Example Case 3 AC - Year Planning
Andrew Rosemberg
15th Feb 2019
Introduction
This an example of the HydroPowerModels package for solving a simple stochastic case with the following specifications:
3 Buses
3 Lines
2 Generators
1 Reservoir and Hydrogenerator
3 Scenarios
12 Stages
AC Formulation
Case
Importing package and optimizer
using Ipopt using HydroPowerModels
Load Case Specifications
data = HydroPowerModels.parse_folder(joinpath(WEAVE_ARGS[:testcases_dir],"case3")) params = create_param( stages = 12, model_constructor_grid = ACPPowerModel, post_method = PowerModels.post_opf, optimizer = Ipopt.Optimizer)
Build Model
m = hydrothermaloperation(data, params)
Solve
import Random Random.seed!(1111) HydroPowerModels.train(m; iteration_limit = 100);
-------------------------------------------------------
SDDP.jl (c) Oscar Dowson, 2017-19
Numerical stability report
Non-zero Matrix range [1e+00, 1e+02]
Non-zero Objective range [1e+00, 1e+05]
Non-zero Bounds range [3e-01, 2e+02]
Non-zero RHS range [6e-02, 1e+00]
No problems detected
Iteration Simulation Bound Time (s)
Coin0511I After Postsolve, objective 4144.9514, infeasibilities - dual 0 (0
), primal 0 (0)
Clp0032I Optimal objective 4144.951424 - 0 iterations time 0.002, Presolve
0.00
Coin0506I Presolve 15 (-100) rows, 8 (-8) columns and 35 (-204) elements
Clp0000I Optimal - objective value 3596.7353
Coin0511I After Postsolve, objective 3596.7353, infeasibilities - dual 0 (0
), primal 0 (0)
Clp0032I Optimal objective 3596.735312 - 0 iterations time 0.002, Presolve
0.00
Coin0506I Presolve 13 (-102) rows, 8 (-8) columns and 31 (-208) elements
Clp0000I Optimal - objective value 1867.644
Coin0511I After Postsolve, objective 1867.644, infeasibilities - dual 0 (0)
, primal 0 (0)
Clp0032I Optimal objective 1867.644003 - 0 iterations time 0.002, Presolve
0.00
Coin0506I Presolve 8 (-107) rows, 8 (-8) columns and 21 (-218) elements
Clp0000I Optimal - objective value 1245.9379
Coin0511I After Postsolve, objective 1245.9379, infeasibilities - dual 0 (0
), primal 0 (0)
Clp0032I Optimal objective 1245.93786 - 0 iterations time 0.002, Presolve 0
.00
Coin0506I Presolve 3 (-12) rows, 6 (-10) columns and 11 (-28) elements
Clp0006I 0 Obj 501.39026 Primal inf 0.023682816 (1)
Clp0006I 1 Obj 548.75789
Clp0000I Optimal - objective value 548.75789
Coin0511I After Postsolve, objective 548.75789, infeasibilities - dual 0 (0
), primal 0 (0)
Clp0032I Optimal objective 548.7578911 - 1 iterations time 0.002, Presolve
0.00
***************************************************************************
***
This program contains Ipopt, a library for large-scale nonlinear optimizati
on.
Ipopt is released as open source code under the Eclipse Public License (EP
L).
For more information visit http://projects.coin-or.org/Ipopt
***************************************************************************
***
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.70e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 1.7705849e+02 1.66e+02 1.38e+02 -1.0 5.67e+01 - 1.75e-04 2.44e-0
2f 1
2 1.0732435e+04 7.78e-02 8.71e+01 -1.0 7.45e+01 - 2.09e-02 1.00e+0
0h 1
3 2.1530912e+03 7.53e-02 7.62e+01 -1.0 8.17e+01 - 1.34e-01 3.52e-0
2f 1
4 8.8751849e+02 4.75e-02 3.58e+01 -1.0 1.89e+01 - 5.25e-01 3.79e-0
1f 1
5 2.9156466e+03 1.08e-02 2.02e+01 -1.0 1.36e+01 - 5.65e-01 1.00e+0
0h 1
6 9.5110319e+02 5.25e-03 2.27e-01 -1.0 1.05e+01 - 9.95e-01 9.96e-0
1f 1
7 7.7927227e+02 4.64e-04 1.08e-01 -1.7 1.02e+01 - 1.00e+00 1.00e+0
0f 1
8 6.2482083e+02 2.13e-03 1.57e-01 -2.5 8.38e+00 - 7.77e-01 1.00e+0
0f 1
9 5.9598743e+02 2.49e-03 4.11e-02 -2.5 1.80e+00 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0434894e+02 1.25e-04 2.96e-03 -2.5 7.52e-01 - 1.00e+00 1.00e+0
0h 1
11 5.8410287e+02 1.57e-04 1.29e-02 -3.8 2.68e+00 - 9.94e-01 9.50e-0
1h 1
12 5.8384999e+02 6.45e-07 6.24e-05 -3.8 1.34e-01 - 1.00e+00 1.00e+0
0h 1
13 5.8278904e+02 3.80e-07 1.31e-04 -5.7 1.49e-01 - 1.00e+00 9.97e-0
1h 1
14 5.8279043e+02 3.84e-11 3.16e-09 -5.7 2.58e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.05e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753400913235e-01 5.8277753400913230e+0
2
Dual infeasibility......: 2.0521752446936277e-09 2.0521752446936277e-0
6
Constraint violation....: 6.2993138483236066e-11 6.2993138483236066e-1
1
Complementarity.........: 2.8882054527025501e-09 2.8882054527025499e-0
6
Overall NLP error.......: 2.8882054527025501e-09 2.8882054527025499e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 2.912
Total CPU secs in NLP function evaluations = 1.632
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.08e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1980081e+02 1.05e+02 1.10e+02 -1.0 3.60e+01 - 2.75e-04 3.07e-0
2f 1
2 1.1453884e+04 5.40e-02 8.33e+01 -1.0 4.30e+01 - 3.23e-02 1.00e+0
0h 1
3 2.8363567e+03 5.19e-02 6.35e+01 -1.0 8.41e+01 - 2.40e-01 4.43e-0
2f 1
4 9.8638894e+02 4.15e-02 3.34e+01 -1.0 3.54e+01 - 4.75e-01 4.83e-0
1f 1
5 3.6411385e+03 1.19e-02 2.78e+01 -1.0 1.90e+01 - 4.14e-01 1.00e+0
0h 1
6 9.4699098e+02 1.07e-02 9.35e-01 -1.0 2.38e+01 - 9.91e-01 8.88e-0
1f 1
7 7.7048863e+02 4.69e-04 6.38e-02 -1.7 6.52e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2822546e+02 1.94e-03 1.98e-01 -2.5 5.36e+00 - 7.59e-01 1.00e+0
0f 1
9 5.9666691e+02 3.33e-03 6.88e-02 -2.5 2.06e+00 - 1.00e+00 9.41e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0422679e+02 1.19e-04 3.32e-03 -2.5 1.41e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8420147e+02 1.58e-04 1.75e-02 -3.8 2.68e+00 - 9.93e-01 9.40e-0
1h 1
12 5.8385260e+02 7.38e-07 6.71e-05 -3.8 1.60e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278913e+02 3.79e-07 1.43e-04 -5.7 1.49e-01 - 1.00e+00 9.97e-0
1h 1
14 5.8279043e+02 3.80e-11 3.05e-09 -5.7 4.69e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753397987564e-01 5.8277753397987567e+0
2
Dual infeasibility......: 2.0962038934209610e-09 2.0962038934209610e-0
6
Constraint violation....: 6.2994012783867959e-11 6.2994012783867959e-1
1
Complementarity.........: 2.8882102321078691e-09 2.8882102321078692e-0
6
Overall NLP error.......: 2.8882102321078691e-09 2.8882102321078692e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 7.60e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5209095e+02 7.33e+01 8.91e+01 -1.0 2.53e+01 - 3.92e-04 3.55e-0
2f 1
2 1.1840334e+04 5.65e-02 8.11e+01 -1.0 2.82e+01 - 4.71e-02 1.00e+0
0h 1
3 3.1800692e+03 5.30e-02 5.39e+01 -1.0 8.04e+01 - 3.28e-01 5.71e-0
2f 1
4 1.0213273e+03 3.38e-02 2.95e+01 -1.0 4.37e+01 - 4.61e-01 5.38e-0
1f 1
5 2.7796186e+03 7.29e-03 1.39e+01 -1.0 2.09e+01 - 6.48e-01 1.00e+0
0h 1
6 1.1504985e+03 5.44e-03 3.91e-01 -1.0 1.81e+01 - 9.63e-01 1.00e+0
0f 1
7 7.9279354e+02 1.09e-03 2.34e-01 -1.7 5.68e+00 - 1.00e+00 8.72e-0
1f 1
8 7.5511765e+02 7.52e-04 1.54e-02 -1.7 1.57e+01 - 1.00e+00 1.00e+0
0f 1
9 6.1510599e+02 1.46e-03 1.18e-01 -3.8 1.98e+01 - 7.64e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8224478e+02 2.49e-03 2.54e-02 -3.8 2.30e+00 - 8.00e-01 7.72e-0
1h 1
11 5.8332850e+02 3.35e-04 1.67e-01 -3.8 3.51e-01 - 1.00e+00 8.65e-0
1h 1
12 5.8383929e+02 4.29e-07 4.82e-05 -3.8 4.72e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8279492e+02 4.16e-07 1.00e-03 -5.7 1.49e-01 - 1.00e+00 9.87e-0
1h 1
14 5.8279043e+02 4.50e-11 4.91e-09 -5.7 1.99e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 3.21e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753323853543e-01 5.8277753323853540e+0
2
Dual infeasibility......: 3.2119047463836337e-09 3.2119047463836337e-0
6
Constraint violation....: 6.3006225237138835e-11 6.3006225237138835e-1
1
Complementarity.........: 2.9051020596454678e-09 2.9051020596454678e-0
6
Overall NLP error.......: 3.2119047463836337e-09 3.2119047463836337e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 5.10e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.8506535e+02 4.89e+01 6.77e+01 -1.0 1.70e+01 - 5.86e-04 4.04e-0
2f 1
2 1.2135672e+04 5.96e-02 7.96e+01 -1.0 2.06e+01 - 6.09e-02 1.00e+0
0h 1
3 3.5070755e+03 5.50e-02 5.36e+01 -1.0 6.46e+01 - 3.15e-01 6.97e-0
2f 1
4 2.1197738e+03 3.09e-02 2.62e+01 -1.0 3.46e+01 - 5.01e-01 4.17e-0
1f 1
5 1.3626709e+03 1.30e-02 2.23e+00 -1.0 1.11e+01 - 9.19e-01 9.53e-0
1h 1
6 1.7935837e+03 3.88e-04 1.17e-01 -1.0 5.15e+00 - 1.00e+00 1.00e+0
0f 1
7 1.1071463e+03 1.09e-03 7.12e-02 -1.7 1.58e+01 - 1.00e+00 9.69e-0
1f 1
8 1.0643076e+03 2.95e-04 1.41e+00 -2.5 1.67e+01 - 1.00e+00 7.32e-0
1h 1
9 1.0400107e+03 3.60e-04 1.58e-02 -2.5 4.47e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.0264186e+03 2.75e-04 7.15e-02 -3.8 2.68e+00 - 7.97e-01 1.00e+0
0h 1
11 1.0234959e+03 1.89e-03 2.23e-03 -3.8 4.12e-02 - 9.97e-01 1.00e+0
0h 1
12 1.0236591e+03 6.96e-05 6.10e-05 -3.8 1.19e-02 - 1.00e+00 1.00e+0
0h 1
13 1.0224449e+03 1.31e-04 8.24e-04 -5.7 1.49e-01 - 9.28e-01 1.00e+0
0h 1
14 1.0224047e+03 3.07e-05 6.01e-06 -5.7 8.11e-03 - 1.00e+00 1.00e+0
0h 1
15 1.0224099e+03 1.41e-07 3.57e-06 -5.7 5.38e-04 - 1.00e+00 1.00e+0
0h 1
16 1.0223968e+03 2.36e-08 5.94e-05 -8.6 1.84e-03 - 1.00e+00 9.44e-0
1h 1
17 1.0223961e+03 8.09e-12 1.02e-10 -8.6 1.03e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.0223961339858485e+00 1.0223961339858485e+0
3
Dual infeasibility......: 1.0239127136089385e-10 1.0239127136089384e-0
7
Constraint violation....: 8.0879747343942654e-12 8.0879747343942654e-1
2
Complementarity.........: 2.5163465142661487e-09 2.5163465142661487e-0
6
Overall NLP error.......: 2.5163465142661487e-09 2.5163465142661487e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.0258983e+02 3.83e+01 5.64e+01 -1.0 1.33e+01 - 7.48e-04 4.29e-0
2f 1
2 1.2255510e+04 6.11e-02 7.83e+01 -1.0 1.70e+01 - 7.56e-02 1.00e+0
0h 1
3 3.6577569e+03 5.54e-02 5.02e+01 -1.0 5.04e+01 - 3.46e-01 8.32e-0
2f 1
4 2.4012758e+03 2.77e-02 2.12e+01 -1.0 2.42e+01 - 5.65e-01 4.73e-0
1f 1
5 1.8992880e+03 7.23e-03 1.16e+00 -1.0 8.90e+00 - 9.35e-01 7.37e-0
1f 1
6 2.1488860e+03 3.60e-04 8.18e-02 -1.0 5.48e+00 - 1.00e+00 1.00e+0
0f 1
7 1.5627067e+03 2.07e-03 9.23e-02 -2.5 4.31e+00 - 8.63e-01 8.25e-0
1f 1
8 1.3829347e+03 2.17e-03 3.66e-01 -2.5 1.09e+00 - 1.00e+00 7.73e-0
1f 1
9 1.3532656e+03 1.70e-04 5.19e-03 -2.5 2.23e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3334309e+03 2.47e-05 4.33e-02 -3.8 2.68e+00 - 1.00e+00 8.81e-0
1h 1
11 1.3319616e+03 5.92e-08 6.12e-04 -3.8 3.17e-01 - 1.00e+00 1.00e+0
0f 1
12 1.3306545e+03 4.24e-08 6.33e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0f 1
13 1.3306430e+03 6.42e-13 3.76e-09 -8.6 1.88e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 13
(scaled) (unscaled)
Objective...............: 1.3306429826585990e+00 1.3306429826585991e+0
3
Dual infeasibility......: 3.7633547785517288e-09 3.7633547785517288e-0
6
Constraint violation....: 6.4218075301880617e-13 6.4218075301880617e-1
3
Complementarity.........: 2.7768706883742780e-09 2.7768706883742780e-0
6
Overall NLP error.......: 3.7633547785517288e-09 3.7633547785517288e-0
6
Number of objective function evaluations = 14
Number of objective gradient evaluations = 14
Number of equality constraint evaluations = 14
Number of inequality constraint evaluations = 14
Number of equality constraint Jacobian evaluations = 14
Number of inequality constraint Jacobian evaluations = 14
Number of Lagrangian Hessian evaluations = 13
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9434075e+02 4.31e+01 6.17e+01 -1.0 1.50e+01 - 6.64e-04 4.17e-0
2f 1
2 1.2202446e+04 6.04e-02 7.90e+01 -1.0 1.87e+01 - 6.75e-02 1.00e+0
0h 1
3 3.5894659e+03 5.53e-02 5.23e+01 -1.0 5.76e+01 - 3.26e-01 7.57e-0
2f 1
4 2.3004746e+03 3.01e-02 2.39e+01 -1.0 2.92e+01 - 5.31e-01 4.32e-0
1f 1
5 1.6430893e+03 9.28e-03 1.46e+00 -1.0 1.05e+01 - 9.24e-01 8.08e-0
1f 1
6 1.9534841e+03 2.65e-04 7.76e-02 -1.0 4.24e+00 - 1.00e+00 1.00e+0
0f 1
7 1.2720495e+03 2.12e-03 9.43e-02 -2.5 5.35e+00 - 8.69e-01 8.88e-0
1f 1
8 1.1685740e+03 1.11e-03 4.56e-01 -2.5 8.54e-01 - 1.00e+00 6.06e-0
1f 1
9 1.1687321e+03 2.67e-06 8.58e-03 -2.5 1.74e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1505405e+03 7.44e-06 3.73e-03 -3.8 2.68e+00 - 8.98e-01 8.94e-0
1f 1
11 1.1472869e+03 4.69e-04 3.69e-04 -3.8 2.83e-01 - 1.00e+00 1.00e+0
0f 1
12 1.1462930e+03 6.29e-05 1.15e-02 -5.7 1.49e-01 - 8.13e-01 1.00e+0
0h 1
13 1.1461765e+03 3.64e-05 4.11e-05 -5.7 9.73e-03 - 1.00e+00 1.00e+0
0h 1
14 1.1461776e+03 1.67e-06 3.70e-05 -5.7 1.55e-03 - 1.00e+00 9.89e-0
1h 1
15 1.1461801e+03 3.54e-08 5.19e-07 -5.7 2.92e-04 - 1.00e+00 1.00e+0
0f 1
16 1.1461654e+03 3.96e-08 7.24e-06 -8.6 1.84e-03 - 9.97e-01 9.81e-0
1h 1
17 1.1461652e+03 5.30e-13 2.97e-11 -8.6 3.54e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.1461651806652837e+00 1.1461651806652837e+0
3
Dual infeasibility......: 2.9720641884384162e-11 2.9720641884384162e-0
8
Constraint violation....: 5.2957638274619967e-13 5.2957638274619967e-1
3
Complementarity.........: 2.5100781131063731e-09 2.5100781131063730e-0
6
Overall NLP error.......: 2.5100781131063731e-09 2.5100781131063730e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.97e+00 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.6433394e+02 9.45e+00 5.13e+01 -1.0 3.33e+00 - 3.06e-03 5.21e-0
2f 1
2 1.2217630e+04 6.82e-02 7.72e+01 -1.0 5.62e+00 - 1.00e-01 1.00e+0
0h 1
3 4.3206553e+03 6.00e-02 2.20e+01 -1.0 3.24e+00 - 6.97e-01 1.09e-0
1f 1
4 3.4847450e+03 3.09e-02 4.57e+00 -1.0 1.93e+00 - 8.28e-01 1.00e+0
0f 1
5 3.7204830e+03 1.15e-02 2.98e-01 -1.0 2.09e+00 - 1.00e+00 1.00e+0
0h 1
6 3.3065546e+03 3.53e-03 2.95e-01 -1.7 1.74e+01 - 8.71e-01 1.00e+0
0f 1
7 3.2404217e+03 7.28e-04 3.15e-02 -1.7 4.99e-01 - 1.00e+00 1.00e+0
0h 1
8 3.1022485e+03 3.47e-04 3.80e-02 -2.5 1.72e+01 - 9.97e-01 9.59e-0
1f 1
9 3.1017312e+03 3.31e-06 4.28e-04 -2.5 7.14e-01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.0796538e+03 6.24e-06 7.61e-04 -3.8 2.68e+00 - 1.00e+00 1.00e+0
0f 1
11 3.0787389e+03 3.46e-09 3.50e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
12 3.0787246e+03 2.35e-12 4.09e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 12
(scaled) (unscaled)
Objective...............: 3.0787246244632422e+00 3.0787246244632420e+0
3
Dual infeasibility......: 4.0878236762999801e-10 4.0878236762999801e-0
7
Constraint violation....: 2.3485657862920561e-12 2.3485657862920561e-1
2
Complementarity.........: 2.5726398939686865e-09 2.5726398939686863e-0
6
Overall NLP error.......: 2.5726398939686865e-09 2.5726398939686863e-0
6
Number of objective function evaluations = 13
Number of objective gradient evaluations = 13
Number of equality constraint evaluations = 13
Number of inequality constraint evaluations = 13
Number of equality constraint Jacobian evaluations = 13
Number of inequality constraint Jacobian evaluations = 13
Number of Lagrangian Hessian evaluations = 12
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9434075e+02 4.31e+01 6.17e+01 -1.0 1.50e+01 - 6.64e-04 4.17e-0
2f 1
2 1.2202446e+04 6.04e-02 7.90e+01 -1.0 1.87e+01 - 6.75e-02 1.00e+0
0h 1
3 3.5894659e+03 5.53e-02 5.23e+01 -1.0 5.76e+01 - 3.26e-01 7.57e-0
2f 1
4 2.3004746e+03 3.01e-02 2.39e+01 -1.0 2.92e+01 - 5.31e-01 4.32e-0
1f 1
5 1.6430893e+03 9.28e-03 1.46e+00 -1.0 1.05e+01 - 9.24e-01 8.08e-0
1f 1
6 1.9534841e+03 2.65e-04 7.76e-02 -1.0 4.24e+00 - 1.00e+00 1.00e+0
0f 1
7 1.2720495e+03 2.12e-03 9.43e-02 -2.5 5.35e+00 - 8.69e-01 8.88e-0
1f 1
8 1.1685740e+03 1.11e-03 4.56e-01 -2.5 8.54e-01 - 1.00e+00 6.06e-0
1f 1
9 1.1687321e+03 2.67e-06 8.58e-03 -2.5 1.74e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1505405e+03 7.44e-06 3.73e-03 -3.8 2.68e+00 - 8.98e-01 8.94e-0
1f 1
11 1.1472869e+03 4.69e-04 3.69e-04 -3.8 2.83e-01 - 1.00e+00 1.00e+0
0f 1
12 1.1462930e+03 6.29e-05 1.15e-02 -5.7 1.49e-01 - 8.13e-01 1.00e+0
0h 1
13 1.1461765e+03 3.64e-05 4.11e-05 -5.7 9.73e-03 - 1.00e+00 1.00e+0
0h 1
14 1.1461776e+03 1.67e-06 3.70e-05 -5.7 1.55e-03 - 1.00e+00 9.89e-0
1h 1
15 1.1461801e+03 3.54e-08 5.19e-07 -5.7 2.92e-04 - 1.00e+00 1.00e+0
0f 1
16 1.1461654e+03 3.96e-08 7.24e-06 -8.6 1.84e-03 - 9.97e-01 9.81e-0
1h 1
17 1.1461652e+03 5.30e-13 2.97e-11 -8.6 3.54e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.1461651807521289e+00 1.1461651807521289e+0
3
Dual infeasibility......: 2.9720643433542902e-11 2.9720643433542902e-0
8
Constraint violation....: 5.2979842735112470e-13 5.2979842735112470e-1
3
Complementarity.........: 2.5100781129964632e-09 2.5100781129964632e-0
6
Overall NLP error.......: 2.5100781129964632e-09 2.5100781129964632e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.7217918e+02 5.77e+01 7.61e+01 -1.0 2.00e+01 - 4.97e-04 3.85e-0
2f 1
2 1.2031055e+04 5.85e-02 8.02e+01 -1.0 2.34e+01 - 5.43e-02 1.00e+0
0h 1
3 3.3855549e+03 5.43e-02 5.44e+01 -1.0 7.23e+01 - 3.13e-01 6.36e-0
2f 1
4 1.7655519e+03 2.97e-02 2.82e+01 -1.0 4.03e+01 - 4.75e-01 4.36e-0
1f 1
5 1.2513290e+03 1.37e-02 2.60e+00 -1.0 1.10e+01 - 9.18e-01 1.00e+0
0f 1
6 1.5080619e+03 4.86e-04 9.81e-02 -1.0 4.34e+00 - 1.00e+00 1.00e+0
0f 1
7 9.6591579e+02 5.77e-04 4.77e-01 -2.5 7.44e+00 - 8.91e-01 6.93e-0
1f 1
8 8.8821109e+02 2.28e-04 3.48e-01 -2.5 2.49e+00 - 8.89e-01 1.00e+0
0h 1
9 8.7925045e+02 8.40e-04 3.85e-01 -2.5 1.45e+00 - 1.00e+00 2.54e-0
1h 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.5997420e+02 7.34e-04 9.35e-03 -2.5 9.03e-01 - 1.00e+00 1.00e+0
0h 1
11 8.4391274e+02 1.23e-03 3.35e-02 -3.8 2.68e+00 - 7.93e-01 1.00e+0
0h 1
12 8.4065662e+02 2.61e-03 9.84e-04 -3.8 4.20e-02 - 1.00e+00 1.00e+0
0h 1
13 8.4098948e+02 4.44e-05 1.23e-04 -3.8 1.44e-02 - 1.00e+00 1.00e+0
0h 1
14 8.3968226e+02 1.02e-04 3.44e-04 -5.7 1.49e-01 - 9.51e-01 9.76e-0
1h 1
15 8.3966916e+02 2.25e-05 3.70e-03 -5.7 3.56e-03 - 1.00e+00 7.80e-0
1h 1
16 8.3967212e+02 8.67e-09 1.24e-06 -5.7 7.84e-04 - 1.00e+00 1.00e+0
0f 1
17 8.3965740e+02 9.04e-09 1.92e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
18 8.3965718e+02 1.37e-12 6.49e-11 -8.6 3.05e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 8.3965717727423816e-01 8.3965717727423817e+0
2
Dual infeasibility......: 6.4887705956151907e-11 6.4887705956151907e-0
8
Constraint violation....: 1.3662404541037176e-12 1.3662404541037176e-1
2
Complementarity.........: 2.5092442889759663e-09 2.5092442889759664e-0
6
Overall NLP error.......: 2.5092442889759663e-09 2.5092442889759664e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 5.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.8654637e+02 4.79e+01 6.68e+01 -1.0 1.67e+01 - 5.97e-04 4.06e-0
2f 1
2 1.2146820e+04 5.97e-02 7.95e+01 -1.0 2.03e+01 - 6.18e-02 1.00e+0
0h 1
3 3.5205423e+03 5.51e-02 5.35e+01 -1.0 6.35e+01 - 3.17e-01 7.05e-0
2f 1
4 2.1529544e+03 3.09e-02 2.58e+01 -1.0 3.38e+01 - 5.05e-01 4.17e-0
1f 1
5 1.4044206e+03 1.16e-02 2.10e+00 -1.0 1.10e+01 - 9.20e-01 9.26e-0
1f 1
6 1.8129112e+03 3.57e-04 9.92e-02 -1.0 4.92e+00 - 1.00e+00 1.00e+0
0f 1
7 1.1213681e+03 1.20e-03 6.83e-02 -1.7 1.57e+01 - 1.00e+00 1.00e+0
0f 1
8 1.0897940e+03 5.78e-04 2.46e+00 -2.5 1.72e+01 - 1.00e+00 5.20e-0
1h 1
9 1.0609980e+03 1.21e-04 1.57e-02 -2.5 8.24e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.0465827e+03 2.57e-04 8.50e-02 -3.8 2.68e+00 - 7.77e-01 1.00e+0
0h 1
11 1.0436801e+03 1.80e-03 2.45e-03 -3.8 3.99e-02 - 9.53e-01 1.00e+0
0h 1
12 1.0438081e+03 7.60e-05 6.60e-05 -3.8 1.18e-02 - 1.00e+00 1.00e+0
0h 1
13 1.0426024e+03 1.32e-04 1.12e-03 -5.7 1.49e-01 - 9.18e-01 1.00e+0
0h 1
14 1.0425605e+03 3.30e-05 6.87e-06 -5.7 8.46e-03 - 1.00e+00 1.00e+0
0h 1
15 1.0425659e+03 2.12e-07 3.58e-06 -5.7 6.62e-04 - 1.00e+00 1.00e+0
0h 1
16 1.0425527e+03 2.68e-08 3.47e-05 -8.6 1.84e-03 - 1.00e+00 9.56e-0
1h 1
17 1.0425521e+03 4.67e-12 5.32e-11 -8.6 8.09e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.0425521371792128e+00 1.0425521371792129e+0
3
Dual infeasibility......: 5.3150177979858622e-11 5.3150177979858622e-0
8
Constraint violation....: 4.6718184876226587e-12 4.6718184876226587e-1
2
Complementarity.........: 2.5094281851047692e-09 2.5094281851047692e-0
6
Overall NLP error.......: 2.5094281851047692e-09 2.5094281851047692e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.7217918e+02 5.77e+01 7.61e+01 -1.0 2.00e+01 - 4.97e-04 3.85e-0
2f 1
2 1.2031055e+04 5.85e-02 8.02e+01 -1.0 2.34e+01 - 5.43e-02 1.00e+0
0h 1
3 3.3855549e+03 5.43e-02 5.44e+01 -1.0 7.23e+01 - 3.13e-01 6.36e-0
2f 1
4 1.7655519e+03 2.97e-02 2.82e+01 -1.0 4.03e+01 - 4.75e-01 4.36e-0
1f 1
5 1.2513290e+03 1.37e-02 2.60e+00 -1.0 1.10e+01 - 9.18e-01 1.00e+0
0f 1
6 1.5080619e+03 4.86e-04 9.81e-02 -1.0 4.34e+00 - 1.00e+00 1.00e+0
0f 1
7 9.6591579e+02 5.77e-04 4.77e-01 -2.5 7.44e+00 - 8.91e-01 6.93e-0
1f 1
8 8.8821109e+02 2.28e-04 3.48e-01 -2.5 2.49e+00 - 8.89e-01 1.00e+0
0h 1
9 8.7925045e+02 8.40e-04 3.85e-01 -2.5 1.45e+00 - 1.00e+00 2.54e-0
1h 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.5997420e+02 7.34e-04 9.35e-03 -2.5 9.03e-01 - 1.00e+00 1.00e+0
0h 1
11 8.4391274e+02 1.23e-03 3.35e-02 -3.8 2.68e+00 - 7.93e-01 1.00e+0
0h 1
12 8.4065662e+02 2.61e-03 9.84e-04 -3.8 4.20e-02 - 1.00e+00 1.00e+0
0h 1
13 8.4098948e+02 4.44e-05 1.23e-04 -3.8 1.44e-02 - 1.00e+00 1.00e+0
0h 1
14 8.3968226e+02 1.02e-04 3.44e-04 -5.7 1.49e-01 - 9.51e-01 9.76e-0
1h 1
15 8.3966916e+02 2.25e-05 3.70e-03 -5.7 3.56e-03 - 1.00e+00 7.80e-0
1h 1
16 8.3967212e+02 8.67e-09 1.24e-06 -5.7 7.84e-04 - 1.00e+00 1.00e+0
0f 1
17 8.3965740e+02 9.04e-09 1.92e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
18 8.3965718e+02 1.37e-12 6.49e-11 -8.6 3.05e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 8.3965717722953426e-01 8.3965717722953423e+0
2
Dual infeasibility......: 6.4887705988382173e-11 6.4887705988382173e-0
8
Constraint violation....: 1.3662404541037176e-12 1.3662404541037176e-1
2
Complementarity.........: 2.5092442886839426e-09 2.5092442886839424e-0
6
Overall NLP error.......: 2.5092442886839426e-09 2.5092442886839424e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101521e-01 6.4890146112101525e+0
2
Dual infeasibility......: 4.9126605618489413e-09 4.9126605618489413e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984918224e-09 4.3646094984918221e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605618489413e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318724481455e-09 2.1031318724481455e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896894379e-09 2.8882108896894380e-0
6
Overall NLP error.......: 2.8882108896894379e-09 2.8882108896894380e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101521e-01 6.4890146112101525e+0
2
Dual infeasibility......: 4.9126605618489413e-09 4.9126605618489413e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984918224e-09 4.3646094984918221e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605618489413e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.04e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.57e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235660171e+00 1.6104063235660171e+0
3
Dual infeasibility......: 2.4574009793760635e-12 2.4574009793760635e-0
9
Constraint violation....: 7.5703172614159067e-16 7.5703172614159067e-1
6
Complementarity.........: 2.5062163919681798e-09 2.5062163919681799e-0
6
Overall NLP error.......: 2.5062163919681798e-09 2.5062163919681799e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2407030e+02 9.17e+02 5.24e+01 -1.0 9.26e+02 - 3.31e-04 9.81e-0
3f 1
2 8.2061416e+02 9.17e+02 5.24e+01 -1.0 7.38e+02 - 1.15e-04 1.23e-0
4h 1
3 2.5649513e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 4.69e-05 2.08e-0
2f 1
4 1.1314657e+04 5.75e-02 8.19e+01 -1.0 8.98e+02 - 3.73e-02 1.00e+0
0h 1
5 3.8956140e+03 5.45e-02 5.06e+01 -1.0 7.64e+01 - 3.74e-01 4.81e-0
2f 1
6 1.9060670e+03 3.62e-02 2.71e+01 -1.0 4.04e+01 - 4.70e-01 5.09e-0
1f 1
7 4.6724079e+03 1.24e-02 2.52e+01 -1.0 2.06e+01 - 4.02e-01 1.00e+0
0h 1
8 1.8740007e+03 1.18e-02 9.57e-01 -1.0 2.50e+01 - 9.87e-01 9.03e-0
1f 1
9 1.6912736e+03 5.16e-04 6.28e-02 -1.7 5.23e+00 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5455615e+03 1.94e-03 2.19e-01 -2.5 5.71e+00 - 7.44e-01 1.00e+0
0f 1
11 1.5139404e+03 3.68e-03 1.05e-01 -2.5 2.12e+00 - 1.00e+00 9.19e-0
1h 1
12 1.5218401e+03 1.31e-04 3.48e-03 -2.5 1.22e+00 - 1.00e+00 1.00e+0
0h 1
13 1.5017779e+03 1.63e-04 2.18e-02 -3.8 2.69e+00 - 9.93e-01 9.31e-0
1h 1
14 1.5013697e+03 7.66e-07 7.15e-05 -3.8 1.77e-01 - 1.00e+00 1.00e+0
0f 1
15 1.5003052e+03 3.77e-07 1.78e-04 -5.7 1.49e-01 - 1.00e+00 9.96e-0
1h 1
16 1.5003062e+03 3.80e-11 2.94e-09 -5.7 1.17e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
1 8.6640671e+02 9.17e+02 5.24e+01 -1.0 9.26e+02 - 4.97e-04 9.81e-0
3f 1
2 8.6297755e+02 9.17e+02 5.24e+01 -1.0 7.33e+02 - 1.12e-04 1.24e-0
4h 1
3 2.6189684e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 4.78e-05 2.24e-0
2f 1
4 1.3061351e+04 5.91e-02 8.01e+01 -1.0 8.97e+02 - 4.92e-02 1.00e+0
0h 1
5 4.3096043e+03 5.53e-02 5.43e+01 -1.0 7.48e+01 - 3.12e-01 5.88e-0
2f 1
6 2.7191223e+03 3.01e-02 2.86e+01 -1.0 3.90e+01 - 4.68e-01 4.31e-0
1f 1
1 1.284321e+04 1.578734e+04 1.626169e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.52e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1158035e+02 1.52e+04 5.50e+01 -1.0 1.54e+04 - 1.75e-04 9.80e-0
3f 1
2 7.0876036e+02 1.52e+04 5.50e+01 -1.0 1.50e+04 - 9.69e-05 1.00e-0
4h 1
3 7.0154963e+02 1.52e+04 5.50e+01 -1.0 1.52e+04 - 2.76e-06 5.60e-0
4f 1
4 4.7467143e+02 1.49e+04 5.40e+01 -1.0 1.52e+04 - 5.97e-04 1.88e-0
2h 1
5 2.5880907e+04 7.61e-02 8.69e+01 -1.0 1.49e+04 - 2.52e-02 1.00e+0
0h 1
6 1.7351129e+04 7.33e-02 7.38e+01 -1.0 7.45e+01 - 1.60e-01 3.97e-0
2f 1
7 1.6089734e+04 4.64e-02 3.42e+01 -1.0 1.95e+01 - 5.30e-01 3.77e-0
1f 1
8 1.6340693e+04 4.07e-02 1.02e+01 -1.0 1.34e+01 - 5.66e-01 1.25e-0
1f 4
9 1.6259505e+04 6.81e-03 1.94e-01 -1.0 8.81e-01 - 9.93e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5964239e+04 7.54e-04 2.01e-01 -1.7 5.86e+00 - 1.00e+00 8.96e-0
1f 1
11 1.5933413e+04 7.90e-04 1.14e-02 -1.7 1.44e+01 - 1.00e+00 1.00e+0
0f 1
12 1.5811986e+04 1.26e-03 8.16e-02 -3.8 1.99e+01 - 8.09e-01 9.34e-0
1f 1
13 1.5788104e+04 1.39e-03 6.58e-02 -3.8 1.67e+00 - 8.57e-01 7.76e-0
1h 1
14 1.5788317e+04 2.49e-06 7.03e-04 -3.8 2.89e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5787360e+04 3.28e-07 5.56e-04 -5.7 1.49e-01 - 1.00e+00 9.89e-0
1h 1
16 1.5787355e+04 4.02e-11 5.92e-09 -5.7 3.81e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5787342e+04 6.30e-11 2.05e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5787341756017753e+01 1.5787341756017753e+0
4
Dual infeasibility......: 2.0519881637910326e-09 2.0519881637910326e-0
6
Constraint violation....: 6.2994831573348620e-11 6.2994831573348620e-1
1
Complementarity.........: 2.8881132377908225e-09 2.8881132377908226e-0
6
Overall NLP error.......: 2.8881132377908225e-09 2.8881132377908226e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.46e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9878773e+02 1.46e+04 5.25e+01 -1.0 1.48e+04 - 2.75e-04 9.80e-0
3f 1
2 7.9595480e+02 1.46e+04 5.25e+01 -1.0 1.44e+04 - 9.50e-05 1.00e-0
4h 1
3 7.8783116e+02 1.46e+04 5.25e+01 -1.0 1.46e+04 - 2.90e-06 5.95e-0
4f 1
4 5.2012917e+02 1.43e+04 5.27e+01 -1.0 1.46e+04 - 6.36e-04 2.05e-0
2h 1
5 2.5886513e+04 5.41e-02 8.35e+01 -1.0 1.43e+04 - 3.34e-02 1.00e+0
0h 1
6 1.7381703e+04 5.18e-02 6.25e+01 -1.0 8.07e+01 - 2.54e-01 4.58e-0
2f 1
7 1.5594839e+04 4.21e-02 3.23e+01 -1.0 3.42e+01 - 4.83e-01 4.72e-0
1f 1
8 1.5917691e+04 2.59e-02 1.44e+01 -1.0 1.84e+01 - 4.26e-01 1.25e-0
1f 4
9 1.5659539e+04 6.13e-03 1.69e-01 -1.0 5.20e+00 - 9.91e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5376038e+04 1.24e-03 2.90e-01 -1.7 4.59e+00 - 1.00e+00 8.63e-0
1f 1
11 1.5350560e+04 7.79e-04 1.14e-02 -1.7 1.61e+01 - 1.00e+00 1.00e+0
0f 1
12 1.5225332e+04 1.34e-03 9.04e-02 -3.8 1.99e+01 - 7.98e-01 9.32e-0
1f 1
13 1.5201170e+04 1.49e-03 6.50e-02 -3.8 1.70e+00 - 8.48e-01 7.71e-0
1h 1
14 1.5201438e+04 2.75e-06 7.51e-04 -3.8 3.08e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5200495e+04 3.13e-07 6.18e-04 -5.7 1.49e-01 - 1.00e+00 9.88e-0
1h 1
16 1.5200489e+04 3.93e-11 6.23e-09 -5.7 1.96e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5200476e+04 6.30e-11 2.10e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5200476117018198e+01 1.5200476117018197e+0
4
Dual infeasibility......: 2.0960045744974055e-09 2.0960045744974055e-0
6
Constraint violation....: 6.2996677319127059e-11 6.2996677319127059e-1
1
Complementarity.........: 2.8881080712525150e-09 2.8881080712525150e-0
6
Overall NLP error.......: 2.8881080712525150e-09 2.8881080712525150e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.0180620e+02 1.39e+04 5.25e+01 -1.0 1.40e+04 - 2.81e-04 9.80e-0
3f 1
2 7.9897228e+02 1.39e+04 5.25e+01 -1.0 1.37e+04 - 9.50e-05 1.01e-0
4h 1
3 7.8994004e+02 1.39e+04 5.25e+01 -1.0 1.39e+04 - 3.06e-06 6.28e-0
4f 1
4 5.0687890e+02 1.36e+04 5.27e+01 -1.0 1.39e+04 - 6.74e-04 2.05e-0
2h 1
5 2.5145287e+04 5.42e-02 8.34e+01 -1.0 1.36e+04 - 3.39e-02 1.00e+0
0h 1
6 1.6658401e+04 5.19e-02 6.18e+01 -1.0 8.06e+01 - 2.61e-01 4.63e-0
2f 1
7 1.4851307e+04 4.17e-02 3.20e+01 -1.0 3.48e+01 - 4.81e-01 4.76e-0
1f 1
8 1.5176605e+04 2.55e-02 1.43e+01 -1.0 1.86e+01 - 4.23e-01 1.25e-0
1f 4
9 1.4915864e+04 6.18e-03 1.83e-01 -1.0 5.28e+00 - 9.90e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4631192e+04 1.26e-03 2.98e-01 -1.7 4.63e+00 - 1.00e+00 8.61e-0
1f 1
11 1.4605120e+04 7.86e-04 1.16e-02 -1.7 1.64e+01 - 1.00e+00 1.00e+0
0f 1
12 1.4479664e+04 1.35e-03 9.10e-02 -3.8 1.99e+01 - 7.97e-01 9.31e-0
1f 1
13 1.4455535e+04 1.49e-03 6.58e-02 -3.8 1.70e+00 - 8.47e-01 7.70e-0
1h 1
14 1.4455813e+04 2.79e-06 7.57e-04 -3.8 3.10e-01 - 1.00e+00 1.00e+0
0h 1
15 1.4454870e+04 3.11e-07 6.22e-04 -5.7 1.49e-01 - 1.00e+00 9.88e-0
1h 1
16 1.4454864e+04 3.91e-11 6.26e-09 -5.7 2.25e-01 - 1.00e+00 1.00e+0
0f 1
17 1.4454851e+04 6.30e-11 2.10e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.4454851464519502e+01 1.4454851464519501e+0
4
Dual infeasibility......: 2.1005813978821222e-09 2.1005813978821222e-0
6
Constraint violation....: 6.2996247107705017e-11 6.2996247107705017e-1
1
Complementarity.........: 2.8881076358634386e-09 2.8881076358634385e-0
6
Overall NLP error.......: 2.8881076358634386e-09 2.8881076358634385e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2426039e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.31e-04 9.80e-0
3f 1
2 8.2143525e+02 1.27e+04 5.24e+01 -1.0 1.24e+04 - 9.42e-05 1.01e-0
4h 1
3 8.1065101e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 3.37e-06 6.96e-0
4f 1
4 4.9728341e+02 1.24e+04 5.26e+01 -1.0 1.26e+04 - 7.53e-04 2.10e-0
2h 1
5 2.4069660e+04 5.53e-02 8.24e+01 -1.0 1.24e+04 - 3.87e-02 1.00e+0
0h 1
6 1.5613094e+04 5.27e-02 5.56e+01 -1.0 8.02e+01 - 3.23e-01 5.03e-0
2f 1
7 1.3641905e+04 3.73e-02 2.97e+01 -1.0 3.93e+01 - 4.70e-01 5.04e-0
1f 1
8 1.3986585e+04 2.27e-02 1.37e+01 -1.0 2.05e+01 - 4.02e-01 1.25e-0
1f 4
9 1.3731771e+04 6.02e-03 3.89e-01 -1.0 4.91e+00 - 9.79e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3426073e+04 1.43e-03 4.05e-01 -1.7 5.53e+00 - 1.00e+00 8.25e-0
1f 1
11 1.3385053e+04 9.11e-04 1.45e-02 -1.7 1.80e+01 - 1.00e+00 1.00e+0
0f 1
12 1.3257084e+04 1.44e-03 9.78e-02 -3.8 1.99e+01 - 7.88e-01 9.29e-0
1f 1
13 1.3233557e+04 1.62e-03 8.51e-02 -3.8 1.71e+00 - 8.43e-01 7.51e-0
1h 1
14 1.3234003e+04 3.33e-06 8.54e-04 -3.8 3.44e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3233070e+04 2.80e-07 6.75e-04 -5.7 1.49e-01 - 1.00e+00 9.87e-0
1h 1
16 1.3233064e+04 3.64e-11 6.70e-09 -5.7 2.74e-01 - 1.00e+00 1.00e+0
0f 1
17 1.3233051e+04 6.30e-11 2.17e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.3233050869465824e+01 1.3233050869465824e+0
4
Dual infeasibility......: 2.1728983067482202e-09 2.1728983067482202e-0
6
Constraint violation....: 6.2998564698268922e-11 6.2998564698268922e-1
1
Complementarity.........: 2.8881016528340024e-09 2.8881016528340022e-0
6
Overall NLP error.......: 2.8881016528340024e-09 2.8881016528340022e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1197349e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.08e-03 9.80e-0
3h 1
2 9.0921602e+02 1.11e+04 5.23e+01 -1.0 1.09e+04 - 8.14e-05 1.01e-0
4h 1
3 8.9401034e+02 1.11e+04 5.23e+01 -1.0 1.11e+04 - 4.16e-06 9.33e-0
4f 1
4 5.3020650e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 1.03e-03 2.30e-0
2h 1
5 2.3256372e+04 6.70e-02 7.65e+01 -1.0 1.09e+04 - 8.24e-02 1.00e+0
0h 1
6 1.5122416e+04 6.04e-02 3.53e+01 -1.0 2.51e+01 - 5.11e-01 8.94e-0
2f 1
7 1.3601685e+04 1.47e-02 1.46e+01 -1.0 1.42e+01 - 6.21e-01 7.97e-0
1f 1
8 1.3713983e+04 5.14e-03 1.01e+00 -1.0 2.84e+00 - 9.93e-01 5.00e-0
1f 2
9 1.3925190e+04 1.91e-04 5.10e-02 -1.0 2.93e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3356447e+04 2.33e-03 8.48e-02 -2.5 2.70e+01 - 8.54e-01 8.36e-0
1f 1
11 1.3191173e+04 2.11e-03 4.46e-01 -2.5 4.24e+00 - 1.00e+00 7.52e-0
1f 1
12 1.3163408e+04 1.46e-04 6.28e-03 -2.5 1.05e+00 - 1.00e+00 1.00e+0
0h 1
13 1.3148776e+04 4.43e-05 2.79e-01 -3.8 2.68e+00 - 1.00e+00 7.06e-0
1h 1
14 1.3143550e+04 1.78e-07 2.08e-04 -3.8 7.88e-01 - 1.00e+00 1.00e+0
0f 1
15 1.3142357e+04 2.09e-08 7.39e-04 -5.7 1.49e-01 - 1.00e+00 9.88e-0
1h 1
16 1.3142348e+04 1.82e-12 6.87e-09 -5.7 1.76e-03 - 1.00e+00 1.00e+0
0f 1
17 1.3142333e+04 2.63e-12 2.58e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.3142332799682711e+01 1.3142332799682710e+0
4
Dual infeasibility......: 2.5842408560294849e-09 2.5842408560294849e-0
6
Constraint violation....: 2.6303889621992482e-12 2.6303889621992482e-1
2
Complementarity.........: 3.1309212790475682e-09 3.1309212790475683e-0
6
Overall NLP error.......: 3.1309212790475682e-09 3.1309212790475683e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3006359e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 2.02e-03 9.80e-0
3h 1
2 9.2722762e+02 9.19e+03 5.23e+01 -1.0 8.88e+03 - 6.77e-05 1.02e-0
4h 1
3 9.0058749e+02 9.18e+03 5.23e+01 -1.0 9.18e+03 - 5.63e-06 1.42e-0
3f 1
4 4.9463665e+02 8.97e+03 5.24e+01 -1.0 9.18e+03 - 1.64e-03 2.27e-0
2h 1
5 2.1164030e+04 7.23e-02 7.69e+01 -1.0 8.97e+03 - 7.85e-02 1.00e+0
0h 1
6 1.3562973e+04 6.54e-02 2.35e+01 -1.0 8.38e+00 - 6.64e-01 8.73e-0
2f 1
7 1.2324131e+04 3.29e-02 9.64e+00 -1.0 7.01e+00 - 6.84e-01 1.00e+0
0f 1
8 1.2476105e+04 1.68e-02 6.52e-01 -1.0 2.39e+00 - 9.95e-01 4.91e-0
1f 2
9 1.2182671e+04 6.71e-03 2.78e-01 -1.7 9.98e+00 - 1.00e+00 8.44e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2122153e+04 1.23e-03 8.86e-02 -1.7 1.11e+01 - 1.00e+00 1.00e+0
0f 1
11 1.1995228e+04 3.35e-04 9.60e-02 -2.5 1.72e+01 - 9.85e-01 8.95e-0
1f 1
12 1.1986791e+04 4.66e-06 1.02e-03 -2.5 1.79e+00 - 1.00e+00 1.00e+0
0f 1
13 1.1965361e+04 5.87e-06 5.32e-03 -3.8 2.68e+00 - 1.00e+00 9.75e-0
1f 1
14 1.1965205e+04 1.30e-08 6.21e-06 -3.8 6.52e-02 - 1.00e+00 1.00e+0
0f 1
15 1.1964013e+04 1.73e-08 3.04e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0f 1
16 1.1963999e+04 1.28e-12 4.22e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.1963999095438808e+01 1.1963999095438809e+0
4
Dual infeasibility......: 4.2180144352489549e-10 4.2180144352489549e-0
7
Constraint violation....: 1.2798651027878805e-12 1.2798651027878805e-1
2
Complementarity.........: 2.5909993213694328e-09 2.5909993213694328e-0
6
Overall NLP error.......: 2.5909993213694328e-09 2.5909993213694328e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2300862e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.80e-0
3h 1
2 9.2018520e+02 6.71e+03 5.23e+01 -1.0 6.43e+03 - 7.59e-05 1.03e-0
4h 1
3 8.8417722e+02 6.69e+03 5.23e+01 -1.0 6.70e+03 - 7.25e-06 1.73e-0
3f 1
4 4.3415242e+02 6.54e+03 5.24e+01 -1.0 6.69e+03 - 2.08e-03 2.26e-0
2h 1
5 1.8486104e+04 7.08e-02 7.69e+01 -1.0 6.54e+03 - 8.04e-02 1.00e+0
0h 1
6 1.0916142e+04 6.40e-02 2.32e+01 -1.0 1.36e+01 - 6.65e-01 8.89e-0
2f 1
7 9.6154375e+03 1.98e-02 9.31e+00 -1.0 9.91e+00 - 6.64e-01 8.81e-0
1f 1
8 9.7199903e+03 1.05e-02 6.35e-01 -1.0 2.75e+00 - 9.95e-01 4.77e-0
1f 2
9 9.3967776e+03 9.36e-03 2.78e-01 -1.7 9.45e+00 - 1.00e+00 8.30e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.3672965e+03 2.18e-03 9.40e-01 -1.7 1.18e+01 - 1.00e+00 4.90e-0
1h 2
11 9.3624199e+03 2.10e-04 1.67e-02 -1.7 6.01e+00 - 1.00e+00 1.00e+0
0h 1
12 9.2069203e+03 4.79e-04 2.44e-02 -3.8 2.00e+01 - 8.46e-01 8.30e-0
1f 1
13 9.1886242e+03 1.49e-04 2.05e-01 -3.8 3.34e+00 - 9.89e-01 7.21e-0
1h 1
14 9.1840023e+03 3.89e-07 3.07e-04 -3.8 9.33e-01 - 1.00e+00 1.00e+0
0h 1
15 9.1828138e+03 1.95e-08 4.40e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
16 9.1828007e+03 7.97e-13 4.82e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 9.1828007392931088e+00 9.1828007392931086e+0
3
Dual infeasibility......: 4.8230707872124948e-10 4.8230707872124948e-0
7
Constraint violation....: 7.9676543141005141e-13 7.9676543141005141e-1
3
Complementarity.........: 2.6134527997788119e-09 2.6134527997788117e-0
6
Overall NLP error.......: 2.6134527997788119e-09 2.6134527997788117e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0890039e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0606063e+02 4.77e+03 5.23e+01 -1.0 4.53e+03 - 8.51e-05 1.04e-0
4h 1
3 8.5674884e+02 4.76e+03 5.23e+01 -1.0 4.77e+03 - 9.62e-06 2.18e-0
3f 1
4 3.8122229e+02 4.65e+03 5.23e+01 -1.0 4.76e+03 - 2.82e-03 2.23e-0
2h 1
5 1.6129511e+04 6.86e-02 7.70e+01 -1.0 4.65e+03 - 8.42e-02 1.00e+0
0h 1
6 8.6428592e+03 6.17e-02 3.53e+01 -1.0 2.77e+01 - 5.15e-01 9.25e-0
2f 1
7 7.1353040e+03 1.99e-02 1.35e+01 -1.0 1.52e+01 - 6.41e-01 7.60e-0
1f 1
8 7.2345503e+03 6.03e-03 1.10e+00 -1.0 2.38e+00 - 9.93e-01 5.00e-0
1f 2
9 7.4467494e+03 2.48e-04 6.11e-02 -1.0 3.13e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.8841153e+03 2.26e-03 8.91e-02 -2.5 2.93e+01 - 8.55e-01 8.27e-0
1f 1
11 6.7163515e+03 2.12e-03 4.49e-01 -2.5 4.53e+00 - 1.00e+00 7.51e-0
1f 1
12 6.6879049e+03 1.53e-04 4.78e-03 -2.5 1.12e+00 - 1.00e+00 1.00e+0
0h 1
13 6.6714076e+03 4.08e-05 1.58e-01 -3.8 2.68e+00 - 1.00e+00 7.53e-0
1h 1
14 6.6671225e+03 1.41e-07 3.55e-04 -3.8 6.62e-01 - 1.00e+00 1.00e+0
0f 1
15 6.6658964e+03 2.80e-08 9.30e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 6.6658840e+03 1.87e-12 1.34e-08 -5.7 2.14e-03 - 1.00e+00 1.00e+0
0f 1
17 6.6658693e+03 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 6.6658693015475494e+00 6.6658693015475492e+0
3
Dual infeasibility......: 4.4776950613588558e-09 4.4776950613588558e-0
6
Constraint violation....: 2.6307428457883475e-12 2.6307428457883475e-1
2
Complementarity.........: 3.6084999009980468e-09 3.6084999009980470e-0
6
Overall NLP error.......: 4.4776950613588558e-09 4.4776950613588558e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9478285e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3f 1
2 8.9187540e+02 3.24e+03 5.24e+01 -1.0 3.02e+03 - 9.14e-05 1.06e-0
4h 1
3 8.1655199e+02 3.23e+03 5.24e+01 -1.0 3.24e+03 - 1.38e-05 3.11e-0
3f 1
4 3.3910587e+02 3.16e+03 5.23e+01 -1.0 3.23e+03 - 4.64e-03 2.16e-0
2h 1
5 1.3760479e+04 6.81e-02 7.78e+01 -1.0 3.16e+03 - 8.37e-02 1.00e+0
0h 1
6 6.7546785e+03 6.11e-02 3.98e+01 -1.0 4.44e+01 - 4.66e-01 9.34e-0
2f 1
7 5.3864148e+03 2.95e-02 1.35e+01 -1.0 2.09e+01 - 6.49e-01 5.65e-0
1f 1
8 5.1381255e+03 3.48e-03 7.14e-01 -1.0 6.07e+00 - 9.54e-01 7.93e-0
1h 1
9 4.8058915e+03 9.07e-03 2.89e-01 -1.7 1.90e+00 - 1.00e+00 8.12e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.7469494e+03 1.26e-03 1.39e-01 -1.7 1.88e+01 - 1.00e+00 9.70e-0
1f 1
11 4.6212427e+03 4.91e-04 1.73e-01 -2.5 1.68e+01 - 9.48e-01 8.28e-0
1h 1
12 4.5986044e+03 6.65e-05 4.46e-03 -2.5 2.80e+00 - 1.00e+00 1.00e+0
0f 1
13 4.5763009e+03 1.58e-05 2.73e-02 -3.8 2.68e+00 - 1.00e+00 9.25e-0
1h 1
14 4.5756328e+03 4.87e-08 5.45e-04 -3.8 1.99e-01 - 1.00e+00 1.00e+0
0f 1
15 4.5743308e+03 4.26e-08 4.12e-04 -5.7 1.49e-01 - 1.00e+00 9.91e-0
1f 1
16 4.5743249e+03 1.95e-12 3.00e-08 -5.7 1.33e-03 - 1.00e+00 1.00e+0
0f 1
17 4.5743102e+03 2.58e-12 3.28e-06 -8.6 1.84e-03 - 1.00e+00 9.99e-0
1f 1
18 4.5743102e+03 1.64e-15 4.83e-14 -8.6 1.07e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 4.5743101733732203e+00 4.5743101733732201e+0
3
Dual infeasibility......: 4.8285426871441785e-14 4.8285426871441785e-1
1
Constraint violation....: 1.6360501065569813e-15 1.6360501065569813e-1
5
Complementarity.........: 2.5059125765115420e-09 2.5059125765115417e-0
6
Overall NLP error.......: 2.5059125765115420e-09 2.5059125765115417e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1589983e+02 2.00e+03 5.23e+01 -1.0 2.02e+03 - 1.20e-03 9.81e-0
3h 1
2 9.1284040e+02 2.00e+03 5.23e+01 -1.0 1.76e+03 - 8.79e-05 1.12e-0
4h 1
3 7.5553664e+02 1.98e+03 5.23e+01 -1.0 2.00e+03 - 2.36e-05 6.19e-0
3f 1
4 3.3207786e+02 1.94e+03 5.17e+01 -1.0 1.98e+03 - 1.43e-02 2.11e-0
2f 1
5 1.0382778e+04 8.33e-02 7.88e+01 -1.0 1.94e+03 - 9.31e-02 1.00e+0
0h 1
6 5.6943684e+03 7.34e-02 2.20e+01 -1.0 1.68e+01 - 7.06e-01 1.12e-0
1f 1
7 4.4774579e+03 2.03e-02 9.10e-01 -1.0 1.14e+01 - 9.52e-01 8.13e-0
1f 1
8 4.7575244e+03 1.61e-02 1.67e-01 -1.0 3.79e+00 - 1.00e+00 9.04e-0
1h 1
9 4.2921560e+03 8.06e-03 3.60e-01 -2.5 2.51e+00 - 7.66e-01 9.31e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2203683e+03 2.26e-03 1.60e-01 -2.5 7.02e-01 - 7.86e-01 6.98e-0
1h 1
11 4.1989190e+03 4.19e-04 1.47e-02 -2.5 2.21e-01 - 1.00e+00 9.90e-0
1h 1
12 4.1815716e+03 2.41e-06 1.05e-01 -3.8 2.69e+00 - 9.17e-01 1.00e+0
0h 1
13 4.1816963e+03 8.87e-10 7.45e-06 -3.8 3.45e-03 - 1.00e+00 1.00e+0
0h 1
14 4.1805057e+03 1.79e-08 1.82e-04 -5.7 1.49e-01 - 1.00e+00 9.96e-0
1f 1
15 4.1805039e+03 1.80e-12 2.29e-09 -5.7 5.97e-04 - 1.00e+00 1.00e+0
0f 1
16 4.1804891e+03 2.63e-12 1.52e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 4.1804891408460350e+00 4.1804891408460353e+0
3
Dual infeasibility......: 1.5189632154845201e-09 1.5189632154845201e-0
6
Constraint violation....: 2.6289109777977160e-12 2.6289109777977160e-1
2
Complementarity.........: 2.8635057235315766e-09 2.8635057235315766e-0
6
Overall NLP error.......: 2.8635057235315766e-09 2.8635057235315766e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6640671e+02 9.17e+02 5.24e+01 -1.0 9.26e+02 - 4.97e-04 9.81e-0
3f 1
2 8.6297755e+02 9.17e+02 5.24e+01 -1.0 7.33e+02 - 1.12e-04 1.24e-0
4h 1
3 2.6189684e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 4.78e-05 2.24e-0
2f 1
4 1.3061351e+04 5.91e-02 8.01e+01 -1.0 8.97e+02 - 4.92e-02 1.00e+0
0h 1
5 4.3096043e+03 5.53e-02 5.43e+01 -1.0 7.48e+01 - 3.12e-01 5.88e-0
2f 1
6 2.7191223e+03 3.01e-02 2.86e+01 -1.0 3.90e+01 - 4.68e-01 4.31e-0
1f 1
7 2.1360734e+03 1.50e-02 2.67e+00 -1.0 1.11e+01 - 9.18e-01 1.00e+0
0h 1
8 2.4962642e+03 4.73e-04 1.00e-01 -1.0 4.04e+00 - 9.99e-01 1.00e+0
0f 1
9 1.8963666e+03 8.08e-04 2.47e-01 -1.7 1.89e+01 - 1.00e+00 8.65e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8823922e+03 1.66e-04 4.18e-02 -1.7 2.16e+00 - 1.00e+00 1.00e+0
0f 1
11 1.7807502e+03 8.71e-05 1.98e-02 -2.5 1.79e+01 - 1.00e+00 9.84e-0
1f 1
12 1.7628166e+03 2.93e-03 7.91e-02 -3.8 2.67e+00 - 6.54e-01 9.83e-0
1h 1
13 1.7579283e+03 5.96e-03 1.22e-02 -3.8 6.62e-02 - 8.50e-01 1.00e+0
0h 1
14 1.7586244e+03 1.23e-04 7.52e-04 -3.8 2.03e-02 - 1.00e+00 1.00e+0
0h 1
15 1.7571777e+03 1.66e-04 9.73e-04 -5.7 1.49e-01 - 9.32e-01 1.00e+0
0h 1
16 1.7571781e+03 5.44e-05 6.54e-03 -5.7 1.35e-03 - 1.00e+00 6.72e-0
1h 1
17 1.7571881e+03 1.11e-08 2.91e-06 -5.7 1.39e-04 - 1.00e+00 1.00e+0
0f 1
18 1.7571731e+03 9.90e-09 2.10e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
19 1.7571729e+03 1.64e-12 7.84e-11 -8.6 3.19e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.7571729106142229e+00 1.7571729106142229e+0
3
Dual infeasibility......: 7.8351370576237947e-11 7.8351370576237947e-0
8
Constraint violation....: 1.6433521210501567e-12 1.6433521210501567e-1
2
Complementarity.........: 2.5101391231747949e-09 2.5101391231747946e-0
6
Overall NLP error.......: 2.5101391231747949e-09 2.5101391231747946e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101510e-01 6.4890146112101513e+0
2
Dual infeasibility......: 4.9126605653162707e-09 4.9126605653162707e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984896560e-09 4.3646094984896562e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605653162707e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933486e-01 5.8277753147933481e+0
2
Dual infeasibility......: 2.1031318725023556e-09 2.1031318725023556e-0
6
Constraint violation....: 6.2994429117502193e-11 6.2994429117502193e-1
1
Complementarity.........: 2.8882108896910881e-09 2.8882108896910880e-0
6
Overall NLP error.......: 2.8882108896910881e-09 2.8882108896910880e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101510e-01 6.4890146112101513e+0
2
Dual infeasibility......: 4.9126605653162707e-09 4.9126605653162707e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984896560e-09 4.3646094984896562e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605653162707e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.05e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.86e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235660167e+00 1.6104063235660167e+0
3
Dual infeasibility......: 2.4575258794729513e-12 2.4575258794729513e-0
9
Constraint violation....: 7.8624591366821517e-15 7.8624591366821517e-1
5
Complementarity.........: 2.5062163919681802e-09 2.5062163919681804e-0
6
Overall NLP error.......: 2.5062163919681802e-09 2.5062163919681804e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2381241e+02 9.17e+02 5.24e+01 -1.0 9.25e+02 - 3.31e-04 9.82e-0
3f 1
2 8.1900461e+02 9.17e+02 5.24e+01 -1.0 5.26e+02 - 7.79e-05 1.73e-0
4h 1
3 2.4185000e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 1.07e-04 2.13e-0
2f 1
4 1.2680352e+04 5.47e-02 8.23e+01 -1.0 8.98e+02 - 3.78e-02 1.00e+0
0h 1
5 3.9103113e+03 5.23e-02 5.80e+01 -1.0 8.30e+01 - 2.93e-01 4.91e-0
2f 1
6 1.9134117e+03 3.74e-02 3.13e+01 -1.0 3.92e+01 - 4.65e-01 5.08e-0
1f 1
7 4.7122064e+03 1.23e-02 2.78e+01 -1.0 2.09e+01 - 3.97e-01 1.00e+0
0h 1
8 1.8777320e+03 1.23e-02 1.10e+00 -1.0 2.60e+01 - 9.87e-01 8.85e-0
1f 1
9 1.9889409e+03 2.13e-04 4.94e-02 -1.0 2.15e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7227527e+03 2.24e-04 1.23e+00 -2.5 1.82e+01 - 9.37e-01 5.95e-0
1f 1
11 1.5351696e+03 3.78e-03 1.32e-01 -2.5 7.57e+00 - 7.96e-01 1.00e+0
0f 1
12 1.5124876e+03 4.93e-03 3.07e-01 -2.5 1.80e+00 - 1.00e+00 7.69e-0
1h 1
13 1.5247300e+03 2.34e-04 4.66e-03 -2.5 7.24e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5021412e+03 1.70e-04 2.15e-02 -3.8 5.39e+00 - 9.90e-01 9.29e-0
1h 1
15 1.5015197e+03 7.29e-07 6.86e-05 -3.8 3.67e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003076e+03 3.77e-07 1.78e-04 -5.7 2.97e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003080e+03 3.79e-11 2.92e-09 -5.7 4.22e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932682238921e+00 1.5002932682238920e+0
3
Dual infeasibility......: 2.1737235850022772e-09 2.1737235850022772e-0
6
Constraint violation....: 6.2995678118404896e-11 6.2995678118404896e-1
1
Complementarity.........: 2.8882174529744085e-09 2.8882174529744084e-0
6
Overall NLP error.......: 2.8882174529744085e-09 2.8882174529744084e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6619491e+02 9.17e+02 5.24e+01 -1.0 9.25e+02 - 4.97e-04 9.82e-0
3f 1
2 8.6134812e+02 9.17e+02 5.24e+01 -1.0 5.14e+02 - 7.56e-05 1.77e-0
4h 1
3 2.6192810e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 1.11e-04 2.24e-0
2f 1
4 1.3048678e+04 5.92e-02 8.01e+01 -1.0 8.97e+02 - 4.93e-02 1.00e+0
0h 1
5 4.3083518e+03 5.53e-02 5.43e+01 -1.0 7.47e+01 - 3.12e-01 5.89e-0
2f 1
2 1.650127e+04 1.578738e+04 1.713184e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.52e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6796485e+02 1.52e+04 5.25e+01 -1.0 1.54e+04 - 2.29e-04 9.80e-0
3f 1
2 7.6512680e+02 1.52e+04 5.25e+01 -1.0 1.50e+04 - 9.59e-05 1.00e-0
4h 1
3 7.5770295e+02 1.52e+04 5.25e+01 -1.0 1.52e+04 - 2.78e-06 5.67e-0
4f 1
4 5.1049664e+02 1.49e+04 5.27e+01 -1.0 1.52e+04 - 6.03e-04 1.98e-0
2h 1
5 2.6256359e+04 6.08e-02 8.48e+01 -1.0 1.49e+04 - 2.94e-02 1.00e+0
0h 1
6 1.7735922e+04 5.85e-02 6.76e+01 -1.0 7.96e+01 - 2.09e-01 4.27e-0
2f 1
7 1.6154119e+04 4.49e-02 3.35e+01 -1.0 2.87e+01 - 5.00e-01 4.36e-0
1f 1
8 1.6450310e+04 3.06e-02 1.35e+01 -1.0 1.62e+01 - 4.67e-01 1.25e-0
1f 4
9 1.6242807e+04 5.30e-03 1.49e-01 -1.0 3.73e+00 - 9.92e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5959970e+04 1.04e-03 2.43e-01 -1.7 4.80e+00 - 1.00e+00 8.81e-0
1f 1
11 1.5935907e+04 7.56e-04 9.98e-03 -1.7 1.55e+01 - 1.00e+00 1.00e+0
0f 1
12 1.5812348e+04 1.30e-03 8.63e-02 -3.8 1.99e+01 - 8.03e-01 9.33e-0
1f 1
13 1.5788121e+04 1.43e-03 6.28e-02 -3.8 1.69e+00 - 8.52e-01 7.76e-0
1h 1
14 1.5788346e+04 2.56e-06 7.16e-04 -3.8 2.95e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5787396e+04 3.24e-07 5.84e-04 -5.7 1.49e-01 - 1.00e+00 9.89e-0
1h 1
16 1.5787390e+04 3.99e-11 6.02e-09 -5.7 1.30e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5787377e+04 6.30e-11 2.07e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5787377147943319e+01 1.5787377147943318e+0
4
Dual infeasibility......: 2.0693042093018226e-09 2.0693042093018226e-0
6
Constraint violation....: 6.2995678118404896e-11 6.2995678118404896e-1
1
Complementarity.........: 2.8881113533675262e-09 2.8881113533675262e-0
6
Overall NLP error.......: 2.8881113533675262e-09 2.8881113533675262e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.46e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.1743974e+02 1.46e+04 5.24e+01 -1.0 1.48e+04 - 3.14e-04 9.80e-0
3h 1
2 8.1457441e+02 1.46e+04 5.24e+01 -1.0 1.40e+04 - 4.70e-05 1.04e-0
4h 1
3 7.8557647e+02 1.46e+04 5.25e+01 -1.0 1.46e+04 - 6.64e-06 2.13e-0
3h 1
4 5.5006203e+02 1.43e+04 5.26e+01 -1.0 1.46e+04 - 2.29e-03 2.04e-0
2h 1
5 2.5264718e+04 5.61e-02 8.29e+01 -1.0 1.43e+04 - 3.90e-02 1.00e+0
0h 1
6 1.7464780e+04 5.34e-02 5.12e+01 -1.0 7.46e+01 - 3.79e-01 5.16e-0
2f 1
7 1.5594308e+04 3.83e-02 2.64e+01 -1.0 3.82e+01 - 4.85e-01 4.87e-0
1f 1
8 1.5921895e+04 2.41e-02 1.11e+01 -1.0 1.92e+01 - 4.20e-01 1.25e-0
1f 4
9 1.5686358e+04 6.11e-03 4.73e-01 -1.0 4.83e+00 - 9.70e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5385929e+04 1.34e-03 1.38e+00 -1.7 5.09e+00 - 3.56e-01 8.41e-0
1f 1
11 1.5365183e+04 1.92e-04 8.13e-01 -1.7 3.27e+00 - 6.21e-01 1.00e+0
0f 1
12 1.5349349e+04 1.27e-04 2.27e-01 -1.7 6.95e+00 - 6.67e-01 1.00e+0
0h 1
13 1.5358204e+04 1.49e-05 4.25e-02 -1.7 1.18e+01 - 8.04e-01 1.00e+0
0h 1
14 1.5243015e+04 1.03e-03 5.83e-02 -2.5 1.50e+01 - 9.13e-01 1.00e+0
0f 1
15 1.5220118e+04 1.23e-03 1.35e-02 -2.5 3.77e+00 - 1.00e+00 1.00e+0
0h 1
16 1.5203525e+04 2.16e-04 9.82e-02 -3.8 5.44e+00 - 1.00e+00 8.41e-0
1h 1
17 1.5201682e+04 4.93e-07 1.14e-04 -3.8 8.65e-01 - 1.00e+00 1.00e+0
0h 1
18 1.5200542e+04 3.84e-07 2.94e-03 -5.7 2.96e-01 - 1.00e+00 9.36e-0
1h 1
19 1.5200491e+04 1.63e-09 2.12e-05 -5.7 8.38e-03 - 9.76e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5200489e+04 3.55e-15 1.84e-11 -5.7 2.22e-03 - 1.00e+00 1.00e+0
0h 1
21 1.5200477e+04 5.83e-11 2.45e-05 -8.6 2.10e-03 - 1.00e+00 9.62e-0
1f 1
22 1.5200476e+04 9.21e-14 3.14e-12 -8.6 1.60e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.5200476117757148e+01 1.5200476117757147e+0
4
Dual infeasibility......: 3.1448018879404155e-12 3.1448018879404155e-0
9
Constraint violation....: 9.2092999892656735e-14 9.2092999892656735e-1
4
Complementarity.........: 2.5110931499324181e-09 2.5110931499324181e-0
6
Overall NLP error.......: 2.5110931499324181e-09 2.5110931499324181e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.5246315e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 4.26e-04 9.80e-0
3h 1
2 8.4961925e+02 1.39e+04 5.24e+01 -1.0 1.32e+04 - 4.56e-05 1.04e-0
4h 1
3 8.4847772e+02 1.39e+04 5.24e+01 -1.0 1.37e+04 - 7.25e-06 8.03e-0
5h 1
4 8.4698370e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 8.56e-05 1.07e-0
4h 1
5 5.4207279e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 1.95e-04 2.20e-0
2f 1
6 2.5799940e+04 5.77e-02 8.08e+01 -1.0 1.36e+04 - 4.62e-02 1.00e+0
0h 1
7 1.7102023e+04 5.41e-02 5.37e+01 -1.0 7.96e+01 - 3.26e-01 5.63e-0
2f 1
8 1.5162002e+04 2.88e-02 2.92e+01 -1.0 4.20e+01 - 4.61e-01 4.95e-0
1f 1
9 1.5295469e+04 1.29e-02 2.80e+00 -1.0 1.66e+01 - 9.19e-01 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4930825e+04 4.85e-03 1.86e-01 -1.0 9.60e+00 - 9.98e-01 1.00e+0
0f 1
11 1.4698923e+04 2.09e-03 1.21e+00 -2.5 4.81e+00 - 9.49e-01 5.98e-0
1f 1
12 1.4543885e+04 1.31e-03 1.13e-01 -2.5 6.16e+00 - 8.49e-01 1.00e+0
0f 1
13 1.4539103e+04 3.44e-04 4.85e-03 -2.5 2.62e-01 - 1.00e+00 1.00e+0
0h 1
14 1.4525026e+04 3.65e-04 8.35e-02 -3.8 2.72e+00 - 7.77e-01 9.08e-0
1h 1
15 1.4521190e+04 1.68e-03 1.87e-03 -3.8 2.30e-01 - 1.00e+00 1.00e+0
0f 1
16 1.4521290e+04 1.80e-05 8.51e-05 -3.8 8.00e-03 - 1.00e+00 1.00e+0
0h 1
17 1.4520113e+04 3.58e-05 1.46e-04 -5.7 1.49e-01 - 9.71e-01 9.99e-0
1h 1
18 1.4520111e+04 7.07e-08 1.51e-07 -5.7 4.95e-04 - 1.00e+00 1.00e+0
0h 1
19 1.4520096e+04 6.19e-09 4.96e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.4520095878284378e+01 1.4520095878284377e+0
4
Dual infeasibility......: 4.9632381582676886e-09 4.9632381582676886e-0
6
Constraint violation....: 6.1938293383079213e-09 6.1938293383079213e-0
9
Complementarity.........: 4.3477917487504726e-09 4.3477917487504723e-0
6
Overall NLP error.......: 6.1938293383079213e-09 4.9632381582676886e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8072599e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.97e-04 9.80e-0
3h 1
2 8.7789681e+02 1.27e+04 5.24e+01 -1.0 1.20e+04 - 4.35e-05 1.05e-0
4h 1
3 8.7649982e+02 1.26e+04 5.24e+01 -1.0 1.25e+04 - 8.25e-06 9.24e-0
5h 1
4 8.7464298e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 9.87e-05 1.24e-0
4h 1
5 5.3818942e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 2.27e-04 2.27e-0
2f 1
6 2.4819351e+04 6.12e-02 7.92e+01 -1.0 1.24e+04 - 5.55e-02 1.00e+0
0h 1
7 1.6196316e+04 5.68e-02 5.31e+01 -1.0 6.51e+01 - 3.17e-01 6.45e-0
2f 1
8 1.4837758e+04 3.11e-02 2.62e+01 -1.0 3.23e+01 - 4.96e-01 4.19e-0
1f 1
9 1.4032966e+04 1.28e-02 2.12e+00 -1.0 1.10e+01 - 9.19e-01 9.21e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4474627e+04 3.88e-04 1.02e-01 -1.0 4.97e+00 - 9.98e-01 1.00e+0
0f 1
11 1.3785632e+04 1.17e-03 7.10e-02 -1.7 2.36e+01 - 1.00e+00 1.00e+0
0f 1
12 1.3746841e+04 6.69e-04 2.58e+00 -2.5 2.28e+01 - 1.00e+00 4.31e-0
1h 1
13 1.3712912e+04 8.27e-05 1.83e-02 -2.5 1.23e+01 - 1.00e+00 1.00e+0
0f 1
14 1.3696873e+04 3.30e-04 8.53e-02 -3.8 2.70e+00 - 7.49e-01 1.00e+0
0h 1
15 1.3693985e+04 1.75e-03 2.31e-03 -3.8 3.87e-02 - 9.27e-01 1.00e+0
0h 1
16 1.3694084e+04 9.23e-05 7.65e-05 -3.8 1.26e-02 - 1.00e+00 1.00e+0
0h 1
17 1.3692877e+04 1.36e-04 1.15e-03 -5.7 1.49e-01 - 9.17e-01 1.00e+0
0h 1
18 1.3692834e+04 3.46e-05 7.33e-06 -5.7 8.67e-03 - 1.00e+00 1.00e+0
0h 1
19 1.3692839e+04 2.90e-07 4.14e-06 -5.7 7.76e-04 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.3692826e+04 2.83e-08 4.06e-05 -8.6 1.84e-03 - 1.00e+00 9.53e-0
1h 1
21 1.3692825e+04 5.54e-12 5.78e-11 -8.6 8.73e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.3692825472372162e+01 1.3692825472372162e+0
4
Dual infeasibility......: 5.7830555241368084e-11 5.7830555241368084e-0
8
Constraint violation....: 5.5354609784785680e-12 5.5354609784785680e-1
2
Complementarity.........: 2.5094085975582872e-09 2.5094085975582873e-0
6
Overall NLP error.......: 2.5094085975582872e-09 2.5094085975582873e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9482527e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 7.48e-04 9.80e-0
3h 1
2 8.9206259e+02 1.11e+04 5.24e+01 -1.0 1.09e+04 - 8.69e-05 1.01e-0
4h 1
3 8.7788074e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 4.01e-06 8.67e-0
4f 1
4 5.1726064e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 9.54e-04 2.26e-0
2h 1
5 2.3121559e+04 6.40e-02 7.79e+01 -1.0 1.09e+04 - 6.98e-02 1.00e+0
0h 1
6 1.4812165e+04 5.85e-02 4.83e+01 -1.0 4.95e+01 - 3.63e-01 7.77e-0
2f 1
7 1.3505031e+04 2.67e-02 2.10e+01 -1.0 2.28e+01 - 5.57e-01 5.00e-0
1f 1
8 1.3018007e+04 6.85e-03 1.23e+00 -1.0 8.59e+00 - 9.37e-01 7.36e-0
1f 1
9 1.3268789e+04 3.20e-04 7.93e-02 -1.0 2.91e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2683148e+04 2.08e-03 9.07e-02 -2.5 4.28e+00 - 8.62e-01 8.28e-0
1f 1
11 1.2505092e+04 2.17e-03 3.62e-01 -2.5 1.06e+00 - 1.00e+00 7.74e-0
1f 1
12 1.2476207e+04 1.68e-04 5.11e-03 -2.5 2.15e-01 - 1.00e+00 1.00e+0
0h 1
13 1.2456345e+04 2.44e-05 4.31e-02 -3.8 2.68e+00 - 1.00e+00 8.82e-0
1h 1
14 1.2454881e+04 5.88e-08 6.10e-04 -3.8 3.16e-01 - 1.00e+00 1.00e+0
0f 1
15 1.2453574e+04 4.24e-08 1.39e-05 -5.7 1.49e-01 - 1.00e+00 9.99e-0
1f 1
16 1.2453562e+04 6.84e-13 3.99e-09 -8.6 1.93e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.2453562267642988e+01 1.2453562267642988e+0
4
Dual infeasibility......: 3.9883527351724813e-09 3.9883527351724813e-0
6
Constraint violation....: 6.8445249468140901e-13 6.8445249468140901e-1
3
Complementarity.........: 2.7863203151325452e-09 2.7863203151325450e-0
6
Overall NLP error.......: 3.9883527351724813e-09 3.9883527351724813e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3006359e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 2.02e-03 9.80e-0
3h 1
2 9.2722762e+02 9.19e+03 5.23e+01 -1.0 8.88e+03 - 6.77e-05 1.02e-0
4h 1
3 9.0058749e+02 9.18e+03 5.23e+01 -1.0 9.18e+03 - 5.63e-06 1.42e-0
3f 1
4 4.9463665e+02 8.97e+03 5.24e+01 -1.0 9.18e+03 - 1.64e-03 2.27e-0
2h 1
5 2.1164030e+04 7.23e-02 7.69e+01 -1.0 8.97e+03 - 7.85e-02 1.00e+0
0h 1
6 1.3562973e+04 6.54e-02 2.35e+01 -1.0 8.38e+00 - 6.64e-01 8.73e-0
2f 1
7 1.2324131e+04 3.29e-02 9.64e+00 -1.0 7.01e+00 - 6.84e-01 1.00e+0
0f 1
8 1.2476105e+04 1.68e-02 6.52e-01 -1.0 2.39e+00 - 9.95e-01 4.91e-0
1f 2
9 1.2182671e+04 6.71e-03 2.78e-01 -1.7 9.98e+00 - 1.00e+00 8.44e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2122153e+04 1.23e-03 8.86e-02 -1.7 1.11e+01 - 1.00e+00 1.00e+0
0f 1
11 1.1995228e+04 3.35e-04 9.60e-02 -2.5 1.72e+01 - 9.85e-01 8.95e-0
1f 1
12 1.1986791e+04 4.66e-06 1.02e-03 -2.5 1.79e+00 - 1.00e+00 1.00e+0
0f 1
13 1.1965361e+04 5.87e-06 5.32e-03 -3.8 2.68e+00 - 1.00e+00 9.75e-0
1f 1
14 1.1965205e+04 1.30e-08 6.21e-06 -3.8 6.52e-02 - 1.00e+00 1.00e+0
0f 1
15 1.1964013e+04 1.73e-08 3.04e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0f 1
16 1.1963999e+04 1.28e-12 4.22e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.1963999109932168e+01 1.1963999109932167e+0
4
Dual infeasibility......: 4.2180122148156111e-10 4.2180122148156111e-0
7
Constraint violation....: 1.2795042803048773e-12 1.2795042803048773e-1
2
Complementarity.........: 2.5909993213787965e-09 2.5909993213787963e-0
6
Overall NLP error.......: 2.5909993213787965e-09 2.5909993213787963e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891119e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0611351e+02 6.71e+03 5.23e+01 -1.0 6.46e+03 - 8.39e-05 1.03e-0
4h 1
3 8.7440044e+02 6.70e+03 5.23e+01 -1.0 6.70e+03 - 6.84e-06 1.53e-0
3f 1
4 4.2534165e+02 6.54e+03 5.24e+01 -1.0 6.70e+03 - 1.83e-03 2.26e-0
2h 1
5 1.8469067e+04 6.74e-02 7.67e+01 -1.0 6.54e+03 - 8.35e-02 1.00e+0
0h 1
6 1.0609292e+04 6.07e-02 3.68e+01 -1.0 2.85e+01 - 4.94e-01 9.10e-0
2f 1
7 9.1070968e+03 1.97e-02 1.46e+01 -1.0 1.53e+01 - 6.26e-01 7.49e-0
1f 1
8 9.1804481e+03 5.62e-03 1.19e+00 -1.0 2.08e+00 - 9.93e-01 5.00e-0
1f 2
9 9.3751841e+03 2.91e-04 6.67e-02 -1.0 2.88e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.8198146e+03 2.22e-03 9.09e-02 -2.5 2.66e+01 - 8.56e-01 8.23e-0
1f 1
11 8.6513288e+03 2.12e-03 4.55e-01 -2.5 4.37e+00 - 1.00e+00 7.50e-0
1f 1
12 8.6223061e+03 1.56e-04 4.78e-03 -2.5 1.09e+00 - 1.00e+00 1.00e+0
0h 1
13 8.6058823e+03 4.18e-05 1.61e-01 -3.8 2.68e+00 - 1.00e+00 7.51e-0
1h 1
14 8.6015687e+03 1.44e-07 3.57e-04 -3.8 6.67e-01 - 1.00e+00 1.00e+0
0f 1
15 8.6003429e+03 2.79e-08 9.26e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 8.6003306e+03 1.87e-12 1.33e-08 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
17 8.6003159e+03 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 8.6003158972340756e+00 8.6003158972340752e+0
3
Dual infeasibility......: 4.4776952371359800e-09 4.4776952371359800e-0
6
Constraint violation....: 2.6307706013639631e-12 2.6307706013639631e-1
2
Complementarity.........: 3.6085002100386504e-09 3.6085002100386505e-0
6
Overall NLP error.......: 4.4776952371359800e-09 4.4776952371359800e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3004795e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 2.02e-03 9.80e-0
3h 1
2 9.2712367e+02 4.77e+03 5.23e+01 -1.0 4.47e+03 - 6.97e-05 1.06e-0
4h 1
3 8.6230721e+02 4.76e+03 5.23e+01 -1.0 4.77e+03 - 1.09e-05 2.80e-0
3f 1
4 3.9458856e+02 4.65e+03 5.23e+01 -1.0 4.76e+03 - 3.78e-03 2.20e-0
2h 1
5 1.5936731e+04 7.51e-02 7.75e+01 -1.0 4.65e+03 - 7.99e-02 1.00e+0
0h 1
6 9.0816127e+03 6.78e-02 2.29e+01 -1.0 8.31e+00 - 6.77e-01 9.05e-0
2f 1
7 7.8525062e+03 3.47e-02 8.39e+00 -1.0 6.89e+00 - 7.10e-01 1.00e+0
0f 1
8 8.1952987e+03 2.05e-02 2.98e-01 -1.0 2.41e+00 - 9.96e-01 9.69e-0
1f 1
9 7.7640020e+03 3.95e-03 3.54e-01 -1.7 1.12e+01 - 8.33e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.7107177e+03 7.81e-04 3.48e-02 -1.7 7.24e+00 - 1.00e+00 1.00e+0
0h 1
11 7.5664016e+03 4.99e-04 2.40e-02 -2.5 1.64e+01 - 9.77e-01 9.84e-0
1f 1
12 7.5511474e+03 1.19e-04 1.70e-01 -3.8 2.89e+00 - 9.96e-01 7.71e-0
1h 1
13 7.5477478e+03 2.23e-07 1.25e-04 -3.8 6.61e-01 - 1.00e+00 1.00e+0
0f 1
14 7.5465612e+03 1.74e-08 3.02e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
15 7.5465477e+03 1.28e-12 4.23e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 7.5465477068866784e+00 7.5465477068866785e+0
3
Dual infeasibility......: 4.2290123240677066e-10 4.2290123240677066e-0
7
Constraint violation....: 1.2839451724033779e-12 1.2839451724033779e-1
2
Complementarity.........: 2.5905430566417348e-09 2.5905430566417350e-0
6
Overall NLP error.......: 2.5905430566417348e-09 2.5905430566417350e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9478285e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3f 1
2 8.9187540e+02 3.24e+03 5.24e+01 -1.0 3.02e+03 - 9.14e-05 1.06e-0
4h 1
3 8.1655199e+02 3.23e+03 5.24e+01 -1.0 3.24e+03 - 1.38e-05 3.11e-0
3f 1
4 3.3910587e+02 3.16e+03 5.23e+01 -1.0 3.23e+03 - 4.64e-03 2.16e-0
2h 1
5 1.3760479e+04 6.81e-02 7.78e+01 -1.0 3.16e+03 - 8.37e-02 1.00e+0
0h 1
6 6.7546785e+03 6.11e-02 3.98e+01 -1.0 4.44e+01 - 4.66e-01 9.34e-0
2f 1
7 5.3864148e+03 2.95e-02 1.35e+01 -1.0 2.09e+01 - 6.49e-01 5.65e-0
1f 1
8 5.1381255e+03 3.48e-03 7.14e-01 -1.0 6.07e+00 - 9.54e-01 7.93e-0
1h 1
9 4.8058915e+03 9.07e-03 2.89e-01 -1.7 1.90e+00 - 1.00e+00 8.12e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.7469494e+03 1.26e-03 1.39e-01 -1.7 1.88e+01 - 1.00e+00 9.70e-0
1f 1
11 4.6212428e+03 4.91e-04 1.73e-01 -2.5 1.68e+01 - 9.48e-01 8.28e-0
1h 1
12 4.5986044e+03 6.65e-05 4.46e-03 -2.5 2.80e+00 - 1.00e+00 1.00e+0
0f 1
13 4.5763009e+03 1.58e-05 2.73e-02 -3.8 2.68e+00 - 1.00e+00 9.25e-0
1h 1
14 4.5756328e+03 4.87e-08 5.45e-04 -3.8 1.99e-01 - 1.00e+00 1.00e+0
0f 1
15 4.5743308e+03 4.26e-08 4.12e-04 -5.7 1.49e-01 - 1.00e+00 9.91e-0
1f 1
16 4.5743249e+03 1.95e-12 3.00e-08 -5.7 1.33e-03 - 1.00e+00 1.00e+0
0f 1
17 4.5743102e+03 2.58e-12 3.28e-06 -8.6 1.84e-03 - 1.00e+00 9.99e-0
1f 1
18 4.5743102e+03 1.64e-15 4.85e-14 -8.6 1.07e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 4.5743101800115848e+00 4.5743101800115846e+0
3
Dual infeasibility......: 4.8519868937614503e-14 4.8519868937614503e-1
1
Constraint violation....: 1.6357795390873376e-15 1.6357795390873376e-1
5
Complementarity.........: 2.5059125764796095e-09 2.5059125764796094e-0
6
Overall NLP error.......: 2.5059125764796095e-09 2.5059125764796094e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8064252e+02 2.00e+03 5.24e+01 -1.0 2.02e+03 - 5.97e-04 9.81e-0
3f 1
2 8.7760033e+02 2.00e+03 5.24e+01 -1.0 1.79e+03 - 9.81e-05 1.11e-0
4h 1
3 7.4188986e+02 1.99e+03 5.24e+01 -1.0 2.00e+03 - 2.20e-05 5.30e-0
3f 1
4 3.0853037e+02 1.94e+03 5.19e+01 -1.0 1.99e+03 - 1.13e-02 2.08e-0
2f 1
5 1.0454262e+04 7.18e-02 7.81e+01 -1.0 1.94e+03 - 1.01e-01 1.00e+0
0h 1
6 4.9583655e+03 6.28e-02 2.13e+01 -1.0 4.92e+01 - 7.01e-01 1.16e-0
1f 1
7 3.4679380e+03 2.85e-02 2.35e+00 -1.0 2.41e+01 - 9.37e-01 6.11e-0
1f 1
8 3.5502765e+03 4.69e-03 1.40e-01 -1.0 3.47e+00 - 1.00e+00 1.00e+0
0f 1
9 3.0919874e+03 1.73e-03 2.74e-01 -2.5 3.67e+00 - 8.96e-01 7.84e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.0656701e+03 1.76e-05 1.17e-02 -2.5 4.34e-01 - 1.00e+00 1.00e+0
0h 1
11 3.0443578e+03 3.86e-04 9.45e-02 -3.8 2.69e+00 - 7.24e-01 9.81e-0
1f 1
12 3.0404046e+03 2.37e-03 5.59e-03 -3.8 4.63e-02 - 8.29e-01 1.00e+0
0h 1
13 3.0405027e+03 1.41e-04 1.23e-04 -3.8 1.70e-02 - 1.00e+00 1.00e+0
0h 1
14 3.0392763e+03 1.55e-04 1.25e-03 -5.7 1.49e-01 - 9.12e-01 1.00e+0
0h 1
15 3.0392276e+03 4.25e-05 1.02e-05 -5.7 9.60e-03 - 1.00e+00 1.00e+0
0h 1
16 3.0392312e+03 9.25e-07 6.70e-06 -5.7 1.39e-03 - 1.00e+00 1.00e+0
0h 1
17 3.0392191e+03 6.89e-08 7.06e-05 -8.6 1.84e-03 - 1.00e+00 9.41e-0
1h 1
18 3.0392184e+03 8.32e-12 9.00e-11 -8.6 1.08e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 3.0392183762051515e+00 3.0392183762051513e+0
3
Dual infeasibility......: 8.9990919932624051e-11 8.9990919932624051e-0
8
Constraint violation....: 8.3233420156147986e-12 8.3233420156147986e-1
2
Complementarity.........: 2.5077806590825924e-09 2.5077806590825923e-0
6
Overall NLP error.......: 2.5077806590825924e-09 2.5077806590825923e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0857741e+02 9.17e+02 5.23e+01 -1.0 9.25e+02 - 1.00e-03 9.82e-0
3f 1
2 9.0342468e+02 9.17e+02 5.23e+01 -1.0 4.76e+02 - 6.91e-05 1.91e-0
4h 1
3 2.8405630e+02 8.96e+02 5.24e+01 -1.0 9.17e+02 - 1.26e-04 2.34e-0
2f 1
4 1.3435408e+04 6.53e-02 7.62e+01 -1.0 8.96e+02 - 8.25e-02 1.00e+0
0h 1
5 4.8779878e+03 5.89e-02 3.93e+01 -1.0 2.99e+01 - 4.58e-01 8.86e-0
2f 1
6 3.3867814e+03 1.87e-02 1.66e+01 -1.0 1.55e+01 - 6.03e-01 7.29e-0
1f 1
7 3.4351076e+03 5.28e-03 2.31e-01 -1.0 2.14e+00 - 9.87e-01 1.00e+0
0h 1
8 3.0189916e+03 1.48e-03 1.25e-01 -1.7 4.66e+00 - 1.00e+00 1.00e+0
0f 1
9 2.8631443e+03 1.98e-03 4.33e-01 -2.5 8.66e-01 - 1.00e+00 7.79e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8367590e+03 1.69e-04 5.51e-03 -2.5 1.78e-01 - 1.00e+00 1.00e+0
0h 1
11 2.8190584e+03 4.67e-05 1.88e-01 -3.8 5.39e+00 - 1.00e+00 7.34e-0
1h 1
12 2.8137626e+03 1.65e-07 3.73e-04 -3.8 1.42e+00 - 1.00e+00 1.00e+0
0f 1
13 2.8123946e+03 2.70e-08 9.22e-04 -5.7 2.97e-01 - 1.00e+00 9.86e-0
1h 1
14 2.8123803e+03 1.86e-12 1.31e-08 -5.7 4.20e-03 - 1.00e+00 1.00e+0
0f 1
15 2.8123637e+03 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 2.8123637008985152e+00 2.8123637008985152e+0
3
Dual infeasibility......: 4.4777012146470653e-09 4.4777012146470653e-0
6
Constraint violation....: 2.6306179456980772e-12 2.6306179456980772e-1
2
Complementarity.........: 3.6085027613640957e-09 3.6085027613640954e-0
6
Overall NLP error.......: 4.4777012146470653e-09 4.4777012146470653e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933520e-01 5.8277753147933515e+0
2
Dual infeasibility......: 2.1031320944656453e-09 2.1031320944656453e-0
6
Constraint violation....: 6.2994234828472884e-11 6.2994234828472884e-1
1
Complementarity.........: 2.8882108896915596e-09 2.8882108896915594e-0
6
Overall NLP error.......: 2.8882108896915596e-09 2.8882108896915594e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933520e-01 5.8277753147933515e+0
2
Dual infeasibility......: 2.1031320944656453e-09 2.1031320944656453e-0
6
Constraint violation....: 6.2994234828472884e-11 6.2994234828472884e-1
1
Complementarity.........: 2.8882108896915596e-09 2.8882108896915594e-0
6
Overall NLP error.......: 2.8882108896915596e-09 2.8882108896915594e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254210190e-01 6.4890146254210185e+0
2
Dual infeasibility......: 4.9126604770980010e-09 4.9126604770980010e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646095252485824e-09 4.3646095252485824e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126604770980010e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.02e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 6.36e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643348e+00 1.6104063281643348e+0
3
Dual infeasibility......: 2.4576378536171077e-12 2.4576378536171077e-0
9
Constraint violation....: 6.3603173025546602e-15 6.3603173025546602e-1
5
Complementarity.........: 2.5062163910047551e-09 2.5062163910047549e-0
6
Overall NLP error.......: 2.5062163910047551e-09 2.5062163910047549e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2407030e+02 9.17e+02 5.24e+01 -1.0 9.26e+02 - 3.31e-04 9.81e-0
3f 1
2 8.2061416e+02 9.17e+02 5.24e+01 -1.0 7.38e+02 - 1.15e-04 1.23e-0
4h 1
3 2.5649513e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 4.69e-05 2.08e-0
2f 1
4 1.1314657e+04 5.75e-02 8.19e+01 -1.0 8.98e+02 - 3.73e-02 1.00e+0
0h 1
5 3.8956140e+03 5.45e-02 5.06e+01 -1.0 7.64e+01 - 3.74e-01 4.81e-0
2f 1
6 1.9060670e+03 3.62e-02 2.71e+01 -1.0 4.04e+01 - 4.70e-01 5.09e-0
1f 1
7 4.6724079e+03 1.24e-02 2.52e+01 -1.0 2.06e+01 - 4.02e-01 1.00e+0
0h 1
8 1.8740007e+03 1.18e-02 9.57e-01 -1.0 2.50e+01 - 9.87e-01 9.03e-0
1f 1
9 1.6912736e+03 5.16e-04 6.28e-02 -1.7 5.23e+00 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5455615e+03 1.94e-03 2.19e-01 -2.5 5.71e+00 - 7.44e-01 1.00e+0
0f 1
11 1.5139404e+03 3.68e-03 1.05e-01 -2.5 2.12e+00 - 1.00e+00 9.19e-0
1h 1
12 1.5218401e+03 1.31e-04 3.48e-03 -2.5 1.22e+00 - 1.00e+00 1.00e+0
0h 1
13 1.5017779e+03 1.63e-04 2.18e-02 -3.8 2.69e+00 - 9.93e-01 9.31e-0
1h 1
14 1.5013697e+03 7.66e-07 7.15e-05 -3.8 1.77e-01 - 1.00e+00 1.00e+0
0f 1
15 1.5003052e+03 3.77e-07 1.78e-04 -5.7 1.49e-01 - 1.00e+00 9.96e-0
1h 1
16 1.5003062e+03 3.80e-11 2.94e-09 -5.7 1.17e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5002932676694936e+00 1.5002932676694936e+0
3
Dual infeasibility......: 2.1737073616540305e-09 2.1737073616540305e-0
6
Constraint violation....: 6.2995705873980512e-11 6.2995705873980512e-1
1
Complementarity.........: 2.8882174165364259e-09 2.8882174165364258e-0
6
Overall NLP error.......: 2.8882174165364259e-09 2.8882174165364258e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6640671e+02 9.17e+02 5.24e+01 -1.0 9.26e+02 - 4.97e-04 9.81e-0
3f 1
2 8.6297755e+02 9.17e+02 5.24e+01 -1.0 7.33e+02 - 1.12e-04 1.24e-0
4h 1
3 2.6189684e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 4.78e-05 2.24e-0
2f 1
4 1.3061351e+04 5.91e-02 8.01e+01 -1.0 8.97e+02 - 4.92e-02 1.00e+0
0h 1
5 4.3096043e+03 5.53e-02 5.43e+01 -1.0 7.48e+01 - 3.12e-01 5.88e-0
2f 1
6 2.7191223e+03 3.01e-02 2.86e+01 -1.0 3.90e+01 - 4.68e-01 4.31e-0
1f 1
3 1.648351e+04 1.597291e+04 1.766831e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.54e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1158067e+02 1.54e+04 5.50e+01 -1.0 1.55e+04 - 1.75e-04 9.80e-0
3f 1
2 7.0876115e+02 1.54e+04 5.50e+01 -1.0 1.52e+04 - 9.69e-05 1.00e-0
4h 1
3 7.0173994e+02 1.54e+04 5.50e+01 -1.0 1.54e+04 - 2.73e-06 5.54e-0
4f 1
4 4.7815761e+02 1.51e+04 5.40e+01 -1.0 1.54e+04 - 5.89e-04 1.88e-0
2h 1
5 2.6070721e+04 7.61e-02 8.69e+01 -1.0 1.51e+04 - 2.52e-02 1.00e+0
0h 1
6 1.7536741e+04 7.33e-02 7.38e+01 -1.0 7.46e+01 - 1.60e-01 3.97e-0
2f 1
7 1.6275268e+04 4.64e-02 3.43e+01 -1.0 1.95e+01 - 5.30e-01 3.77e-0
1f 1
8 1.6526242e+04 4.07e-02 1.02e+01 -1.0 1.34e+01 - 5.66e-01 1.25e-0
1f 4
9 1.6445086e+04 6.81e-03 1.94e-01 -1.0 8.83e-01 - 9.93e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6149813e+04 7.54e-04 2.01e-01 -1.7 5.86e+00 - 1.00e+00 8.96e-0
1f 1
11 1.6118983e+04 7.90e-04 1.14e-02 -1.7 1.44e+01 - 1.00e+00 1.00e+0
0f 1
12 1.5997558e+04 1.26e-03 8.16e-02 -3.8 1.99e+01 - 8.09e-01 9.34e-0
1f 1
13 1.5973677e+04 1.39e-03 6.58e-02 -3.8 1.67e+00 - 8.57e-01 7.76e-0
1h 1
14 1.5973890e+04 2.49e-06 7.03e-04 -3.8 2.89e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5972933e+04 3.28e-07 5.56e-04 -5.7 1.49e-01 - 1.00e+00 9.89e-0
1h 1
16 1.5972927e+04 4.02e-11 5.92e-09 -5.7 3.80e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5972914e+04 6.30e-11 2.05e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5972914315151229e+01 1.5972914315151229e+0
4
Dual infeasibility......: 2.0519881832062983e-09 2.0519881832062983e-0
6
Constraint violation....: 6.2994984229014506e-11 6.2994984229014506e-1
1
Complementarity.........: 2.8881132369977784e-09 2.8881132369977782e-0
6
Overall NLP error.......: 2.8881132369977784e-09 2.8881132369977782e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.47e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9878787e+02 1.47e+04 5.25e+01 -1.0 1.49e+04 - 2.75e-04 9.80e-0
3f 1
2 7.9595527e+02 1.47e+04 5.25e+01 -1.0 1.45e+04 - 9.50e-05 1.00e-0
4h 1
3 7.8795948e+02 1.47e+04 5.25e+01 -1.0 1.47e+04 - 2.88e-06 5.91e-0
4f 1
4 5.2243876e+02 1.44e+04 5.27e+01 -1.0 1.47e+04 - 6.31e-04 2.05e-0
2h 1
5 2.6001207e+04 5.40e-02 8.35e+01 -1.0 1.44e+04 - 3.34e-02 1.00e+0
0h 1
6 1.7493864e+04 5.18e-02 6.25e+01 -1.0 8.07e+01 - 2.54e-01 4.58e-0
2f 1
7 1.5706828e+04 4.21e-02 3.23e+01 -1.0 3.42e+01 - 4.83e-01 4.72e-0
1f 1
8 1.6029714e+04 2.59e-02 1.44e+01 -1.0 1.84e+01 - 4.26e-01 1.25e-0
1f 4
9 1.5771498e+04 6.13e-03 1.70e-01 -1.0 5.20e+00 - 9.91e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5488004e+04 1.24e-03 2.90e-01 -1.7 4.59e+00 - 1.00e+00 8.63e-0
1f 1
11 1.5462530e+04 7.79e-04 1.14e-02 -1.7 1.61e+01 - 1.00e+00 1.00e+0
0f 1
12 1.5337303e+04 1.34e-03 9.04e-02 -3.8 1.99e+01 - 7.98e-01 9.32e-0
1f 1
13 1.5313141e+04 1.49e-03 6.50e-02 -3.8 1.70e+00 - 8.48e-01 7.71e-0
1h 1
14 1.5313409e+04 2.75e-06 7.51e-04 -3.8 3.08e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5312466e+04 3.13e-07 6.18e-04 -5.7 1.49e-01 - 1.00e+00 9.88e-0
1h 1
16 1.5312460e+04 3.93e-11 6.23e-09 -5.7 1.96e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5312447e+04 6.30e-11 2.10e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5312446898944252e+01 1.5312446898944252e+0
4
Dual infeasibility......: 2.0960047922534826e-09 2.0960047922534826e-0
6
Constraint violation....: 6.2995969551948860e-11 6.2995969551948860e-1
1
Complementarity.........: 2.8881080701044665e-09 2.8881080701044665e-0
6
Overall NLP error.......: 2.8881080701044665e-09 2.8881080701044665e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.0180620e+02 1.39e+04 5.25e+01 -1.0 1.40e+04 - 2.81e-04 9.80e-0
3f 1
2 7.9897236e+02 1.39e+04 5.25e+01 -1.0 1.37e+04 - 9.50e-05 1.01e-0
4h 1
3 7.8997231e+02 1.39e+04 5.25e+01 -1.0 1.39e+04 - 3.05e-06 6.27e-0
4f 1
4 5.0740028e+02 1.36e+04 5.27e+01 -1.0 1.39e+04 - 6.73e-04 2.05e-0
2h 1
5 2.5171175e+04 5.42e-02 8.34e+01 -1.0 1.36e+04 - 3.39e-02 1.00e+0
0h 1
6 1.6683650e+04 5.19e-02 6.18e+01 -1.0 8.06e+01 - 2.61e-01 4.63e-0
2f 1
7 1.4876513e+04 4.17e-02 3.20e+01 -1.0 3.48e+01 - 4.81e-01 4.76e-0
1f 1
8 1.5201819e+04 2.55e-02 1.43e+01 -1.0 1.86e+01 - 4.23e-01 1.25e-0
1f 4
9 1.4941061e+04 6.18e-03 1.84e-01 -1.0 5.28e+00 - 9.90e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4656391e+04 1.26e-03 2.98e-01 -1.7 4.63e+00 - 1.00e+00 8.61e-0
1f 1
11 1.4630320e+04 7.86e-04 1.16e-02 -1.7 1.64e+01 - 1.00e+00 1.00e+0
0f 1
12 1.4504865e+04 1.35e-03 9.10e-02 -3.8 1.99e+01 - 7.97e-01 9.31e-0
1f 1
13 1.4480735e+04 1.49e-03 6.58e-02 -3.8 1.70e+00 - 8.47e-01 7.70e-0
1h 1
14 1.4481013e+04 2.79e-06 7.57e-04 -3.8 3.10e-01 - 1.00e+00 1.00e+0
0h 1
15 1.4480071e+04 3.11e-07 6.22e-04 -5.7 1.49e-01 - 1.00e+00 9.88e-0
1h 1
16 1.4480065e+04 3.91e-11 6.26e-09 -5.7 2.25e-01 - 1.00e+00 1.00e+0
0f 1
17 1.4480052e+04 6.30e-11 2.10e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.4480051731615575e+01 1.4480051731615575e+0
4
Dual infeasibility......: 2.1005813955210178e-09 2.1005813955210178e-0
6
Constraint violation....: 6.2996080574251323e-11 6.2996080574251323e-1
1
Complementarity.........: 2.8881076355289437e-09 2.8881076355289435e-0
6
Overall NLP error.......: 2.8881076355289437e-09 2.8881076355289435e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2426036e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.31e-04 9.80e-0
3f 1
2 8.2143522e+02 1.27e+04 5.24e+01 -1.0 1.24e+04 - 9.42e-05 1.01e-0
4h 1
3 8.1065099e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 3.37e-06 6.96e-0
4f 1
4 4.9728339e+02 1.24e+04 5.26e+01 -1.0 1.26e+04 - 7.53e-04 2.10e-0
2h 1
5 2.4069660e+04 5.53e-02 8.24e+01 -1.0 1.24e+04 - 3.87e-02 1.00e+0
0h 1
6 1.5613094e+04 5.27e-02 5.56e+01 -1.0 8.02e+01 - 3.23e-01 5.03e-0
2f 1
7 1.3641905e+04 3.73e-02 2.97e+01 -1.0 3.93e+01 - 4.70e-01 5.04e-0
1f 1
8 1.3986585e+04 2.27e-02 1.37e+01 -1.0 2.05e+01 - 4.02e-01 1.25e-0
1f 4
9 1.3731771e+04 6.02e-03 3.89e-01 -1.0 4.91e+00 - 9.79e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3426073e+04 1.43e-03 4.05e-01 -1.7 5.53e+00 - 1.00e+00 8.25e-0
1f 1
11 1.3385053e+04 9.11e-04 1.45e-02 -1.7 1.80e+01 - 1.00e+00 1.00e+0
0f 1
12 1.3257084e+04 1.44e-03 9.78e-02 -3.8 1.99e+01 - 7.88e-01 9.29e-0
1f 1
13 1.3233557e+04 1.62e-03 8.51e-02 -3.8 1.71e+00 - 8.43e-01 7.51e-0
1h 1
14 1.3234003e+04 3.33e-06 8.54e-04 -3.8 3.44e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3233070e+04 2.80e-07 6.75e-04 -5.7 1.49e-01 - 1.00e+00 9.87e-0
1h 1
16 1.3233064e+04 3.64e-11 6.70e-09 -5.7 2.74e-01 - 1.00e+00 1.00e+0
0f 1
17 1.3233051e+04 6.30e-11 2.17e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.3233050885359253e+01 1.3233050885359253e+0
4
Dual infeasibility......: 2.1728983059880081e-09 2.1728983059880081e-0
6
Constraint violation....: 6.2999050420842195e-11 6.2999050420842195e-1
1
Complementarity.........: 2.8881016528413473e-09 2.8881016528413472e-0
6
Overall NLP error.......: 2.8881016528413473e-09 2.8881016528413472e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1197348e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.08e-03 9.80e-0
3h 1
2 9.0921600e+02 1.11e+04 5.23e+01 -1.0 1.09e+04 - 8.14e-05 1.01e-0
4h 1
3 8.9401033e+02 1.11e+04 5.23e+01 -1.0 1.11e+04 - 4.16e-06 9.33e-0
4f 1
4 5.3020649e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 1.03e-03 2.30e-0
2h 1
5 2.3256372e+04 6.70e-02 7.65e+01 -1.0 1.09e+04 - 8.24e-02 1.00e+0
0h 1
6 1.5122416e+04 6.04e-02 3.53e+01 -1.0 2.51e+01 - 5.11e-01 8.94e-0
2f 1
7 1.3601685e+04 1.47e-02 1.46e+01 -1.0 1.42e+01 - 6.21e-01 7.97e-0
1f 1
8 1.3713982e+04 5.14e-03 1.01e+00 -1.0 2.84e+00 - 9.93e-01 5.00e-0
1f 2
9 1.3925189e+04 1.91e-04 5.10e-02 -1.0 2.93e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3356446e+04 2.33e-03 8.48e-02 -2.5 2.70e+01 - 8.54e-01 8.36e-0
1f 1
11 1.3191173e+04 2.11e-03 4.46e-01 -2.5 4.24e+00 - 1.00e+00 7.52e-0
1f 1
12 1.3163408e+04 1.46e-04 6.28e-03 -2.5 1.05e+00 - 1.00e+00 1.00e+0
0h 1
13 1.3148776e+04 4.43e-05 2.79e-01 -3.8 2.68e+00 - 1.00e+00 7.06e-0
1h 1
14 1.3143550e+04 1.78e-07 2.08e-04 -3.8 7.88e-01 - 1.00e+00 1.00e+0
0f 1
15 1.3142357e+04 2.09e-08 7.39e-04 -5.7 1.49e-01 - 1.00e+00 9.88e-0
1h 1
16 1.3142347e+04 1.82e-12 6.87e-09 -5.7 1.76e-03 - 1.00e+00 1.00e+0
0f 1
17 1.3142332e+04 2.63e-12 2.58e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.3142332340578308e+01 1.3142332340578309e+0
4
Dual infeasibility......: 2.5842454079993666e-09 2.5842454079993666e-0
6
Constraint violation....: 2.6305208011834225e-12 2.6305208011834225e-1
2
Complementarity.........: 3.1309224497515883e-09 3.1309224497515884e-0
6
Overall NLP error.......: 3.1309224497515883e-09 3.1309224497515884e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891839e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0614875e+02 9.19e+03 5.23e+01 -1.0 8.94e+03 - 8.31e-05 1.02e-0
4h 1
3 8.8589053e+02 9.18e+03 5.23e+01 -1.0 9.18e+03 - 4.99e-06 1.11e-0
3f 1
4 4.8290407e+02 8.97e+03 5.24e+01 -1.0 9.18e+03 - 1.26e-03 2.28e-0
2h 1
5 2.1194856e+04 6.67e-02 7.66e+01 -1.0 8.97e+03 - 8.32e-02 1.00e+0
0h 1
6 1.3110859e+04 6.01e-02 3.76e+01 -1.0 2.89e+01 - 4.83e-01 9.02e-0
2f 1
7 1.1611939e+04 1.94e-02 1.53e+01 -1.0 1.53e+01 - 6.18e-01 7.42e-0
1f 1
8 1.1669715e+04 5.64e-03 1.25e+00 -1.0 2.10e+00 - 9.91e-01 5.00e-0
1f 2
9 1.1851856e+04 3.17e-04 6.99e-02 -1.0 2.45e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1303064e+04 2.21e-03 9.19e-02 -2.5 2.21e+01 - 8.56e-01 8.21e-0
1f 1
11 1.1134535e+04 2.12e-03 4.58e-01 -2.5 3.77e+00 - 1.00e+00 7.49e-0
1f 1
12 1.1105283e+04 1.58e-04 4.78e-03 -2.5 9.43e-01 - 1.00e+00 1.00e+0
0h 1
13 1.1088904e+04 4.25e-05 1.63e-01 -3.8 2.68e+00 - 1.00e+00 7.50e-0
1h 1
14 1.1084573e+04 1.45e-07 3.58e-04 -3.8 6.70e-01 - 1.00e+00 1.00e+0
0f 1
15 1.1083348e+04 2.78e-08 9.22e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 1.1083335e+04 1.87e-12 1.33e-08 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
17 1.1083321e+04 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.1083320715970446e+01 1.1083320715970445e+0
4
Dual infeasibility......: 4.4776953435394118e-09 4.4776953435394118e-0
6
Constraint violation....: 2.6305971290163654e-12 2.6305971290163654e-1
2
Complementarity.........: 3.6085004020783432e-09 3.6085004020783432e-0
6
Overall NLP error.......: 4.4776953435394118e-09 4.4776953435394118e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2300862e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.80e-0
3h 1
2 9.2018520e+02 6.71e+03 5.23e+01 -1.0 6.43e+03 - 7.59e-05 1.03e-0
4h 1
3 8.8417722e+02 6.69e+03 5.23e+01 -1.0 6.70e+03 - 7.25e-06 1.73e-0
3f 1
4 4.3415243e+02 6.54e+03 5.24e+01 -1.0 6.69e+03 - 2.08e-03 2.26e-0
2h 1
5 1.8486104e+04 7.08e-02 7.69e+01 -1.0 6.54e+03 - 8.04e-02 1.00e+0
0h 1
6 1.0916142e+04 6.40e-02 2.32e+01 -1.0 1.36e+01 - 6.65e-01 8.89e-0
2f 1
7 9.6154376e+03 1.98e-02 9.31e+00 -1.0 9.91e+00 - 6.64e-01 8.81e-0
1f 1
8 9.7199903e+03 1.05e-02 6.35e-01 -1.0 2.75e+00 - 9.95e-01 4.77e-0
1f 2
9 9.3967776e+03 9.36e-03 2.78e-01 -1.7 9.45e+00 - 1.00e+00 8.30e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.3672965e+03 2.18e-03 9.40e-01 -1.7 1.18e+01 - 1.00e+00 4.90e-0
1h 2
11 9.3624199e+03 2.10e-04 1.67e-02 -1.7 6.01e+00 - 1.00e+00 1.00e+0
0h 1
12 9.2069203e+03 4.79e-04 2.44e-02 -3.8 2.00e+01 - 8.46e-01 8.30e-0
1f 1
13 9.1886242e+03 1.49e-04 2.05e-01 -3.8 3.34e+00 - 9.89e-01 7.21e-0
1h 1
14 9.1840024e+03 3.89e-07 3.07e-04 -3.8 9.33e-01 - 1.00e+00 1.00e+0
0h 1
15 9.1828139e+03 1.95e-08 4.40e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
16 9.1828008e+03 7.96e-13 4.82e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 9.1828007504537741e+00 9.1828007504537745e+0
3
Dual infeasibility......: 4.8230711696902221e-10 4.8230711696902221e-0
7
Constraint violation....: 7.9644624229047167e-13 7.9644624229047167e-1
3
Complementarity.........: 2.6134527997884870e-09 2.6134527997884869e-0
6
Overall NLP error.......: 2.6134527997884870e-09 2.6134527997884869e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0890039e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0606063e+02 4.77e+03 5.23e+01 -1.0 4.53e+03 - 8.51e-05 1.04e-0
4h 1
3 8.5674884e+02 4.76e+03 5.23e+01 -1.0 4.77e+03 - 9.62e-06 2.18e-0
3f 1
4 3.8122229e+02 4.65e+03 5.23e+01 -1.0 4.76e+03 - 2.82e-03 2.23e-0
2h 1
5 1.6129511e+04 6.86e-02 7.70e+01 -1.0 4.65e+03 - 8.42e-02 1.00e+0
0h 1
6 8.6428592e+03 6.17e-02 3.53e+01 -1.0 2.77e+01 - 5.15e-01 9.25e-0
2f 1
7 7.1353040e+03 1.99e-02 1.35e+01 -1.0 1.52e+01 - 6.41e-01 7.60e-0
1f 1
8 7.2345503e+03 6.03e-03 1.10e+00 -1.0 2.38e+00 - 9.93e-01 5.00e-0
1f 2
9 7.4467494e+03 2.48e-04 6.11e-02 -1.0 3.13e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.8841153e+03 2.26e-03 8.91e-02 -2.5 2.93e+01 - 8.55e-01 8.27e-0
1f 1
11 6.7163515e+03 2.12e-03 4.49e-01 -2.5 4.53e+00 - 1.00e+00 7.51e-0
1f 1
12 6.6879049e+03 1.53e-04 4.78e-03 -2.5 1.12e+00 - 1.00e+00 1.00e+0
0h 1
13 6.6714076e+03 4.08e-05 1.58e-01 -3.8 2.68e+00 - 1.00e+00 7.53e-0
1h 1
14 6.6671225e+03 1.41e-07 3.55e-04 -3.8 6.62e-01 - 1.00e+00 1.00e+0
0f 1
15 6.6658964e+03 2.80e-08 9.30e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 6.6658841e+03 1.87e-12 1.34e-08 -5.7 2.14e-03 - 1.00e+00 1.00e+0
0f 1
17 6.6658693e+03 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 6.6658693129129061e+00 6.6658693129129060e+0
3
Dual infeasibility......: 4.4776950723097212e-09 4.4776950723097212e-0
6
Constraint violation....: 2.6307428457883475e-12 2.6307428457883475e-1
2
Complementarity.........: 3.6084999010221885e-09 3.6084999010221883e-0
6
Overall NLP error.......: 4.4776950723097212e-09 4.4776950723097212e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2298268e+02 3.24e+03 5.23e+01 -1.0 3.27e+03 - 1.51e-03 9.81e-0
3h 1
2 9.2003557e+02 3.24e+03 5.23e+01 -1.0 2.98e+03 - 7.92e-05 1.08e-0
4h 1
3 8.2924045e+02 3.23e+03 5.23e+01 -1.0 3.24e+03 - 1.50e-05 3.73e-0
3f 1
4 3.5764794e+02 3.16e+03 5.22e+01 -1.0 3.23e+03 - 5.83e-03 2.18e-0
2h 1
5 1.3704663e+04 7.54e-02 7.77e+01 -1.0 3.16e+03 - 8.28e-02 1.00e+0
0h 1
6 7.3446410e+03 6.78e-02 2.26e+01 -1.0 1.31e+01 - 6.82e-01 9.46e-0
2f 1
7 6.0810712e+03 2.03e-02 7.24e+00 -1.0 9.63e+00 - 7.16e-01 8.72e-0
1f 1
8 6.2085934e+03 1.09e-02 6.05e-01 -1.0 2.64e+00 - 9.96e-01 4.67e-0
1f 2
9 5.9253757e+03 1.11e-02 2.98e-01 -1.7 1.18e+01 - 1.00e+00 8.14e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8752347e+03 1.11e-03 1.28e-01 -1.7 1.00e+01 - 1.00e+00 9.65e-0
1h 1
11 5.7570006e+03 4.14e-04 1.11e-01 -2.5 1.70e+01 - 9.54e-01 8.70e-0
1h 1
12 5.7430581e+03 1.61e-05 3.35e-03 -2.5 2.14e+00 - 1.00e+00 1.00e+0
0f 1
13 5.7235010e+03 5.14e-06 3.47e-02 -3.8 2.68e+00 - 1.00e+00 9.15e-0
1f 1
14 5.7222072e+03 1.38e-08 1.87e-05 -3.8 2.27e-01 - 1.00e+00 1.00e+0
0f 1
15 5.7210129e+03 1.79e-08 5.07e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0f 1
16 5.7210000e+03 6.40e-13 4.11e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 5.7210000170272064e+00 5.7210000170272060e+0
3
Dual infeasibility......: 4.1054900581664937e-10 4.1054900581664937e-0
7
Constraint violation....: 6.3971050678901520e-13 6.3971050678901520e-1
3
Complementarity.........: 2.5983435457832804e-09 2.5983435457832802e-0
6
Overall NLP error.......: 2.5983435457832804e-09 2.5983435457832802e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8055761e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.81e-0
3f 1
2 8.7686982e+02 2.00e+03 5.24e+01 -1.0 1.46e+03 - 5.63e-05 1.36e-0
4h 1
3 2.9368501e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 5.20e-05 2.28e-0
2f 1
4 1.4297701e+04 6.09e-02 7.94e+01 -1.0 1.95e+03 - 5.25e-02 1.00e+0
0h 1
5 5.5715643e+03 5.67e-02 5.36e+01 -1.0 6.49e+01 - 3.13e-01 6.17e-0
2f 1
6 4.1854190e+03 3.04e-02 2.68e+01 -1.0 3.22e+01 - 4.92e-01 4.30e-0
1f 1
7 3.3694030e+03 1.34e-02 2.18e+00 -1.0 1.10e+01 - 9.20e-01 9.27e-0
1f 1
8 3.8356226e+03 4.21e-04 1.12e-01 -1.0 4.99e+00 - 1.00e+00 1.00e+0
0f 1
9 3.1530617e+03 1.17e-03 1.00e+00 -1.7 3.81e+01 - 4.53e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.1751525e+03 7.86e-06 1.08e-02 -1.7 5.11e-01 - 1.00e+00 1.00e+0
0h 1
11 3.0765245e+03 2.20e-05 6.64e-01 -3.8 4.04e+01 - 9.62e-01 6.85e-0
1f 1
12 3.0448391e+03 3.90e-04 1.55e-01 -3.8 1.24e+01 - 7.02e-01 1.00e+0
0f 1
13 3.0404009e+03 2.51e-03 5.37e-03 -3.8 6.45e-02 - 1.00e+00 1.00e+0
0h 1
14 3.0406397e+03 2.37e-05 9.54e-05 -3.8 7.39e-03 - 1.00e+00 1.00e+0
0h 1
15 3.0392708e+03 1.32e-04 1.15e-03 -5.7 2.97e-01 - 9.17e-01 1.00e+0
0h 1
16 3.0392294e+03 3.21e-05 6.98e-06 -5.7 8.35e-03 - 1.00e+00 1.00e+0
0h 1
17 3.0392340e+03 2.74e-07 3.61e-06 -5.7 7.55e-04 - 1.00e+00 1.00e+0
0h 1
18 3.0392190e+03 3.08e-08 3.55e-05 -8.6 3.68e-03 - 1.00e+00 9.56e-0
1h 1
19 3.0392184e+03 4.76e-12 5.55e-11 -8.6 1.64e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 3.0392183775058768e+00 3.0392183775058766e+0
3
Dual infeasibility......: 5.5480277590628745e-11 5.5480277590628745e-0
8
Constraint violation....: 4.7641890432714717e-12 4.7641890432714717e-1
2
Complementarity.........: 3.1228874930459205e-09 3.1228874930459202e-0
6
Overall NLP error.......: 3.1228874930459205e-09 3.1228874930459202e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6640671e+02 9.17e+02 5.24e+01 -1.0 9.26e+02 - 4.97e-04 9.81e-0
3f 1
2 8.6297755e+02 9.17e+02 5.24e+01 -1.0 7.33e+02 - 1.12e-04 1.24e-0
4h 1
3 2.6189684e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 4.78e-05 2.24e-0
2f 1
4 1.3061351e+04 5.91e-02 8.01e+01 -1.0 8.97e+02 - 4.92e-02 1.00e+0
0h 1
5 4.3096043e+03 5.53e-02 5.43e+01 -1.0 7.48e+01 - 3.12e-01 5.88e-0
2f 1
6 2.7191223e+03 3.01e-02 2.86e+01 -1.0 3.90e+01 - 4.68e-01 4.31e-0
1f 1
7 2.1360734e+03 1.50e-02 2.67e+00 -1.0 1.11e+01 - 9.18e-01 1.00e+0
0h 1
8 2.4962642e+03 4.73e-04 1.00e-01 -1.0 4.04e+00 - 9.99e-01 1.00e+0
0f 1
9 1.8963666e+03 8.08e-04 2.47e-01 -1.7 1.89e+01 - 1.00e+00 8.65e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8823922e+03 1.66e-04 4.18e-02 -1.7 2.16e+00 - 1.00e+00 1.00e+0
0f 1
11 1.7807502e+03 8.71e-05 1.98e-02 -2.5 1.79e+01 - 1.00e+00 9.84e-0
1f 1
12 1.7628166e+03 2.93e-03 7.91e-02 -3.8 2.67e+00 - 6.54e-01 9.83e-0
1h 1
13 1.7579283e+03 5.96e-03 1.22e-02 -3.8 6.62e-02 - 8.50e-01 1.00e+0
0h 1
14 1.7586244e+03 1.23e-04 7.52e-04 -3.8 2.03e-02 - 1.00e+00 1.00e+0
0h 1
15 1.7571777e+03 1.66e-04 9.73e-04 -5.7 1.49e-01 - 9.32e-01 1.00e+0
0h 1
16 1.7571781e+03 5.44e-05 6.54e-03 -5.7 1.35e-03 - 1.00e+00 6.72e-0
1h 1
17 1.7571881e+03 1.11e-08 2.91e-06 -5.7 1.39e-04 - 1.00e+00 1.00e+0
0f 1
18 1.7571731e+03 9.90e-09 2.10e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
19 1.7571729e+03 1.64e-12 7.84e-11 -8.6 3.19e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.7571729109755030e+00 1.7571729109755029e+0
3
Dual infeasibility......: 7.8351371135993549e-11 7.8351371135993555e-0
8
Constraint violation....: 1.6431300764452317e-12 1.6431300764452317e-1
2
Complementarity.........: 2.5101391226427180e-09 2.5101391226427177e-0
6
Overall NLP error.......: 2.5101391226427180e-09 2.5101391226427177e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.05e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.86e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235660167e+00 1.6104063235660167e+0
3
Dual infeasibility......: 2.4575258794729513e-12 2.4575258794729513e-0
9
Constraint violation....: 7.8624591366821517e-15 7.8624591366821517e-1
5
Complementarity.........: 2.5062163919681802e-09 2.5062163919681804e-0
6
Overall NLP error.......: 2.5062163919681802e-09 2.5062163919681804e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933486e-01 5.8277753147933481e+0
2
Dual infeasibility......: 2.1031318725023556e-09 2.1031318725023556e-0
6
Constraint violation....: 6.2994429117502193e-11 6.2994429117502193e-1
1
Complementarity.........: 2.8882108896910881e-09 2.8882108896910880e-0
6
Overall NLP error.......: 2.8882108896910881e-09 2.8882108896910880e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101510e-01 6.4890146112101513e+0
2
Dual infeasibility......: 4.9126605653162707e-09 4.9126605653162707e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984896560e-09 4.3646094984896562e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605653162707e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.05e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.86e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235660167e+00 1.6104063235660167e+0
3
Dual infeasibility......: 2.4575258794729513e-12 2.4575258794729513e-0
9
Constraint violation....: 7.8624591366821517e-15 7.8624591366821517e-1
5
Complementarity.........: 2.5062163919681802e-09 2.5062163919681804e-0
6
Overall NLP error.......: 2.5062163919681802e-09 2.5062163919681804e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2381241e+02 9.17e+02 5.24e+01 -1.0 9.25e+02 - 3.31e-04 9.82e-0
3f 1
2 8.1900461e+02 9.17e+02 5.24e+01 -1.0 5.26e+02 - 7.79e-05 1.73e-0
4h 1
3 2.4185000e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 1.07e-04 2.13e-0
2f 1
4 1.2680352e+04 5.47e-02 8.23e+01 -1.0 8.98e+02 - 3.78e-02 1.00e+0
0h 1
5 3.9103113e+03 5.23e-02 5.80e+01 -1.0 8.30e+01 - 2.93e-01 4.91e-0
2f 1
6 1.9134117e+03 3.74e-02 3.13e+01 -1.0 3.92e+01 - 4.65e-01 5.08e-0
1f 1
7 4.7122064e+03 1.23e-02 2.78e+01 -1.0 2.09e+01 - 3.97e-01 1.00e+0
0h 1
8 1.8777320e+03 1.23e-02 1.10e+00 -1.0 2.60e+01 - 9.87e-01 8.85e-0
1f 1
9 1.9889409e+03 2.13e-04 4.94e-02 -1.0 2.15e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7227527e+03 2.24e-04 1.23e+00 -2.5 1.82e+01 - 9.37e-01 5.95e-0
1f 1
11 1.5351696e+03 3.78e-03 1.32e-01 -2.5 7.57e+00 - 7.96e-01 1.00e+0
0f 1
12 1.5124876e+03 4.93e-03 3.07e-01 -2.5 1.80e+00 - 1.00e+00 7.69e-0
1h 1
13 1.5247300e+03 2.34e-04 4.66e-03 -2.5 7.24e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5021412e+03 1.70e-04 2.15e-02 -3.8 5.39e+00 - 9.90e-01 9.29e-0
1h 1
15 1.5015197e+03 7.29e-07 6.86e-05 -3.8 3.67e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003076e+03 3.77e-07 1.78e-04 -5.7 2.97e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003080e+03 3.79e-11 2.92e-09 -5.7 4.22e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932691983129e+00 1.5002932691983128e+0
3
Dual infeasibility......: 2.1737238067758316e-09 2.1737238067758316e-0
6
Constraint violation....: 6.2995886285222014e-11 6.2995886285222014e-1
1
Complementarity.........: 2.9881175999350707e-09 2.9881175999350708e-0
6
Overall NLP error.......: 2.9881175999350707e-09 2.9881175999350708e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
1 8.6619491e+02 9.17e+02 5.24e+01 -1.0 9.25e+02 - 4.97e-04 9.82e-0
3f 1
2 8.6134812e+02 9.17e+02 5.24e+01 -1.0 5.14e+02 - 7.56e-05 1.77e-0
4h 1
3 2.6192810e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 1.11e-04 2.24e-0
2f 1
4 1.3048678e+04 5.92e-02 8.01e+01 -1.0 8.97e+02 - 4.93e-02 1.00e+0
0h 1
5 4.3083518e+03 5.53e-02 5.43e+01 -1.0 7.47e+01 - 3.12e-01 5.89e-0
2f 1
4 1.658751e+04 1.597291e+04 1.825148e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.54e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6795539e+02 1.54e+04 5.25e+01 -1.0 1.55e+04 - 2.29e-04 9.80e-0
3f 1
2 7.6508073e+02 1.54e+04 5.25e+01 -1.0 1.48e+04 - 4.81e-05 1.03e-0
4h 1
3 7.6061051e+02 1.54e+04 5.25e+01 -1.0 1.53e+04 - 6.21e-06 3.44e-0
4f 1
4 7.5525226e+02 1.54e+04 5.25e+01 -1.0 1.54e+04 - 3.50e-04 4.27e-0
4h 1
5 5.2058108e+02 1.51e+04 5.27e+01 -1.0 1.54e+04 - 8.45e-04 2.00e-0
2f 1
6 2.6153648e+04 6.12e-02 8.48e+01 -1.0 1.51e+04 - 2.99e-02 1.00e+0
0h 1
7 1.7906543e+04 5.88e-02 6.63e+01 -1.0 7.70e+01 - 2.24e-01 4.34e-0
2f 1
8 1.6338930e+04 4.51e-02 3.26e+01 -1.0 2.87e+01 - 5.03e-01 4.35e-0
1f 1
9 1.6632345e+04 3.08e-02 1.29e+01 -1.0 1.61e+01 - 4.70e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6428968e+04 5.31e-03 1.87e-01 -1.0 3.78e+00 - 9.89e-01 1.00e+0
0h 1
11 1.6144129e+04 1.04e-03 2.44e-01 -1.7 4.59e+00 - 1.00e+00 8.80e-0
1f 1
12 1.6126785e+04 7.44e-04 1.02e-02 -1.7 2.21e+01 - 1.00e+00 1.00e+0
0f 1
13 1.6005031e+04 1.16e-03 3.58e-02 -3.8 2.95e+01 - 8.03e-01 8.57e-0
1f 1
14 1.5974129e+04 1.57e-03 4.09e-02 -3.8 1.99e+00 - 8.48e-01 7.95e-0
1h 1
15 1.5973822e+04 3.27e-06 8.07e-04 -3.8 3.95e-02 - 1.00e+00 1.00e+0
0h 1
16 1.5972934e+04 2.63e-07 7.32e-04 -5.7 1.49e-01 - 1.00e+00 9.87e-0
1h 1
17 1.5972927e+04 3.63e-11 6.53e-09 -5.7 1.76e-01 - 1.00e+00 1.00e+0
0f 1
18 1.5972914e+04 6.30e-11 2.07e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5972914315093632e+01 1.5972914315093632e+0
4
Dual infeasibility......: 2.0692878527419748e-09 2.0692878527419748e-0
6
Constraint violation....: 6.2996843852580753e-11 6.2996843852580753e-1
1
Complementarity.........: 2.8880968344009989e-09 2.8880968344009986e-0
6
Overall NLP error.......: 2.8880968344009989e-09 2.8880968344009986e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.47e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6678143e+02 1.47e+04 5.24e+01 -1.0 1.49e+04 - 4.98e-04 9.80e-0
3h 1
2 8.6396036e+02 1.47e+04 5.24e+01 -1.0 1.40e+04 - 4.45e-05 1.04e-0
4h 1
3 8.6007321e+02 1.47e+04 5.24e+01 -1.0 1.47e+04 - 6.88e-06 2.97e-0
4h 1
4 8.5535284e+02 1.47e+04 5.24e+01 -1.0 1.47e+04 - 3.02e-04 3.66e-0
4h 1
5 5.7838312e+02 1.44e+04 5.25e+01 -1.0 1.47e+04 - 7.18e-04 2.22e-0
2f 1
6 2.6428924e+04 6.01e-02 8.02e+01 -1.0 1.44e+04 - 5.12e-02 1.00e+0
0h 1
7 1.8078035e+04 5.61e-02 5.28e+01 -1.0 7.21e+01 - 3.30e-01 6.11e-0
2f 1
8 1.6494188e+04 3.02e-02 2.72e+01 -1.0 3.87e+01 - 4.78e-01 4.34e-0
1f 1
9 1.5943033e+04 1.44e-02 2.51e+00 -1.0 1.09e+01 - 9.19e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6274081e+04 4.05e-04 7.21e-02 -1.0 4.15e+00 - 9.88e-01 1.00e+0
0f 1
11 1.5695634e+04 6.68e-04 4.04e-01 -2.5 7.85e+00 - 8.84e-01 7.16e-0
1f 1
12 1.5619881e+04 2.37e-04 3.53e-01 -2.5 2.54e+00 - 8.86e-01 1.00e+0
0h 1
13 1.5611758e+04 7.65e-04 4.10e-01 -2.5 1.46e+00 - 1.00e+00 2.29e-0
1h 2
14 1.5591777e+04 8.36e-04 1.04e-02 -2.5 9.32e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5575533e+04 1.22e-03 3.32e-02 -3.8 2.85e+00 - 7.94e-01 1.00e+0
0h 1
16 1.5572442e+04 2.48e-03 9.61e-04 -3.8 8.32e-02 - 1.00e+00 1.00e+0
0h 1
17 1.5572768e+04 4.65e-05 1.19e-04 -3.8 1.47e-02 - 1.00e+00 1.00e+0
0h 1
18 1.5571459e+04 1.03e-04 3.62e-04 -5.7 1.49e-01 - 9.51e-01 9.77e-0
1h 1
19 1.5571447e+04 2.27e-05 3.61e-03 -5.7 3.13e-03 - 1.00e+00 7.80e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5571450e+04 8.86e-09 1.25e-06 -5.7 6.87e-04 - 1.00e+00 1.00e+0
0f 1
21 1.5571435e+04 9.09e-09 1.90e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
22 1.5571435e+04 1.35e-12 6.44e-11 -8.6 3.05e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.5571435244590710e+01 1.5571435244590710e+0
4
Dual infeasibility......: 6.4401837289005532e-11 6.4401837289005538e-0
8
Constraint violation....: 1.3549161792525410e-12 1.3549161792525410e-1
2
Complementarity.........: 2.5092509945614526e-09 2.5092509945614526e-0
6
Overall NLP error.......: 2.5092509945614526e-09 2.5092509945614526e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2433988e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.31e-04 9.80e-0
3h 1
2 8.2147242e+02 1.39e+04 5.24e+01 -1.0 1.32e+04 - 4.69e-05 1.04e-0
4h 1
3 8.2038546e+02 1.39e+04 5.24e+01 -1.0 1.37e+04 - 7.10e-06 7.53e-0
5h 1
4 8.1895447e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 8.05e-05 1.01e-0
4h 1
5 5.2020083e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 1.83e-04 2.13e-0
2f 1
6 2.5589506e+04 5.48e-02 8.23e+01 -1.0 1.36e+04 - 3.80e-02 1.00e+0
0h 1
7 1.6883823e+04 5.24e-02 5.75e+01 -1.0 8.24e+01 - 2.99e-01 4.94e-0
2f 1
8 1.4892333e+04 3.74e-02 3.10e+01 -1.0 3.92e+01 - 4.66e-01 5.07e-0
1f 1
9 1.5241113e+04 2.25e-02 1.47e+01 -1.0 2.08e+01 - 3.98e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4978158e+04 6.03e-03 4.21e-01 -1.0 5.04e+00 - 9.78e-01 1.00e+0
0h 1
11 1.4672573e+04 1.45e-03 4.11e-01 -1.7 5.56e+00 - 1.00e+00 8.24e-0
1f 1
12 1.4632981e+04 9.35e-04 1.42e-02 -1.7 1.98e+01 - 1.00e+00 1.00e+0
0f 1
13 1.4503178e+04 1.44e-03 9.75e-02 -3.8 2.20e+01 - 7.89e-01 9.29e-0
1f 1
14 1.4480340e+04 1.62e-03 8.58e-02 -3.8 1.70e+00 - 8.43e-01 7.51e-0
1h 1
15 1.4481003e+04 3.36e-06 8.56e-04 -3.8 1.21e-01 - 1.00e+00 1.00e+0
0h 1
16 1.4480071e+04 2.80e-07 6.79e-04 -5.7 1.48e-01 - 1.00e+00 9.87e-0
1h 1
17 1.4480065e+04 3.65e-11 6.72e-09 -5.7 2.86e-01 - 1.00e+00 1.00e+0
0f 1
18 1.4480052e+04 6.30e-11 2.17e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.4480051731558209e+01 1.4480051731558209e+0
4
Dual infeasibility......: 2.1734460967813283e-09 2.1734460967813283e-0
6
Constraint violation....: 6.2998758987298231e-11 6.2998758987298231e-1
1
Complementarity.........: 2.8881012929239409e-09 2.8881012929239410e-0
6
Overall NLP error.......: 2.8881012929239409e-09 2.8881012929239410e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.3447439e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.60e-04 9.80e-0
3h 1
2 8.3160098e+02 1.27e+04 5.24e+01 -1.0 1.20e+04 - 4.67e-05 1.04e-0
4h 1
3 8.3017381e+02 1.26e+04 5.24e+01 -1.0 1.25e+04 - 7.83e-06 9.17e-0
5h 1
4 8.2830315e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 9.76e-05 1.22e-0
4h 1
5 5.0143470e+02 1.24e+04 5.26e+01 -1.0 1.26e+04 - 2.23e-04 2.15e-0
2f 1
6 2.4398179e+04 5.58e-02 8.17e+01 -1.0 1.24e+04 - 4.10e-02 1.00e+0
0h 1
7 1.5717382e+04 5.27e-02 5.37e+01 -1.0 8.18e+01 - 3.38e-01 5.19e-0
2f 1
8 1.3648908e+04 3.45e-02 2.93e+01 -1.0 4.12e+01 - 4.62e-01 5.21e-0
1f 1
9 1.4006278e+04 2.18e-02 1.38e+01 -1.0 2.20e+01 - 3.92e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3780348e+04 5.37e-03 6.34e-01 -1.0 3.85e+00 - 9.65e-01 1.00e+0
0h 1
11 1.3450219e+04 1.50e-03 5.31e-01 -1.7 6.75e+00 - 1.00e+00 7.88e-0
1f 1
12 1.3387917e+04 1.07e-03 1.91e-02 -1.7 2.06e+01 - 1.00e+00 1.00e+0
0f 1
13 1.3258183e+04 1.48e-03 8.77e-02 -3.8 2.28e+01 - 7.82e-01 9.06e-0
1f 1
14 1.3233347e+04 1.84e-03 1.12e-01 -3.8 1.84e+00 - 8.40e-01 7.33e-0
1h 1
15 1.3233963e+04 4.07e-06 1.06e-03 -3.8 1.85e-01 - 1.00e+00 1.00e+0
0h 1
16 1.3233071e+04 2.29e-07 8.20e-04 -5.7 1.48e-01 - 1.00e+00 9.85e-0
1h 1
17 1.3233064e+04 3.11e-11 7.52e-09 -5.7 1.12e-01 - 1.00e+00 1.00e+0
0f 1
18 1.3233051e+04 6.30e-11 2.29e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.3233050885267639e+01 1.3233050885267639e+0
4
Dual infeasibility......: 2.2925723063147634e-09 2.2925723063147634e-0
6
Constraint violation....: 6.3002991712579615e-11 6.3002991712579615e-1
1
Complementarity.........: 2.8880871415797357e-09 2.8880871415797358e-0
6
Overall NLP error.......: 2.8880871415797357e-09 2.8880871415797358e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8868549e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 6.74e-04 9.80e-0
3h 1
2 8.8591720e+02 1.11e+04 5.24e+01 -1.0 1.09e+04 - 8.82e-05 1.01e-0
4h 1
3 8.7191468e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 3.98e-06 8.53e-0
4f 1
4 5.1245282e+02 1.09e+04 5.25e+01 -1.0 1.11e+04 - 9.38e-04 2.25e-0
2h 1
5 2.3065869e+04 6.30e-02 7.86e+01 -1.0 1.09e+04 - 6.29e-02 1.00e+0
0h 1
6 1.4736042e+04 5.81e-02 5.05e+01 -1.0 5.64e+01 - 3.42e-01 7.15e-0
2f 1
7 1.3434977e+04 2.95e-02 2.32e+01 -1.0 2.69e+01 - 5.30e-01 4.51e-0
1f 1
8 1.2792681e+04 9.07e-03 1.25e+00 -1.0 1.02e+01 - 9.26e-01 7.86e-0
1f 1
9 1.3092896e+04 2.81e-04 7.74e-02 -1.0 3.60e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2435511e+04 2.12e-03 8.36e-02 -2.5 5.17e+00 - 8.68e-01 8.73e-0
1f 1
11 1.2302010e+04 1.43e-03 2.26e-01 -2.5 9.28e-01 - 1.00e+00 7.04e-0
1f 1
12 1.2305458e+04 3.36e-06 8.02e-03 -2.5 1.25e-01 - 1.00e+00 1.00e+0
0h 1
13 1.2286939e+04 2.72e-06 1.35e-01 -3.8 2.68e+00 - 9.82e-01 8.64e-0
1f 1
14 1.2283573e+04 4.17e-04 1.04e-03 -3.8 3.63e-01 - 1.00e+00 1.00e+0
0f 1
15 1.2282718e+04 2.22e-05 1.33e-02 -5.7 1.49e-01 - 8.48e-01 1.00e+0
0h 1
16 1.2282604e+04 2.25e-05 4.75e-05 -5.7 7.84e-03 - 1.00e+00 1.00e+0
0h 1
17 1.2282610e+04 6.50e-08 2.51e-06 -5.7 3.76e-04 - 1.00e+00 1.00e+0
0h 1
18 1.2282596e+04 1.57e-08 3.81e-05 -8.6 1.84e-03 - 9.98e-01 9.60e-0
1h 1
19 1.2282596e+04 3.70e-12 4.33e-11 -8.6 7.38e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.2282595627307357e+01 1.2282595627307357e+0
4
Dual infeasibility......: 4.3340333344180787e-11 4.3340333344180787e-0
8
Constraint violation....: 3.7045921885692223e-12 3.7045921885692223e-1
2
Complementarity.........: 2.5100100434091698e-09 2.5100100434091697e-0
6
Overall NLP error.......: 2.5100100434091698e-09 2.5100100434091697e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891839e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0614875e+02 9.19e+03 5.23e+01 -1.0 8.94e+03 - 8.31e-05 1.02e-0
4h 1
3 8.8589053e+02 9.18e+03 5.23e+01 -1.0 9.18e+03 - 4.99e-06 1.11e-0
3f 1
4 4.8290407e+02 8.97e+03 5.24e+01 -1.0 9.18e+03 - 1.26e-03 2.28e-0
2h 1
5 2.1194856e+04 6.67e-02 7.66e+01 -1.0 8.97e+03 - 8.32e-02 1.00e+0
0h 1
6 1.3110859e+04 6.01e-02 3.76e+01 -1.0 2.89e+01 - 4.83e-01 9.02e-0
2f 1
7 1.1611939e+04 1.94e-02 1.53e+01 -1.0 1.53e+01 - 6.18e-01 7.42e-0
1f 1
8 1.1669715e+04 5.64e-03 1.25e+00 -1.0 2.10e+00 - 9.91e-01 5.00e-0
1f 2
9 1.1851856e+04 3.17e-04 6.99e-02 -1.0 2.45e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1303064e+04 2.21e-03 9.19e-02 -2.5 2.21e+01 - 8.56e-01 8.21e-0
1f 1
11 1.1134535e+04 2.12e-03 4.58e-01 -2.5 3.77e+00 - 1.00e+00 7.49e-0
1f 1
12 1.1105283e+04 1.58e-04 4.78e-03 -2.5 9.43e-01 - 1.00e+00 1.00e+0
0h 1
13 1.1088904e+04 4.25e-05 1.63e-01 -3.8 2.68e+00 - 1.00e+00 7.50e-0
1h 1
14 1.1084573e+04 1.45e-07 3.58e-04 -3.8 6.70e-01 - 1.00e+00 1.00e+0
0f 1
15 1.1083348e+04 2.78e-08 9.22e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 1.1083335e+04 1.87e-12 1.33e-08 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
17 1.1083321e+04 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.1083320712319775e+01 1.1083320712319775e+0
4
Dual infeasibility......: 4.4776953857983091e-09 4.4776953857983091e-0
6
Constraint violation....: 2.6305485567590381e-12 2.6305485567590381e-1
2
Complementarity.........: 3.6085004276189471e-09 3.6085004276189471e-0
6
Overall NLP error.......: 4.4776953857983091e-09 4.4776953857983091e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2300862e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.80e-0
3h 1
2 9.2018520e+02 6.71e+03 5.23e+01 -1.0 6.43e+03 - 7.59e-05 1.03e-0
4h 1
3 8.8417722e+02 6.69e+03 5.23e+01 -1.0 6.70e+03 - 7.25e-06 1.73e-0
3f 1
4 4.3415243e+02 6.54e+03 5.24e+01 -1.0 6.69e+03 - 2.08e-03 2.26e-0
2h 1
5 1.8486104e+04 7.08e-02 7.69e+01 -1.0 6.54e+03 - 8.04e-02 1.00e+0
0h 1
6 1.0916142e+04 6.40e-02 2.32e+01 -1.0 1.36e+01 - 6.65e-01 8.89e-0
2f 1
7 9.6154376e+03 1.98e-02 9.31e+00 -1.0 9.91e+00 - 6.64e-01 8.81e-0
1f 1
8 9.7199903e+03 1.05e-02 6.35e-01 -1.0 2.75e+00 - 9.95e-01 4.77e-0
1f 2
9 9.3967776e+03 9.36e-03 2.78e-01 -1.7 9.45e+00 - 1.00e+00 8.30e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.3672965e+03 2.18e-03 9.40e-01 -1.7 1.18e+01 - 1.00e+00 4.90e-0
1h 2
11 9.3624199e+03 2.10e-04 1.67e-02 -1.7 6.01e+00 - 1.00e+00 1.00e+0
0h 1
12 9.2069203e+03 4.79e-04 2.44e-02 -3.8 2.00e+01 - 8.46e-01 8.30e-0
1f 1
13 9.1886242e+03 1.49e-04 2.05e-01 -3.8 3.34e+00 - 9.89e-01 7.21e-0
1h 1
14 9.1840024e+03 3.89e-07 3.07e-04 -3.8 9.33e-01 - 1.00e+00 1.00e+0
0h 1
15 9.1828139e+03 1.95e-08 4.40e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
16 9.1828008e+03 7.97e-13 4.82e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 9.1828007512686032e+00 9.1828007512686036e+0
3
Dual infeasibility......: 4.8230711653534134e-10 4.8230711653534134e-0
7
Constraint violation....: 7.9655726459293419e-13 7.9655726459293419e-1
3
Complementarity.........: 2.6134527997823803e-09 2.6134527997823802e-0
6
Overall NLP error.......: 2.6134527997823803e-09 2.6134527997823802e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0890039e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0606063e+02 4.77e+03 5.23e+01 -1.0 4.53e+03 - 8.51e-05 1.04e-0
4h 1
3 8.5674884e+02 4.76e+03 5.23e+01 -1.0 4.77e+03 - 9.62e-06 2.18e-0
3f 1
4 3.8122229e+02 4.65e+03 5.23e+01 -1.0 4.76e+03 - 2.82e-03 2.23e-0
2h 1
5 1.6129511e+04 6.86e-02 7.70e+01 -1.0 4.65e+03 - 8.42e-02 1.00e+0
0h 1
6 8.6428592e+03 6.17e-02 3.53e+01 -1.0 2.77e+01 - 5.15e-01 9.25e-0
2f 1
7 7.1353040e+03 1.99e-02 1.35e+01 -1.0 1.52e+01 - 6.41e-01 7.60e-0
1f 1
8 7.2345503e+03 6.03e-03 1.10e+00 -1.0 2.38e+00 - 9.93e-01 5.00e-0
1f 2
9 7.4467494e+03 2.48e-04 6.11e-02 -1.0 3.13e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.8841153e+03 2.26e-03 8.91e-02 -2.5 2.93e+01 - 8.55e-01 8.27e-0
1f 1
11 6.7163515e+03 2.12e-03 4.49e-01 -2.5 4.53e+00 - 1.00e+00 7.51e-0
1f 1
12 6.6879049e+03 1.53e-04 4.78e-03 -2.5 1.12e+00 - 1.00e+00 1.00e+0
0h 1
13 6.6714076e+03 4.08e-05 1.58e-01 -3.8 2.68e+00 - 1.00e+00 7.53e-0
1h 1
14 6.6671225e+03 1.41e-07 3.55e-04 -3.8 6.62e-01 - 1.00e+00 1.00e+0
0f 1
15 6.6658964e+03 2.80e-08 9.30e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 6.6658841e+03 1.87e-12 1.34e-08 -5.7 2.14e-03 - 1.00e+00 1.00e+0
0f 1
17 6.6658693e+03 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 6.6658693136752634e+00 6.6658693136752636e+0
3
Dual infeasibility......: 4.4776950703581573e-09 4.4776950703581573e-0
6
Constraint violation....: 2.6307567235761553e-12 2.6307567235761553e-1
2
Complementarity.........: 3.6084999010178863e-09 3.6084999010178862e-0
6
Overall NLP error.......: 4.4776950703581573e-09 4.4776950703581573e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9478285e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3f 1
2 8.9187540e+02 3.24e+03 5.24e+01 -1.0 3.02e+03 - 9.14e-05 1.06e-0
4h 1
3 8.1655199e+02 3.23e+03 5.24e+01 -1.0 3.24e+03 - 1.38e-05 3.11e-0
3f 1
4 3.3910587e+02 3.16e+03 5.23e+01 -1.0 3.23e+03 - 4.64e-03 2.16e-0
2h 1
5 1.3760479e+04 6.81e-02 7.78e+01 -1.0 3.16e+03 - 8.37e-02 1.00e+0
0h 1
6 6.7546785e+03 6.11e-02 3.98e+01 -1.0 4.44e+01 - 4.66e-01 9.34e-0
2f 1
7 5.3864148e+03 2.95e-02 1.35e+01 -1.0 2.09e+01 - 6.49e-01 5.65e-0
1f 1
8 5.1381255e+03 3.48e-03 7.14e-01 -1.0 6.07e+00 - 9.54e-01 7.93e-0
1h 1
9 4.8058915e+03 9.07e-03 2.89e-01 -1.7 1.90e+00 - 1.00e+00 8.12e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.7469494e+03 1.26e-03 1.39e-01 -1.7 1.88e+01 - 1.00e+00 9.70e-0
1f 1
11 4.6212428e+03 4.91e-04 1.73e-01 -2.5 1.68e+01 - 9.48e-01 8.28e-0
1h 1
12 4.5986044e+03 6.65e-05 4.46e-03 -2.5 2.80e+00 - 1.00e+00 1.00e+0
0f 1
13 4.5763010e+03 1.58e-05 2.73e-02 -3.8 2.68e+00 - 1.00e+00 9.25e-0
1h 1
14 4.5756328e+03 4.87e-08 5.45e-04 -3.8 1.99e-01 - 1.00e+00 1.00e+0
0f 1
15 4.5743308e+03 4.26e-08 4.12e-04 -5.7 1.49e-01 - 1.00e+00 9.91e-0
1f 1
16 4.5743249e+03 1.95e-12 3.00e-08 -5.7 1.33e-03 - 1.00e+00 1.00e+0
0f 1
17 4.5743102e+03 2.58e-12 3.28e-06 -8.6 1.84e-03 - 1.00e+00 9.99e-0
1f 1
18 4.5743102e+03 1.64e-15 4.85e-14 -8.6 1.07e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 4.5743101819921304e+00 4.5743101819921303e+0
3
Dual infeasibility......: 4.8507457076806713e-14 4.8507457076806713e-1
1
Constraint violation....: 1.6360500999395364e-15 1.6360500999395364e-1
5
Complementarity.........: 2.5059125765115420e-09 2.5059125765115417e-0
6
Overall NLP error.......: 2.5059125765115420e-09 2.5059125765115417e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1583257e+02 2.00e+03 5.23e+01 -1.0 2.01e+03 - 1.20e-03 9.81e-0
3h 1
2 9.1195716e+02 2.00e+03 5.23e+01 -1.0 1.37e+03 - 4.87e-05 1.44e-0
4h 1
3 3.1303385e+02 1.95e+03 5.24e+01 -1.0 2.00e+03 - 6.04e-05 2.36e-0
2f 1
4 1.4608110e+04 6.65e-02 7.72e+01 -1.0 1.95e+03 - 6.92e-02 1.00e+0
0h 1
5 6.1485043e+03 6.09e-02 3.60e+01 -1.0 2.22e+01 - 5.08e-01 7.70e-0
2f 1
6 4.6744427e+03 1.15e-02 1.62e+01 -1.0 1.30e+01 - 6.04e-01 8.35e-0
1f 1
7 4.8737737e+03 2.78e-03 1.37e-01 -1.0 3.28e+00 - 9.92e-01 1.00e+0
0f 1
8 4.4144926e+03 1.77e-03 1.46e-01 -1.7 7.24e+00 - 1.00e+00 1.00e+0
0f 1
9 4.2301474e+03 2.01e-03 3.83e-01 -2.5 2.16e+00 - 1.00e+00 7.84e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2032539e+03 1.87e-04 1.95e-02 -2.5 4.49e-01 - 1.00e+00 9.81e-0
1f 1
11 4.1817214e+03 1.90e-06 1.87e-02 -3.8 5.38e+00 - 9.84e-01 1.00e+0
0h 1
12 4.1818471e+03 1.75e-09 4.85e-06 -3.8 6.74e-03 - 1.00e+00 1.00e+0
0h 1
13 4.1805081e+03 1.80e-08 1.81e-04 -5.7 2.97e-01 - 1.00e+00 9.96e-0
1f 1
14 4.1805057e+03 1.80e-12 2.29e-09 -5.7 1.19e-03 - 1.00e+00 1.00e+0
0f 1
15 4.1804891e+03 2.63e-12 1.52e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 4.1804891473415609e+00 4.1804891473415610e+0
3
Dual infeasibility......: 1.5189628577088146e-09 1.5189628577088146e-0
6
Constraint violation....: 2.6288415888586769e-12 2.6288415888586769e-1
2
Complementarity.........: 2.8635057180168234e-09 2.8635057180168233e-0
6
Overall NLP error.......: 2.8635057180168234e-09 2.8635057180168233e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0857741e+02 9.17e+02 5.23e+01 -1.0 9.25e+02 - 1.00e-03 9.82e-0
3f 1
2 9.0342468e+02 9.17e+02 5.23e+01 -1.0 4.76e+02 - 6.91e-05 1.91e-0
4h 1
3 2.8405630e+02 8.96e+02 5.24e+01 -1.0 9.17e+02 - 1.26e-04 2.34e-0
2f 1
4 1.3435408e+04 6.53e-02 7.62e+01 -1.0 8.96e+02 - 8.25e-02 1.00e+0
0h 1
5 4.8779878e+03 5.89e-02 3.93e+01 -1.0 2.99e+01 - 4.58e-01 8.86e-0
2f 1
6 3.3867814e+03 1.87e-02 1.66e+01 -1.0 1.55e+01 - 6.03e-01 7.29e-0
1f 1
7 3.4351076e+03 5.28e-03 2.31e-01 -1.0 2.14e+00 - 9.87e-01 1.00e+0
0h 1
8 3.0189916e+03 1.48e-03 1.25e-01 -1.7 4.66e+00 - 1.00e+00 1.00e+0
0f 1
9 2.8631443e+03 1.98e-03 4.33e-01 -2.5 8.66e-01 - 1.00e+00 7.79e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8367590e+03 1.69e-04 5.51e-03 -2.5 1.78e-01 - 1.00e+00 1.00e+0
0h 1
11 2.8190584e+03 4.67e-05 1.88e-01 -3.8 5.39e+00 - 1.00e+00 7.34e-0
1h 1
12 2.8137626e+03 1.65e-07 3.73e-04 -3.8 1.42e+00 - 1.00e+00 1.00e+0
0f 1
13 2.8123946e+03 2.70e-08 9.22e-04 -5.7 2.97e-01 - 1.00e+00 9.86e-0
1h 1
14 2.8123803e+03 1.86e-12 1.31e-08 -5.7 4.20e-03 - 1.00e+00 1.00e+0
0f 1
15 2.8123637e+03 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 2.8123637064063445e+00 2.8123637064063446e+0
3
Dual infeasibility......: 4.4777012781868183e-09 4.4777012781868183e-0
6
Constraint violation....: 2.6305832512285576e-12 2.6305832512285576e-1
2
Complementarity.........: 3.6085027348701297e-09 3.6085027348701296e-0
6
Overall NLP error.......: 4.4777012781868183e-09 4.4777012781868183e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254210190e-01 6.4890146254210185e+0
2
Dual infeasibility......: 4.9126604770980010e-09 4.9126604770980010e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646095252485824e-09 4.3646095252485824e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126604770980010e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933520e-01 5.8277753147933515e+0
2
Dual infeasibility......: 2.1031320944656453e-09 2.1031320944656453e-0
6
Constraint violation....: 6.2994234828472884e-11 6.2994234828472884e-1
1
Complementarity.........: 2.8882108896915596e-09 2.8882108896915594e-0
6
Overall NLP error.......: 2.8882108896915596e-09 2.8882108896915594e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254210190e-01 6.4890146254210185e+0
2
Dual infeasibility......: 4.9126604770980010e-09 4.9126604770980010e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646095252485824e-09 4.3646095252485824e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126604770980010e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.02e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 6.36e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643348e+00 1.6104063281643348e+0
3
Dual infeasibility......: 2.4576378536171077e-12 2.4576378536171077e-0
9
Constraint violation....: 6.3603173025546602e-15 6.3603173025546602e-1
5
Complementarity.........: 2.5062163910047551e-09 2.5062163910047549e-0
6
Overall NLP error.......: 2.5062163910047551e-09 2.5062163910047549e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2381241e+02 9.17e+02 5.24e+01 -1.0 9.25e+02 - 3.31e-04 9.82e-0
3f 1
2 8.1900461e+02 9.17e+02 5.24e+01 -1.0 5.26e+02 - 7.79e-05 1.73e-0
4h 1
3 2.4185000e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 1.07e-04 2.13e-0
2f 1
4 1.2680352e+04 5.47e-02 8.23e+01 -1.0 8.98e+02 - 3.78e-02 1.00e+0
0h 1
5 3.9103113e+03 5.23e-02 5.80e+01 -1.0 8.30e+01 - 2.93e-01 4.91e-0
2f 1
6 1.9134117e+03 3.74e-02 3.13e+01 -1.0 3.92e+01 - 4.65e-01 5.08e-0
1f 1
7 4.7122064e+03 1.23e-02 2.78e+01 -1.0 2.09e+01 - 3.97e-01 1.00e+0
0h 1
8 1.8777320e+03 1.23e-02 1.10e+00 -1.0 2.60e+01 - 9.87e-01 8.85e-0
1f 1
9 1.9889409e+03 2.13e-04 4.94e-02 -1.0 2.15e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7227527e+03 2.24e-04 1.23e+00 -2.5 1.82e+01 - 9.37e-01 5.95e-0
1f 1
11 1.5351696e+03 3.78e-03 1.32e-01 -2.5 7.57e+00 - 7.96e-01 1.00e+0
0f 1
12 1.5124876e+03 4.93e-03 3.07e-01 -2.5 1.80e+00 - 1.00e+00 7.69e-0
1h 1
13 1.5247300e+03 2.34e-04 4.66e-03 -2.5 7.24e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5021412e+03 1.70e-04 2.15e-02 -3.8 5.39e+00 - 9.90e-01 9.29e-0
1h 1
15 1.5015197e+03 7.29e-07 6.86e-05 -3.8 3.67e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003076e+03 3.77e-07 1.78e-04 -5.7 2.97e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003080e+03 3.79e-11 2.92e-09 -5.7 4.22e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932701718228e+00 1.5002932701718228e+0
3
Dual infeasibility......: 2.1737235847989893e-09 2.1737235847989893e-0
6
Constraint violation....: 6.2995580973890242e-11 6.2995580973890242e-1
1
Complementarity.........: 2.8882174529892601e-09 2.8882174529892599e-0
6
Overall NLP error.......: 2.8882174529892601e-09 2.8882174529892599e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
1 8.6619491e+02 9.17e+02 5.24e+01 -1.0 9.25e+02 - 4.97e-04 9.82e-0
3f 1
2 8.6134812e+02 9.17e+02 5.24e+01 -1.0 5.14e+02 - 7.56e-05 1.77e-0
4h 1
3 2.6192810e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 1.11e-04 2.24e-0
2f 1
4 1.3048678e+04 5.92e-02 8.01e+01 -1.0 8.97e+02 - 4.93e-02 1.00e+0
0h 1
5 4.3083518e+03 5.53e-02 5.43e+01 -1.0 7.47e+01 - 3.12e-01 5.89e-0
2f 1
5 1.607503e+04 1.621968e+04 1.880387e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.56e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6796546e+02 1.56e+04 5.25e+01 -1.0 1.58e+04 - 2.29e-04 9.80e-0
3f 1
2 7.6512853e+02 1.56e+04 5.25e+01 -1.0 1.54e+04 - 9.58e-05 1.00e-0
4h 1
3 7.5814774e+02 1.56e+04 5.25e+01 -1.0 1.56e+04 - 2.70e-06 5.51e-0
4f 1
4 5.1911335e+02 1.53e+04 5.27e+01 -1.0 1.56e+04 - 5.86e-04 1.98e-0
2h 1
5 2.6698232e+04 6.08e-02 8.48e+01 -1.0 1.53e+04 - 2.94e-02 1.00e+0
0h 1
6 1.8168707e+04 5.84e-02 6.76e+01 -1.0 7.97e+01 - 2.08e-01 4.27e-0
2f 1
7 1.6586427e+04 4.49e-02 3.35e+01 -1.0 2.87e+01 - 5.00e-01 4.36e-0
1f 1
8 1.6882709e+04 3.06e-02 1.35e+01 -1.0 1.62e+01 - 4.67e-01 1.25e-0
1f 4
9 1.6675085e+04 5.30e-03 1.49e-01 -1.0 3.73e+00 - 9.92e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6392263e+04 1.03e-03 2.43e-01 -1.7 4.79e+00 - 1.00e+00 8.81e-0
1f 1
11 1.6368202e+04 7.56e-04 9.97e-03 -1.7 1.55e+01 - 1.00e+00 1.00e+0
0f 1
12 1.6244647e+04 1.30e-03 8.63e-02 -3.8 1.99e+01 - 8.03e-01 9.33e-0
1f 1
13 1.6220420e+04 1.43e-03 6.28e-02 -3.8 1.69e+00 - 8.52e-01 7.76e-0
1h 1
14 1.6220645e+04 2.56e-06 7.16e-04 -3.8 2.95e-01 - 1.00e+00 1.00e+0
0h 1
15 1.6219695e+04 3.24e-07 5.84e-04 -5.7 1.49e-01 - 1.00e+00 9.89e-0
1h 1
16 1.6219689e+04 3.99e-11 6.02e-09 -5.7 1.29e-01 - 1.00e+00 1.00e+0
0f 1
17 1.6219676e+04 6.30e-11 2.07e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.6219675984158730e+01 1.6219675984158730e+0
4
Dual infeasibility......: 2.0693044325542965e-09 2.0693044325542965e-0
6
Constraint violation....: 6.2995608729465857e-11 6.2995608729465857e-1
1
Complementarity.........: 2.8881113522392795e-09 2.8881113522392796e-0
6
Overall NLP error.......: 2.8881113522392795e-09 2.8881113522392796e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6811102e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.29e-04 9.80e-0
3f 1
2 7.6527236e+02 1.50e+04 5.25e+01 -1.0 1.48e+04 - 9.59e-05 1.00e-0
4h 1
3 7.5760393e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 2.82e-06 5.75e-0
4f 1
4 5.0604791e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 6.13e-04 1.98e-0
2h 1
5 2.6023948e+04 6.08e-02 8.48e+01 -1.0 1.47e+04 - 2.95e-02 1.00e+0
0h 1
6 1.7508549e+04 5.84e-02 6.75e+01 -1.0 7.96e+01 - 2.09e-01 4.27e-0
2f 1
7 1.5926087e+04 4.49e-02 3.35e+01 -1.0 2.87e+01 - 5.00e-01 4.36e-0
1f 1
8 1.6222352e+04 3.06e-02 1.35e+01 -1.0 1.62e+01 - 4.67e-01 1.25e-0
1f 4
9 1.6014622e+04 5.30e-03 1.49e-01 -1.0 3.74e+00 - 9.92e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5731798e+04 1.04e-03 2.43e-01 -1.7 4.80e+00 - 1.00e+00 8.81e-0
1f 1
11 1.5707740e+04 7.55e-04 9.99e-03 -1.7 1.55e+01 - 1.00e+00 1.00e+0
0f 1
12 1.5584174e+04 1.30e-03 8.63e-02 -3.8 1.99e+01 - 8.03e-01 9.33e-0
1f 1
13 1.5559945e+04 1.43e-03 6.28e-02 -3.8 1.69e+00 - 8.52e-01 7.76e-0
1h 1
14 1.5560171e+04 2.56e-06 7.17e-04 -3.8 2.95e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5559221e+04 3.24e-07 5.84e-04 -5.7 1.49e-01 - 1.00e+00 9.89e-0
1h 1
16 1.5559215e+04 3.99e-11 6.02e-09 -5.7 1.29e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5559202e+04 6.30e-11 2.07e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5559202102850129e+01 1.5559202102850129e+0
4
Dual infeasibility......: 2.0693819616379303e-09 2.0693819616379303e-0
6
Constraint violation....: 6.2994734428833965e-11 6.2994734428833965e-1
1
Complementarity.........: 2.8881113424035553e-09 2.8881113424035551e-0
6
Overall NLP error.......: 2.8881113424035553e-09 2.8881113424035551e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.3159103e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.51e-04 9.80e-0
3h 1
2 8.2872890e+02 1.39e+04 5.24e+01 -1.0 1.32e+04 - 4.66e-05 1.04e-0
4h 1
3 8.2679276e+02 1.39e+04 5.24e+01 -1.0 1.38e+04 - 7.09e-06 1.35e-0
4h 1
4 8.2443652e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 1.41e-04 1.67e-0
4h 1
5 5.2732344e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 3.16e-04 2.14e-0
2f 1
6 2.5550394e+04 5.56e-02 8.19e+01 -1.0 1.36e+04 - 4.03e-02 1.00e+0
0h 1
7 1.6934506e+04 5.27e-02 5.43e+01 -1.0 8.14e+01 - 3.33e-01 5.14e-0
2f 1
8 1.4893980e+04 3.53e-02 2.94e+01 -1.0 4.07e+01 - 4.64e-01 5.16e-0
1f 1
9 1.5247682e+04 2.21e-02 1.38e+01 -1.0 2.15e+01 - 3.94e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5009593e+04 5.62e-03 5.50e-01 -1.0 4.10e+00 - 9.70e-01 1.00e+0
0h 1
11 1.4687934e+04 1.49e-03 4.87e-01 -1.7 6.32e+00 - 1.00e+00 8.01e-0
1f 1
12 1.4635049e+04 1.02e-03 1.72e-02 -1.7 2.11e+01 - 1.00e+00 1.00e+0
0f 1
13 1.4503203e+04 1.48e-03 9.49e-02 -3.8 2.40e+01 - 7.84e-01 9.19e-0
1f 1
14 1.4480134e+04 1.74e-03 1.03e-01 -3.8 1.76e+00 - 8.41e-01 7.38e-0
1h 1
15 1.4480986e+04 3.79e-06 9.68e-04 -3.8 3.08e-02 - 1.00e+00 1.00e+0
0h 1
16 1.4480071e+04 2.42e-07 7.49e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
17 1.4480065e+04 3.35e-11 7.15e-09 -5.7 1.70e-01 - 1.00e+00 1.00e+0
0f 1
18 1.4480052e+04 6.30e-11 2.24e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.4480051731504126e+01 1.4480051731504125e+0
4
Dual infeasibility......: 2.2425540061627461e-09 2.2425540061627461e-0
6
Constraint violation....: 6.3001187600164599e-11 6.3001187600164599e-1
1
Complementarity.........: 2.8880938479008308e-09 2.8880938479008307e-0
6
Overall NLP error.......: 2.8880938479008308e-09 2.8880938479008307e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.7318029e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.39e-04 9.80e-0
3h 1
2 8.7034365e+02 1.27e+04 5.24e+01 -1.0 1.20e+04 - 4.42e-05 1.05e-0
4h 1
3 8.6815855e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 8.11e-06 1.44e-0
4h 1
4 8.6542031e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 1.50e-04 1.83e-0
4h 1
5 5.3292436e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 3.44e-04 2.25e-0
2f 1
6 2.4664353e+04 6.04e-02 7.97e+01 -1.0 1.24e+04 - 5.23e-02 1.00e+0
0h 1
7 1.6097984e+04 5.63e-02 5.35e+01 -1.0 7.00e+01 - 3.18e-01 6.18e-0
2f 1
8 1.4632766e+04 3.10e-02 2.72e+01 -1.0 3.62e+01 - 4.82e-01 4.19e-0
1f 1
9 1.4255889e+04 1.48e-02 2.67e+00 -1.0 1.11e+01 - 9.18e-01 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4102249e+04 7.76e-03 1.72e+00 -1.0 7.04e+00 - 9.95e-01 4.68e-0
1f 2
11 1.4237824e+04 5.50e-04 5.95e-02 -1.0 1.21e+02 - 1.00e+00 1.00e+0
0f 1
12 1.3711972e+04 6.12e-04 7.02e-01 -2.5 1.31e+02 - 9.03e-01 6.44e-0
1f 1
13 1.3620363e+04 6.97e-05 1.41e-01 -2.5 3.63e+01 - 9.66e-01 1.00e+0
0f 1
14 1.3600981e+04 1.85e-03 8.46e-03 -2.5 2.50e+00 - 1.00e+00 1.00e+0
0f 1
15 1.3587312e+04 4.45e-04 3.30e-02 -3.8 2.81e+00 - 8.52e-01 1.00e+0
0h 1
16 1.3584738e+04 1.63e-03 8.83e-04 -3.8 4.23e-02 - 1.00e+00 1.00e+0
0h 1
17 1.3584933e+04 4.94e-05 5.12e-05 -3.8 1.17e-02 - 1.00e+00 1.00e+0
0h 1
18 1.3583664e+04 1.21e-04 5.63e-04 -5.7 1.49e-01 - 9.39e-01 1.00e+0
0h 1
19 1.3583636e+04 1.33e-05 7.21e-05 -5.7 5.03e-03 - 1.00e+00 9.81e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.3583643e+04 3.71e-08 4.59e-06 -5.7 2.79e-04 - 1.00e+00 1.00e+0
0f 1
21 1.3583627e+04 3.21e-08 3.31e-05 -8.6 1.84e-03 - 1.00e+00 9.71e-0
1h 1
22 1.3583627e+04 2.60e-12 3.52e-10 -8.6 5.36e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.3583626748398085e+01 1.3583626748398085e+0
4
Dual infeasibility......: 3.5200462504911121e-10 3.5200462504911121e-0
7
Constraint violation....: 2.6036950373509171e-12 2.6036950373509171e-1
2
Complementarity.........: 2.5390002113814180e-09 2.5390002113814179e-0
6
Overall NLP error.......: 2.5390002113814180e-09 2.5390002113814179e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9481942e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 7.48e-04 9.80e-0
3h 1
2 8.9197823e+02 1.11e+04 5.24e+01 -1.0 1.04e+04 - 4.18e-05 1.06e-0
4h 1
3 8.3527076e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 9.63e-06 3.46e-0
3h 1
4 5.3623938e+02 1.08e+04 5.23e+01 -1.0 1.11e+04 - 3.85e-03 2.15e-0
2h 1
5 2.1933099e+04 6.71e-02 7.79e+01 -1.0 1.08e+04 - 8.01e-02 1.00e+0
0h 1
6 1.4673675e+04 6.05e-02 4.23e+01 -1.0 4.53e+01 - 4.37e-01 8.94e-0
2f 1
7 1.3327687e+04 2.86e-02 1.56e+01 -1.0 2.13e+01 - 6.21e-01 5.45e-0
1f 1
8 1.3017486e+04 4.21e-03 8.87e-01 -1.0 6.85e+00 - 9.49e-01 7.63e-0
1f 1
9 1.3264412e+04 1.26e-04 5.69e-02 -1.0 6.42e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2672550e+04 2.20e-03 8.22e-02 -2.5 3.95e+00 - 8.61e-01 8.47e-0
1f 1
11 1.2504071e+04 2.15e-03 3.45e-01 -2.5 8.59e-01 - 1.00e+00 7.80e-0
1f 1
12 1.2479357e+04 1.51e-04 4.63e-03 -2.5 1.73e-01 - 1.00e+00 1.00e+0
0h 1
13 1.2456714e+04 2.21e-05 3.94e-02 -3.8 5.36e+00 - 1.00e+00 8.88e-0
1h 1
14 1.2455033e+04 5.68e-08 6.01e-04 -3.8 5.99e-01 - 1.00e+00 1.00e+0
0f 1
15 1.2453577e+04 4.28e-08 3.91e-05 -5.7 2.97e-01 - 1.00e+00 9.98e-0
1f 1
16 1.2453579e+04 1.88e-12 1.19e-08 -5.7 4.73e-04 - 1.00e+00 1.00e+0
0f 1
17 1.2453562e+04 2.57e-12 3.30e-06 -8.6 3.68e-03 - 1.00e+00 9.99e-0
1f 1
18 1.2453562e+04 5.45e-15 4.85e-14 -8.6 2.11e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.2453562271777464e+01 1.2453562271777464e+0
4
Dual infeasibility......: 4.8491912190019540e-14 4.8491912190019540e-1
1
Constraint violation....: 5.4544961262404038e-15 5.4544961262404038e-1
5
Complementarity.........: 2.5905204409223599e-09 2.5905204409223601e-0
6
Overall NLP error.......: 2.5905204409223599e-09 2.5905204409223601e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8777320e+02 9.19e+03 5.24e+01 -1.0 9.28e+03 - 6.64e-04 9.80e-0
3h 1
2 8.8499164e+02 9.19e+03 5.24e+01 -1.0 8.96e+03 - 8.88e-05 1.02e-0
4h 1
3 8.6604553e+02 9.18e+03 5.24e+01 -1.0 9.18e+03 - 4.81e-06 1.03e-0
3f 1
4 4.6753384e+02 8.97e+03 5.24e+01 -1.0 9.18e+03 - 1.16e-03 2.24e-0
2h 1
5 2.1019834e+04 6.31e-02 7.87e+01 -1.0 8.97e+03 - 6.27e-02 1.00e+0
0h 1
6 1.2779542e+04 5.82e-02 5.04e+01 -1.0 5.68e+01 - 3.45e-01 7.15e-0
2f 1
7 1.1474093e+04 2.98e-02 2.31e+01 -1.0 2.74e+01 - 5.30e-01 4.48e-0
1f 1
8 1.0826912e+04 8.86e-03 1.29e+00 -1.0 1.03e+01 - 9.25e-01 7.95e-0
1f 1
9 1.1132672e+04 2.56e-04 7.50e-02 -1.0 3.69e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.0462579e+04 2.14e-03 9.04e-02 -2.5 5.27e+00 - 8.69e-01 8.83e-0
1f 1
11 1.0356962e+04 1.11e-03 4.48e-01 -2.5 8.53e-01 - 1.00e+00 6.12e-0
1f 1
12 1.0357041e+04 2.64e-06 8.39e-03 -2.5 1.73e-01 - 1.00e+00 1.00e+0
0h 1
13 1.0339021e+04 7.22e-06 6.55e-03 -3.8 2.68e+00 - 9.00e-01 8.93e-0
1f 1
14 1.0335760e+04 4.68e-04 3.83e-04 -3.8 2.86e-01 - 1.00e+00 1.00e+0
0f 1
15 1.0334765e+04 6.30e-05 1.15e-02 -5.7 1.49e-01 - 8.13e-01 1.00e+0
0h 1
16 1.0334649e+04 3.63e-05 4.09e-05 -5.7 9.71e-03 - 1.00e+00 1.00e+0
0h 1
17 1.0334650e+04 1.61e-06 3.43e-05 -5.7 1.54e-03 - 1.00e+00 9.90e-0
1h 1
18 1.0334653e+04 3.53e-08 5.13e-07 -5.7 2.92e-04 - 1.00e+00 1.00e+0
0f 1
19 1.0334638e+04 3.96e-08 7.26e-06 -8.6 1.84e-03 - 9.97e-01 9.81e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.0334638e+04 5.32e-13 2.97e-11 -8.6 3.54e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.0334637928678045e+01 1.0334637928678045e+0
4
Dual infeasibility......: 2.9731375774012011e-11 2.9731375774012011e-0
8
Constraint violation....: 5.3168580649298747e-13 5.3168580649298747e-1
3
Complementarity.........: 2.5100786379957366e-09 2.5100786379957366e-0
6
Overall NLP error.......: 2.5100786379957366e-09 2.5100786379957366e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891119e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0611351e+02 6.71e+03 5.23e+01 -1.0 6.46e+03 - 8.39e-05 1.03e-0
4h 1
3 8.7440044e+02 6.70e+03 5.23e+01 -1.0 6.70e+03 - 6.84e-06 1.53e-0
3f 1
4 4.2534165e+02 6.54e+03 5.24e+01 -1.0 6.70e+03 - 1.83e-03 2.26e-0
2h 1
5 1.8469067e+04 6.74e-02 7.67e+01 -1.0 6.54e+03 - 8.35e-02 1.00e+0
0h 1
6 1.0609292e+04 6.07e-02 3.68e+01 -1.0 2.85e+01 - 4.94e-01 9.10e-0
2f 1
7 9.1070968e+03 1.97e-02 1.46e+01 -1.0 1.53e+01 - 6.26e-01 7.49e-0
1f 1
8 9.1804481e+03 5.62e-03 1.19e+00 -1.0 2.08e+00 - 9.93e-01 5.00e-0
1f 2
9 9.3751841e+03 2.91e-04 6.67e-02 -1.0 2.88e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.8198146e+03 2.22e-03 9.09e-02 -2.5 2.66e+01 - 8.56e-01 8.23e-0
1f 1
11 8.6513288e+03 2.12e-03 4.55e-01 -2.5 4.37e+00 - 1.00e+00 7.50e-0
1f 1
12 8.6223061e+03 1.56e-04 4.78e-03 -2.5 1.09e+00 - 1.00e+00 1.00e+0
0h 1
13 8.6058823e+03 4.18e-05 1.61e-01 -3.8 2.68e+00 - 1.00e+00 7.51e-0
1h 1
14 8.6015687e+03 1.44e-07 3.57e-04 -3.8 6.67e-01 - 1.00e+00 1.00e+0
0f 1
15 8.6003429e+03 2.79e-08 9.26e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 8.6003306e+03 1.87e-12 1.33e-08 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
17 8.6003159e+03 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 8.6003158972769373e+00 8.6003158972769379e+0
3
Dual infeasibility......: 4.4776954084276413e-09 4.4776954084276413e-0
6
Constraint violation....: 2.6308052958334827e-12 2.6308052958334827e-1
2
Complementarity.........: 3.6085002362403929e-09 3.6085002362403929e-0
6
Overall NLP error.......: 4.4776954084276413e-09 4.4776954084276413e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0890039e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0606063e+02 4.77e+03 5.23e+01 -1.0 4.53e+03 - 8.51e-05 1.04e-0
4h 1
3 8.5674884e+02 4.76e+03 5.23e+01 -1.0 4.77e+03 - 9.62e-06 2.18e-0
3f 1
4 3.8122229e+02 4.65e+03 5.23e+01 -1.0 4.76e+03 - 2.82e-03 2.23e-0
2h 1
5 1.6129511e+04 6.86e-02 7.70e+01 -1.0 4.65e+03 - 8.42e-02 1.00e+0
0h 1
6 8.6428592e+03 6.17e-02 3.53e+01 -1.0 2.77e+01 - 5.15e-01 9.25e-0
2f 1
7 7.1353040e+03 1.99e-02 1.35e+01 -1.0 1.52e+01 - 6.41e-01 7.60e-0
1f 1
8 7.2345503e+03 6.03e-03 1.10e+00 -1.0 2.38e+00 - 9.93e-01 5.00e-0
1f 2
9 7.4467494e+03 2.48e-04 6.11e-02 -1.0 3.13e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.8841153e+03 2.26e-03 8.91e-02 -2.5 2.93e+01 - 8.55e-01 8.27e-0
1f 1
11 6.7163515e+03 2.12e-03 4.49e-01 -2.5 4.53e+00 - 1.00e+00 7.51e-0
1f 1
12 6.6879049e+03 1.53e-04 4.78e-03 -2.5 1.12e+00 - 1.00e+00 1.00e+0
0h 1
13 6.6714076e+03 4.08e-05 1.58e-01 -3.8 2.68e+00 - 1.00e+00 7.53e-0
1h 1
14 6.6671225e+03 1.41e-07 3.55e-04 -3.8 6.62e-01 - 1.00e+00 1.00e+0
0f 1
15 6.6658964e+03 2.80e-08 9.30e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 6.6658841e+03 1.87e-12 1.34e-08 -5.7 2.14e-03 - 1.00e+00 1.00e+0
0f 1
17 6.6658693e+03 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 6.6658693160553293e+00 6.6658693160553294e+0
3
Dual infeasibility......: 4.4776951306469979e-09 4.4776951306469979e-0
6
Constraint violation....: 2.6305624345468459e-12 2.6305624345468459e-1
2
Complementarity.........: 3.6084999013914560e-09 3.6084999013914561e-0
6
Overall NLP error.......: 4.4776951306469979e-09 4.4776951306469979e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2294726e+02 3.24e+03 5.23e+01 -1.0 3.27e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1945201e+02 3.24e+03 5.23e+01 -1.0 2.47e+03 - 3.93e-05 1.30e-0
4h 1
3 3.4573144e+02 3.17e+03 5.24e+01 -1.0 3.24e+03 - 4.04e-05 2.36e-0
2f 1
4 1.5906615e+04 6.81e-02 7.93e+01 -1.0 3.17e+03 - 4.21e-02 1.00e+0
0h 1
5 7.5933644e+03 6.41e-02 5.66e+01 -1.0 2.00e+01 - 2.81e-01 5.33e-0
2f 1
6 6.3092956e+03 1.54e-02 2.51e+01 -1.0 1.01e+01 - 5.90e-01 8.06e-0
1f 1
7 6.3346293e+03 6.22e-03 2.30e-01 -1.0 1.94e+00 - 9.91e-01 1.00e+0
0f 1
8 5.9359407e+03 1.57e-03 8.95e-02 -1.7 4.62e+00 - 1.00e+00 9.66e-0
1f 1
9 5.7772838e+03 1.82e-03 5.17e-01 -2.5 1.14e+00 - 1.00e+00 7.50e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.7447658e+03 3.25e-04 1.02e-01 -2.5 2.94e-01 - 1.00e+00 8.96e-0
1h 1
11 5.7477659e+03 1.16e-05 4.01e-03 -2.5 2.85e-02 - 1.00e+00 1.00e+0
0f 1
12 5.7228582e+03 1.05e-05 8.02e-03 -3.8 5.36e+00 - 1.00e+00 9.61e-0
1f 1
13 5.7223579e+03 1.57e-08 1.36e-05 -3.8 2.04e-01 - 1.00e+00 1.00e+0
0f 1
14 5.7210148e+03 1.79e-08 5.06e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0f 1
15 5.7210000e+03 6.40e-13 4.11e-10 -8.6 3.67e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.7210000203084217e+00 5.7210000203084219e+0
3
Dual infeasibility......: 4.1141742656350931e-10 4.1141742656350931e-0
7
Constraint violation....: 6.4032112945255903e-13 6.4032112945255903e-1
3
Complementarity.........: 2.5985704258832736e-09 2.5985704258832734e-0
6
Overall NLP error.......: 2.5985704258832736e-09 2.5985704258832734e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1589983e+02 2.00e+03 5.23e+01 -1.0 2.02e+03 - 1.20e-03 9.81e-0
3h 1
2 9.1284040e+02 2.00e+03 5.23e+01 -1.0 1.76e+03 - 8.79e-05 1.12e-0
4h 1
3 7.5553664e+02 1.98e+03 5.23e+01 -1.0 2.00e+03 - 2.36e-05 6.19e-0
3f 1
4 3.3207786e+02 1.94e+03 5.17e+01 -1.0 1.98e+03 - 1.43e-02 2.11e-0
2f 1
5 1.0382778e+04 8.33e-02 7.88e+01 -1.0 1.94e+03 - 9.31e-02 1.00e+0
0h 1
6 5.6943684e+03 7.34e-02 2.20e+01 -1.0 1.68e+01 - 7.06e-01 1.12e-0
1f 1
7 4.4774579e+03 2.03e-02 9.10e-01 -1.0 1.14e+01 - 9.52e-01 8.13e-0
1f 1
8 4.7575244e+03 1.61e-02 1.67e-01 -1.0 3.79e+00 - 1.00e+00 9.04e-0
1h 1
9 4.2921560e+03 8.06e-03 3.60e-01 -2.5 2.51e+00 - 7.66e-01 9.31e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2203683e+03 2.26e-03 1.60e-01 -2.5 7.02e-01 - 7.86e-01 6.98e-0
1h 1
11 4.1989190e+03 4.19e-04 1.47e-02 -2.5 2.21e-01 - 1.00e+00 9.90e-0
1h 1
12 4.1815716e+03 2.41e-06 1.05e-01 -3.8 2.69e+00 - 9.17e-01 1.00e+0
0h 1
13 4.1816963e+03 8.87e-10 7.45e-06 -3.8 3.45e-03 - 1.00e+00 1.00e+0
0h 1
14 4.1805057e+03 1.79e-08 1.82e-04 -5.7 1.49e-01 - 1.00e+00 9.96e-0
1f 1
15 4.1805039e+03 1.80e-12 2.29e-09 -5.7 5.97e-04 - 1.00e+00 1.00e+0
0f 1
16 4.1804891e+03 2.63e-12 1.52e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 4.1804891474630494e+00 4.1804891474630494e+0
3
Dual infeasibility......: 1.5189631986971741e-09 1.5189631986971741e-0
6
Constraint violation....: 2.6289526111611394e-12 2.6289526111611394e-1
2
Complementarity.........: 2.8635057233442293e-09 2.8635057233442294e-0
6
Overall NLP error.......: 2.8635057233442293e-09 2.8635057233442294e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6619491e+02 9.17e+02 5.24e+01 -1.0 9.25e+02 - 4.97e-04 9.82e-0
3f 1
2 8.6134812e+02 9.17e+02 5.24e+01 -1.0 5.14e+02 - 7.56e-05 1.77e-0
4h 1
3 2.6192810e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 1.11e-04 2.24e-0
2f 1
4 1.3048678e+04 5.92e-02 8.01e+01 -1.0 8.97e+02 - 4.93e-02 1.00e+0
0h 1
5 4.3083518e+03 5.53e-02 5.43e+01 -1.0 7.47e+01 - 3.12e-01 5.89e-0
2f 1
6 2.7179342e+03 3.01e-02 2.86e+01 -1.0 3.90e+01 - 4.69e-01 4.31e-0
1f 1
7 2.1360110e+03 1.50e-02 2.67e+00 -1.0 1.11e+01 - 9.18e-01 1.00e+0
0f 1
8 2.4957352e+03 4.71e-04 1.03e-01 -1.0 4.04e+00 - 1.00e+00 1.00e+0
0f 1
9 1.9169927e+03 8.04e-04 2.48e-01 -1.7 4.19e+01 - 1.00e+00 8.64e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.9028506e+03 1.66e-04 4.19e-02 -1.7 2.05e+00 - 1.00e+00 1.00e+0
0f 1
11 1.7836050e+03 8.73e-05 1.98e-02 -2.5 3.57e+01 - 1.00e+00 9.84e-0
1f 1
12 1.7630015e+03 2.93e-03 7.91e-02 -3.8 5.38e+00 - 6.54e-01 9.83e-0
1h 1
13 1.7580779e+03 5.96e-03 1.22e-02 -3.8 7.07e-02 - 8.50e-01 1.00e+0
0h 1
14 1.7587754e+03 1.23e-04 7.54e-04 -3.8 2.03e-02 - 1.00e+00 1.00e+0
0h 1
15 1.7571795e+03 1.66e-04 9.73e-04 -5.7 2.97e-01 - 9.32e-01 1.00e+0
0h 1
16 1.7571800e+03 5.45e-05 6.55e-03 -5.7 1.35e-03 - 1.00e+00 6.72e-0
1h 1
17 1.7571900e+03 1.12e-08 2.93e-06 -5.7 1.39e-04 - 1.00e+00 1.00e+0
0f 1
18 1.7571732e+03 9.90e-09 2.10e-05 -8.6 3.68e-03 - 1.00e+00 9.83e-0
1h 1
19 1.7571729e+03 1.64e-12 7.83e-11 -8.6 6.38e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.7571729150680500e+00 1.7571729150680499e+0
3
Dual infeasibility......: 7.8273386251577685e-11 7.8273386251577679e-0
8
Constraint violation....: 1.6427970095378441e-12 1.6427970095378441e-1
2
Complementarity.........: 2.5101356412859253e-09 2.5101356412859252e-0
6
Overall NLP error.......: 2.5101356412859253e-09 2.5101356412859252e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.06e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.86e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235660175e+00 1.6104063235660176e+0
3
Dual infeasibility......: 2.4576507795665303e-12 2.4576507795665303e-0
9
Constraint violation....: 7.8624590837425925e-15 7.8624590837425925e-1
5
Complementarity.........: 2.5062163919681794e-09 2.5062163919681795e-0
6
Overall NLP error.......: 2.5062163919681794e-09 2.5062163919681795e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933486e-01 5.8277753147933481e+0
2
Dual infeasibility......: 2.1031318725023556e-09 2.1031318725023556e-0
6
Constraint violation....: 6.2994429117502193e-11 6.2994429117502193e-1
1
Complementarity.........: 2.8882108896910881e-09 2.8882108896910880e-0
6
Overall NLP error.......: 2.8882108896910881e-09 2.8882108896910880e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101510e-01 6.4890146112101513e+0
2
Dual infeasibility......: 4.9126605653162707e-09 4.9126605653162707e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984896560e-09 4.3646094984896562e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605653162707e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.06e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.86e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235660175e+00 1.6104063235660176e+0
3
Dual infeasibility......: 2.4576507795665303e-12 2.4576507795665303e-0
9
Constraint violation....: 7.8624590837425925e-15 7.8624590837425925e-1
5
Complementarity.........: 2.5062163919681794e-09 2.5062163919681795e-0
6
Overall NLP error.......: 2.5062163919681794e-09 2.5062163919681795e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2355451e+02 9.17e+02 5.24e+01 -1.0 9.24e+02 - 3.31e-04 9.84e-0
3f 1
2 8.1662500e+02 9.17e+02 5.24e+01 -1.0 5.55e+02 - 7.26e-05 2.50e-0
4h 1
3 2.4196991e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 1.96e-04 2.12e-0
2f 1
4 1.2636833e+04 5.48e-02 8.23e+01 -1.0 8.98e+02 - 3.79e-02 1.00e+0
0h 1
5 3.9066543e+03 5.23e-02 5.77e+01 -1.0 8.26e+01 - 2.96e-01 4.93e-0
2f 1
6 1.9129688e+03 3.74e-02 3.11e+01 -1.0 3.92e+01 - 4.66e-01 5.08e-0
1f 1
7 4.7067283e+03 1.23e-02 2.76e+01 -1.0 2.08e+01 - 3.97e-01 1.00e+0
0h 1
8 1.8774461e+03 1.23e-02 1.09e+00 -1.0 2.59e+01 - 9.87e-01 8.86e-0
1f 1
9 1.9927655e+03 2.09e-04 4.90e-02 -1.0 2.51e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7260747e+03 2.23e-04 1.23e+00 -2.5 1.90e+01 - 9.37e-01 5.95e-0
1f 1
11 1.5380610e+03 3.77e-03 1.32e-01 -2.5 7.57e+00 - 7.96e-01 1.00e+0
0f 1
12 1.5153061e+03 4.98e-03 3.07e-01 -2.5 1.80e+00 - 1.00e+00 7.69e-0
1h 1
13 1.5275650e+03 2.35e-04 4.67e-03 -2.5 7.22e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5024753e+03 1.70e-04 2.15e-02 -3.8 8.08e+00 - 9.90e-01 9.29e-0
1h 1
15 1.5016701e+03 7.28e-07 6.85e-05 -3.8 5.51e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003100e+03 3.77e-07 1.78e-04 -5.7 4.46e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003099e+03 3.79e-11 2.92e-09 -5.7 4.21e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932720251907e+00 1.5002932720251906e+0
3
Dual infeasibility......: 2.1737235191556299e-09 2.1737235191556299e-0
6
Constraint violation....: 6.2995525462739010e-11 6.2995525462739010e-1
1
Complementarity.........: 2.9340826867951512e-09 2.9340826867951510e-0
6
Overall NLP error.......: 2.9340826867951512e-09 2.9340826867951510e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6598311e+02 9.17e+02 5.24e+01 -1.0 9.24e+02 - 4.97e-04 9.84e-0
3h 1
2 8.5884059e+02 9.17e+02 5.24e+01 -1.0 5.71e+02 - 7.06e-05 2.62e-0
4h 1
3 2.6203260e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 2.08e-04 2.23e-0
2f 1
4 1.3003571e+04 5.93e-02 8.01e+01 -1.0 8.97e+02 - 4.95e-02 1.00e+0
0h 1
5 4.3038712e+03 5.54e-02 5.41e+01 -1.0 7.44e+01 - 3.14e-01 5.91e-0
2f 1
6 1.605942e+04 1.621968e+04 1.936076e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.56e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6795604e+02 1.56e+04 5.25e+01 -1.0 1.58e+04 - 2.29e-04 9.80e-0
3f 1
2 7.6508329e+02 1.56e+04 5.25e+01 -1.0 1.50e+04 - 4.81e-05 1.03e-0
4h 1
3 7.4063097e+02 1.56e+04 5.25e+01 -1.0 1.56e+04 - 6.10e-06 1.93e-0
3h 1
4 5.3682140e+02 1.53e+04 5.27e+01 -1.0 1.56e+04 - 2.05e-03 1.95e-0
2h 1
5 2.5988086e+04 6.17e-02 8.49e+01 -1.0 1.53e+04 - 3.06e-02 1.00e+0
0h 1
6 1.8130643e+04 5.92e-02 6.40e+01 -1.0 7.32e+01 - 2.51e-01 4.45e-0
2f 1
7 1.6583267e+04 4.55e-02 3.12e+01 -1.0 2.88e+01 - 5.08e-01 4.32e-0
1f 1
8 1.6872433e+04 3.11e-02 1.20e+01 -1.0 1.59e+01 - 4.75e-01 1.25e-0
1f 4
9 1.6677525e+04 5.33e-03 3.87e-01 -1.0 3.86e+00 - 9.77e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6390593e+04 1.04e-03 1.40e+00 -1.7 4.60e+00 - 3.19e-01 8.79e-0
1f 1
11 1.6379681e+04 1.64e-04 7.44e-01 -1.7 3.73e+00 - 6.30e-01 1.00e+0
0f 1
12 1.6366875e+04 1.14e-04 2.00e-01 -1.7 7.75e+00 - 6.84e-01 1.00e+0
0h 1
13 1.6266899e+04 8.94e-04 7.50e-02 -2.5 4.30e+00 - 9.07e-01 1.00e+0
0f 1
14 1.6239071e+04 1.56e-03 1.62e-02 -2.5 4.09e+00 - 1.00e+00 1.00e+0
0h 1
15 1.6222909e+04 2.79e-04 1.09e-01 -3.8 5.75e+00 - 1.00e+00 8.31e-0
1h 1
16 1.6220903e+04 6.13e-07 1.30e-04 -3.8 9.71e-01 - 1.00e+00 1.00e+0
0h 1
17 1.6219687e+04 4.02e-07 1.10e-04 -5.7 2.97e-01 - 1.00e+00 9.98e-0
1h 1
18 1.6219689e+04 3.83e-11 3.01e-09 -5.7 2.81e-02 - 1.00e+00 1.00e+0
0f 1
19 1.6219677e+04 4.58e-11 8.36e-05 -8.6 2.81e-03 - 1.00e+00 8.65e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6219676e+04 1.16e-12 3.80e-11 -8.6 1.36e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.6219675985024505e+01 1.6219675985024505e+0
4
Dual infeasibility......: 3.7987790230675515e-11 3.7987790230675515e-0
8
Constraint violation....: 1.1552842016371301e-12 1.1552842016371301e-1
2
Complementarity.........: 2.6558910310037608e-09 2.6558910310037609e-0
6
Overall NLP error.......: 2.6558910310037608e-09 2.6558910310037609e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6809345e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.29e-04 9.80e-0
3f 1
2 7.6521550e+02 1.50e+04 5.25e+01 -1.0 1.43e+04 - 4.82e-05 1.03e-0
4h 1
3 7.6416186e+02 1.50e+04 5.25e+01 -1.0 1.48e+04 - 6.44e-06 7.78e-0
5h 1
4 7.6282729e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 8.25e-05 1.01e-0
4h 1
5 5.0188267e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 1.85e-04 2.00e-0
2f 1
6 2.6232804e+04 6.05e-02 8.47e+01 -1.0 1.47e+04 - 2.92e-02 1.00e+0
0h 1
7 1.7519151e+04 5.82e-02 6.83e+01 -1.0 8.15e+01 - 1.99e-01 4.23e-0
2f 1
8 1.5926086e+04 4.46e-02 3.40e+01 -1.0 2.87e+01 - 4.98e-01 4.38e-0
1f 1
9 1.6224345e+04 3.04e-02 1.39e+01 -1.0 1.63e+01 - 4.65e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6014114e+04 5.29e-03 1.64e-01 -1.0 3.71e+00 - 9.91e-01 1.00e+0
0h 1
11 1.5730170e+04 1.03e-03 2.42e-01 -1.7 4.60e+00 - 1.00e+00 8.81e-0
1f 1
12 1.5708710e+04 7.63e-04 9.84e-03 -1.7 1.80e+01 - 1.00e+00 1.00e+0
0f 1
13 1.5583291e+04 1.30e-03 8.62e-02 -3.8 2.19e+01 - 8.03e-01 9.33e-0
1f 1
14 1.5559749e+04 1.43e-03 6.30e-02 -3.8 1.69e+00 - 8.52e-01 7.76e-0
1h 1
15 1.5560171e+04 2.57e-06 7.16e-04 -3.8 9.63e-02 - 1.00e+00 1.00e+0
0h 1
16 1.5559221e+04 3.24e-07 5.84e-04 -5.7 1.49e-01 - 1.00e+00 9.89e-0
1h 1
17 1.5559215e+04 4.00e-11 6.02e-09 -5.7 9.96e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5559202e+04 6.30e-11 2.07e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5559202102841420e+01 1.5559202102841420e+0
4
Dual infeasibility......: 2.0693781099224682e-09 2.0693781099224682e-0
6
Constraint violation....: 6.2995164640256007e-11 6.2995164640256007e-1
1
Complementarity.........: 2.8881113382927621e-09 2.8881113382927619e-0
6
Overall NLP error.......: 2.8881113382927621e-09 2.8881113382927619e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.3158654e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.51e-04 9.80e-0
3h 1
2 8.2872439e+02 1.39e+04 5.24e+01 -1.0 1.32e+04 - 4.66e-05 1.04e-0
4h 1
3 8.2601810e+02 1.39e+04 5.24e+01 -1.0 1.38e+04 - 7.07e-06 1.90e-0
4h 1
4 8.2276528e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 1.95e-04 2.31e-0
4h 1
5 5.2876491e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 4.44e-04 2.14e-0
2f 1
6 2.5456598e+04 5.58e-02 8.20e+01 -1.0 1.36e+04 - 4.05e-02 1.00e+0
0h 1
7 1.6926073e+04 5.28e-02 5.35e+01 -1.0 8.07e+01 - 3.43e-01 5.18e-0
2f 1
8 1.4892564e+04 3.52e-02 2.89e+01 -1.0 4.07e+01 - 4.66e-01 5.15e-0
1f 1
9 1.5244716e+04 2.22e-02 1.34e+01 -1.0 2.14e+01 - 3.96e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5009598e+04 5.61e-03 5.36e-01 -1.0 4.05e+00 - 9.70e-01 1.00e+0
0h 1
11 1.4687824e+04 1.48e-03 4.83e-01 -1.7 6.30e+00 - 1.00e+00 8.02e-0
1f 1
12 1.4636233e+04 1.01e-03 1.73e-02 -1.7 2.22e+01 - 1.00e+00 1.00e+0
0f 1
13 1.4505258e+04 1.44e-03 8.22e-02 -3.8 2.58e+01 - 7.84e-01 9.01e-0
1f 1
14 1.4480339e+04 1.78e-03 9.55e-02 -3.8 1.85e+00 - 8.40e-01 7.44e-0
1h 1
15 1.4480966e+04 3.98e-06 1.00e-03 -3.8 3.31e-02 - 1.00e+00 1.00e+0
0h 1
16 1.4480072e+04 2.23e-07 7.96e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
17 1.4480065e+04 3.25e-11 7.34e-09 -5.7 1.68e-01 - 1.00e+00 1.00e+0
0f 1
18 1.4480052e+04 6.30e-11 2.24e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.4480051731496410e+01 1.4480051731496409e+0
4
Dual infeasibility......: 2.2424865603846272e-09 2.2424865603846272e-0
6
Constraint violation....: 6.3001701078313488e-11 6.3001701078313488e-1
1
Complementarity.........: 2.8880893688139864e-09 2.8880893688139863e-0
6
Overall NLP error.......: 2.8880893688139864e-09 2.8880893688139863e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.7318606e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.39e-04 9.80e-0
3h 1
2 8.7040806e+02 1.27e+04 5.24e+01 -1.0 1.24e+04 - 9.04e-05 1.01e-0
4h 1
3 8.5944985e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 3.45e-06 7.28e-0
4f 1
4 5.3476781e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 7.89e-04 2.22e-0
2h 1
5 2.4506160e+04 6.07e-02 7.98e+01 -1.0 1.24e+04 - 5.30e-02 1.00e+0
0h 1
6 1.6081900e+04 5.65e-02 5.30e+01 -1.0 6.91e+01 - 3.25e-01 6.26e-0
2f 1
7 1.4617590e+04 3.10e-02 2.68e+01 -1.0 3.61e+01 - 4.86e-01 4.20e-0
1f 1
8 1.4247796e+04 1.48e-02 2.62e+00 -1.0 1.11e+01 - 9.19e-01 5.00e-0
1f 2
9 1.4099349e+04 7.58e-03 1.66e+00 -1.0 6.73e+00 - 1.00e+00 4.81e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4217465e+04 5.08e-04 5.80e-02 -1.0 9.95e+01 - 1.00e+00 1.00e+0
0f 1
11 1.3712691e+04 6.07e-04 7.03e-01 -2.5 9.83e+01 - 9.03e-01 6.43e-0
1f 1
12 1.3622823e+04 6.99e-05 1.44e-01 -2.5 3.45e+01 - 9.65e-01 1.00e+0
0f 1
13 1.3600897e+04 1.85e-03 8.56e-03 -2.5 9.53e-01 - 1.00e+00 1.00e+0
0h 1
14 1.3587358e+04 4.47e-04 3.30e-02 -3.8 2.68e+00 - 8.52e-01 1.00e+0
0h 1
15 1.3584739e+04 1.64e-03 8.82e-04 -3.8 3.55e-02 - 1.00e+00 1.00e+0
0h 1
16 1.3584934e+04 4.95e-05 5.13e-05 -3.8 1.17e-02 - 1.00e+00 1.00e+0
0h 1
17 1.3583665e+04 1.21e-04 5.63e-04 -5.7 1.49e-01 - 9.39e-01 1.00e+0
0h 1
18 1.3583637e+04 1.33e-05 7.19e-05 -5.7 5.03e-03 - 1.00e+00 9.81e-0
1h 1
19 1.3583644e+04 3.71e-08 4.59e-06 -5.7 2.79e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.3583629e+04 3.21e-08 3.31e-05 -8.6 1.84e-03 - 1.00e+00 9.71e-0
1h 1
21 1.3583628e+04 2.60e-12 3.52e-10 -8.6 5.36e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.3583628295577451e+01 1.3583628295577451e+0
4
Dual infeasibility......: 3.5206267527628675e-10 3.5206267527628675e-0
7
Constraint violation....: 2.6040281042583047e-12 2.6040281042583047e-1
2
Complementarity.........: 2.5390057557589962e-09 2.5390057557589961e-0
6
Overall NLP error.......: 2.5390057557589962e-09 2.5390057557589961e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9482527e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 7.48e-04 9.80e-0
3h 1
2 8.9206259e+02 1.11e+04 5.24e+01 -1.0 1.09e+04 - 8.69e-05 1.01e-0
4h 1
3 8.7788074e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 4.01e-06 8.67e-0
4f 1
4 5.1726064e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 9.54e-04 2.26e-0
2h 1
5 2.3121559e+04 6.40e-02 7.79e+01 -1.0 1.09e+04 - 6.98e-02 1.00e+0
0h 1
6 1.4812165e+04 5.85e-02 4.83e+01 -1.0 4.95e+01 - 3.63e-01 7.77e-0
2f 1
7 1.3505031e+04 2.67e-02 2.10e+01 -1.0 2.28e+01 - 5.57e-01 5.00e-0
1f 1
8 1.3018007e+04 6.85e-03 1.23e+00 -1.0 8.59e+00 - 9.37e-01 7.36e-0
1f 1
9 1.3268789e+04 3.20e-04 7.93e-02 -1.0 2.91e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2683148e+04 2.08e-03 9.07e-02 -2.5 4.28e+00 - 8.62e-01 8.28e-0
1f 1
11 1.2505092e+04 2.17e-03 3.62e-01 -2.5 1.06e+00 - 1.00e+00 7.74e-0
1f 1
12 1.2476207e+04 1.68e-04 5.11e-03 -2.5 2.15e-01 - 1.00e+00 1.00e+0
0h 1
13 1.2456345e+04 2.44e-05 4.31e-02 -3.8 2.68e+00 - 1.00e+00 8.82e-0
1h 1
14 1.2454881e+04 5.88e-08 6.10e-04 -3.8 3.16e-01 - 1.00e+00 1.00e+0
0f 1
15 1.2453574e+04 4.24e-08 1.39e-05 -5.7 1.49e-01 - 1.00e+00 9.99e-0
1f 1
16 1.2453562e+04 6.84e-13 3.99e-09 -8.6 1.93e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.2453562273064611e+01 1.2453562273064610e+0
4
Dual infeasibility......: 3.9883528192006908e-09 3.9883528192006908e-0
6
Constraint violation....: 6.8436922795456212e-13 6.8436922795456212e-1
3
Complementarity.........: 2.7863203158954427e-09 2.7863203158954426e-0
6
Overall NLP error.......: 3.9883528192006908e-09 3.9883528192006908e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3005826e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 2.02e-03 9.80e-0
3h 1
2 9.2703232e+02 9.19e+03 5.23e+01 -1.0 8.09e+03 - 2.76e-05 1.12e-0
4h 1
3 7.5783098e+02 9.11e+03 5.23e+01 -1.0 9.19e+03 - 1.67e-05 9.02e-0
3f 1
4 5.7019952e+02 8.91e+03 5.19e+01 -1.0 9.11e+03 - 1.10e-02 2.10e-0
2h 1
5 1.8305220e+04 8.28e-02 7.82e+01 -1.0 8.91e+03 - 8.71e-02 1.00e+0
0h 1
6 1.3289624e+04 7.37e-02 2.12e+01 -1.0 7.99e+00 - 7.08e-01 1.04e-0
1f 1
7 1.2190257e+04 3.47e-02 3.50e+00 -1.0 6.47e+00 - 8.56e-01 9.70e-0
1f 1
8 1.2545395e+04 3.12e-02 3.82e-01 -1.0 2.06e+00 - 9.41e-01 9.51e-0
1f 1
9 1.2155820e+04 4.32e-03 1.11e+00 -1.7 4.92e+00 - 4.77e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2131259e+04 3.76e-04 6.00e-01 -1.7 7.33e+00 - 7.02e-01 1.00e+0
0h 1
11 1.2151175e+04 9.52e-05 1.16e-01 -1.7 1.26e+01 - 8.36e-01 1.00e+0
0f 1
12 1.1996095e+04 3.90e-04 1.86e-02 -2.5 1.81e+01 - 9.74e-01 9.46e-0
1f 1
13 1.1970900e+04 1.01e-04 1.51e-01 -3.8 9.37e+00 - 9.96e-01 7.76e-0
1h 1
14 1.1965350e+04 2.18e-07 1.25e-04 -3.8 2.14e+00 - 1.00e+00 1.00e+0
0f 1
15 1.1964014e+04 1.78e-08 2.99e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
16 1.1963999e+04 1.29e-12 4.23e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.1963999114939348e+01 1.1963999114939348e+0
4
Dual infeasibility......: 4.2344683490571825e-10 4.2344683490571825e-0
7
Constraint violation....: 1.2937012572322715e-12 1.2937012572322715e-1
2
Complementarity.........: 4.4600744263433786e-09 4.4600744263433787e-0
6
Overall NLP error.......: 4.4600744263433786e-09 4.4600744263433787e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2300862e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.80e-0
3h 1
2 9.2018520e+02 6.71e+03 5.23e+01 -1.0 6.43e+03 - 7.59e-05 1.03e-0
4h 1
3 8.8417722e+02 6.69e+03 5.23e+01 -1.0 6.70e+03 - 7.25e-06 1.73e-0
3f 1
4 4.3415243e+02 6.54e+03 5.24e+01 -1.0 6.69e+03 - 2.08e-03 2.26e-0
2h 1
5 1.8486104e+04 7.08e-02 7.69e+01 -1.0 6.54e+03 - 8.04e-02 1.00e+0
0h 1
6 1.0916142e+04 6.40e-02 2.32e+01 -1.0 1.36e+01 - 6.65e-01 8.89e-0
2f 1
7 9.6154376e+03 1.98e-02 9.31e+00 -1.0 9.91e+00 - 6.64e-01 8.81e-0
1f 1
8 9.7199903e+03 1.05e-02 6.35e-01 -1.0 2.75e+00 - 9.95e-01 4.77e-0
1f 2
9 9.3967776e+03 9.36e-03 2.78e-01 -1.7 9.45e+00 - 1.00e+00 8.30e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.3672965e+03 2.18e-03 9.40e-01 -1.7 1.18e+01 - 1.00e+00 4.90e-0
1h 2
11 9.3624199e+03 2.10e-04 1.67e-02 -1.7 6.01e+00 - 1.00e+00 1.00e+0
0h 1
12 9.2069203e+03 4.79e-04 2.44e-02 -3.8 2.00e+01 - 8.46e-01 8.30e-0
1f 1
13 9.1886242e+03 1.49e-04 2.05e-01 -3.8 3.34e+00 - 9.89e-01 7.21e-0
1h 1
14 9.1840024e+03 3.89e-07 3.07e-04 -3.8 9.33e-01 - 1.00e+00 1.00e+0
0h 1
15 9.1828139e+03 1.95e-08 4.40e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
16 9.1828008e+03 7.97e-13 4.82e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 9.1828007560005869e+00 9.1828007560005863e+0
3
Dual infeasibility......: 4.8230730063032913e-10 4.8230730063032913e-0
7
Constraint violation....: 7.9650175344170293e-13 7.9650175344170293e-1
3
Complementarity.........: 2.6134527997765375e-09 2.6134527997765374e-0
6
Overall NLP error.......: 2.6134527997765375e-09 2.6134527997765374e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0887653e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0575715e+02 4.77e+03 5.23e+01 -1.0 4.05e+03 - 4.23e-05 1.17e-0
4h 1
3 6.7332363e+02 4.72e+03 5.24e+01 -1.0 4.77e+03 - 2.39e-05 1.03e-0
2f 1
4 4.3700868e+02 4.62e+03 5.18e+01 -1.0 4.72e+03 - 1.38e-02 2.11e-0
2h 1
5 1.3037782e+04 7.91e-02 7.80e+01 -1.0 4.62e+03 - 9.53e-02 1.00e+0
0h 1
6 8.3073570e+03 6.95e-02 2.11e+01 -1.0 2.25e+01 - 7.07e-01 1.14e-0
1f 1
7 6.9813415e+03 1.49e-02 1.23e+00 -1.0 1.41e+01 - 9.43e-01 7.79e-0
1f 1
8 7.2864192e+03 1.03e-02 3.33e-01 -1.0 4.36e+00 - 7.01e-01 9.21e-0
1f 1
9 6.8765640e+03 2.53e-03 3.91e-01 -1.7 2.73e+00 - 7.92e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.8431007e+03 7.09e-04 4.96e-01 -1.7 8.81e+00 - 6.66e-01 1.00e+0
0h 1
11 6.8653228e+03 1.10e-05 8.21e-02 -1.7 1.27e+01 - 8.71e-01 1.00e+0
0h 1
12 6.7021403e+03 4.84e-04 2.19e-02 -2.5 2.03e+01 - 9.71e-01 9.44e-0
1f 1
13 6.6704724e+03 1.37e-04 7.90e-02 -3.8 8.83e+00 - 9.82e-01 8.42e-0
1h 1
14 6.6673148e+03 1.81e-07 9.10e-02 -3.8 1.42e+00 - 9.28e-01 1.00e+0
0h 1
15 6.6672355e+03 4.83e-09 2.86e-05 -3.8 1.69e-04 - 1.00e+00 1.00e+0
0h 1
16 6.6659218e+03 1.92e-08 3.88e-03 -5.7 2.97e-01 - 1.00e+00 9.68e-0
1f 1
17 6.6658859e+03 5.75e-12 2.63e-08 -5.7 9.60e-03 - 1.00e+00 1.00e+0
0f 1
18 6.6658693e+03 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 6.6658693183061271e+00 6.6658693183061268e+0
3
Dual infeasibility......: 4.4780427136865511e-09 4.4780427136865511e-0
6
Constraint violation....: 2.6337751424243550e-12 2.6337751424243550e-1
2
Complementarity.........: 3.6085482127160554e-09 3.6085482127160552e-0
6
Overall NLP error.......: 4.4780427136865511e-09 4.4780427136865511e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2298268e+02 3.24e+03 5.23e+01 -1.0 3.27e+03 - 1.51e-03 9.81e-0
3h 1
2 9.2003557e+02 3.24e+03 5.23e+01 -1.0 2.98e+03 - 7.92e-05 1.08e-0
4h 1
3 8.2924045e+02 3.23e+03 5.23e+01 -1.0 3.24e+03 - 1.50e-05 3.73e-0
3f 1
4 3.5764794e+02 3.16e+03 5.22e+01 -1.0 3.23e+03 - 5.83e-03 2.18e-0
2h 1
5 1.3704663e+04 7.54e-02 7.77e+01 -1.0 3.16e+03 - 8.28e-02 1.00e+0
0h 1
6 7.3446410e+03 6.78e-02 2.26e+01 -1.0 1.31e+01 - 6.82e-01 9.46e-0
2f 1
7 6.0810712e+03 2.03e-02 7.24e+00 -1.0 9.63e+00 - 7.16e-01 8.72e-0
1f 1
8 6.2085934e+03 1.09e-02 6.05e-01 -1.0 2.64e+00 - 9.96e-01 4.67e-0
1f 2
9 5.9253757e+03 1.11e-02 2.98e-01 -1.7 1.18e+01 - 1.00e+00 8.14e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8752347e+03 1.11e-03 1.28e-01 -1.7 1.00e+01 - 1.00e+00 9.65e-0
1h 1
11 5.7570006e+03 4.14e-04 1.11e-01 -2.5 1.70e+01 - 9.54e-01 8.70e-0
1h 1
12 5.7430581e+03 1.61e-05 3.35e-03 -2.5 2.14e+00 - 1.00e+00 1.00e+0
0f 1
13 5.7235010e+03 5.14e-06 3.47e-02 -3.8 2.68e+00 - 1.00e+00 9.15e-0
1f 1
14 5.7222072e+03 1.38e-08 1.87e-05 -3.8 2.27e-01 - 1.00e+00 1.00e+0
0f 1
15 5.7210129e+03 1.79e-08 5.07e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0f 1
16 5.7210000e+03 6.40e-13 4.11e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 5.7210000196737711e+00 5.7210000196737710e+0
3
Dual infeasibility......: 4.1054900581410827e-10 4.1054900581410827e-0
7
Constraint violation....: 6.3965499563778394e-13 6.3965499563778394e-1
3
Complementarity.........: 2.5983435457931114e-09 2.5983435457931113e-0
6
Overall NLP error.......: 2.5983435457931114e-09 2.5983435457931113e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8064252e+02 2.00e+03 5.24e+01 -1.0 2.02e+03 - 5.97e-04 9.81e-0
3f 1
2 8.7760033e+02 2.00e+03 5.24e+01 -1.0 1.79e+03 - 9.81e-05 1.11e-0
4h 1
3 7.4188986e+02 1.99e+03 5.24e+01 -1.0 2.00e+03 - 2.20e-05 5.30e-0
3f 1
4 3.0853037e+02 1.94e+03 5.19e+01 -1.0 1.99e+03 - 1.13e-02 2.08e-0
2f 1
5 1.0454262e+04 7.18e-02 7.81e+01 -1.0 1.94e+03 - 1.01e-01 1.00e+0
0h 1
6 4.9583655e+03 6.28e-02 2.13e+01 -1.0 4.92e+01 - 7.01e-01 1.16e-0
1f 1
7 3.4679380e+03 2.85e-02 2.35e+00 -1.0 2.41e+01 - 9.37e-01 6.11e-0
1f 1
8 3.5502765e+03 4.69e-03 1.40e-01 -1.0 3.47e+00 - 1.00e+00 1.00e+0
0f 1
9 3.0919874e+03 1.73e-03 2.74e-01 -2.5 3.67e+00 - 8.96e-01 7.84e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.0656701e+03 1.76e-05 1.17e-02 -2.5 4.34e-01 - 1.00e+00 1.00e+0
0h 1
11 3.0443578e+03 3.86e-04 9.45e-02 -3.8 2.69e+00 - 7.24e-01 9.81e-0
1f 1
12 3.0404046e+03 2.37e-03 5.59e-03 -3.8 4.63e-02 - 8.29e-01 1.00e+0
0h 1
13 3.0405027e+03 1.41e-04 1.23e-04 -3.8 1.70e-02 - 1.00e+00 1.00e+0
0h 1
14 3.0392763e+03 1.55e-04 1.25e-03 -5.7 1.49e-01 - 9.12e-01 1.00e+0
0h 1
15 3.0392276e+03 4.25e-05 1.02e-05 -5.7 9.60e-03 - 1.00e+00 1.00e+0
0h 1
16 3.0392312e+03 9.25e-07 6.70e-06 -5.7 1.39e-03 - 1.00e+00 1.00e+0
0h 1
17 3.0392191e+03 6.89e-08 7.06e-05 -8.6 1.84e-03 - 1.00e+00 9.41e-0
1h 1
18 3.0392184e+03 8.32e-12 9.00e-11 -8.6 1.08e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 3.0392183800707255e+00 3.0392183800707253e+0
3
Dual infeasibility......: 8.9990918950093956e-11 8.9990918950093956e-0
8
Constraint violation....: 8.3232309933123361e-12 8.3232309933123361e-1
2
Complementarity.........: 2.5077806590825846e-09 2.5077806590825846e-0
6
Overall NLP error.......: 2.5077806590825846e-09 2.5077806590825846e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6598311e+02 9.17e+02 5.24e+01 -1.0 9.24e+02 - 4.97e-04 9.84e-0
3h 1
2 8.5884059e+02 9.17e+02 5.24e+01 -1.0 5.71e+02 - 7.06e-05 2.62e-0
4h 1
3 2.6203260e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 2.08e-04 2.23e-0
2f 1
4 1.3003571e+04 5.93e-02 8.01e+01 -1.0 8.97e+02 - 4.95e-02 1.00e+0
0h 1
5 4.3038712e+03 5.54e-02 5.41e+01 -1.0 7.44e+01 - 3.14e-01 5.91e-0
2f 1
6 2.7137366e+03 3.01e-02 2.84e+01 -1.0 3.90e+01 - 4.69e-01 4.31e-0
1f 1
7 2.1355118e+03 1.49e-02 2.65e+00 -1.0 1.11e+01 - 9.18e-01 1.00e+0
0f 1
8 2.4920592e+03 4.63e-04 9.64e-02 -1.0 4.06e+00 - 9.98e-01 1.00e+0
0f 1
9 1.8814591e+03 7.64e-04 3.05e-01 -2.5 8.15e+00 - 8.78e-01 7.48e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8091248e+03 2.45e-04 3.37e-01 -2.5 2.62e+00 - 8.83e-01 1.00e+0
0h 1
11 1.8028113e+03 7.15e-04 4.35e-01 -2.5 1.35e+00 - 1.00e+00 1.82e-0
1h 2
12 1.7830589e+03 1.10e-03 1.24e-02 -2.5 9.05e-01 - 1.00e+00 1.00e+0
0h 1
13 1.7614976e+03 1.21e-03 3.33e-02 -3.8 8.08e+00 - 7.93e-01 1.00e+0
0h 1
14 1.7584853e+03 2.29e-03 9.17e-04 -3.8 3.89e-02 - 1.00e+00 1.00e+0
0h 1
15 1.7588136e+03 4.79e-05 1.28e-04 -3.8 1.53e-02 - 1.00e+00 1.00e+0
0h 1
16 1.7572061e+03 1.04e-04 3.74e-04 -5.7 4.46e-01 - 9.51e-01 9.78e-0
1h 1
17 1.7571896e+03 2.28e-05 3.67e-03 -5.7 9.78e-03 - 1.00e+00 7.82e-0
1h 1
18 1.7571915e+03 8.73e-09 1.22e-06 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
19 1.7571732e+03 9.03e-09 1.92e-05 -8.6 5.53e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7571729e+03 1.37e-12 6.49e-11 -8.6 9.17e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.7571729153454902e+00 1.7571729153454903e+0
3
Dual infeasibility......: 6.4906225452538490e-11 6.4906225452538490e-0
8
Constraint violation....: 1.3685719224554305e-12 1.3685719224554305e-1
2
Complementarity.........: 2.9022676949116454e-09 2.9022676949116455e-0
6
Overall NLP error.......: 2.9022676949116454e-09 2.9022676949116455e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101521e-01 6.4890146112101525e+0
2
Dual infeasibility......: 4.9126605618489413e-09 4.9126605618489413e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984918224e-09 4.3646094984918221e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605618489413e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318724481455e-09 2.1031318724481455e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896894379e-09 2.8882108896894380e-0
6
Overall NLP error.......: 2.8882108896894379e-09 2.8882108896894380e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101521e-01 6.4890146112101525e+0
2
Dual infeasibility......: 4.9126605618489413e-09 4.9126605618489413e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984918224e-09 4.3646094984918221e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605618489413e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.04e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.57e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235660171e+00 1.6104063235660171e+0
3
Dual infeasibility......: 2.4574009793760635e-12 2.4574009793760635e-0
9
Constraint violation....: 7.5703172614159067e-16 7.5703172614159067e-1
6
Complementarity.........: 2.5062163919681798e-09 2.5062163919681799e-0
6
Overall NLP error.......: 2.5062163919681798e-09 2.5062163919681799e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2329662e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 3.31e-04 9.85e-0
3h 1
2 8.1338739e+02 9.17e+02 5.24e+01 -1.0 6.65e+02 - 7.53e-05 3.59e-0
4h 1
3 2.4215012e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 3.16e-04 2.12e-0
2f 1
4 1.2572829e+04 5.49e-02 8.23e+01 -1.0 8.98e+02 - 3.81e-02 1.00e+0
0h 1
5 3.9012337e+03 5.24e-02 5.73e+01 -1.0 8.21e+01 - 3.02e-01 4.95e-0
2f 1
6 1.9122630e+03 3.74e-02 3.08e+01 -1.0 3.92e+01 - 4.67e-01 5.07e-0
1f 1
7 4.6985285e+03 1.23e-02 2.74e+01 -1.0 2.08e+01 - 3.98e-01 1.00e+0
0h 1
8 1.8769618e+03 1.22e-02 1.07e+00 -1.0 2.57e+01 - 9.87e-01 8.88e-0
1f 1
9 1.9956227e+03 2.03e-04 4.84e-02 -1.0 2.76e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7291248e+03 2.21e-04 1.23e+00 -2.5 1.88e+01 - 9.37e-01 5.95e-0
1f 1
11 1.5409848e+03 3.77e-03 1.32e-01 -2.5 7.58e+00 - 7.96e-01 1.00e+0
0f 1
12 1.5181170e+03 5.06e-03 3.08e-01 -2.5 1.81e+00 - 1.00e+00 7.68e-0
1h 1
13 1.5303991e+03 2.38e-04 4.69e-03 -2.5 7.19e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5028095e+03 1.70e-04 2.15e-02 -3.8 1.08e+01 - 9.90e-01 9.29e-0
1h 1
15 1.5018205e+03 7.26e-07 6.85e-05 -3.8 7.35e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003124e+03 3.77e-07 1.78e-04 -5.7 5.94e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003117e+03 3.79e-11 2.92e-09 -5.7 4.21e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932742029689e+00 1.5002932742029689e+0
3
Dual infeasibility......: 2.1737236411364212e-09 2.1737236411364212e-0
6
Constraint violation....: 6.2995816896282975e-11 6.2995816896282975e-1
1
Complementarity.........: 2.8882174480592339e-09 2.8882174480592338e-0
6
Overall NLP error.......: 2.8882174480592339e-09 2.8882174480592338e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6577131e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 4.97e-04 9.85e-0
3h 1
2 8.5529111e+02 9.17e+02 5.24e+01 -1.0 6.82e+02 - 7.34e-05 3.86e-0
4h 1
3 2.6219590e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 3.43e-04 2.22e-0
2f 1
4 1.2935511e+04 5.94e-02 8.01e+01 -1.0 8.97e+02 - 4.97e-02 1.00e+0
0h 1
5 4.2970559e+03 5.55e-02 5.39e+01 -1.0 7.40e+01 - 3.17e-01 5.94e-0
2f 1
7 1.616849e+04 1.621968e+04 1.991759e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.56e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1155504e+02 1.56e+04 5.50e+01 -1.0 1.58e+04 - 1.75e-04 9.80e-0
3f 1
2 7.0864857e+02 1.56e+04 5.50e+01 -1.0 1.44e+04 - 3.33e-05 1.07e-0
4h 1
3 6.5079066e+02 1.56e+04 5.48e+01 -1.0 1.56e+04 - 1.08e-05 4.64e-0
3h 1
4 5.5065296e+02 1.53e+04 5.37e+01 -1.0 1.56e+04 - 4.93e-03 1.87e-0
2h 1
5 2.4407537e+04 7.56e-02 8.64e+01 -1.0 1.53e+04 - 2.82e-02 1.00e+0
0h 1
6 1.7760271e+04 7.24e-02 6.19e+01 -1.0 5.72e+01 - 2.91e-01 4.50e-0
2f 1
7 1.6522870e+04 4.80e-02 2.75e+01 -1.0 2.10e+01 - 5.48e-01 3.81e-0
1f 1
8 1.7007895e+04 3.46e-02 8.50e+00 -1.0 1.31e+01 - 5.69e-01 2.50e-0
1f 3
9 1.6700264e+04 6.61e-03 2.04e+00 -1.0 2.92e+00 - 8.24e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6713176e+04 2.50e-04 1.66e+00 -1.0 4.38e+00 - 3.34e-01 1.00e+0
0f 1
11 1.6721009e+04 8.54e-06 6.73e-01 -1.0 4.64e+00 - 6.16e-01 1.00e+0
0f 1
12 1.6424881e+04 2.28e-04 3.78e-01 -1.7 4.90e+00 - 9.10e-01 8.04e-0
1f 1
13 1.6382940e+04 6.31e-04 2.44e-01 -1.7 1.58e+01 - 6.20e-01 1.00e+0
0f 1
14 1.6392836e+04 4.68e-05 9.80e-03 -1.7 1.87e+01 - 9.58e-01 1.00e+0
0h 1
15 1.6262034e+04 9.76e-04 4.15e-02 -2.5 3.50e+01 - 9.31e-01 1.00e+0
0f 1
16 1.6242435e+04 1.03e-03 1.08e-02 -2.5 1.20e+00 - 1.00e+00 1.00e+0
0h 1
17 1.6223038e+04 1.70e-04 7.89e-02 -3.8 8.04e+00 - 1.00e+00 8.60e-0
1h 1
18 1.6221042e+04 5.65e-07 9.32e-05 -3.8 1.13e+00 - 1.00e+00 1.00e+0
0h 1
19 1.6219699e+04 3.96e-07 7.60e-04 -5.7 4.45e-01 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6219692e+04 1.13e-10 4.64e-09 -5.7 8.38e-03 - 1.00e+00 1.00e+0
0f 1
21 1.6219676e+04 6.27e-11 1.48e-05 -8.6 5.06e-03 - 1.00e+00 9.76e-0
1h 1
22 1.6219676e+04 3.66e-14 1.20e-12 -8.6 1.95e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.6219675984907578e+01 1.6219675984907577e+0
4
Dual infeasibility......: 1.2040006751381873e-12 1.2040006751381873e-0
9
Constraint violation....: 3.6581848661398908e-14 3.6581848661398908e-1
4
Complementarity.........: 2.5377633618570244e-09 2.5377633618570242e-0
6
Overall NLP error.......: 2.5377633618570244e-09 2.5377633618570242e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9876123e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.75e-04 9.80e-0
3h 1
2 7.9582776e+02 1.50e+04 5.25e+01 -1.0 1.37e+04 - 3.22e-05 1.08e-0
4h 1
3 7.9499496e+02 1.50e+04 5.25e+01 -1.0 1.47e+04 - 1.18e-05 6.15e-0
5h 1
4 7.9435818e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 7.18e-05 4.81e-0
5h 1
5 5.2291516e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 1.21e-04 2.07e-0
2f 1
6 2.6506834e+04 5.36e-02 8.35e+01 -1.0 1.47e+04 - 3.29e-02 1.00e+0
0h 1
7 1.7758724e+04 5.15e-02 6.38e+01 -1.0 8.30e+01 - 2.38e-01 4.51e-0
2f 1
8 1.5955023e+04 4.20e-02 3.32e+01 -1.0 3.42e+01 - 4.80e-01 4.75e-0
1f 1
9 1.6281022e+04 2.56e-02 1.50e+01 -1.0 1.85e+01 - 4.22e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6017095e+04 6.14e-03 1.88e-01 -1.0 5.29e+00 - 9.91e-01 1.00e+0
0h 1
11 1.5732831e+04 1.24e-03 2.90e-01 -1.7 4.59e+00 - 1.00e+00 8.64e-0
1f 1
12 1.5711414e+04 7.92e-04 1.12e-02 -1.7 2.01e+01 - 1.00e+00 1.00e+0
0f 1
13 1.5584545e+04 1.31e-03 7.85e-02 -3.8 2.43e+01 - 7.98e-01 9.14e-0
1f 1
14 1.5559769e+04 1.51e-03 5.99e-02 -3.8 1.77e+00 - 8.47e-01 7.75e-0
1h 1
15 1.5560150e+04 2.91e-06 7.72e-04 -3.8 4.06e-02 - 1.00e+00 1.00e+0
0h 1
16 1.5559221e+04 3.00e-07 6.55e-04 -5.7 1.49e-01 - 1.00e+00 9.88e-0
1h 1
17 1.5559215e+04 3.86e-11 6.35e-09 -5.7 2.27e-01 - 1.00e+00 1.00e+0
0f 1
18 1.5559202e+04 6.30e-11 2.10e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5559202102815028e+01 1.5559202102815028e+0
4
Dual infeasibility......: 2.0959853752128246e-09 2.0959853752128246e-0
6
Constraint violation....: 6.2996385885583095e-11 6.2996385885583095e-1
1
Complementarity.........: 2.8881044263348141e-09 2.8881044263348140e-0
6
Overall NLP error.......: 2.8881044263348141e-09 2.8881044263348140e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4408150e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.92e-04 9.80e-0
3h 1
2 8.4122991e+02 1.39e+04 5.24e+01 -1.0 1.32e+04 - 4.60e-05 1.04e-0
4h 1
3 8.3853783e+02 1.39e+04 5.24e+01 -1.0 1.38e+04 - 7.14e-06 1.90e-0
4h 1
4 8.3529600e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 1.95e-04 2.32e-0
4h 1
5 5.3847827e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 4.45e-04 2.17e-0
2f 1
6 2.5566833e+04 5.71e-02 8.12e+01 -1.0 1.36e+04 - 4.51e-02 1.00e+0
0h 1
7 1.7026300e+04 5.36e-02 5.27e+01 -1.0 8.02e+01 - 3.44e-01 5.57e-0
2f 1
8 1.4909695e+04 3.41e-02 2.87e+01 -1.0 4.22e+01 - 4.65e-01 5.34e-0
1f 1
9 1.5391586e+04 1.84e-02 8.33e+00 -1.0 2.08e+01 - 5.84e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5065083e+04 5.26e-03 5.60e-01 -1.0 6.08e+00 - 9.52e-01 1.00e+0
0h 1
11 1.4709853e+04 1.46e-03 5.13e-01 -1.7 6.66e+00 - 1.00e+00 7.86e-0
1f 1
12 1.4653713e+04 7.17e-04 2.53e-02 -1.7 2.22e+01 - 1.00e+00 1.00e+0
0f 1
13 1.4511902e+04 1.40e-03 9.85e-02 -3.8 2.58e+01 - 7.66e-01 9.01e-0
1f 1
14 1.4479150e+04 2.53e-03 4.54e-02 -3.8 2.34e+00 - 8.16e-01 7.70e-0
1h 1
15 1.4480674e+04 2.77e-04 1.16e-01 -3.8 5.59e-02 - 1.00e+00 9.10e-0
1h 1
16 1.4481114e+04 4.54e-07 2.60e-05 -3.8 3.21e-02 - 1.00e+00 1.00e+0
0f 1
17 1.4480069e+04 4.16e-07 9.97e-04 -5.7 1.49e-01 - 1.00e+00 9.87e-0
1h 1
18 1.4480065e+04 4.52e-11 4.87e-09 -5.7 4.40e-03 - 1.00e+00 1.00e+0
0f 1
19 1.4480052e+04 6.30e-11 3.21e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.4480051730856863e+01 1.4480051730856861e+0
4
Dual infeasibility......: 3.2050993471066866e-09 3.2050993471066866e-0
6
Constraint violation....: 6.3005448081021598e-11 6.3005448081021598e-1
1
Complementarity.........: 2.9156098843751323e-09 2.9156098843751322e-0
6
Overall NLP error.......: 3.2050993471066866e-09 3.2050993471066866e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1459120e+02 1.27e+04 5.23e+01 -1.0 1.28e+04 - 1.16e-03 9.80e-0
3h 1
2 9.1183954e+02 1.27e+04 5.23e+01 -1.0 1.24e+04 - 7.99e-05 1.01e-0
4h 1
3 8.9950201e+02 1.26e+04 5.23e+01 -1.0 1.26e+04 - 3.69e-06 8.34e-0
4f 1
4 5.6782356e+02 1.23e+04 5.24e+01 -1.0 1.26e+04 - 9.10e-04 2.30e-0
2h 1
5 2.4859287e+04 6.74e-02 7.65e+01 -1.0 1.23e+04 - 8.17e-02 1.00e+0
0h 1
6 1.6712478e+04 6.08e-02 3.28e+01 -1.0 2.21e+01 - 5.42e-01 8.87e-0
2f 1
7 1.5184039e+04 1.39e-02 1.39e+01 -1.0 1.32e+01 - 6.26e-01 8.46e-0
1f 1
8 1.5334679e+04 7.43e-03 7.94e-01 -1.0 3.57e+00 - 9.93e-01 5.00e-0
1f 2
9 1.4999739e+04 8.64e-03 2.47e-01 -1.7 6.25e+00 - 1.00e+00 8.45e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4968981e+04 1.95e-03 8.71e-01 -1.7 1.44e+01 - 1.00e+00 5.00e-0
1f 2
11 1.4962340e+04 2.02e-04 1.43e-02 -1.7 7.22e+00 - 1.00e+00 1.00e+0
0h 1
12 1.4804142e+04 5.23e-04 2.51e-02 -3.8 1.99e+01 - 8.43e-01 8.28e-0
1f 1
13 1.4782345e+04 1.68e-04 1.28e-01 -3.8 3.40e+00 - 9.84e-01 7.47e-0
1h 1
14 1.4778369e+04 3.81e-07 1.99e-03 -3.8 8.60e-01 - 9.97e-01 1.00e+0
0h 1
15 1.4778341e+04 1.50e-09 3.85e-06 -3.8 2.42e-04 - 1.00e+00 1.00e+0
0h 1
16 1.4777153e+04 1.80e-08 3.63e-04 -5.7 1.49e-01 - 1.00e+00 9.93e-0
1f 1
17 1.4777148e+04 1.80e-12 3.50e-09 -5.7 1.03e-03 - 1.00e+00 1.00e+0
0f 1
18 1.4777133e+04 2.63e-12 1.79e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.4777133482966034e+01 1.4777133482966034e+0
4
Dual infeasibility......: 1.7934851862067541e-09 1.7934851862067541e-0
6
Constraint violation....: 2.6299032396259747e-12 2.6299032396259747e-1
2
Complementarity.........: 2.9321585781265375e-09 2.9321585781265373e-0
6
Overall NLP error.......: 2.9321585781265375e-09 2.9321585781265373e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6663227e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 4.97e-04 9.80e-0
3h 1
2 8.6384003e+02 1.11e+04 5.24e+01 -1.0 1.09e+04 - 9.14e-05 1.01e-0
4h 1
3 8.5017170e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 3.90e-06 8.21e-0
4f 1
4 4.9538323e+02 1.09e+04 5.25e+01 -1.0 1.11e+04 - 9.01e-04 2.20e-0
2h 1
5 2.2860587e+04 6.00e-02 8.02e+01 -1.0 1.09e+04 - 5.09e-02 1.00e+0
0h 1
6 1.4474022e+04 5.60e-02 5.30e+01 -1.0 7.24e+01 - 3.29e-01 6.09e-0
2f 1
7 1.2886580e+04 3.02e-02 2.74e+01 -1.0 3.88e+01 - 4.77e-01 4.34e-0
1f 1
8 1.2611916e+04 1.45e-02 2.53e+00 -1.0 1.09e+01 - 9.19e-01 5.00e-0
1f 2
9 1.2457830e+04 7.14e-03 1.79e+00 -1.0 7.67e+00 - 1.00e+00 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2560536e+04 5.57e-04 4.23e-02 -1.0 9.96e+01 - 1.00e+00 1.00e+0
0f 1
11 1.2128441e+04 4.45e-04 9.63e-01 -2.5 9.85e+01 - 9.18e-01 5.84e-0
1f 1
12 1.2005875e+04 2.23e-04 2.20e-01 -2.5 4.03e+01 - 9.25e-01 1.00e+0
0f 1
13 1.1979924e+04 3.09e-03 1.97e-02 -2.5 1.15e+00 - 1.00e+00 1.00e+0
0h 1
14 1.1966627e+04 8.07e-04 3.65e-02 -3.8 2.68e+00 - 8.02e-01 1.00e+0
0h 1
15 1.1963692e+04 2.15e-03 1.02e-03 -3.8 4.89e-02 - 1.00e+00 1.00e+0
0h 1
16 1.1963905e+04 4.87e-05 1.38e-04 -3.8 1.22e-02 - 1.00e+00 1.00e+0
0h 1
17 1.1962603e+04 1.01e-04 3.31e-04 -5.7 1.49e-01 - 9.50e-01 9.74e-0
1h 1
18 1.1962589e+04 2.31e-05 3.85e-03 -5.7 3.81e-03 - 1.00e+00 7.72e-0
1h 1
19 1.1962591e+04 9.00e-09 1.28e-06 -5.7 8.67e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.1962577e+04 9.08e-09 1.93e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
21 1.1962576e+04 1.37e-12 6.54e-11 -8.6 3.06e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.1962576470520791e+01 1.1962576470520791e+0
4
Dual infeasibility......: 6.5447236309704640e-11 6.5447236309704640e-0
8
Constraint violation....: 1.3696821454800556e-12 1.3696821454800556e-1
2
Complementarity.........: 2.5092871489790805e-09 2.5092871489790805e-0
6
Overall NLP error.......: 2.5092871489790805e-09 2.5092871489790805e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8777320e+02 9.19e+03 5.24e+01 -1.0 9.28e+03 - 6.64e-04 9.80e-0
3h 1
2 8.8499164e+02 9.19e+03 5.24e+01 -1.0 8.96e+03 - 8.88e-05 1.02e-0
4h 1
3 8.6604553e+02 9.18e+03 5.24e+01 -1.0 9.18e+03 - 4.81e-06 1.03e-0
3f 1
4 4.6753384e+02 8.97e+03 5.24e+01 -1.0 9.18e+03 - 1.16e-03 2.24e-0
2h 1
5 2.1019834e+04 6.31e-02 7.87e+01 -1.0 8.97e+03 - 6.27e-02 1.00e+0
0h 1
6 1.2779542e+04 5.82e-02 5.04e+01 -1.0 5.68e+01 - 3.45e-01 7.15e-0
2f 1
7 1.1474093e+04 2.98e-02 2.31e+01 -1.0 2.74e+01 - 5.30e-01 4.48e-0
1f 1
8 1.0826912e+04 8.86e-03 1.29e+00 -1.0 1.03e+01 - 9.25e-01 7.95e-0
1f 1
9 1.1132672e+04 2.56e-04 7.50e-02 -1.0 3.69e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.0462579e+04 2.14e-03 9.04e-02 -2.5 5.27e+00 - 8.69e-01 8.83e-0
1f 1
11 1.0356962e+04 1.11e-03 4.48e-01 -2.5 8.53e-01 - 1.00e+00 6.12e-0
1f 1
12 1.0357041e+04 2.64e-06 8.39e-03 -2.5 1.73e-01 - 1.00e+00 1.00e+0
0h 1
13 1.0339021e+04 7.22e-06 6.55e-03 -3.8 2.68e+00 - 9.00e-01 8.93e-0
1f 1
14 1.0335760e+04 4.68e-04 3.83e-04 -3.8 2.86e-01 - 1.00e+00 1.00e+0
0f 1
15 1.0334765e+04 6.30e-05 1.15e-02 -5.7 1.49e-01 - 8.13e-01 1.00e+0
0h 1
16 1.0334649e+04 3.63e-05 4.09e-05 -5.7 9.71e-03 - 1.00e+00 1.00e+0
0h 1
17 1.0334650e+04 1.61e-06 3.43e-05 -5.7 1.54e-03 - 1.00e+00 9.90e-0
1h 1
18 1.0334653e+04 3.53e-08 5.13e-07 -5.7 2.92e-04 - 1.00e+00 1.00e+0
0f 1
19 1.0334638e+04 3.96e-08 7.26e-06 -8.6 1.84e-03 - 9.97e-01 9.81e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.0334638e+04 5.32e-13 2.97e-11 -8.6 3.54e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.0334637929425249e+01 1.0334637929425249e+0
4
Dual infeasibility......: 2.9731377955480846e-11 2.9731377955480846e-0
8
Constraint violation....: 5.3168580649298747e-13 5.3168580649298747e-1
3
Complementarity.........: 2.5100786379623132e-09 2.5100786379623131e-0
6
Overall NLP error.......: 2.5100786379623132e-09 2.5100786379623131e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891119e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0611351e+02 6.71e+03 5.23e+01 -1.0 6.46e+03 - 8.39e-05 1.03e-0
4h 1
3 8.7440044e+02 6.70e+03 5.23e+01 -1.0 6.70e+03 - 6.84e-06 1.53e-0
3f 1
4 4.2534165e+02 6.54e+03 5.24e+01 -1.0 6.70e+03 - 1.83e-03 2.26e-0
2h 1
5 1.8469067e+04 6.74e-02 7.67e+01 -1.0 6.54e+03 - 8.35e-02 1.00e+0
0h 1
6 1.0609292e+04 6.07e-02 3.68e+01 -1.0 2.85e+01 - 4.94e-01 9.10e-0
2f 1
7 9.1070968e+03 1.97e-02 1.46e+01 -1.0 1.53e+01 - 6.26e-01 7.49e-0
1f 1
8 9.1804481e+03 5.62e-03 1.19e+00 -1.0 2.08e+00 - 9.93e-01 5.00e-0
1f 2
9 9.3751841e+03 2.91e-04 6.67e-02 -1.0 2.88e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.8198146e+03 2.22e-03 9.09e-02 -2.5 2.66e+01 - 8.56e-01 8.23e-0
1f 1
11 8.6513288e+03 2.12e-03 4.55e-01 -2.5 4.37e+00 - 1.00e+00 7.50e-0
1f 1
12 8.6223061e+03 1.56e-04 4.78e-03 -2.5 1.09e+00 - 1.00e+00 1.00e+0
0h 1
13 8.6058823e+03 4.18e-05 1.61e-01 -3.8 2.68e+00 - 1.00e+00 7.51e-0
1h 1
14 8.6015687e+03 1.44e-07 3.57e-04 -3.8 6.67e-01 - 1.00e+00 1.00e+0
0f 1
15 8.6003429e+03 2.79e-08 9.26e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 8.6003306e+03 1.87e-12 1.33e-08 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
17 8.6003159e+03 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 8.6003158995931841e+00 8.6003158995931844e+0
3
Dual infeasibility......: 4.4776951885514407e-09 4.4776951885514407e-0
6
Constraint violation....: 2.6307983569395788e-12 2.6307983569395788e-1
2
Complementarity.........: 3.6085002362451732e-09 3.6085002362451731e-0
6
Overall NLP error.......: 4.4776951885514407e-09 4.4776951885514407e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0887653e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0575715e+02 4.77e+03 5.23e+01 -1.0 4.05e+03 - 4.23e-05 1.17e-0
4h 1
3 6.7332358e+02 4.72e+03 5.24e+01 -1.0 4.77e+03 - 2.39e-05 1.03e-0
2f 1
4 4.3700870e+02 4.62e+03 5.18e+01 -1.0 4.72e+03 - 1.38e-02 2.11e-0
2h 1
5 1.3037781e+04 7.91e-02 7.80e+01 -1.0 4.62e+03 - 9.53e-02 1.00e+0
0h 1
6 8.3073569e+03 6.95e-02 2.11e+01 -1.0 2.25e+01 - 7.07e-01 1.14e-0
1f 1
7 6.9813415e+03 1.49e-02 1.23e+00 -1.0 1.41e+01 - 9.43e-01 7.79e-0
1f 1
8 7.2864192e+03 1.03e-02 2.48e-01 -1.0 4.36e+00 - 7.68e-01 9.21e-0
1f 1
9 6.8801930e+03 2.49e-03 4.52e-01 -1.7 3.14e+00 - 7.54e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.8460008e+03 6.48e-04 4.84e-01 -1.7 9.17e+00 - 6.82e-01 1.00e+0
0h 1
11 6.8666643e+03 1.93e-05 6.46e-02 -1.7 1.30e+01 - 8.98e-01 1.00e+0
0h 1
12 6.7013261e+03 4.91e-04 2.19e-02 -2.5 2.21e+01 - 9.71e-01 9.47e-0
1f 1
13 6.6703671e+03 1.37e-04 7.88e-02 -3.8 8.29e+00 - 9.83e-01 8.42e-0
1h 1
14 6.6673147e+03 1.79e-07 9.11e-02 -3.8 1.33e+00 - 9.28e-01 1.00e+0
0h 1
15 6.6672355e+03 4.80e-09 2.85e-05 -3.8 1.68e-04 - 1.00e+00 1.00e+0
0h 1
16 6.6659218e+03 1.92e-08 3.88e-03 -5.7 2.97e-01 - 1.00e+00 9.68e-0
1f 1
17 6.6658859e+03 5.75e-12 2.63e-08 -5.7 9.60e-03 - 1.00e+00 1.00e+0
0f 1
18 6.6658693e+03 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 6.6658693183342583e+00 6.6658693183342584e+0
3
Dual infeasibility......: 4.4780425901065617e-09 4.4780425901065617e-0
6
Constraint violation....: 2.6337820813182589e-12 2.6337820813182589e-1
2
Complementarity.........: 3.6085482347115390e-09 3.6085482347115387e-0
6
Overall NLP error.......: 4.4780425901065617e-09 4.4780425901065617e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9478285e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3f 1
2 8.9187540e+02 3.24e+03 5.24e+01 -1.0 3.02e+03 - 9.14e-05 1.06e-0
4h 1
3 8.1655199e+02 3.23e+03 5.24e+01 -1.0 3.24e+03 - 1.38e-05 3.11e-0
3f 1
4 3.3910587e+02 3.16e+03 5.23e+01 -1.0 3.23e+03 - 4.64e-03 2.16e-0
2h 1
5 1.3760479e+04 6.81e-02 7.78e+01 -1.0 3.16e+03 - 8.37e-02 1.00e+0
0h 1
6 6.7546785e+03 6.11e-02 3.98e+01 -1.0 4.44e+01 - 4.66e-01 9.34e-0
2f 1
7 5.3864148e+03 2.95e-02 1.35e+01 -1.0 2.09e+01 - 6.49e-01 5.65e-0
1f 1
8 5.1381255e+03 3.48e-03 7.14e-01 -1.0 6.07e+00 - 9.54e-01 7.93e-0
1h 1
9 4.8058915e+03 9.07e-03 2.89e-01 -1.7 1.90e+00 - 1.00e+00 8.12e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.7469494e+03 1.26e-03 1.39e-01 -1.7 1.88e+01 - 1.00e+00 9.70e-0
1f 1
11 4.6212428e+03 4.91e-04 1.73e-01 -2.5 1.68e+01 - 9.48e-01 8.28e-0
1h 1
12 4.5986044e+03 6.65e-05 4.46e-03 -2.5 2.80e+00 - 1.00e+00 1.00e+0
0f 1
13 4.5763010e+03 1.58e-05 2.73e-02 -3.8 2.68e+00 - 1.00e+00 9.25e-0
1h 1
14 4.5756328e+03 4.87e-08 5.45e-04 -3.8 1.99e-01 - 1.00e+00 1.00e+0
0f 1
15 4.5743308e+03 4.26e-08 4.12e-04 -5.7 1.49e-01 - 1.00e+00 9.91e-0
1f 1
16 4.5743249e+03 1.95e-12 3.00e-08 -5.7 1.33e-03 - 1.00e+00 1.00e+0
0f 1
17 4.5743102e+03 2.58e-12 3.28e-06 -8.6 1.84e-03 - 1.00e+00 9.99e-0
1f 1
18 4.5743102e+03 1.64e-15 4.87e-14 -8.6 1.07e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 4.5743101839832550e+00 4.5743101839832552e+0
3
Dual infeasibility......: 4.8730169145348542e-14 4.8730169145348542e-1
1
Constraint violation....: 1.6360501462616507e-15 1.6360501462616507e-1
5
Complementarity.........: 2.5059125765115490e-09 2.5059125765115489e-0
6
Overall NLP error.......: 2.5059125765115490e-09 2.5059125765115489e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8064252e+02 2.00e+03 5.24e+01 -1.0 2.02e+03 - 5.97e-04 9.81e-0
3f 1
2 8.7760033e+02 2.00e+03 5.24e+01 -1.0 1.79e+03 - 9.81e-05 1.11e-0
4h 1
3 7.4188986e+02 1.99e+03 5.24e+01 -1.0 2.00e+03 - 2.20e-05 5.30e-0
3f 1
4 3.0853037e+02 1.94e+03 5.19e+01 -1.0 1.99e+03 - 1.13e-02 2.08e-0
2f 1
5 1.0454262e+04 7.18e-02 7.81e+01 -1.0 1.94e+03 - 1.01e-01 1.00e+0
0h 1
6 4.9583655e+03 6.28e-02 2.13e+01 -1.0 4.92e+01 - 7.01e-01 1.16e-0
1f 1
7 3.4679380e+03 2.85e-02 2.35e+00 -1.0 2.41e+01 - 9.37e-01 6.11e-0
1f 1
8 3.5502765e+03 4.69e-03 1.40e-01 -1.0 3.47e+00 - 1.00e+00 1.00e+0
0f 1
9 3.0919874e+03 1.73e-03 2.74e-01 -2.5 3.67e+00 - 8.96e-01 7.84e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.0656701e+03 1.76e-05 1.17e-02 -2.5 4.34e-01 - 1.00e+00 1.00e+0
0h 1
11 3.0443578e+03 3.86e-04 9.45e-02 -3.8 2.69e+00 - 7.24e-01 9.81e-0
1f 1
12 3.0404046e+03 2.37e-03 5.59e-03 -3.8 4.63e-02 - 8.29e-01 1.00e+0
0h 1
13 3.0405027e+03 1.41e-04 1.23e-04 -3.8 1.70e-02 - 1.00e+00 1.00e+0
0h 1
14 3.0392763e+03 1.55e-04 1.25e-03 -5.7 1.49e-01 - 9.12e-01 1.00e+0
0h 1
15 3.0392276e+03 4.25e-05 1.02e-05 -5.7 9.60e-03 - 1.00e+00 1.00e+0
0h 1
16 3.0392312e+03 9.25e-07 6.70e-06 -5.7 1.39e-03 - 1.00e+00 1.00e+0
0h 1
17 3.0392191e+03 6.89e-08 7.06e-05 -8.6 1.84e-03 - 1.00e+00 9.41e-0
1h 1
18 3.0392184e+03 8.32e-12 9.00e-11 -8.6 1.08e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 3.0392183801941539e+00 3.0392183801941537e+0
3
Dual infeasibility......: 8.9990918189112608e-11 8.9990918189112608e-0
8
Constraint violation....: 8.3232309933123361e-12 8.3232309933123361e-1
2
Complementarity.........: 2.5077806590822413e-09 2.5077806590822412e-0
6
Overall NLP error.......: 2.5077806590822413e-09 2.5077806590822412e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6577131e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 4.97e-04 9.85e-0
3h 1
2 8.5529111e+02 9.17e+02 5.24e+01 -1.0 6.82e+02 - 7.34e-05 3.86e-0
4h 1
3 2.6219590e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 3.43e-04 2.22e-0
2f 1
4 1.2935511e+04 5.94e-02 8.01e+01 -1.0 8.97e+02 - 4.97e-02 1.00e+0
0h 1
5 4.2970559e+03 5.55e-02 5.39e+01 -1.0 7.40e+01 - 3.17e-01 5.94e-0
2f 1
6 2.7073797e+03 3.01e-02 2.82e+01 -1.0 3.90e+01 - 4.71e-01 4.32e-0
1f 1
7 2.1347600e+03 1.48e-02 2.63e+00 -1.0 1.10e+01 - 9.18e-01 1.00e+0
0f 1
8 2.4862941e+03 4.51e-04 9.18e-02 -1.0 4.08e+00 - 9.96e-01 1.00e+0
0f 1
9 1.8831401e+03 7.45e-04 3.24e-01 -2.5 8.10e+00 - 8.79e-01 7.42e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8122003e+03 2.44e-04 3.40e-01 -2.5 3.82e+00 - 8.83e-01 1.00e+0
0h 1
11 1.8056517e+03 7.22e-04 4.32e-01 -2.5 1.37e+00 - 1.00e+00 1.89e-0
1h 2
12 1.7859100e+03 1.05e-03 1.21e-02 -2.5 9.15e-01 - 1.00e+00 1.00e+0
0h 1
13 1.7616667e+03 1.22e-03 3.34e-02 -3.8 1.08e+01 - 7.93e-01 1.00e+0
0h 1
14 1.7586347e+03 2.33e-03 9.24e-04 -3.8 3.94e-02 - 1.00e+00 1.00e+0
0h 1
15 1.7589630e+03 4.74e-05 1.26e-04 -3.8 1.52e-02 - 1.00e+00 1.00e+0
0h 1
16 1.7572116e+03 1.04e-04 3.69e-04 -5.7 5.95e-01 - 9.51e-01 9.78e-0
1h 1
17 1.7571923e+03 2.28e-05 3.67e-03 -5.7 1.32e-02 - 1.00e+00 7.82e-0
1h 1
18 1.7571934e+03 8.72e-09 1.22e-06 -5.7 2.88e-03 - 1.00e+00 1.00e+0
0f 1
19 1.7571732e+03 9.04e-09 1.92e-05 -8.6 7.37e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7571729e+03 1.37e-12 6.49e-11 -8.6 1.22e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.7571729175254300e+00 1.7571729175254300e+0
3
Dual infeasibility......: 6.4906248359184664e-11 6.4906248359184664e-0
8
Constraint violation....: 1.3683498778505054e-12 1.3683498778505054e-1
2
Complementarity.........: 2.7303725016422028e-09 2.7303725016422028e-0
6
Overall NLP error.......: 2.7303725016422028e-09 2.7303725016422028e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101521e-01 6.4890146112101525e+0
2
Dual infeasibility......: 4.9126605618489413e-09 4.9126605618489413e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984918224e-09 4.3646094984918221e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605618489413e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318724481455e-09 2.1031318724481455e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896894379e-09 2.8882108896894380e-0
6
Overall NLP error.......: 2.8882108896894379e-09 2.8882108896894380e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101521e-01 6.4890146112101525e+0
2
Dual infeasibility......: 4.9126605618489413e-09 4.9126605618489413e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984918224e-09 4.3646094984918221e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605618489413e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.04e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.57e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235660171e+00 1.6104063235660171e+0
3
Dual infeasibility......: 2.4574009793760635e-12 2.4574009793760635e-0
9
Constraint violation....: 7.5703172614159067e-16 7.5703172614159067e-1
6
Complementarity.........: 2.5062163919681798e-09 2.5062163919681799e-0
6
Overall NLP error.......: 2.5062163919681798e-09 2.5062163919681799e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2303872e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 3.31e-04 9.86e-0
3h 1
2 8.0919006e+02 9.17e+02 5.24e+01 -1.0 7.37e+02 - 8.12e-05 5.04e-0
4h 1
3 2.4239398e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 4.72e-04 2.11e-0
2f 1
4 1.2489447e+04 5.50e-02 8.23e+01 -1.0 8.98e+02 - 3.83e-02 1.00e+0
0h 1
5 3.8941148e+03 5.25e-02 5.67e+01 -1.0 8.14e+01 - 3.09e-01 4.98e-0
2f 1
6 1.9112633e+03 3.73e-02 3.04e+01 -1.0 3.92e+01 - 4.68e-01 5.06e-0
1f 1
7 4.6876227e+03 1.23e-02 2.71e+01 -1.0 2.07e+01 - 3.99e-01 1.00e+0
0h 1
8 1.8763004e+03 1.20e-02 1.04e+00 -1.0 2.56e+01 - 9.88e-01 8.91e-0
1f 1
9 1.9981274e+03 1.95e-04 4.76e-02 -1.0 2.98e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7321093e+03 2.19e-04 1.23e+00 -2.5 1.80e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5439398e+03 3.77e-03 1.33e-01 -2.5 7.59e+00 - 7.95e-01 1.00e+0
0f 1
12 1.5209204e+03 5.17e-03 3.09e-01 -2.5 1.82e+00 - 1.00e+00 7.67e-0
1h 1
13 1.5332321e+03 2.41e-04 4.72e-03 -2.5 7.16e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5031438e+03 1.70e-04 2.15e-02 -3.8 1.35e+01 - 9.90e-01 9.29e-0
1h 1
15 1.5019709e+03 7.24e-07 6.84e-05 -3.8 9.19e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003148e+03 3.77e-07 1.78e-04 -5.7 7.43e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.79e-11 2.92e-09 -5.7 4.20e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932765106662e+00 1.5002932765106661e+0
3
Dual infeasibility......: 2.1737237291990485e-09 2.1737237291990485e-0
6
Constraint violation....: 6.2995900163009821e-11 6.2995900163009821e-1
1
Complementarity.........: 2.8882174443513331e-09 2.8882174443513331e-0
6
Overall NLP error.......: 2.8882174443513331e-09 2.8882174443513331e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6555952e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 4.97e-04 9.86e-0
3h 1
2 8.5049278e+02 9.17e+02 5.24e+01 -1.0 7.54e+02 - 7.94e-05 5.56e-0
4h 1
3 2.6243053e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 5.25e-04 2.21e-0
2h 1
4 1.2843590e+04 5.96e-02 8.01e+01 -1.0 8.97e+02 - 5.01e-02 1.00e+0
0h 1
5 4.2877637e+03 5.57e-02 5.36e+01 -1.0 7.35e+01 - 3.21e-01 5.99e-0
2f 1
8 1.351248e+04 1.621968e+04 2.048376e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.56e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1154201e+02 1.56e+04 5.50e+01 -1.0 1.58e+04 - 1.75e-04 9.80e-0
3h 1
2 7.0856325e+02 1.56e+04 5.50e+01 -1.0 1.37e+04 - 2.58e-05 1.13e-0
4h 1
3 6.9842478e+02 1.56e+04 5.50e+01 -1.0 1.56e+04 - 1.71e-05 8.11e-0
4h 1
4 4.8611400e+02 1.53e+04 5.40e+01 -1.0 1.56e+04 - 8.22e-04 1.87e-0
2h 1
5 2.6224118e+04 7.61e-02 8.72e+01 -1.0 1.53e+04 - 2.18e-02 1.00e+0
0h 1
6 1.7795593e+04 7.35e-02 7.55e+01 -1.0 7.72e+01 - 1.43e-01 3.66e-0
2f 1
7 1.6530626e+04 4.63e-02 3.52e+01 -1.0 1.95e+01 - 5.28e-01 3.80e-0
1f 1
8 1.7033908e+04 3.51e-02 1.60e+01 -1.0 1.35e+01 - 5.63e-01 2.50e-0
1f 3
9 1.6692896e+04 7.56e-03 3.27e+00 -1.0 1.33e+00 - 7.86e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6708973e+04 1.97e-04 1.76e+00 -1.0 2.01e+00 - 3.51e-01 1.00e+0
0f 1
11 1.6717240e+04 5.60e-06 6.76e-01 -1.0 2.51e+00 - 6.38e-01 1.00e+0
0f 1
12 1.6724870e+04 2.32e-07 2.96e-01 -1.0 6.97e+00 - 5.55e-01 1.00e+0
0f 1
13 1.6432283e+04 2.18e-04 4.00e-01 -1.7 4.71e+00 - 9.15e-01 7.84e-0
1f 1
14 1.6392559e+04 6.32e-04 2.45e-01 -1.7 2.06e+01 - 6.36e-01 1.00e+0
0f 1
15 1.6404395e+04 5.26e-05 2.20e-03 -1.7 2.20e+01 - 1.00e+00 1.00e+0
0h 1
16 1.6257891e+04 9.80e-04 4.06e-02 -2.5 5.07e+01 - 9.32e-01 1.00e+0
0f 1
17 1.6242899e+04 1.02e-03 1.07e-02 -2.5 3.36e+00 - 1.00e+00 1.00e+0
0h 1
18 1.6222888e+04 1.69e-04 7.84e-02 -3.8 8.73e+00 - 1.00e+00 8.60e-0
1h 1
19 1.6221039e+04 5.53e-07 9.23e-05 -3.8 9.86e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6219702e+04 3.96e-07 8.98e-04 -5.7 4.44e-01 - 1.00e+00 9.79e-0
1h 1
21 1.6219691e+04 1.62e-10 6.34e-09 -5.7 4.14e-03 - 1.00e+00 1.00e+0
0f 1
22 1.6219677e+04 6.68e-11 5.61e-05 -8.6 4.56e-03 - 1.00e+00 9.08e-0
1h 1
23 1.6219676e+04 5.28e-13 1.72e-11 -8.6 7.61e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 23
(scaled) (unscaled)
Objective...............: 1.6219675985021642e+01 1.6219675985021642e+0
4
Dual infeasibility......: 1.7232929670924779e-11 1.7232929670924779e-0
8
Constraint violation....: 5.2841064857034326e-13 5.2841064857034326e-1
3
Complementarity.........: 2.6522766217259662e-09 2.6522766217259663e-0
6
Overall NLP error.......: 2.6522766217259662e-09 2.6522766217259663e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 24
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 24
Number of inequality constraint Jacobian evaluations = 24
Number of Lagrangian Hessian evaluations = 23
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4810922e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 4.08e-04 9.80e-0
3h 1
2 8.4527142e+02 1.50e+04 5.24e+01 -1.0 1.43e+04 - 4.57e-05 1.04e-0
4h 1
3 8.4408971e+02 1.50e+04 5.24e+01 -1.0 1.48e+04 - 6.68e-06 8.98e-0
5h 1
4 8.4261078e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 9.47e-05 1.14e-0
4h 1
5 5.6305260e+02 1.46e+04 5.26e+01 -1.0 1.50e+04 - 2.12e-04 2.18e-0
2f 1
6 2.6852132e+04 5.72e-02 8.10e+01 -1.0 1.46e+04 - 4.54e-02 1.00e+0
0h 1
7 1.8160239e+04 5.37e-02 5.35e+01 -1.0 8.07e+01 - 3.31e-01 5.57e-0
2f 1
8 1.6091868e+04 3.18e-02 2.93e+01 -1.0 4.23e+01 - 4.61e-01 5.22e-0
1f 1
9 1.6573457e+04 1.25e-02 2.80e+00 -1.0 2.05e+01 - 8.62e-01 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6059720e+04 5.16e-03 1.93e-01 -1.0 1.07e+01 - 9.56e-01 1.00e+0
0f 1
11 1.5779865e+04 1.30e-03 5.15e-01 -1.7 3.99e+00 - 1.00e+00 7.88e-0
1f 1
12 1.5748585e+04 3.76e-04 2.59e-02 -1.7 1.83e+01 - 1.00e+00 1.00e+0
0f 1
13 1.5603712e+04 1.15e-03 1.16e-01 -3.8 2.23e+01 - 7.67e-01 9.20e-0
1f 1
14 1.5574252e+04 1.47e-03 3.30e-02 -3.8 2.13e+00 - 8.19e-01 7.40e-0
1h 1
15 1.5574867e+04 3.45e-06 3.28e-02 -3.8 1.45e-01 - 9.81e-01 1.00e+0
0h 1
16 1.5573967e+04 8.69e-05 3.47e-04 -3.8 1.21e-02 - 1.00e+00 1.00e+0
0h 1
17 1.5572894e+04 1.51e-05 7.65e-03 -5.7 1.49e-01 - 9.11e-01 9.84e-0
1h 1
18 1.5572844e+04 4.81e-07 1.69e-06 -5.7 2.37e-03 - 1.00e+00 1.00e+0
0h 1
19 1.5572829e+04 4.63e-09 3.82e-07 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5572829e+04 9.77e-15 3.67e-14 -8.6 1.46e-07 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.5572828722691977e+01 1.5572828722691977e+0
4
Dual infeasibility......: 3.6730082671370773e-14 3.6730082671370773e-1
1
Constraint violation....: 9.7699626167013776e-15 9.7699626167013776e-1
5
Complementarity.........: 2.5059091823756285e-09 2.5059091823756287e-0
6
Overall NLP error.......: 2.5059091823756285e-09 2.5059091823756287e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0892329e+02 1.39e+04 5.23e+01 -1.0 1.40e+04 - 1.00e-03 9.80e-0
3h 1
2 9.0612191e+02 1.39e+04 5.23e+01 -1.0 1.31e+04 - 3.81e-05 1.05e-0
4h 1
3 8.9511700e+02 1.39e+04 5.23e+01 -1.0 1.39e+04 - 8.20e-06 8.13e-0
4f 1
4 8.7674880e+02 1.39e+04 5.23e+01 -1.0 1.39e+04 - 8.22e-04 1.40e-0
3h 1
5 6.0977410e+02 1.36e+04 5.23e+01 -1.0 1.39e+04 - 2.99e-03 2.26e-0
2f 1
6 2.4896826e+04 6.97e-02 7.72e+01 -1.0 1.36e+04 - 8.49e-02 1.00e+0
0h 1
7 1.7738615e+04 6.25e-02 3.39e+01 -1.0 2.70e+01 - 5.35e-01 9.41e-0
2f 1
8 1.6225211e+04 1.99e-02 1.23e+01 -1.0 1.51e+01 - 6.56e-01 7.71e-0
1f 1
9 1.6348789e+04 6.43e-03 1.00e+00 -1.0 2.79e+00 - 9.83e-01 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6568218e+04 2.08e-04 5.53e-02 -1.0 2.31e+01 - 1.00e+00 1.00e+0
0f 1
11 1.6005548e+04 2.29e-03 8.75e-02 -2.5 2.35e+01 - 8.55e-01 8.31e-0
1f 1
12 1.5841402e+04 2.12e-03 4.45e-01 -2.5 8.58e-01 - 1.00e+00 7.52e-0
1f 1
13 1.5814510e+04 1.50e-04 4.78e-03 -2.5 2.02e-01 - 1.00e+00 1.00e+0
0h 1
14 1.5797508e+04 4.00e-05 1.56e-01 -3.8 3.27e+00 - 1.00e+00 7.54e-0
1h 1
15 1.5793371e+04 1.39e-07 3.53e-04 -3.8 5.34e-01 - 1.00e+00 1.00e+0
0f 1
16 1.5792148e+04 2.81e-08 9.34e-04 -5.7 1.45e-01 - 1.00e+00 9.86e-0
1h 1
17 1.5792137e+04 1.87e-12 1.34e-08 -5.7 1.21e-03 - 1.00e+00 1.00e+0
0f 1
18 1.5792122e+04 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5792122162025317e+01 1.5792122162025316e+0
4
Dual infeasibility......: 4.4776946995508499e-09 4.4776946995508499e-0
6
Constraint violation....: 2.6309926459688882e-12 2.6309926459688882e-1
2
Complementarity.........: 3.6084996734514116e-09 3.6084996734514116e-0
6
Overall NLP error.......: 4.4776946995508499e-09 4.4776946995508499e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4549022e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.98e-04 9.80e-0
3f 1
2 8.4268289e+02 1.27e+04 5.24e+01 -1.0 1.24e+04 - 9.30e-05 1.01e-0
4h 1
3 8.3185819e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 3.40e-06 7.06e-0
4f 1
4 5.1298182e+02 1.24e+04 5.26e+01 -1.0 1.26e+04 - 7.64e-04 2.15e-0
2h 1
5 2.4253114e+04 5.75e-02 8.12e+01 -1.0 1.24e+04 - 4.59e-02 1.00e+0
0h 1
6 1.5783829e+04 5.39e-02 5.24e+01 -1.0 7.95e+01 - 3.46e-01 5.65e-0
2f 1
7 1.3665691e+04 3.43e-02 2.85e+01 -1.0 4.22e+01 - 4.66e-01 5.35e-0
1f 1
8 1.4122490e+04 1.83e-02 6.66e+00 -1.0 2.17e+01 - 6.31e-01 2.50e-0
1f 3
9 1.3813325e+04 5.37e-03 5.08e-01 -1.0 6.56e+00 - 9.50e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3462116e+04 1.47e-03 5.06e-01 -1.7 6.30e+00 - 1.00e+00 7.87e-0
1f 1
11 1.3408535e+04 6.08e-04 2.59e-02 -1.7 1.83e+01 - 1.00e+00 1.00e+0
0f 1
12 1.3266988e+04 1.38e-03 1.17e-01 -3.8 1.99e+01 - 7.65e-01 9.24e-0
1f 1
13 1.3231850e+04 2.70e-03 2.12e-02 -3.8 2.32e+00 - 8.15e-01 8.20e-0
1h 1
14 1.3233706e+04 3.11e-04 1.34e-01 -3.8 2.70e-01 - 1.00e+00 9.08e-0
1h 1
15 1.3234117e+04 5.09e-07 2.22e-05 -3.8 1.24e-01 - 1.00e+00 1.00e+0
0f 1
16 1.3233074e+04 4.18e-07 2.33e-03 -5.7 1.49e-01 - 1.00e+00 9.77e-0
1h 1
17 1.3233064e+04 4.90e-11 2.26e-08 -5.7 2.76e-02 - 1.00e+00 1.00e+0
0f 1
18 1.3233051e+04 6.30e-11 4.40e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.3233050894275006e+01 1.3233050894275006e+0
4
Dual infeasibility......: 4.4004633115598922e-09 4.4004633115598922e-0
6
Constraint violation....: 6.2987018378812820e-11 6.2987018378812820e-1
1
Complementarity.........: 3.8025353377998893e-09 3.8025353377998894e-0
6
Overall NLP error.......: 4.4004633115598922e-09 4.4004633115598922e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9423562e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 7.40e-04 9.80e-0
3h 1
2 8.9139414e+02 1.11e+04 5.24e+01 -1.0 1.04e+04 - 4.19e-05 1.06e-0
4h 1
3 8.3488164e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 9.61e-06 3.45e-0
3h 1
4 5.3570100e+02 1.08e+04 5.24e+01 -1.0 1.11e+04 - 3.83e-03 2.15e-0
2h 1
5 2.1931798e+04 6.70e-02 7.80e+01 -1.0 1.08e+04 - 7.91e-02 1.00e+0
0h 1
6 1.4667211e+04 6.05e-02 4.26e+01 -1.0 4.60e+01 - 4.33e-01 8.85e-0
2f 1
7 1.3326615e+04 2.85e-02 1.59e+01 -1.0 2.17e+01 - 6.16e-01 5.37e-0
1f 1
8 1.2997264e+04 4.49e-03 9.27e-01 -1.0 7.16e+00 - 9.47e-01 7.56e-0
1f 1
9 1.3242733e+04 1.42e-04 5.95e-02 -1.0 6.07e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2651572e+04 2.19e-03 8.34e-02 -2.5 4.03e+00 - 8.61e-01 8.44e-0
1f 1
11 1.2481370e+04 2.15e-03 3.34e-01 -2.5 8.77e-01 - 1.00e+00 7.83e-0
1f 1
12 1.2456352e+04 1.54e-04 4.69e-03 -2.5 1.75e-01 - 1.00e+00 1.00e+0
0h 1
13 1.2434410e+04 2.69e-05 5.49e-02 -3.8 5.36e+00 - 1.00e+00 8.57e-0
1h 1
14 1.2432066e+04 6.78e-08 5.88e-04 -3.8 7.67e-01 - 1.00e+00 1.00e+0
0f 1
15 1.2430629e+04 4.01e-08 1.80e-04 -5.7 2.97e-01 - 1.00e+00 9.95e-0
1f 1
16 1.2430626e+04 1.89e-12 1.54e-08 -5.7 1.51e-03 - 1.00e+00 1.00e+0
0f 1
17 1.2430610e+04 2.56e-12 9.46e-07 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
18 1.2430610e+04 7.31e-15 2.73e-14 -8.6 4.63e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.2430609723239622e+01 1.2430609723239621e+0
4
Dual infeasibility......: 2.7253078974276967e-14 2.7253078974276967e-1
1
Constraint violation....: 7.3073820946400598e-15 7.3073820946400598e-1
5
Complementarity.........: 2.5586622994281037e-09 2.5586622994281035e-0
6
Overall NLP error.......: 2.5586622994281037e-09 2.5586622994281035e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891076e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0602418e+02 9.19e+03 5.23e+01 -1.0 8.41e+03 - 3.92e-05 1.08e-0
4h 1
3 8.1828318e+02 9.14e+03 5.24e+01 -1.0 9.19e+03 - 1.24e-05 4.81e-0
3h 1
4 5.0911015e+02 8.95e+03 5.22e+01 -1.0 9.14e+03 - 5.53e-03 2.13e-0
2h 1
5 1.9574028e+04 7.15e-02 7.74e+01 -1.0 8.95e+03 - 8.67e-02 1.00e+0
0h 1
6 1.2972291e+04 6.39e-02 3.14e+01 -1.0 2.60e+01 - 5.69e-01 9.74e-0
2f 1
7 1.1456842e+04 1.98e-02 1.02e+01 -1.0 1.50e+01 - 6.92e-01 7.89e-0
1f 1
8 1.1617387e+04 7.35e-03 8.73e-01 -1.0 3.38e+00 - 9.92e-01 5.00e-0
1f 2
9 1.1302278e+04 1.11e-02 5.82e-01 -1.7 1.02e+01 - 4.79e-01 8.28e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1281767e+04 7.37e-04 7.28e-01 -1.7 1.24e+01 - 6.64e-01 1.00e+0
0f 1
11 1.1287352e+04 8.85e-05 2.68e-03 -1.7 1.24e+01 - 1.00e+00 1.00e+0
0h 1
12 1.1111823e+04 6.08e-04 2.66e-02 -2.5 2.82e+01 - 9.71e-01 9.80e-0
1f 1
13 1.1087102e+04 1.50e-04 7.78e-02 -3.8 5.87e+00 - 9.85e-01 8.32e-0
1h 1
14 1.1084765e+04 1.87e-07 1.02e-01 -3.8 9.88e-01 - 9.18e-01 1.00e+0
0h 1
15 1.1084687e+04 4.55e-09 2.92e-05 -3.8 1.51e-04 - 1.00e+00 1.00e+0
0h 1
16 1.1083373e+04 1.92e-08 3.89e-03 -5.7 2.97e-01 - 1.00e+00 9.68e-0
1f 1
17 1.1083337e+04 5.76e-12 2.63e-08 -5.7 9.61e-03 - 1.00e+00 1.00e+0
0f 1
18 1.1083321e+04 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1083320722691914e+01 1.1083320722691913e+0
4
Dual infeasibility......: 4.4780436825080131e-09 4.4780436825080131e-0
6
Constraint violation....: 2.6338167757877784e-12 2.6338167757877784e-1
2
Complementarity.........: 3.6085484068652726e-09 3.6085484068652724e-0
6
Overall NLP error.......: 4.4780436825080131e-09 4.4780436825080131e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2299660e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1994562e+02 6.71e+03 5.23e+01 -1.0 5.82e+03 - 3.44e-05 1.14e-0
4h 1
3 7.2850970e+02 6.64e+03 5.23e+01 -1.0 6.70e+03 - 1.95e-05 9.17e-0
3f 1
4 4.9339558e+02 6.50e+03 5.19e+01 -1.0 6.64e+03 - 1.16e-02 2.10e-0
2h 1
5 1.5628518e+04 8.10e-02 7.81e+01 -1.0 6.50e+03 - 8.90e-02 1.00e+0
0h 1
6 1.0636045e+04 7.19e-02 2.13e+01 -1.0 1.24e+01 - 7.05e-01 1.06e-0
1f 1
7 9.4596865e+03 2.23e-02 3.10e+00 -1.0 9.08e+00 - 8.57e-01 8.74e-0
1f 1
8 9.7561576e+03 1.77e-02 1.82e-01 -1.0 2.44e+00 - 9.72e-01 9.15e-0
1f 1
9 9.3947720e+03 3.04e-03 1.24e+00 -1.7 9.20e+00 - 3.41e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.3664918e+03 2.52e-04 4.32e-01 -1.7 9.43e+00 - 7.89e-01 1.00e+0
0h 1
11 9.3813129e+03 1.27e-04 2.73e-03 -1.7 1.36e+01 - 1.00e+00 1.00e+0
0f 1
12 9.2103847e+03 4.93e-04 1.97e-02 -2.5 2.85e+01 - 9.73e-01 9.61e-0
1f 1
13 9.1898008e+03 1.57e-04 2.20e-01 -3.8 6.42e+00 - 9.95e-01 7.13e-0
1h 1
14 9.1841535e+03 3.49e-07 3.45e-04 -3.8 1.84e+00 - 1.00e+00 1.00e+0
0h 1
15 9.1828157e+03 1.96e-08 4.30e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
16 9.1828008e+03 8.27e-13 4.93e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 9.1828007580548601e+00 9.1828007580548601e+0
3
Dual infeasibility......: 4.9313791395556178e-10 4.9313791395556178e-0
7
Constraint violation....: 8.2710227555793381e-13 8.2710227555793381e-1
3
Complementarity.........: 4.1497701212167727e-09 4.1497701212167727e-0
6
Overall NLP error.......: 4.1497701212167727e-09 4.1497701212167727e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3004795e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 2.02e-03 9.80e-0
3h 1
2 9.2712367e+02 4.77e+03 5.23e+01 -1.0 4.47e+03 - 6.97e-05 1.06e-0
4h 1
3 8.6230721e+02 4.76e+03 5.23e+01 -1.0 4.77e+03 - 1.09e-05 2.80e-0
3f 1
4 3.9458856e+02 4.65e+03 5.23e+01 -1.0 4.76e+03 - 3.78e-03 2.20e-0
2h 1
5 1.5936731e+04 7.51e-02 7.75e+01 -1.0 4.65e+03 - 7.99e-02 1.00e+0
0h 1
6 9.0816127e+03 6.78e-02 2.29e+01 -1.0 8.31e+00 - 6.77e-01 9.05e-0
2f 1
7 7.8525062e+03 3.47e-02 8.39e+00 -1.0 6.89e+00 - 7.10e-01 1.00e+0
0f 1
8 8.1952987e+03 2.05e-02 2.98e-01 -1.0 2.41e+00 - 9.96e-01 9.69e-0
1f 1
9 7.7640020e+03 3.95e-03 3.54e-01 -1.7 1.12e+01 - 8.33e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.7107177e+03 7.81e-04 3.48e-02 -1.7 7.24e+00 - 1.00e+00 1.00e+0
0h 1
11 7.5664016e+03 4.99e-04 2.40e-02 -2.5 1.64e+01 - 9.77e-01 9.84e-0
1f 1
12 7.5511474e+03 1.19e-04 1.70e-01 -3.8 2.89e+00 - 9.96e-01 7.71e-0
1h 1
13 7.5477479e+03 2.23e-07 1.25e-04 -3.8 6.61e-01 - 1.00e+00 1.00e+0
0f 1
14 7.5465612e+03 1.74e-08 3.02e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
15 7.5465477e+03 1.28e-12 4.23e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 7.5465477132506864e+00 7.5465477132506867e+0
3
Dual infeasibility......: 4.2290145445518724e-10 4.2290145445518724e-0
7
Constraint violation....: 1.2839590501911857e-12 1.2839590501911857e-1
2
Complementarity.........: 2.5905430566365087e-09 2.5905430566365088e-0
6
Overall NLP error.......: 2.5905430566365087e-09 2.5905430566365088e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9478285e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3f 1
2 8.9187540e+02 3.24e+03 5.24e+01 -1.0 3.02e+03 - 9.14e-05 1.06e-0
4h 1
3 8.1655199e+02 3.23e+03 5.24e+01 -1.0 3.24e+03 - 1.38e-05 3.11e-0
3f 1
4 3.3910587e+02 3.16e+03 5.23e+01 -1.0 3.23e+03 - 4.64e-03 2.16e-0
2h 1
5 1.3760479e+04 6.81e-02 7.78e+01 -1.0 3.16e+03 - 8.37e-02 1.00e+0
0h 1
6 6.7546785e+03 6.11e-02 3.98e+01 -1.0 4.44e+01 - 4.66e-01 9.34e-0
2f 1
7 5.3864148e+03 2.95e-02 1.35e+01 -1.0 2.09e+01 - 6.49e-01 5.65e-0
1f 1
8 5.1381255e+03 3.48e-03 7.14e-01 -1.0 6.07e+00 - 9.54e-01 7.93e-0
1h 1
9 4.8058915e+03 9.07e-03 2.89e-01 -1.7 1.90e+00 - 1.00e+00 8.12e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.7469494e+03 1.26e-03 1.39e-01 -1.7 1.88e+01 - 1.00e+00 9.70e-0
1f 1
11 4.6212428e+03 4.91e-04 1.73e-01 -2.5 1.68e+01 - 9.48e-01 8.28e-0
1h 1
12 4.5986044e+03 6.65e-05 4.46e-03 -2.5 2.80e+00 - 1.00e+00 1.00e+0
0f 1
13 4.5763010e+03 1.58e-05 2.73e-02 -3.8 2.68e+00 - 1.00e+00 9.25e-0
1h 1
14 4.5756328e+03 4.87e-08 5.45e-04 -3.8 1.99e-01 - 1.00e+00 1.00e+0
0f 1
15 4.5743308e+03 4.26e-08 4.12e-04 -5.7 1.49e-01 - 1.00e+00 9.91e-0
1f 1
16 4.5743249e+03 1.95e-12 3.00e-08 -5.7 1.33e-03 - 1.00e+00 1.00e+0
0f 1
17 4.5743102e+03 2.58e-12 3.28e-06 -8.6 1.84e-03 - 1.00e+00 9.99e-0
1f 1
18 4.5743102e+03 1.64e-15 4.85e-14 -8.6 1.07e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 4.5743101863089537e+00 4.5743101863089532e+0
3
Dual infeasibility......: 4.8519907901130077e-14 4.8519907901130077e-1
1
Constraint violation....: 1.6357795390873376e-15 1.6357795390873376e-1
5
Complementarity.........: 2.5059125764796103e-09 2.5059125764796103e-0
6
Overall NLP error.......: 2.5059125764796103e-09 2.5059125764796103e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1589983e+02 2.00e+03 5.23e+01 -1.0 2.02e+03 - 1.20e-03 9.81e-0
3h 1
2 9.1284040e+02 2.00e+03 5.23e+01 -1.0 1.76e+03 - 8.79e-05 1.12e-0
4h 1
3 7.5553664e+02 1.98e+03 5.23e+01 -1.0 2.00e+03 - 2.36e-05 6.19e-0
3f 1
4 3.3207786e+02 1.94e+03 5.17e+01 -1.0 1.98e+03 - 1.43e-02 2.11e-0
2f 1
5 1.0382778e+04 8.33e-02 7.88e+01 -1.0 1.94e+03 - 9.31e-02 1.00e+0
0h 1
6 5.6943684e+03 7.34e-02 2.20e+01 -1.0 1.68e+01 - 7.06e-01 1.12e-0
1f 1
7 4.4774579e+03 2.03e-02 9.10e-01 -1.0 1.14e+01 - 9.52e-01 8.13e-0
1f 1
8 4.7575244e+03 1.61e-02 1.67e-01 -1.0 3.79e+00 - 1.00e+00 9.04e-0
1h 1
9 4.2921560e+03 8.06e-03 3.60e-01 -2.5 2.51e+00 - 7.66e-01 9.31e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2203683e+03 2.26e-03 1.60e-01 -2.5 7.02e-01 - 7.86e-01 6.98e-0
1h 1
11 4.1989190e+03 4.19e-04 1.47e-02 -2.5 2.21e-01 - 1.00e+00 9.90e-0
1h 1
12 4.1815716e+03 2.41e-06 1.05e-01 -3.8 2.69e+00 - 9.17e-01 1.00e+0
0h 1
13 4.1816963e+03 8.87e-10 7.45e-06 -3.8 3.45e-03 - 1.00e+00 1.00e+0
0h 1
14 4.1805057e+03 1.79e-08 1.82e-04 -5.7 1.49e-01 - 1.00e+00 9.96e-0
1f 1
15 4.1805039e+03 1.80e-12 2.29e-09 -5.7 5.97e-04 - 1.00e+00 1.00e+0
0f 1
16 4.1804892e+03 2.63e-12 1.52e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 4.1804891516418712e+00 4.1804891516418711e+0
3
Dual infeasibility......: 1.5189627709069957e-09 1.5189627709069957e-0
6
Constraint violation....: 2.6289040389038121e-12 2.6289040389038121e-1
2
Complementarity.........: 2.8635057235282414e-09 2.8635057235282414e-0
6
Overall NLP error.......: 2.8635057235282414e-09 2.8635057235282414e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2303872e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 3.31e-04 9.86e-0
3h 1
2 8.0919006e+02 9.17e+02 5.24e+01 -1.0 7.37e+02 - 8.12e-05 5.04e-0
4h 1
3 2.4239398e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 4.72e-04 2.11e-0
2f 1
4 1.2489447e+04 5.50e-02 8.23e+01 -1.0 8.98e+02 - 3.83e-02 1.00e+0
0h 1
5 3.8941148e+03 5.25e-02 5.67e+01 -1.0 8.14e+01 - 3.09e-01 4.98e-0
2f 1
6 1.9112633e+03 3.73e-02 3.04e+01 -1.0 3.92e+01 - 4.68e-01 5.06e-0
1f 1
7 4.6876227e+03 1.23e-02 2.71e+01 -1.0 2.07e+01 - 3.99e-01 1.00e+0
0h 1
8 1.8763004e+03 1.20e-02 1.04e+00 -1.0 2.56e+01 - 9.88e-01 8.91e-0
1f 1
9 1.9981274e+03 1.95e-04 4.76e-02 -1.0 2.98e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7321093e+03 2.19e-04 1.23e+00 -2.5 1.80e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5439398e+03 3.77e-03 1.33e-01 -2.5 7.59e+00 - 7.95e-01 1.00e+0
0f 1
12 1.5209204e+03 5.17e-03 3.09e-01 -2.5 1.82e+00 - 1.00e+00 7.67e-0
1h 1
13 1.5332321e+03 2.41e-04 4.72e-03 -2.5 7.16e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5031438e+03 1.70e-04 2.15e-02 -3.8 1.35e+01 - 9.90e-01 9.29e-0
1h 1
15 1.5019709e+03 7.24e-07 6.84e-05 -3.8 9.19e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003148e+03 3.77e-07 1.78e-04 -5.7 7.43e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.79e-11 2.92e-09 -5.7 4.20e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932765106665e+00 1.5002932765106664e+0
3
Dual infeasibility......: 2.1737235069511557e-09 2.1737235069511557e-0
6
Constraint violation....: 6.2995664240617089e-11 6.2995664240617089e-1
1
Complementarity.........: 2.8882174443541434e-09 2.8882174443541435e-0
6
Overall NLP error.......: 2.8882174443541434e-09 2.8882174443541435e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1584841e+02 1.09e+02 1.13e+02 -1.0 3.76e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1398692e+04 5.38e-02 8.36e+01 -1.0 4.53e+01 - 3.10e-02 1.00e+0
0h 1
3 2.7848916e+03 5.17e-02 6.48e+01 -1.0 8.43e+01 - 2.27e-01 4.32e-0
2f 1
4 9.8155785e+02 4.24e-02 3.38e+01 -1.0 3.41e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5909723e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.21e-01 1.00e+0
0h 1
6 9.4491032e+02 1.01e-02 8.73e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6264865e+02 4.59e-04 6.60e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536469e+02 1.94e-03 1.94e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379741e+02 3.25e-03 6.12e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140235e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388164e+02 1.57e-04 1.69e-02 -3.8 7.57e-01 - 9.93e-01 9.41e-0
1h 1
12 5.8370191e+02 7.28e-07 6.65e-05 -3.8 8.63e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278679e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.06e-09 -5.7 3.41e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148935385e-01 5.8277753148935381e+0
2
Dual infeasibility......: 2.0880540103884580e-09 2.0880540103884580e-0
6
Constraint violation....: 6.2994123806170421e-11 6.2994123806170421e-1
1
Complementarity.........: 2.8882094461377354e-09 2.8882094461377355e-0
6
Overall NLP error.......: 2.8882094461377354e-09 2.8882094461377355e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1584841e+02 1.09e+02 1.13e+02 -1.0 3.76e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1398692e+04 5.38e-02 8.36e+01 -1.0 4.53e+01 - 3.10e-02 1.00e+0
0h 1
3 2.7848916e+03 5.17e-02 6.48e+01 -1.0 8.43e+01 - 2.27e-01 4.32e-0
2f 1
4 9.8155785e+02 4.24e-02 3.38e+01 -1.0 3.41e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5909723e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.21e-01 1.00e+0
0h 1
6 9.4491032e+02 1.01e-02 8.73e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6264865e+02 4.59e-04 6.60e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536469e+02 1.94e-03 1.94e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379741e+02 3.25e-03 6.12e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140235e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388164e+02 1.57e-04 1.69e-02 -3.8 7.57e-01 - 9.93e-01 9.41e-0
1h 1
12 5.8370191e+02 7.28e-07 6.65e-05 -3.8 8.63e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278679e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.06e-09 -5.7 3.41e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148935385e-01 5.8277753148935381e+0
2
Dual infeasibility......: 2.0880540103884580e-09 2.0880540103884580e-0
6
Constraint violation....: 6.2994123806170421e-11 6.2994123806170421e-1
1
Complementarity.........: 2.8882094461377354e-09 2.8882094461377355e-0
6
Overall NLP error.......: 2.8882094461377354e-09 2.8882094461377355e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.77e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5003661e+02 7.50e+01 9.04e+01 -1.0 2.59e+01 - 3.83e-04 3.52e-0
2f 1
2 1.1818872e+04 5.63e-02 8.12e+01 -1.0 2.87e+01 - 4.64e-02 1.00e+0
0h 1
3 3.1585743e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.65e-0
2f 1
4 1.0154810e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8148897e+03 7.28e-03 1.55e+01 -1.0 1.93e+01 - 6.11e-01 1.00e+0
0h 1
6 1.1196673e+03 5.40e-03 4.04e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8244210e+02 9.99e-04 2.10e-01 -1.7 5.71e+00 - 1.00e+00 8.87e-0
1h 1
8 7.2817516e+02 8.46e-04 1.35e-02 -1.7 3.45e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0982259e+02 1.50e-03 1.13e-01 -3.8 4.49e+00 - 7.71e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8216110e+02 2.17e-03 7.23e-02 -3.8 2.11e+00 - 8.07e-01 7.40e-0
1h 1
11 5.8336684e+02 9.52e-05 4.78e-02 -3.8 3.17e-02 - 1.00e+00 9.56e-0
1h 1
12 5.8368716e+02 2.82e-07 1.33e-05 -3.8 3.28e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278928e+02 4.12e-07 5.39e-04 -5.7 3.47e-02 - 1.00e+00 9.91e-0
1h 1
14 5.8278859e+02 4.36e-11 3.52e-09 -5.7 2.10e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.65e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753111572772e-01 5.8277753111572770e+0
2
Dual infeasibility......: 2.6503248466384396e-09 2.6503248466384396e-0
6
Constraint violation....: 6.3002297823189224e-11 6.3002297823189224e-1
1
Complementarity.........: 2.8882681473527046e-09 2.8882681473527046e-0
6
Overall NLP error.......: 2.8882681473527046e-09 2.8882681473527046e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.27e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9796473e+02 4.09e+01 5.94e+01 -1.0 1.42e+01 - 6.99e-04 4.23e-0
2f 1
2 1.2226497e+04 6.07e-02 7.87e+01 -1.0 1.80e+01 - 7.07e-02 1.00e+0
0h 1
3 3.6201832e+03 5.54e-02 5.15e+01 -1.0 5.45e+01 - 3.33e-01 7.87e-0
2f 1
4 2.3523812e+03 2.93e-02 2.28e+01 -1.0 2.70e+01 - 5.45e-01 4.46e-0
1f 1
5 1.7571767e+03 8.49e-03 1.17e+00 -1.0 9.96e+00 - 9.27e-01 7.68e-0
1f 1
6 2.0298800e+03 3.42e-04 8.15e-02 -1.0 3.35e+00 - 1.00e+00 1.00e+0
0h 1
7 1.4033455e+03 2.08e-03 8.15e-02 -2.5 4.87e+00 - 8.66e-01 8.50e-0
1f 1
8 1.2236679e+03 2.16e-03 2.06e-01 -2.5 1.05e+00 - 1.00e+00 8.33e-0
1f 1
9 1.2066818e+03 8.65e-05 3.81e-03 -2.5 1.49e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1969333e+03 4.60e-05 1.08e+00 -3.8 9.70e-02 - 1.00e+00 4.99e-0
1h 1
11 1.1949894e+03 3.31e-07 1.13e-01 -3.8 3.83e-02 - 9.68e-01 1.00e+0
0f 1
12 1.1939528e+03 1.38e-08 1.76e-03 -3.8 3.31e-02 - 1.00e+00 1.00e+0
0H 1
13 1.1941496e+03 1.10e-05 2.71e-04 -3.8 3.66e-03 - 1.00e+00 1.00e+0
0f 1
14 1.1935294e+03 1.78e-06 6.37e-02 -5.7 1.23e-02 - 7.78e-01 9.68e-0
1h 1
15 1.1933614e+03 1.24e-05 2.14e-04 -5.7 5.02e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1933675e+03 2.91e-08 2.24e-06 -5.7 2.67e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1933542e+03 2.76e-08 9.71e-06 -8.6 2.46e-04 - 9.82e-01 9.89e-0
1h 1
18 1.1933541e+03 2.43e-13 3.27e-11 -8.6 1.97e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1933540960405655e+00 1.1933540960405655e+0
3
Dual infeasibility......: 3.2688513523482524e-11 3.2688513523482524e-0
8
Constraint violation....: 2.4291679778798425e-13 2.4291679778798425e-1
3
Complementarity.........: 2.5120652665544336e-09 2.5120652665544335e-0
6
Overall NLP error.......: 2.5120652665544336e-09 2.5120652665544335e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2278116e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 3.31e-04 9.87e-0
3h 1
2 8.0655676e+02 9.17e+02 5.24e+01 -1.0 7.64e+02 - 9.12e-05 5.91e-0
4h 1
3 6.8551356e+02 9.13e+02 5.24e+01 -1.0 9.17e+02 - 5.58e-04 4.52e-0
3h 1
4 2.5424757e+02 8.94e+02 5.24e+01 -1.0 9.13e+02 - 5.37e-03 2.03e-0
2f 1
5 1.0171556e+04 5.97e-02 8.27e+01 -1.0 8.94e+02 - 4.73e-02 1.00e+0
0h 1
6 3.6641639e+03 5.57e-02 4.00e+01 -1.0 6.42e+01 - 5.07e-01 6.19e-0
2f 1
7 1.8848290e+03 3.80e-02 1.82e+01 -1.0 3.83e+01 - 5.39e-01 4.87e-0
1f 1
8 2.8688369e+03 3.43e-03 5.12e+00 -1.0 6.15e+00 - 8.07e-01 1.00e+0
0f 1
9 2.1131666e+03 1.02e-03 8.43e-02 -1.0 6.46e+00 - 9.89e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6956506e+03 7.22e-04 4.22e-01 -2.5 7.50e+00 - 9.09e-01 7.34e-0
1f 1
11 1.5454290e+03 3.09e-03 2.28e-01 -2.5 7.79e+00 - 7.23e-01 1.00e+0
0f 1
12 1.5242481e+03 2.42e-03 2.17e-01 -2.5 1.78e+00 - 1.00e+00 8.40e-0
1h 1
13 1.5335197e+03 1.10e-04 3.94e-03 -2.5 4.58e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5029409e+03 1.62e-04 2.15e-02 -3.8 1.39e+01 - 9.92e-01 9.31e-0
1h 1
15 1.5019708e+03 7.72e-07 7.02e-05 -3.8 7.26e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003141e+03 3.77e-07 1.79e-04 -5.7 7.43e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.80e-11 2.93e-09 -5.7 1.63e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
1 8.6534799e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 4.97e-04 9.87e-0
3h 1
2 8.4756645e+02 9.17e+02 5.24e+01 -1.0 7.79e+02 - 8.94e-05 6.57e-0
4h 1
3 7.0654469e+02 9.12e+02 5.24e+01 -1.0 9.17e+02 - 6.24e-04 5.32e-0
3h 1
4 2.7668043e+02 8.93e+02 5.23e+01 -1.0 9.12e+02 - 6.28e-03 2.08e-0
2f 1
5 1.0298000e+04 6.55e-02 8.03e+01 -1.0 8.93e+02 - 6.71e-02 1.00e+0
0h 1
9 1.679224e+04 1.621968e+04 2.105634e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.56e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2433241e+02 1.56e+04 5.24e+01 -1.0 1.58e+04 - 3.31e-04 9.80e-0
3h 1
2 8.2134185e+02 1.56e+04 5.24e+01 -1.0 1.35e+04 - 2.39e-05 1.14e-0
4h 1
3 8.1100736e+02 1.56e+04 5.24e+01 -1.0 1.56e+04 - 1.84e-05 8.24e-0
4h 1
4 5.6310380e+02 1.53e+04 5.26e+01 -1.0 1.56e+04 - 8.36e-04 2.09e-0
2h 1
5 2.7044624e+04 5.53e-02 8.36e+01 -1.0 1.53e+04 - 2.43e-02 1.00e+0
0h 1
6 1.8679772e+04 5.34e-02 6.80e+01 -1.0 8.20e+01 - 1.90e-01 3.77e-0
2f 1
7 1.6694852e+04 4.33e-02 3.65e+01 -1.0 3.42e+01 - 4.71e-01 5.45e-0
1f 1
8 1.7032268e+04 2.12e-02 1.92e+01 -1.0 1.94e+01 - 3.73e-01 1.25e-0
1f 4
9 1.6691143e+04 6.80e-03 9.46e-01 -1.0 7.69e+00 - 9.60e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6750196e+04 2.07e-04 2.29e+00 -1.0 5.91e+00 - 1.05e-01 1.00e+0
0f 1
11 1.6756463e+04 8.69e-06 6.47e-01 -1.0 6.40e+00 - 6.98e-01 1.00e+0
0f 1
12 1.6451910e+04 2.44e-04 4.01e-01 -1.7 5.30e+00 - 8.73e-01 7.52e-0
1f 1
13 1.6402146e+04 5.93e-04 1.89e-01 -1.7 1.88e+01 - 7.87e-01 1.00e+0
0f 1
14 1.6268021e+04 1.40e-03 9.28e-02 -2.5 1.97e+01 - 8.71e-01 1.00e+0
0f 1
15 1.6241558e+04 1.83e-03 2.17e-02 -2.5 5.57e+00 - 1.00e+00 1.00e+0
0h 1
16 1.6223602e+04 3.53e-04 1.33e-01 -3.8 8.69e+00 - 1.00e+00 8.11e-0
1h 1
17 1.6221030e+04 5.16e-07 1.70e-04 -3.8 1.37e+00 - 1.00e+00 1.00e+0
0h 1
18 1.6219708e+04 3.95e-07 1.36e-03 -5.7 4.42e-01 - 1.00e+00 9.71e-0
1h 1
19 1.6219693e+04 3.02e-10 2.77e-05 -5.7 1.12e-02 - 9.70e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6219690e+04 5.33e-15 1.84e-11 -5.7 2.88e-03 - 1.00e+00 1.00e+0
0h 1
21 1.6219678e+04 4.56e-11 9.70e-05 -8.6 3.36e-03 - 1.00e+00 8.50e-0
1f 1
22 1.6219676e+04 1.41e-12 4.87e-11 -8.6 6.27e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.6219675985030154e+01 1.6219675985030153e+0
4
Dual infeasibility......: 4.8662001764469648e-11 4.8662001764469648e-0
8
Constraint violation....: 1.4094142519738284e-12 1.4094142519738284e-1
2
Complementarity.........: 2.6615933810922526e-09 2.6615933810922526e-0
6
Overall NLP error.......: 2.6615933810922526e-09 2.6615933810922526e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9092977e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 6.99e-04 9.80e-0
3h 1
2 8.8817884e+02 1.50e+04 5.24e+01 -1.0 1.47e+04 - 8.73e-05 1.01e-0
4h 1
3 8.8019535e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 2.96e-06 6.36e-0
4f 1
4 6.0281933e+02 1.46e+04 5.25e+01 -1.0 1.50e+04 - 6.80e-04 2.27e-0
2h 1
5 2.7061250e+04 6.30e-02 7.83e+01 -1.0 1.46e+04 - 6.43e-02 1.00e+0
0h 1
6 1.8630005e+04 5.80e-02 5.03e+01 -1.0 5.45e+01 - 3.42e-01 7.26e-0
2f 1
7 1.7334783e+04 2.88e-02 2.29e+01 -1.0 2.56e+01 - 5.35e-01 4.63e-0
1f 1
8 1.6727092e+04 8.82e-03 1.18e+00 -1.0 9.84e+00 - 9.28e-01 7.64e-0
1f 1
9 1.7008792e+04 3.29e-04 8.10e-02 -1.0 3.33e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6382322e+04 2.09e-03 8.12e-02 -2.5 4.87e+00 - 8.66e-01 8.50e-0
1f 1
11 1.6202338e+04 2.17e-03 2.02e-01 -2.5 1.04e+00 - 1.00e+00 8.35e-0
1f 1
12 1.6185689e+04 8.56e-05 3.85e-03 -2.5 1.46e-01 - 1.00e+00 1.00e+0
0h 1
13 1.6174722e+04 4.57e-05 1.11e+00 -3.8 2.68e+00 - 1.00e+00 4.97e-0
1h 1
14 1.6171406e+04 3.44e-07 1.13e-01 -3.8 1.35e+00 - 9.68e-01 1.00e+0
0f 1
15 1.6170371e+04 1.54e-08 1.79e-03 -3.8 3.29e-02 - 1.00e+00 1.00e+0
0H 1
16 1.6170569e+04 1.15e-05 2.77e-04 -3.8 3.78e-03 - 1.00e+00 1.00e+0
0f 1
17 1.6169803e+04 1.86e-06 6.31e-02 -5.7 1.49e-01 - 7.77e-01 9.69e-0
1h 1
18 1.6169630e+04 1.24e-05 2.12e-04 -5.7 5.04e-03 - 1.00e+00 1.00e+0
0f 1
19 1.6169636e+04 2.69e-08 2.12e-06 -5.7 2.56e-04 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6169621e+04 2.73e-08 7.73e-06 -8.6 1.84e-03 - 9.82e-01 9.88e-0
1h 1
21 1.6169621e+04 2.92e-13 3.32e-11 -8.6 2.21e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.6169621122077672e+01 1.6169621122077671e+0
4
Dual infeasibility......: 3.3198034397996028e-11 3.3198034397996028e-0
8
Constraint violation....: 2.9154456626656611e-13 2.9154456626656611e-1
3
Complementarity.........: 2.5121397107086900e-09 2.5121397107086899e-0
6
Overall NLP error.......: 2.5121397107086900e-09 2.5121397107086899e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0892498e+02 1.39e+04 5.23e+01 -1.0 1.40e+04 - 1.00e-03 9.80e-0
3h 1
2 9.0618100e+02 1.39e+04 5.23e+01 -1.0 1.36e+04 - 8.23e-05 1.01e-0
4h 1
3 8.9627358e+02 1.39e+04 5.23e+01 -1.0 1.39e+04 - 3.30e-06 7.33e-0
4f 1
4 5.9289595e+02 1.36e+04 5.24e+01 -1.0 1.39e+04 - 7.91e-04 2.30e-0
2h 1
5 2.6108731e+04 6.61e-02 7.64e+01 -1.0 1.36e+04 - 8.29e-02 1.00e+0
0h 1
6 1.7835058e+04 5.96e-02 3.83e+01 -1.0 2.93e+01 - 4.73e-01 8.95e-0
2f 1
7 1.6339024e+04 1.92e-02 1.58e+01 -1.0 1.54e+01 - 6.12e-01 7.37e-0
1f 1
8 1.6383520e+04 5.77e-03 1.30e+00 -1.0 2.12e+00 - 9.90e-01 5.00e-0
1f 2
9 1.6555151e+04 3.39e-04 7.26e-02 -1.0 2.06e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6012008e+04 2.19e-03 9.28e-02 -2.5 1.81e+01 - 8.56e-01 8.19e-0
1f 1
11 1.5843494e+04 2.11e-03 4.62e-01 -2.5 3.20e+00 - 1.00e+00 7.48e-0
1f 1
12 1.5814061e+04 1.60e-04 4.78e-03 -2.5 8.05e-01 - 1.00e+00 1.00e+0
0h 1
13 1.5797721e+04 4.30e-05 1.64e-01 -3.8 2.68e+00 - 1.00e+00 7.49e-0
1h 1
14 1.5793374e+04 1.47e-07 3.59e-04 -3.8 6.72e-01 - 1.00e+00 1.00e+0
0f 1
15 1.5792149e+04 2.78e-08 9.19e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 1.5792137e+04 1.87e-12 1.32e-08 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
17 1.5792122e+04 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5792122177270826e+01 1.5792122177270827e+0
4
Dual infeasibility......: 4.4776957134416645e-09 4.4776957134416645e-0
6
Constraint violation....: 2.6306457012736928e-12 2.6306457012736928e-1
2
Complementarity.........: 3.6085005931900812e-09 3.6085005931900812e-0
6
Overall NLP error.......: 4.4776957134416645e-09 4.4776957134416645e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1596960e+02 1.27e+04 5.23e+01 -1.0 1.28e+04 - 1.20e-03 9.80e-0
3h 1
2 9.1314144e+02 1.27e+04 5.23e+01 -1.0 1.18e+04 - 3.58e-05 1.06e-0
4h 1
3 8.9858676e+02 1.26e+04 5.23e+01 -1.0 1.26e+04 - 9.50e-06 9.83e-0
4f 1
4 8.6754488e+02 1.26e+04 5.23e+01 -1.0 1.26e+04 - 9.94e-04 2.17e-0
3h 1
5 5.9389600e+02 1.23e+04 5.22e+01 -1.0 1.26e+04 - 4.82e-03 2.24e-0
2f 1
6 2.3056618e+04 7.35e-02 7.76e+01 -1.0 1.23e+04 - 8.46e-02 1.00e+0
0h 1
7 1.6592889e+04 6.59e-02 2.59e+01 -1.0 1.89e+01 - 6.39e-01 9.59e-0
2f 1
8 1.5181553e+04 1.53e-02 8.46e+00 -1.0 1.24e+01 - 7.02e-01 8.37e-0
1f 1
9 1.5338989e+04 8.11e-03 7.08e-01 -1.0 3.45e+00 - 9.76e-01 4.82e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5041951e+04 1.09e-02 1.41e-01 -1.7 6.76e+00 - 8.62e-01 8.20e-0
1f 1
11 1.4889314e+04 3.78e-03 2.27e-01 -2.5 1.22e+00 - 8.23e-01 7.30e-0
1h 1
12 1.4853191e+04 7.05e-04 1.08e-02 -2.5 1.41e+00 - 1.00e+00 9.99e-0
1h 1
13 1.4835958e+04 4.34e-05 1.37e-01 -3.8 3.76e+00 - 8.43e-01 9.41e-0
1h 1
14 1.4835310e+04 3.09e-08 2.02e-05 -3.8 1.57e-01 - 1.00e+00 1.00e+0
0f 1
15 1.4834112e+04 1.78e-08 1.90e-04 -5.7 1.56e-01 - 1.00e+00 9.96e-0
1f 1
16 1.4834111e+04 1.80e-12 2.33e-09 -5.7 4.98e-04 - 1.00e+00 1.00e+0
0f 1
17 1.4834096e+04 2.63e-12 1.52e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.4834096269710775e+01 1.4834096269710775e+0
4
Dual infeasibility......: 1.5189632357565596e-09 1.5189632357565596e-0
6
Constraint violation....: 2.6289526111611394e-12 2.6289526111611394e-1
2
Complementarity.........: 2.8635056786843514e-09 2.8635056786843512e-0
6
Overall NLP error.......: 2.8635056786843514e-09 2.8635056786843512e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2301827e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.51e-03 9.80e-0
3h 1
2 9.2024087e+02 1.11e+04 5.23e+01 -1.0 1.08e+04 - 7.47e-05 1.02e-0
4h 1
3 9.0326738e+02 1.11e+04 5.23e+01 -1.0 1.11e+04 - 4.37e-06 1.03e-0
3f 1
4 5.3702294e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 1.15e-03 2.30e-0
2h 1
5 2.3289105e+04 6.96e-02 7.66e+01 -1.0 1.09e+04 - 7.98e-02 1.00e+0
0h 1
6 1.5362575e+04 6.29e-02 2.45e+01 -1.0 1.37e+01 - 6.46e-01 8.76e-0
2f 1
7 1.4033684e+04 2.07e-02 1.03e+01 -1.0 9.92e+00 - 6.53e-01 8.97e-0
1f 1
8 1.4145242e+04 1.08e-02 5.79e-01 -1.0 2.88e+00 - 9.94e-01 4.84e-0
1f 2
9 1.3817987e+04 8.41e-03 2.69e-01 -1.7 8.68e+00 - 1.00e+00 8.38e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3787132e+04 2.15e-03 8.88e-01 -1.7 1.24e+01 - 1.00e+00 5.00e-0
1h 2
11 1.3779949e+04 1.97e-04 1.51e-02 -1.7 6.18e+00 - 1.00e+00 1.00e+0
0h 1
12 1.3624290e+04 4.77e-04 2.41e-02 -3.8 1.99e+01 - 8.46e-01 8.31e-0
1f 1
13 1.3606068e+04 1.49e-04 2.06e-01 -3.8 3.35e+00 - 9.89e-01 7.20e-0
1h 1
14 1.3601454e+04 3.86e-07 3.06e-04 -3.8 9.35e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3600265e+04 1.95e-08 4.40e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
16 1.3600252e+04 7.95e-13 4.82e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.3600252116313257e+01 1.3600252116313257e+0
4
Dual infeasibility......: 4.8171317386651747e-10 4.8171317386651747e-0
7
Constraint violation....: 7.9511397466092149e-13 7.9511397466092149e-1
3
Complementarity.........: 2.6133282770702366e-09 2.6133282770702364e-0
6
Overall NLP error.......: 2.6133282770702366e-09 2.6133282770702364e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891839e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0614875e+02 9.19e+03 5.23e+01 -1.0 8.94e+03 - 8.31e-05 1.02e-0
4h 1
3 8.8589053e+02 9.18e+03 5.23e+01 -1.0 9.18e+03 - 4.99e-06 1.11e-0
3f 1
4 4.8290407e+02 8.97e+03 5.24e+01 -1.0 9.18e+03 - 1.26e-03 2.28e-0
2h 1
5 2.1194856e+04 6.67e-02 7.66e+01 -1.0 8.97e+03 - 8.32e-02 1.00e+0
0h 1
6 1.3110859e+04 6.01e-02 3.76e+01 -1.0 2.89e+01 - 4.83e-01 9.02e-0
2f 1
7 1.1611939e+04 1.94e-02 1.53e+01 -1.0 1.53e+01 - 6.18e-01 7.42e-0
1f 1
8 1.1669715e+04 5.64e-03 1.25e+00 -1.0 2.10e+00 - 9.91e-01 5.00e-0
1f 2
9 1.1851856e+04 3.17e-04 6.99e-02 -1.0 2.45e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1303065e+04 2.21e-03 9.19e-02 -2.5 2.21e+01 - 8.56e-01 8.21e-0
1f 1
11 1.1134535e+04 2.12e-03 4.58e-01 -2.5 3.77e+00 - 1.00e+00 7.49e-0
1f 1
12 1.1105283e+04 1.58e-04 4.78e-03 -2.5 9.43e-01 - 1.00e+00 1.00e+0
0h 1
13 1.1088904e+04 4.25e-05 1.63e-01 -3.8 2.68e+00 - 1.00e+00 7.50e-0
1h 1
14 1.1084573e+04 1.45e-07 3.58e-04 -3.8 6.70e-01 - 1.00e+00 1.00e+0
0f 1
15 1.1083348e+04 2.78e-08 9.22e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 1.1083335e+04 1.87e-12 1.33e-08 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
17 1.1083321e+04 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.1083320723006979e+01 1.1083320723006978e+0
4
Dual infeasibility......: 4.4776954123798970e-09 4.4776954123798970e-0
6
Constraint violation....: 2.6305416178651342e-12 2.6305416178651342e-1
2
Complementarity.........: 3.6085004017808432e-09 3.6085004017808432e-0
6
Overall NLP error.......: 4.4776954123798970e-09 4.4776954123798970e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2300862e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.80e-0
3h 1
2 9.2018520e+02 6.71e+03 5.23e+01 -1.0 6.43e+03 - 7.59e-05 1.03e-0
4h 1
3 8.8417722e+02 6.69e+03 5.23e+01 -1.0 6.70e+03 - 7.25e-06 1.73e-0
3f 1
4 4.3415243e+02 6.54e+03 5.24e+01 -1.0 6.69e+03 - 2.08e-03 2.26e-0
2h 1
5 1.8486104e+04 7.08e-02 7.69e+01 -1.0 6.54e+03 - 8.04e-02 1.00e+0
0h 1
6 1.0916142e+04 6.40e-02 2.32e+01 -1.0 1.36e+01 - 6.65e-01 8.89e-0
2f 1
7 9.6154376e+03 1.98e-02 9.31e+00 -1.0 9.91e+00 - 6.64e-01 8.81e-0
1f 1
8 9.7199903e+03 1.05e-02 6.35e-01 -1.0 2.75e+00 - 9.95e-01 4.77e-0
1f 2
9 9.3967776e+03 9.36e-03 2.78e-01 -1.7 9.45e+00 - 1.00e+00 8.30e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.3672965e+03 2.18e-03 9.40e-01 -1.7 1.18e+01 - 1.00e+00 4.90e-0
1h 2
11 9.3624199e+03 2.10e-04 1.67e-02 -1.7 6.01e+00 - 1.00e+00 1.00e+0
0h 1
12 9.2069203e+03 4.79e-04 2.44e-02 -3.8 2.00e+01 - 8.46e-01 8.30e-0
1f 1
13 9.1886242e+03 1.49e-04 2.05e-01 -3.8 3.34e+00 - 9.89e-01 7.21e-0
1h 1
14 9.1840024e+03 3.89e-07 3.07e-04 -3.8 9.33e-01 - 1.00e+00 1.00e+0
0h 1
15 9.1828139e+03 1.95e-08 4.40e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
16 9.1828008e+03 7.96e-13 4.82e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 9.1828007575363557e+00 9.1828007575363554e+0
3
Dual infeasibility......: 4.8230733855284121e-10 4.8230733855284121e-0
7
Constraint violation....: 7.9643236450266386e-13 7.9643236450266386e-1
3
Complementarity.........: 2.6134527997819932e-09 2.6134527997819931e-0
6
Overall NLP error.......: 2.6134527997819932e-09 2.6134527997819931e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8775283e+02 4.77e+03 5.24e+01 -1.0 4.82e+03 - 6.64e-04 9.80e-0
3f 1
2 8.8490545e+02 4.77e+03 5.24e+01 -1.0 4.54e+03 - 9.09e-05 1.04e-0
4h 1
3 8.3891577e+02 4.76e+03 5.24e+01 -1.0 4.77e+03 - 9.27e-06 2.02e-0
3f 1
4 3.6771363e+02 4.66e+03 5.24e+01 -1.0 4.76e+03 - 2.59e-03 2.19e-0
2h 1
5 1.5982222e+04 6.47e-02 7.88e+01 -1.0 4.66e+03 - 6.69e-02 1.00e+0
0h 1
6 8.2942245e+03 5.93e-02 4.78e+01 -1.0 5.43e+01 - 3.77e-01 7.64e-0
2f 1
7 6.9811109e+03 2.94e-02 2.07e+01 -1.0 2.67e+01 - 5.54e-01 4.62e-0
1f 1
8 6.4193393e+03 6.17e-03 1.02e+00 -1.0 9.91e+00 - 9.28e-01 7.77e-0
1f 1
9 6.6977348e+03 2.38e-04 6.93e-02 -1.0 3.42e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0467842e+03 2.17e-03 8.37e-02 -2.5 5.05e+00 - 8.70e-01 8.75e-0
1f 1
11 5.9396938e+03 1.10e-03 4.47e-01 -2.5 8.28e-01 - 1.00e+00 6.10e-0
1f 1
12 5.9395944e+03 2.61e-06 8.30e-03 -2.5 1.67e-01 - 1.00e+00 1.00e+0
0h 1
13 5.9215589e+03 6.87e-06 1.24e-02 -3.8 2.68e+00 - 9.05e-01 8.92e-0
1f 1
14 5.9183066e+03 4.65e-04 4.13e-04 -3.8 2.89e-01 - 1.00e+00 1.00e+0
0f 1
15 5.9173127e+03 6.28e-05 1.14e-02 -5.7 1.49e-01 - 8.14e-01 1.00e+0
0h 1
16 5.9171977e+03 3.58e-05 4.03e-05 -5.7 9.65e-03 - 1.00e+00 1.00e+0
0h 1
17 5.9171990e+03 1.44e-06 2.56e-05 -5.7 1.50e-03 - 1.00e+00 9.93e-0
1h 1
18 5.9172014e+03 3.51e-08 4.96e-07 -5.7 2.91e-04 - 1.00e+00 1.00e+0
0f 1
19 5.9171868e+03 3.95e-08 7.31e-06 -8.6 1.84e-03 - 9.97e-01 9.81e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 5.9171865e+03 5.37e-13 2.98e-11 -8.6 3.55e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 5.9171865294995616e+00 5.9171865294995614e+0
3
Dual infeasibility......: 2.9758893353575829e-11 2.9758893353575829e-0
8
Constraint violation....: 5.3712589931365073e-13 5.3712589931365073e-1
3
Complementarity.........: 2.5100799351787574e-09 2.5100799351787575e-0
6
Overall NLP error.......: 2.5100799351787574e-09 2.5100799351787575e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9478285e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3f 1
2 8.9187540e+02 3.24e+03 5.24e+01 -1.0 3.02e+03 - 9.14e-05 1.06e-0
4h 1
3 8.1655199e+02 3.23e+03 5.24e+01 -1.0 3.24e+03 - 1.38e-05 3.11e-0
3f 1
4 3.3910587e+02 3.16e+03 5.23e+01 -1.0 3.23e+03 - 4.64e-03 2.16e-0
2h 1
5 1.3760479e+04 6.81e-02 7.78e+01 -1.0 3.16e+03 - 8.37e-02 1.00e+0
0h 1
6 6.7546785e+03 6.11e-02 3.98e+01 -1.0 4.44e+01 - 4.66e-01 9.34e-0
2f 1
7 5.3864148e+03 2.95e-02 1.35e+01 -1.0 2.09e+01 - 6.49e-01 5.65e-0
1f 1
8 5.1381255e+03 3.48e-03 7.14e-01 -1.0 6.07e+00 - 9.54e-01 7.93e-0
1h 1
9 4.8058915e+03 9.07e-03 2.89e-01 -1.7 1.90e+00 - 1.00e+00 8.12e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.7469494e+03 1.26e-03 1.39e-01 -1.7 1.88e+01 - 1.00e+00 9.70e-0
1f 1
11 4.6212428e+03 4.91e-04 1.73e-01 -2.5 1.68e+01 - 9.48e-01 8.28e-0
1h 1
12 4.5986044e+03 6.65e-05 4.46e-03 -2.5 2.80e+00 - 1.00e+00 1.00e+0
0f 1
13 4.5763010e+03 1.58e-05 2.73e-02 -3.8 2.68e+00 - 1.00e+00 9.25e-0
1h 1
14 4.5756328e+03 4.87e-08 5.45e-04 -3.8 1.99e-01 - 1.00e+00 1.00e+0
0f 1
15 4.5743308e+03 4.26e-08 4.12e-04 -5.7 1.49e-01 - 1.00e+00 9.91e-0
1f 1
16 4.5743249e+03 1.95e-12 3.00e-08 -5.7 1.33e-03 - 1.00e+00 1.00e+0
0f 1
17 4.5743102e+03 2.58e-12 3.28e-06 -8.6 1.84e-03 - 1.00e+00 9.99e-0
1f 1
18 4.5743102e+03 7.11e-15 4.84e-14 -8.6 1.07e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 4.5743101839483264e+00 4.5743101839483261e+0
3
Dual infeasibility......: 4.8371468885196738e-14 4.8371468885196738e-1
1
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5059125779723429e-09 2.5059125779723428e-0
6
Overall NLP error.......: 2.5059125779723429e-09 2.5059125779723428e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8064252e+02 2.00e+03 5.24e+01 -1.0 2.02e+03 - 5.97e-04 9.81e-0
3f 1
2 8.7760033e+02 2.00e+03 5.24e+01 -1.0 1.79e+03 - 9.81e-05 1.11e-0
4h 1
3 7.4188986e+02 1.99e+03 5.24e+01 -1.0 2.00e+03 - 2.20e-05 5.30e-0
3f 1
4 3.0853037e+02 1.94e+03 5.19e+01 -1.0 1.99e+03 - 1.13e-02 2.08e-0
2f 1
5 1.0454262e+04 7.18e-02 7.81e+01 -1.0 1.94e+03 - 1.01e-01 1.00e+0
0h 1
6 4.9583655e+03 6.28e-02 2.13e+01 -1.0 4.92e+01 - 7.01e-01 1.16e-0
1f 1
7 3.4679380e+03 2.85e-02 2.35e+00 -1.0 2.41e+01 - 9.37e-01 6.11e-0
1f 1
8 3.5502765e+03 4.69e-03 1.40e-01 -1.0 3.47e+00 - 1.00e+00 1.00e+0
0f 1
9 3.0919874e+03 1.73e-03 2.74e-01 -2.5 3.67e+00 - 8.96e-01 7.84e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.0656701e+03 1.76e-05 1.17e-02 -2.5 4.34e-01 - 1.00e+00 1.00e+0
0h 1
11 3.0443579e+03 3.86e-04 9.45e-02 -3.8 2.69e+00 - 7.24e-01 9.81e-0
1f 1
12 3.0404046e+03 2.37e-03 5.59e-03 -3.8 4.63e-02 - 8.29e-01 1.00e+0
0h 1
13 3.0405027e+03 1.41e-04 1.23e-04 -3.8 1.70e-02 - 1.00e+00 1.00e+0
0h 1
14 3.0392764e+03 1.55e-04 1.25e-03 -5.7 1.49e-01 - 9.12e-01 1.00e+0
0h 1
15 3.0392276e+03 4.25e-05 1.02e-05 -5.7 9.60e-03 - 1.00e+00 1.00e+0
0h 1
16 3.0392312e+03 9.25e-07 6.70e-06 -5.7 1.39e-03 - 1.00e+00 1.00e+0
0h 1
17 3.0392191e+03 6.89e-08 7.06e-05 -8.6 1.84e-03 - 1.00e+00 9.41e-0
1h 1
18 3.0392184e+03 8.32e-12 9.00e-11 -8.6 1.08e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 3.0392183844694101e+00 3.0392183844694100e+0
3
Dual infeasibility......: 8.9990919915578340e-11 8.9990919915578346e-0
8
Constraint violation....: 8.3233420156147986e-12 8.3233420156147986e-1
2
Complementarity.........: 2.5077806590802292e-09 2.5077806590802290e-0
6
Overall NLP error.......: 2.5077806590802292e-09 2.5077806590802290e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2278116e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 3.31e-04 9.87e-0
3h 1
2 8.0655676e+02 9.17e+02 5.24e+01 -1.0 7.64e+02 - 9.12e-05 5.91e-0
4h 1
3 6.8551356e+02 9.13e+02 5.24e+01 -1.0 9.17e+02 - 5.58e-04 4.52e-0
3h 1
4 2.5424757e+02 8.94e+02 5.24e+01 -1.0 9.13e+02 - 5.37e-03 2.03e-0
2f 1
5 1.0171556e+04 5.97e-02 8.27e+01 -1.0 8.94e+02 - 4.73e-02 1.00e+0
0h 1
6 3.6641639e+03 5.57e-02 4.00e+01 -1.0 6.42e+01 - 5.07e-01 6.19e-0
2f 1
7 1.8848290e+03 3.80e-02 1.82e+01 -1.0 3.83e+01 - 5.39e-01 4.87e-0
1f 1
8 2.8688369e+03 3.43e-03 5.12e+00 -1.0 6.15e+00 - 8.07e-01 1.00e+0
0f 1
9 2.1131666e+03 1.02e-03 8.43e-02 -1.0 6.46e+00 - 9.89e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6956506e+03 7.22e-04 4.22e-01 -2.5 7.50e+00 - 9.09e-01 7.34e-0
1f 1
11 1.5454290e+03 3.09e-03 2.28e-01 -2.5 7.79e+00 - 7.23e-01 1.00e+0
0f 1
12 1.5242481e+03 2.42e-03 2.17e-01 -2.5 1.78e+00 - 1.00e+00 8.40e-0
1h 1
13 1.5335197e+03 1.10e-04 3.94e-03 -2.5 4.58e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5029409e+03 1.62e-04 2.15e-02 -3.8 1.39e+01 - 9.92e-01 9.31e-0
1h 1
15 1.5019708e+03 7.72e-07 7.02e-05 -3.8 7.26e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003141e+03 3.77e-07 1.79e-04 -5.7 7.43e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.80e-11 2.93e-09 -5.7 1.63e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932763986945e+00 1.5002932763986944e+0
3
Dual infeasibility......: 2.1737172424263444e-09 2.1737172424263444e-0
6
Constraint violation....: 6.2995803018495167e-11 6.2995803018495167e-1
1
Complementarity.........: 2.8882173006646807e-09 2.8882173006646805e-0
6
Overall NLP error.......: 2.8882173006646807e-09 2.8882173006646805e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.27e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9794778e+02 4.09e+01 5.94e+01 -1.0 1.43e+01 - 6.99e-04 4.23e-0
2f 1
2 1.2226387e+04 6.07e-02 7.87e+01 -1.0 1.80e+01 - 7.07e-02 1.00e+0
0h 1
3 3.6200419e+03 5.54e-02 5.15e+01 -1.0 5.46e+01 - 3.33e-01 7.87e-0
2f 1
4 2.3521653e+03 2.93e-02 2.28e+01 -1.0 2.70e+01 - 5.45e-01 4.46e-0
1f 1
5 1.7566466e+03 8.50e-03 1.17e+00 -1.0 9.97e+00 - 9.27e-01 7.68e-0
1f 1
6 2.0294850e+03 3.42e-04 8.15e-02 -1.0 3.36e+00 - 1.00e+00 1.00e+0
0h 1
7 1.4027450e+03 2.08e-03 8.14e-02 -2.5 4.87e+00 - 8.66e-01 8.50e-0
1f 1
8 1.2230782e+03 2.16e-03 2.05e-01 -2.5 1.05e+00 - 1.00e+00 8.33e-0
1f 1
9 1.2062995e+03 8.52e-05 3.86e-03 -2.5 1.48e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1967643e+03 4.57e-05 1.12e+00 -3.8 9.65e-02 - 1.00e+00 4.94e-0
1h 1
11 1.1947755e+03 3.49e-07 1.15e-01 -3.8 3.95e-02 - 9.67e-01 1.00e+0
0f 1
12 1.1937328e+03 1.71e-08 1.86e-03 -3.8 3.32e-02 - 1.00e+00 1.00e+0
0H 1
13 1.1939329e+03 1.19e-05 2.86e-04 -3.8 3.90e-03 - 1.00e+00 1.00e+0
0f 1
14 1.1933097e+03 1.90e-06 6.24e-02 -5.7 1.24e-02 - 7.78e-01 9.69e-0
1h 1
15 1.1931430e+03 1.23e-05 2.09e-04 -5.7 5.02e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1931489e+03 2.62e-08 2.07e-06 -5.7 2.53e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1931357e+03 2.71e-08 6.92e-06 -8.6 2.43e-04 - 9.82e-01 9.88e-0
1h 1
18 1.1931356e+03 3.15e-13 3.35e-11 -8.6 2.20e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1931355663569287e+00 1.1931355663569286e+0
3
Dual infeasibility......: 3.3465744247990933e-11 3.3465744247990933e-0
8
Constraint violation....: 3.1452618287630685e-13 3.1452618287630685e-1
3
Complementarity.........: 2.5121780124477237e-09 2.5121780124477235e-0
6
Overall NLP error.......: 2.5121780124477237e-09 2.5121780124477235e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1583979e+02 1.09e+02 1.13e+02 -1.0 3.76e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1398569e+04 5.38e-02 8.36e+01 -1.0 4.53e+01 - 3.10e-02 1.00e+0
0h 1
3 2.7847768e+03 5.17e-02 6.48e+01 -1.0 8.43e+01 - 2.27e-01 4.32e-0
2f 1
4 9.8154680e+02 4.24e-02 3.38e+01 -1.0 3.41e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5908602e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.21e-01 1.00e+0
0h 1
6 9.4490807e+02 1.01e-02 8.73e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6264784e+02 4.59e-04 6.60e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536457e+02 1.94e-03 1.94e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379731e+02 3.25e-03 6.12e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140236e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388162e+02 1.57e-04 1.69e-02 -3.8 7.57e-01 - 9.93e-01 9.41e-0
1h 1
12 5.8370191e+02 7.28e-07 6.65e-05 -3.8 8.63e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278679e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.06e-09 -5.7 3.41e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148936495e-01 5.8277753148936495e+0
2
Dual infeasibility......: 2.0880379878907814e-09 2.0880379878907814e-0
6
Constraint violation....: 6.2994207072897268e-11 6.2994207072897268e-1
1
Complementarity.........: 2.8882094445741685e-09 2.8882094445741686e-0
6
Overall NLP error.......: 2.8882094445741685e-09 2.8882094445741686e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.77e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5002486e+02 7.50e+01 9.04e+01 -1.0 2.59e+01 - 3.83e-04 3.52e-0
2f 1
2 1.1818748e+04 5.63e-02 8.12e+01 -1.0 2.87e+01 - 4.64e-02 1.00e+0
0h 1
3 3.1584761e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.65e-0
2f 1
4 1.0154559e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8154929e+03 7.28e-03 1.55e+01 -1.0 1.93e+01 - 6.10e-01 1.00e+0
0h 1
6 1.1193858e+03 5.40e-03 4.04e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8239836e+02 9.98e-04 2.09e-01 -1.7 5.71e+00 - 1.00e+00 8.88e-0
1h 1
8 7.2813381e+02 8.47e-04 1.34e-02 -1.7 3.45e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0980708e+02 1.50e-03 1.13e-01 -3.8 4.49e+00 - 7.71e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8216323e+02 2.17e-03 7.25e-02 -3.8 2.11e+00 - 8.07e-01 7.40e-0
1h 1
11 5.8336793e+02 9.41e-05 4.73e-02 -3.8 3.16e-02 - 1.00e+00 9.56e-0
1h 1
12 5.8368716e+02 2.82e-07 1.32e-05 -3.8 3.31e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278927e+02 4.12e-07 5.37e-04 -5.7 3.47e-02 - 1.00e+00 9.91e-0
1h 1
14 5.8278859e+02 4.36e-11 3.51e-09 -5.7 2.12e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.65e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753111686303e-01 5.8277753111686297e+0
2
Dual infeasibility......: 2.6486160075059257e-09 2.6486160075059257e-0
6
Constraint violation....: 6.3002061900796491e-11 6.3002061900796491e-1
1
Complementarity.........: 2.8882678877706121e-09 2.8882678877706120e-0
6
Overall NLP error.......: 2.8882678877706121e-09 2.8882678877706120e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.27e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9794778e+02 4.09e+01 5.94e+01 -1.0 1.43e+01 - 6.99e-04 4.23e-0
2f 1
2 1.2226387e+04 6.07e-02 7.87e+01 -1.0 1.80e+01 - 7.07e-02 1.00e+0
0h 1
3 3.6200419e+03 5.54e-02 5.15e+01 -1.0 5.46e+01 - 3.33e-01 7.87e-0
2f 1
4 2.3521653e+03 2.93e-02 2.28e+01 -1.0 2.70e+01 - 5.45e-01 4.46e-0
1f 1
5 1.7566466e+03 8.50e-03 1.17e+00 -1.0 9.97e+00 - 9.27e-01 7.68e-0
1f 1
6 2.0294850e+03 3.42e-04 8.15e-02 -1.0 3.36e+00 - 1.00e+00 1.00e+0
0h 1
7 1.4027450e+03 2.08e-03 8.14e-02 -2.5 4.87e+00 - 8.66e-01 8.50e-0
1f 1
8 1.2230782e+03 2.16e-03 2.05e-01 -2.5 1.05e+00 - 1.00e+00 8.33e-0
1f 1
9 1.2062995e+03 8.52e-05 3.86e-03 -2.5 1.48e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1967643e+03 4.57e-05 1.12e+00 -3.8 9.65e-02 - 1.00e+00 4.94e-0
1h 1
11 1.1947755e+03 3.49e-07 1.15e-01 -3.8 3.95e-02 - 9.67e-01 1.00e+0
0f 1
12 1.1937328e+03 1.71e-08 1.86e-03 -3.8 3.32e-02 - 1.00e+00 1.00e+0
0H 1
13 1.1939329e+03 1.19e-05 2.86e-04 -3.8 3.90e-03 - 1.00e+00 1.00e+0
0f 1
14 1.1933097e+03 1.90e-06 6.24e-02 -5.7 1.24e-02 - 7.78e-01 9.69e-0
1h 1
15 1.1931430e+03 1.23e-05 2.09e-04 -5.7 5.02e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1931489e+03 2.62e-08 2.07e-06 -5.7 2.53e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1931357e+03 2.71e-08 6.92e-06 -8.6 2.43e-04 - 9.82e-01 9.88e-0
1h 1
18 1.1931356e+03 3.15e-13 3.35e-11 -8.6 2.20e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1931355663569287e+00 1.1931355663569286e+0
3
Dual infeasibility......: 3.3465744247990933e-11 3.3465744247990933e-0
8
Constraint violation....: 3.1452618287630685e-13 3.1452618287630685e-1
3
Complementarity.........: 2.5121780124477237e-09 2.5121780124477235e-0
6
Overall NLP error.......: 2.5121780124477237e-09 2.5121780124477235e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2252371e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 3.31e-04 9.88e-0
3h 1
2 8.0445960e+02 9.17e+02 5.24e+01 -1.0 7.80e+02 - 1.02e-04 6.58e-0
4h 1
3 7.4450016e+02 9.15e+02 5.24e+01 -1.0 9.17e+02 - 6.37e-04 2.25e-0
3h 1
4 2.4840620e+02 8.96e+02 5.25e+01 -1.0 9.15e+02 - 3.05e-03 2.07e-0
2f 1
5 1.1004294e+04 5.79e-02 8.27e+01 -1.0 8.96e+02 - 4.32e-02 1.00e+0
0h 1
6 3.7548069e+03 5.44e-02 4.55e+01 -1.0 7.01e+01 - 4.43e-01 5.64e-0
2f 1
7 1.8925967e+03 3.73e-02 2.26e+01 -1.0 3.91e+01 - 5.02e-01 4.92e-0
1f 1
8 3.4775516e+03 6.84e-03 1.32e+01 -1.0 1.10e+01 - 6.02e-01 1.00e+0
0h 1
9 2.0261975e+03 3.16e-03 2.34e-01 -1.0 1.21e+01 - 9.88e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6958807e+03 6.81e-04 7.39e-02 -1.7 9.87e+00 - 9.33e-01 9.09e-0
1f 1
11 1.5676461e+03 1.62e-03 2.75e-01 -2.5 5.65e+00 - 7.66e-01 1.00e+0
0f 1
12 1.5222235e+03 4.32e-03 4.94e-02 -2.5 2.75e+00 - 1.00e+00 9.66e-0
1h 1
13 1.5339753e+03 1.95e-04 5.29e-03 -2.5 7.29e-01 - 1.00e+00 1.00e+0
0h 1
14 1.5023720e+03 1.76e-04 1.65e-02 -3.8 1.44e+01 - 9.98e-01 9.45e-0
1h 1
15 1.5019708e+03 5.78e-07 6.95e-05 -3.8 3.30e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003136e+03 3.82e-07 1.86e-04 -5.7 7.45e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.85e-11 3.00e-09 -5.7 7.01e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932762871262e+00 1.5002932762871262e+0
3
Dual infeasibility......: 2.1737082653136714e-09 2.1737082653136714e-0
6
Constraint violation....: 6.2995789140707359e-11 6.2995789140707359e-1
1
Complementarity.........: 2.8882160956390697e-09 2.8882160956390696e-0
6
Overall NLP error.......: 2.8882160956390697e-09 2.8882160956390696e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6513656e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 4.97e-04 9.88e-0
3h 1
2 8.4530680e+02 9.17e+02 5.24e+01 -1.0 7.94e+02 - 1.00e-04 7.33e-0
4h 1
3 7.7732378e+02 9.14e+02 5.24e+01 -1.0 9.17e+02 - 7.11e-04 2.57e-0
3h 1
4 2.6899853e+02 8.95e+02 5.24e+01 -1.0 9.15e+02 - 3.47e-03 2.14e-0
2f 1
5 1.1246098e+04 6.32e-02 8.04e+01 -1.0 8.95e+02 - 5.91e-02 1.00e+0
0h 1
10 1.799944e+04 1.632511e+04 2.164720e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6796560e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.80e-0
3f 1
2 7.6512894e+02 1.57e+04 5.25e+01 -1.0 1.55e+04 - 9.58e-05 1.00e-0
4h 1
3 7.5825249e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 2.68e-06 5.47e-0
4f 1
4 5.2121500e+02 1.54e+04 5.27e+01 -1.0 1.57e+04 - 5.81e-04 1.98e-0
2h 1
5 2.6805913e+04 6.08e-02 8.48e+01 -1.0 1.54e+04 - 2.94e-02 1.00e+0
0h 1
6 1.8274250e+04 5.84e-02 6.76e+01 -1.0 7.97e+01 - 2.08e-01 4.27e-0
2f 1
7 1.6691858e+04 4.49e-02 3.35e+01 -1.0 2.87e+01 - 5.00e-01 4.36e-0
1f 1
8 1.6988161e+04 3.06e-02 1.35e+01 -1.0 1.62e+01 - 4.67e-01 1.25e-0
1f 4
9 1.6780510e+04 5.30e-03 1.49e-01 -1.0 3.73e+00 - 9.92e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6497690e+04 1.03e-03 2.43e-01 -1.7 4.79e+00 - 1.00e+00 8.81e-0
1f 1
11 1.6473631e+04 7.56e-04 9.97e-03 -1.7 1.55e+01 - 1.00e+00 1.00e+0
0f 1
12 1.6350076e+04 1.30e-03 8.63e-02 -3.8 1.99e+01 - 8.03e-01 9.33e-0
1f 1
13 1.6325849e+04 1.43e-03 6.28e-02 -3.8 1.69e+00 - 8.52e-01 7.76e-0
1h 1
14 1.6326074e+04 2.56e-06 7.16e-04 -3.8 2.95e-01 - 1.00e+00 1.00e+0
0h 1
15 1.6325124e+04 3.24e-07 5.84e-04 -5.7 1.49e-01 - 1.00e+00 9.89e-0
1h 1
16 1.6325118e+04 3.99e-11 6.02e-09 -5.7 1.28e-01 - 1.00e+00 1.00e+0
0f 1
17 1.6325105e+04 6.30e-11 2.07e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.6325105196562557e+01 1.6325105196562557e+0
4
Dual infeasibility......: 2.0693044332463224e-09 2.0693044332463224e-0
6
Constraint violation....: 6.2994928717863274e-11 6.2994928717863274e-1
1
Complementarity.........: 2.8881113519696129e-09 2.8881113519696127e-0
6
Overall NLP error.......: 2.8881113519696129e-09 2.8881113519696127e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6678397e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 4.98e-04 9.80e-0
3h 1
2 8.6400663e+02 1.50e+04 5.24e+01 -1.0 1.48e+04 - 9.09e-05 1.01e-0
4h 1
3 8.5620874e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 2.90e-06 6.09e-0
4f 1
4 5.8162406e+02 1.46e+04 5.25e+01 -1.0 1.50e+04 - 6.50e-04 2.21e-0
2h 1
5 2.6836110e+04 5.98e-02 8.01e+01 -1.0 1.46e+04 - 5.05e-02 1.00e+0
0h 1
6 1.8341294e+04 5.58e-02 5.34e+01 -1.0 7.30e+01 - 3.23e-01 6.03e-0
2f 1
7 1.6755990e+04 3.02e-02 2.77e+01 -1.0 3.88e+01 - 4.75e-01 4.32e-0
1f 1
8 1.6473669e+04 1.45e-02 2.55e+00 -1.0 1.10e+01 - 9.18e-01 5.00e-0
1f 2
9 1.6312273e+04 7.14e-03 1.81e+00 -1.0 7.89e+00 - 1.00e+00 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6416261e+04 5.57e-04 4.25e-02 -1.0 9.94e+01 - 1.00e+00 1.00e+0
0f 1
11 1.5983287e+04 4.46e-04 9.59e-01 -2.5 9.81e+01 - 9.17e-01 5.85e-0
1f 1
12 1.5861457e+04 2.18e-04 2.20e-01 -2.5 4.03e+01 - 9.25e-01 1.00e+0
0f 1
13 1.5835523e+04 3.07e-03 1.93e-02 -2.5 1.15e+00 - 1.00e+00 1.00e+0
0h 1
14 1.5822208e+04 7.99e-04 3.58e-02 -3.8 2.68e+00 - 8.03e-01 1.00e+0
0h 1
15 1.5819282e+04 2.13e-03 1.02e-03 -3.8 4.83e-02 - 1.00e+00 1.00e+0
0h 1
16 1.5819495e+04 4.92e-05 1.31e-04 -3.8 1.22e-02 - 1.00e+00 1.00e+0
0h 1
17 1.5818193e+04 1.01e-04 3.43e-04 -5.7 1.49e-01 - 9.50e-01 9.75e-0
1h 1
18 1.5818179e+04 2.31e-05 3.76e-03 -5.7 3.67e-03 - 1.00e+00 7.73e-0
1h 1
19 1.5818183e+04 9.14e-09 1.28e-06 -5.7 8.32e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5818168e+04 9.12e-09 1.91e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
21 1.5818168e+04 1.36e-12 6.49e-11 -8.6 3.06e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.5818167570710052e+01 1.5818167570710051e+0
4
Dual infeasibility......: 6.4900172756544015e-11 6.4900172756544015e-0
8
Constraint violation....: 1.3574696922091789e-12 1.3574696922091789e-1
2
Complementarity.........: 2.5092901379436670e-09 2.5092901379436671e-0
6
Overall NLP error.......: 2.5092901379436670e-09 2.5092901379436671e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0892498e+02 1.39e+04 5.23e+01 -1.0 1.40e+04 - 1.00e-03 9.80e-0
3h 1
2 9.0618100e+02 1.39e+04 5.23e+01 -1.0 1.36e+04 - 8.23e-05 1.01e-0
4h 1
3 8.9627358e+02 1.39e+04 5.23e+01 -1.0 1.39e+04 - 3.30e-06 7.33e-0
4f 1
4 5.9289595e+02 1.36e+04 5.24e+01 -1.0 1.39e+04 - 7.91e-04 2.30e-0
2h 1
5 2.6108731e+04 6.61e-02 7.64e+01 -1.0 1.36e+04 - 8.29e-02 1.00e+0
0h 1
6 1.7835058e+04 5.96e-02 3.83e+01 -1.0 2.93e+01 - 4.73e-01 8.95e-0
2f 1
7 1.6339024e+04 1.92e-02 1.58e+01 -1.0 1.54e+01 - 6.12e-01 7.37e-0
1f 1
8 1.6383520e+04 5.77e-03 1.30e+00 -1.0 2.12e+00 - 9.90e-01 5.00e-0
1f 2
9 1.6555151e+04 3.39e-04 7.26e-02 -1.0 2.06e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6012008e+04 2.19e-03 9.28e-02 -2.5 1.81e+01 - 8.56e-01 8.19e-0
1f 1
11 1.5843494e+04 2.11e-03 4.62e-01 -2.5 3.20e+00 - 1.00e+00 7.48e-0
1f 1
12 1.5814061e+04 1.60e-04 4.78e-03 -2.5 8.05e-01 - 1.00e+00 1.00e+0
0h 1
13 1.5797721e+04 4.30e-05 1.64e-01 -3.8 2.68e+00 - 1.00e+00 7.49e-0
1h 1
14 1.5793374e+04 1.47e-07 3.59e-04 -3.8 6.72e-01 - 1.00e+00 1.00e+0
0f 1
15 1.5792149e+04 2.78e-08 9.19e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 1.5792137e+04 1.87e-12 1.32e-08 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
17 1.5792122e+04 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5792122179009464e+01 1.5792122179009464e+0
4
Dual infeasibility......: 4.4776956237141939e-09 4.4776956237141939e-0
6
Constraint violation....: 2.6307150902127319e-12 2.6307150902127319e-1
2
Complementarity.........: 3.6085005954171976e-09 3.6085005954171976e-0
6
Overall NLP error.......: 4.4776956237141939e-09 4.4776956237141939e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1597188e+02 1.27e+04 5.23e+01 -1.0 1.28e+04 - 1.20e-03 9.80e-0
3h 1
2 9.1321871e+02 1.27e+04 5.23e+01 -1.0 1.24e+04 - 7.92e-05 1.01e-0
4h 1
3 9.0074018e+02 1.26e+04 5.23e+01 -1.0 1.26e+04 - 3.71e-06 8.43e-0
4f 1
4 5.6875667e+02 1.23e+04 5.24e+01 -1.0 1.26e+04 - 9.20e-04 2.31e-0
2h 1
5 2.4866156e+04 6.77e-02 7.65e+01 -1.0 1.23e+04 - 8.14e-02 1.00e+0
0h 1
6 1.6742845e+04 6.11e-02 3.13e+01 -1.0 2.05e+01 - 5.60e-01 8.85e-0
2f 1
7 1.5215174e+04 1.68e-02 1.34e+01 -1.0 1.27e+01 - 6.30e-01 8.71e-0
1f 1
8 1.5383027e+04 8.76e-03 6.74e-01 -1.0 3.86e+00 - 9.93e-01 5.00e-0
1f 2
9 1.5057082e+04 7.92e-03 2.44e-01 -1.7 6.57e+00 - 1.00e+00 8.49e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4996775e+04 1.27e-03 1.01e-01 -1.7 1.41e+01 - 1.00e+00 1.00e+0
0f 1
11 1.4871041e+04 4.23e-04 1.06e-01 -2.5 1.72e+01 - 9.68e-01 8.78e-0
1h 1
12 1.4856576e+04 2.26e-05 3.37e-03 -2.5 2.08e+00 - 1.00e+00 1.00e+0
0f 1
13 1.4838332e+04 8.63e-06 1.03e-01 -3.8 2.68e+00 - 1.00e+00 8.23e-0
1f 1
14 1.4835312e+04 5.15e-08 7.18e-05 -3.8 4.75e-01 - 1.00e+00 1.00e+0
0f 1
15 1.4834112e+04 1.99e-08 1.57e-04 -5.7 1.49e-01 - 1.00e+00 9.96e-0
1f 1
16 1.4834111e+04 1.81e-12 2.22e-09 -5.7 5.61e-04 - 1.00e+00 1.00e+0
0f 1
17 1.4834096e+04 2.63e-12 1.52e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.4834096271903373e+01 1.4834096271903372e+0
4
Dual infeasibility......: 1.5189622508325777e-09 1.5189622508325777e-0
6
Constraint violation....: 2.6291815946599684e-12 2.6291815946599684e-1
2
Complementarity.........: 2.8635056539690202e-09 2.8635056539690204e-0
6
Overall NLP error.......: 2.8635056539690202e-09 2.8635056539690204e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9482527e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 7.48e-04 9.80e-0
3h 1
2 8.9206259e+02 1.11e+04 5.24e+01 -1.0 1.09e+04 - 8.69e-05 1.01e-0
4h 1
3 8.7788074e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 4.01e-06 8.67e-0
4f 1
4 5.1726064e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 9.54e-04 2.26e-0
2h 1
5 2.3121559e+04 6.40e-02 7.79e+01 -1.0 1.09e+04 - 6.98e-02 1.00e+0
0h 1
6 1.4812165e+04 5.85e-02 4.83e+01 -1.0 4.95e+01 - 3.63e-01 7.77e-0
2f 1
7 1.3505031e+04 2.67e-02 2.10e+01 -1.0 2.28e+01 - 5.57e-01 5.00e-0
1f 1
8 1.3018007e+04 6.85e-03 1.23e+00 -1.0 8.59e+00 - 9.37e-01 7.36e-0
1f 1
9 1.3268789e+04 3.20e-04 7.93e-02 -1.0 2.91e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2683148e+04 2.08e-03 9.07e-02 -2.5 4.28e+00 - 8.62e-01 8.28e-0
1f 1
11 1.2505092e+04 2.17e-03 3.62e-01 -2.5 1.06e+00 - 1.00e+00 7.74e-0
1f 1
12 1.2476207e+04 1.68e-04 5.11e-03 -2.5 2.15e-01 - 1.00e+00 1.00e+0
0h 1
13 1.2456345e+04 2.44e-05 4.31e-02 -3.8 2.68e+00 - 1.00e+00 8.82e-0
1h 1
14 1.2454881e+04 5.88e-08 6.10e-04 -3.8 3.16e-01 - 1.00e+00 1.00e+0
0f 1
15 1.2453574e+04 4.24e-08 1.39e-05 -5.7 1.49e-01 - 1.00e+00 9.99e-0
1f 1
16 1.2453562e+04 6.84e-13 3.99e-09 -8.6 1.93e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.2453562281962174e+01 1.2453562281962175e+0
4
Dual infeasibility......: 3.9883524924924597e-09 3.9883524924924597e-0
6
Constraint violation....: 6.8439698353017775e-13 6.8439698353017775e-1
3
Complementarity.........: 2.7863202819669043e-09 2.7863202819669043e-0
6
Overall NLP error.......: 3.9883524924924597e-09 3.9883524924924597e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891839e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0614875e+02 9.19e+03 5.23e+01 -1.0 8.94e+03 - 8.31e-05 1.02e-0
4h 1
3 8.8589053e+02 9.18e+03 5.23e+01 -1.0 9.18e+03 - 4.99e-06 1.11e-0
3f 1
4 4.8290407e+02 8.97e+03 5.24e+01 -1.0 9.18e+03 - 1.26e-03 2.28e-0
2h 1
5 2.1194856e+04 6.67e-02 7.66e+01 -1.0 8.97e+03 - 8.32e-02 1.00e+0
0h 1
6 1.3110859e+04 6.01e-02 3.76e+01 -1.0 2.89e+01 - 4.83e-01 9.02e-0
2f 1
7 1.1611939e+04 1.94e-02 1.53e+01 -1.0 1.53e+01 - 6.18e-01 7.42e-0
1f 1
8 1.1669715e+04 5.64e-03 1.25e+00 -1.0 2.10e+00 - 9.91e-01 5.00e-0
1f 2
9 1.1851856e+04 3.17e-04 6.99e-02 -1.0 2.45e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1303065e+04 2.21e-03 9.19e-02 -2.5 2.21e+01 - 8.56e-01 8.21e-0
1f 1
11 1.1134535e+04 2.12e-03 4.58e-01 -2.5 3.77e+00 - 1.00e+00 7.49e-0
1f 1
12 1.1105283e+04 1.58e-04 4.78e-03 -2.5 9.43e-01 - 1.00e+00 1.00e+0
0h 1
13 1.1088904e+04 4.25e-05 1.63e-01 -3.8 2.68e+00 - 1.00e+00 7.50e-0
1h 1
14 1.1084573e+04 1.45e-07 3.58e-04 -3.8 6.70e-01 - 1.00e+00 1.00e+0
0f 1
15 1.1083348e+04 2.78e-08 9.22e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 1.1083335e+04 1.87e-12 1.33e-08 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
17 1.1083321e+04 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.1083320724480421e+01 1.1083320724480422e+0
4
Dual infeasibility......: 4.4776954017754681e-09 4.4776954017754681e-0
6
Constraint violation....: 2.6306040679102694e-12 2.6306040679102694e-1
2
Complementarity.........: 3.6085004027864876e-09 3.6085004027864877e-0
6
Overall NLP error.......: 4.4776954017754681e-09 4.4776954017754681e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2300862e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.80e-0
3h 1
2 9.2018520e+02 6.71e+03 5.23e+01 -1.0 6.43e+03 - 7.59e-05 1.03e-0
4h 1
3 8.8417722e+02 6.69e+03 5.23e+01 -1.0 6.70e+03 - 7.25e-06 1.73e-0
3f 1
4 4.3415243e+02 6.54e+03 5.24e+01 -1.0 6.69e+03 - 2.08e-03 2.26e-0
2h 1
5 1.8486104e+04 7.08e-02 7.69e+01 -1.0 6.54e+03 - 8.04e-02 1.00e+0
0h 1
6 1.0916142e+04 6.40e-02 2.32e+01 -1.0 1.36e+01 - 6.65e-01 8.89e-0
2f 1
7 9.6154376e+03 1.98e-02 9.31e+00 -1.0 9.91e+00 - 6.64e-01 8.81e-0
1f 1
8 9.7199903e+03 1.05e-02 6.35e-01 -1.0 2.75e+00 - 9.95e-01 4.77e-0
1f 2
9 9.3967776e+03 9.36e-03 2.78e-01 -1.7 9.45e+00 - 1.00e+00 8.30e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.3672965e+03 2.18e-03 9.40e-01 -1.7 1.18e+01 - 1.00e+00 4.90e-0
1h 2
11 9.3624199e+03 2.10e-04 1.67e-02 -1.7 6.01e+00 - 1.00e+00 1.00e+0
0h 1
12 9.2069203e+03 4.79e-04 2.44e-02 -3.8 2.00e+01 - 8.46e-01 8.30e-0
1f 1
13 9.1886242e+03 1.49e-04 2.05e-01 -3.8 3.34e+00 - 9.89e-01 7.21e-0
1h 1
14 9.1840024e+03 3.89e-07 3.07e-04 -3.8 9.33e-01 - 1.00e+00 1.00e+0
0h 1
15 9.1828139e+03 1.95e-08 4.40e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
16 9.1828008e+03 7.96e-13 4.82e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 9.1828007591848841e+00 9.1828007591848836e+0
3
Dual infeasibility......: 4.8230733855284121e-10 4.8230733855284121e-0
7
Constraint violation....: 7.9644624229047167e-13 7.9644624229047167e-1
3
Complementarity.........: 2.6134527997819932e-09 2.6134527997819931e-0
6
Overall NLP error.......: 2.6134527997819932e-09 2.6134527997819931e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3002852e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 2.02e-03 9.81e-0
3h 1
2 9.2665255e+02 4.77e+03 5.23e+01 -1.0 3.78e+03 - 3.07e-05 1.25e-0
4h 1
3 4.3498395e+02 4.67e+03 5.24e+01 -1.0 4.77e+03 - 3.22e-05 2.12e-0
2f 1
4 1.2082241e+04 8.33e-02 7.86e+01 -1.0 4.67e+03 - 3.26e-02 1.00e+0
0h 1
5 9.1245095e+03 7.96e-02 2.66e+01 -1.0 1.08e+01 - 6.13e-01 4.30e-0
2f 1
6 7.9979551e+03 1.30e-02 1.10e+01 -1.0 9.06e+00 - 6.51e-01 8.24e-0
1f 1
7 8.1341059e+03 8.57e-03 1.54e-01 -1.0 2.78e+00 - 9.88e-01 9.38e-0
1f 1
8 7.7579536e+03 2.58e-03 1.34e+00 -1.7 7.12e+00 - 3.14e-01 1.00e+0
0f 1
9 7.7248513e+03 2.26e-04 5.82e-01 -1.7 7.86e+00 - 7.20e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.7367023e+03 1.12e-04 1.13e-01 -1.7 1.31e+01 - 8.73e-01 1.00e+0
0f 1
11 7.5778252e+03 4.07e-04 1.70e-02 -2.5 2.08e+01 - 9.70e-01 9.46e-0
1f 1
12 7.5533878e+03 1.06e-04 1.58e-01 -3.8 8.71e+00 - 9.97e-01 7.71e-0
1h 1
13 7.5478983e+03 2.16e-07 1.34e-04 -3.8 2.02e+00 - 1.00e+00 1.00e+0
0f 1
14 7.5465631e+03 1.78e-08 2.98e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
15 7.5465477e+03 1.30e-12 4.24e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 7.5465477174266766e+00 7.5465477174266762e+0
3
Dual infeasibility......: 4.2351405291032494e-10 4.2351405291032494e-0
7
Constraint violation....: 1.2957968031912515e-12 1.2957968031912515e-1
2
Complementarity.........: 3.8266721895938684e-09 3.8266721895938683e-0
6
Overall NLP error.......: 3.8266721895938684e-09 3.8266721895938683e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6658302e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 4.97e-04 9.81e-0
3f 1
2 8.6365170e+02 3.24e+03 5.24e+01 -1.0 3.03e+03 - 9.59e-05 1.06e-0
4h 1
3 7.9164439e+02 3.23e+03 5.24e+01 -1.0 3.24e+03 - 1.34e-05 2.94e-0
3f 1
4 3.2269649e+02 3.17e+03 5.24e+01 -1.0 3.23e+03 - 4.33e-03 2.11e-0
2h 1
5 1.3532414e+04 6.35e-02 8.05e+01 -1.0 3.17e+03 - 5.89e-02 1.00e+0
0h 1
6 6.4324764e+03 5.86e-02 4.63e+01 -1.0 6.47e+01 - 4.10e-01 7.06e-0
2f 1
7 4.8641756e+03 3.05e-02 2.15e+01 -1.0 3.76e+01 - 5.25e-01 4.45e-0
1f 1
8 4.4515440e+03 1.21e-02 1.93e+00 -1.0 1.04e+01 - 9.23e-01 1.00e+0
0f 1
9 4.6903276e+03 4.06e-04 6.36e-02 -1.0 4.25e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2205020e+03 5.03e-04 7.11e-01 -2.5 6.93e+00 - 8.96e-01 6.21e-0
1f 1
11 4.1366846e+03 2.39e-04 3.87e-01 -2.5 2.43e+00 - 8.90e-01 1.00e+0
0h 1
12 4.1101121e+03 5.79e-03 1.75e-01 -2.5 1.74e+00 - 1.00e+00 6.83e-0
1h 1
13 4.1031715e+03 5.46e-04 4.14e-03 -2.5 3.56e-01 - 1.00e+00 1.00e+0
0f 1
14 4.0873945e+03 1.16e-03 3.01e-02 -3.8 2.68e+00 - 8.04e-01 1.00e+0
0h 1
15 4.0842958e+03 2.39e-03 1.07e-03 -3.8 4.80e-02 - 1.00e+00 1.00e+0
0h 1
16 4.0846634e+03 4.13e-05 1.38e-04 -3.8 1.45e-02 - 1.00e+00 1.00e+0
0h 1
17 4.0833438e+03 1.04e-04 4.02e-04 -5.7 1.49e-01 - 9.51e-01 9.80e-0
1h 1
18 4.0833356e+03 2.19e-05 3.60e-03 -5.7 2.93e-03 - 1.00e+00 7.90e-0
1h 1
19 4.0833393e+03 8.57e-09 1.14e-06 -5.7 6.15e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 4.0833246e+03 8.99e-09 1.93e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
21 4.0833244e+03 1.37e-12 6.48e-11 -8.6 3.06e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 4.0833243811690094e+00 4.0833243811690095e+0
3
Dual infeasibility......: 6.4795731161743559e-11 6.4795731161743559e-0
8
Constraint violation....: 1.3741230375785563e-12 1.3741230375785563e-1
2
Complementarity.........: 2.5092130211833713e-09 2.5092130211833714e-0
6
Overall NLP error.......: 2.5092130211833713e-09 2.5092130211833714e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8055761e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.81e-0
3f 1
2 8.7686981e+02 2.00e+03 5.24e+01 -1.0 1.46e+03 - 5.63e-05 1.36e-0
4h 1
3 2.9368501e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 5.20e-05 2.28e-0
2f 1
4 1.4297701e+04 6.09e-02 7.94e+01 -1.0 1.95e+03 - 5.25e-02 1.00e+0
0h 1
5 5.5715643e+03 5.67e-02 5.36e+01 -1.0 6.49e+01 - 3.13e-01 6.17e-0
2f 1
6 4.1854190e+03 3.04e-02 2.68e+01 -1.0 3.22e+01 - 4.92e-01 4.30e-0
1f 1
7 3.3694030e+03 1.34e-02 2.18e+00 -1.0 1.10e+01 - 9.20e-01 9.27e-0
1f 1
8 3.8356226e+03 4.21e-04 1.12e-01 -1.0 4.99e+00 - 1.00e+00 1.00e+0
0f 1
9 3.1540976e+03 1.17e-03 8.84e-01 -1.7 3.91e+01 - 5.17e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.1749458e+03 8.96e-06 1.08e-02 -1.7 1.52e+00 - 1.00e+00 1.00e+0
0h 1
11 3.0765554e+03 2.21e-05 6.67e-01 -3.8 4.04e+01 - 9.63e-01 6.84e-0
1f 1
12 3.0448285e+03 3.92e-04 1.55e-01 -3.8 1.24e+01 - 7.01e-01 1.00e+0
0f 1
13 3.0404013e+03 2.50e-03 5.33e-03 -3.8 6.43e-02 - 1.00e+00 1.00e+0
0h 1
14 3.0406395e+03 2.33e-05 9.42e-05 -3.8 7.34e-03 - 1.00e+00 1.00e+0
0h 1
15 3.0392708e+03 1.32e-04 1.15e-03 -5.7 2.97e-01 - 9.17e-01 1.00e+0
0h 1
16 3.0392294e+03 3.20e-05 6.96e-06 -5.7 8.34e-03 - 1.00e+00 1.00e+0
0h 1
17 3.0392340e+03 2.70e-07 3.59e-06 -5.7 7.50e-04 - 1.00e+00 1.00e+0
0h 1
18 3.0392190e+03 3.07e-08 3.53e-05 -8.6 3.68e-03 - 1.00e+00 9.56e-0
1h 1
19 3.0392184e+03 4.73e-12 5.53e-11 -8.6 1.63e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 3.0392183842919041e+00 3.0392183842919039e+0
3
Dual infeasibility......: 5.5280062746616929e-11 5.5280062746616929e-0
8
Constraint violation....: 4.7309933748351796e-12 4.7309933748351796e-1
2
Complementarity.........: 3.0151450282445348e-09 3.0151450282445346e-0
6
Overall NLP error.......: 3.0151450282445348e-09 3.0151450282445346e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2252371e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 3.31e-04 9.88e-0
3h 1
2 8.0445960e+02 9.17e+02 5.24e+01 -1.0 7.80e+02 - 1.02e-04 6.58e-0
4h 1
3 7.4450016e+02 9.15e+02 5.24e+01 -1.0 9.17e+02 - 6.37e-04 2.25e-0
3h 1
4 2.4840620e+02 8.96e+02 5.25e+01 -1.0 9.15e+02 - 3.05e-03 2.07e-0
2f 1
5 1.1004294e+04 5.79e-02 8.27e+01 -1.0 8.96e+02 - 4.32e-02 1.00e+0
0h 1
6 3.7548069e+03 5.44e-02 4.55e+01 -1.0 7.01e+01 - 4.43e-01 5.64e-0
2f 1
7 1.8925967e+03 3.73e-02 2.26e+01 -1.0 3.91e+01 - 5.02e-01 4.92e-0
1f 1
8 3.4775516e+03 6.84e-03 1.32e+01 -1.0 1.10e+01 - 6.02e-01 1.00e+0
0h 1
9 2.0261975e+03 3.16e-03 2.34e-01 -1.0 1.21e+01 - 9.88e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6958807e+03 6.81e-04 7.39e-02 -1.7 9.87e+00 - 9.33e-01 9.09e-0
1f 1
11 1.5676461e+03 1.62e-03 2.75e-01 -2.5 5.65e+00 - 7.66e-01 1.00e+0
0f 1
12 1.5222235e+03 4.32e-03 4.94e-02 -2.5 2.75e+00 - 1.00e+00 9.66e-0
1h 1
13 1.5339753e+03 1.95e-04 5.29e-03 -2.5 7.29e-01 - 1.00e+00 1.00e+0
0h 1
14 1.5023720e+03 1.76e-04 1.65e-02 -3.8 1.44e+01 - 9.98e-01 9.45e-0
1h 1
15 1.5019708e+03 5.78e-07 6.95e-05 -3.8 3.30e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003136e+03 3.82e-07 1.86e-04 -5.7 7.45e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.85e-11 3.00e-09 -5.7 7.01e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932762871259e+00 1.5002932762871260e+0
3
Dual infeasibility......: 2.1737082655034068e-09 2.1737082655034068e-0
6
Constraint violation....: 6.2995900163009821e-11 6.2995900163009821e-1
1
Complementarity.........: 2.8882160956352977e-09 2.8882160956352978e-0
6
Overall NLP error.......: 2.8882160956352977e-09 2.8882160956352978e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.27e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9793211e+02 4.09e+01 5.94e+01 -1.0 1.43e+01 - 6.99e-04 4.23e-0
2f 1
2 1.2226285e+04 6.07e-02 7.87e+01 -1.0 1.80e+01 - 7.07e-02 1.00e+0
0h 1
3 3.6199112e+03 5.54e-02 5.15e+01 -1.0 5.46e+01 - 3.33e-01 7.86e-0
2f 1
4 2.3519654e+03 2.93e-02 2.28e+01 -1.0 2.71e+01 - 5.45e-01 4.46e-0
1f 1
5 1.7561563e+03 8.50e-03 1.17e+00 -1.0 9.97e+00 - 9.27e-01 7.68e-0
1f 1
6 2.0291199e+03 3.42e-04 8.15e-02 -1.0 3.36e+00 - 1.00e+00 1.00e+0
0h 1
7 1.4021894e+03 2.08e-03 8.14e-02 -2.5 4.88e+00 - 8.66e-01 8.50e-0
1f 1
8 1.2225326e+03 2.16e-03 2.05e-01 -2.5 1.05e+00 - 1.00e+00 8.34e-0
1f 1
9 1.2059502e+03 8.39e-05 3.90e-03 -2.5 1.47e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1966067e+03 4.53e-05 1.17e+00 -3.8 9.60e-02 - 1.00e+00 4.90e-0
1h 1
11 1.1945770e+03 3.67e-07 1.16e-01 -3.8 4.07e-02 - 9.66e-01 1.00e+0
0f 1
12 1.1935294e+03 2.07e-08 1.94e-03 -3.8 3.32e-02 - 1.00e+00 1.00e+0
0H 1
13 1.1937324e+03 1.28e-05 2.99e-04 -3.8 4.12e-03 - 1.00e+00 1.00e+0
0f 1
14 1.1931065e+03 2.01e-06 6.12e-02 -5.7 1.24e-02 - 7.78e-01 9.70e-0
1h 1
15 1.1929410e+03 1.23e-05 2.04e-04 -5.7 5.02e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1929468e+03 2.35e-08 1.91e-06 -5.7 2.38e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1929336e+03 2.66e-08 4.40e-06 -8.6 2.40e-04 - 9.83e-01 9.86e-0
1h 1
18 1.1929334e+03 3.91e-13 3.42e-11 -8.6 2.42e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1929334410015173e+00 1.1929334410015174e+0
3
Dual infeasibility......: 3.4228648146029938e-11 3.4228648146029938e-0
8
Constraint violation....: 3.9135361618036768e-13 3.9135361618036768e-1
3
Complementarity.........: 2.5122799625073959e-09 2.5122799625073960e-0
6
Overall NLP error.......: 2.5122799625073959e-09 2.5122799625073960e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1583181e+02 1.09e+02 1.13e+02 -1.0 3.76e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1398456e+04 5.38e-02 8.36e+01 -1.0 4.53e+01 - 3.10e-02 1.00e+0
0h 1
3 2.7846707e+03 5.17e-02 6.48e+01 -1.0 8.43e+01 - 2.27e-01 4.32e-0
2f 1
4 9.8153658e+02 4.24e-02 3.38e+01 -1.0 3.41e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5907565e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.22e-01 1.00e+0
0h 1
6 9.4490599e+02 1.01e-02 8.73e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6264710e+02 4.59e-04 6.60e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536446e+02 1.94e-03 1.94e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379722e+02 3.25e-03 6.12e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140237e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388160e+02 1.57e-04 1.69e-02 -3.8 7.57e-01 - 9.93e-01 9.41e-0
1h 1
12 5.8370191e+02 7.28e-07 6.65e-05 -3.8 8.62e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278679e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.06e-09 -5.7 3.41e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148937428e-01 5.8277753148937427e+0
2
Dual infeasibility......: 2.0880230787357517e-09 2.0880230787357517e-0
6
Constraint violation....: 6.2994068295019190e-11 6.2994068295019190e-1
1
Complementarity.........: 2.8882094431288321e-09 2.8882094431288318e-0
6
Overall NLP error.......: 2.8882094431288321e-09 2.8882094431288318e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.77e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5001399e+02 7.50e+01 9.04e+01 -1.0 2.59e+01 - 3.83e-04 3.52e-0
2f 1
2 1.1818633e+04 5.63e-02 8.12e+01 -1.0 2.87e+01 - 4.64e-02 1.00e+0
0h 1
3 3.1583851e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.65e-0
2f 1
4 1.0154326e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8160524e+03 7.28e-03 1.55e+01 -1.0 1.93e+01 - 6.10e-01 1.00e+0
0h 1
6 1.1191249e+03 5.40e-03 4.04e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8235771e+02 9.98e-04 2.09e-01 -1.7 5.71e+00 - 1.00e+00 8.88e-0
1h 1
8 7.2809562e+02 8.48e-04 1.34e-02 -1.7 3.45e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0979280e+02 1.50e-03 1.13e-01 -3.8 4.49e+00 - 7.71e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8216519e+02 2.17e-03 7.26e-02 -3.8 2.11e+00 - 8.07e-01 7.40e-0
1h 1
11 5.8336893e+02 9.31e-05 4.68e-02 -3.8 3.16e-02 - 1.00e+00 9.57e-0
1h 1
12 5.8368715e+02 2.81e-07 1.31e-05 -3.8 3.35e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278927e+02 4.12e-07 5.36e-04 -5.7 3.47e-02 - 1.00e+00 9.91e-0
1h 1
14 5.8278859e+02 4.36e-11 3.51e-09 -5.7 2.14e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.65e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753111790787e-01 5.8277753111790787e+0
2
Dual infeasibility......: 2.6470430972460074e-09 2.6470430972460074e-0
6
Constraint violation....: 6.3001950878494029e-11 6.3001950878494029e-1
1
Complementarity.........: 2.8882676492671358e-09 2.8882676492671358e-0
6
Overall NLP error.......: 2.8882676492671358e-09 2.8882676492671358e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.27e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9793211e+02 4.09e+01 5.94e+01 -1.0 1.43e+01 - 6.99e-04 4.23e-0
2f 1
2 1.2226285e+04 6.07e-02 7.87e+01 -1.0 1.80e+01 - 7.07e-02 1.00e+0
0h 1
3 3.6199112e+03 5.54e-02 5.15e+01 -1.0 5.46e+01 - 3.33e-01 7.86e-0
2f 1
4 2.3519654e+03 2.93e-02 2.28e+01 -1.0 2.71e+01 - 5.45e-01 4.46e-0
1f 1
5 1.7561563e+03 8.50e-03 1.17e+00 -1.0 9.97e+00 - 9.27e-01 7.68e-0
1f 1
6 2.0291199e+03 3.42e-04 8.15e-02 -1.0 3.36e+00 - 1.00e+00 1.00e+0
0h 1
7 1.4021894e+03 2.08e-03 8.14e-02 -2.5 4.88e+00 - 8.66e-01 8.50e-0
1f 1
8 1.2225326e+03 2.16e-03 2.05e-01 -2.5 1.05e+00 - 1.00e+00 8.34e-0
1f 1
9 1.2059502e+03 8.39e-05 3.90e-03 -2.5 1.47e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1966067e+03 4.53e-05 1.17e+00 -3.8 9.60e-02 - 1.00e+00 4.90e-0
1h 1
11 1.1945770e+03 3.67e-07 1.16e-01 -3.8 4.07e-02 - 9.66e-01 1.00e+0
0f 1
12 1.1935294e+03 2.07e-08 1.94e-03 -3.8 3.32e-02 - 1.00e+00 1.00e+0
0H 1
13 1.1937324e+03 1.28e-05 2.99e-04 -3.8 4.12e-03 - 1.00e+00 1.00e+0
0f 1
14 1.1931065e+03 2.01e-06 6.12e-02 -5.7 1.24e-02 - 7.78e-01 9.70e-0
1h 1
15 1.1929410e+03 1.23e-05 2.04e-04 -5.7 5.02e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1929468e+03 2.35e-08 1.91e-06 -5.7 2.38e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1929336e+03 2.66e-08 4.40e-06 -8.6 2.40e-04 - 9.83e-01 9.86e-0
1h 1
18 1.1929334e+03 3.91e-13 3.42e-11 -8.6 2.42e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1929334410015173e+00 1.1929334410015174e+0
3
Dual infeasibility......: 3.4228648146029938e-11 3.4228648146029938e-0
8
Constraint violation....: 3.9135361618036768e-13 3.9135361618036768e-1
3
Complementarity.........: 2.5122799625073959e-09 2.5122799625073960e-0
6
Overall NLP error.......: 2.5122799625073959e-09 2.5122799625073960e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 40
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 20
inequality constraints with only lower bounds: 11
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2226637e+02 9.17e+02 5.24e+01 -1.0 9.19e+02 - 3.31e-04 9.89e-0
3h 1
2 8.0286297e+02 9.17e+02 5.24e+01 -1.0 7.89e+02 - 1.13e-04 7.08e-0
4h 1
3 7.6060824e+02 9.15e+02 5.24e+01 -1.0 9.16e+02 - 6.97e-04 1.59e-0
3h 1
4 2.4716589e+02 8.96e+02 5.25e+01 -1.0 9.15e+02 - 2.42e-03 2.09e-0
2f 1
5 1.1235023e+04 5.75e-02 8.26e+01 -1.0 8.96e+02 - 4.23e-02 1.00e+0
0h 1
6 3.7780456e+03 5.41e-02 4.68e+01 -1.0 7.18e+01 - 4.28e-01 5.52e-0
2f 1
7 1.8942440e+03 3.70e-02 2.36e+01 -1.0 3.93e+01 - 4.94e-01 4.93e-0
1f 1
8 3.7487297e+03 8.17e-03 1.62e+01 -1.0 1.31e+01 - 5.41e-01 1.00e+0
0h 1
9 1.9569907e+03 4.71e-03 3.28e-01 -1.0 1.48e+01 - 9.88e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6789202e+03 4.30e-04 7.52e-02 -1.7 7.57e+00 - 9.82e-01 9.91e-0
1f 1
11 1.5604360e+03 1.99e-03 2.29e-01 -2.5 6.90e+00 - 7.53e-01 1.00e+0
0f 1
12 1.5246247e+03 3.26e-03 4.62e-02 -2.5 2.14e+00 - 1.00e+00 9.68e-0
1h 1
13 1.5342173e+03 1.63e-04 3.95e-03 -2.5 8.53e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5023068e+03 1.71e-04 1.77e-02 -3.8 1.49e+01 - 9.95e-01 9.40e-0
1h 1
15 1.5019706e+03 6.35e-07 6.91e-05 -3.8 1.99e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003128e+03 3.79e-07 1.87e-04 -5.7 7.47e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.85e-11 3.02e-09 -5.7 7.44e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932761754137e+00 1.5002932761754137e+0
3
Dual infeasibility......: 2.1737074506365357e-09 2.1737074506365357e-0
6
Constraint violation....: 6.2995969551948860e-11 6.2995969551948860e-1
1
Complementarity.........: 2.8882160139872711e-09 2.8882160139872712e-0
6
Overall NLP error.......: 2.8882160139872711e-09 2.8882160139872712e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
1 8.6492522e+02 9.17e+02 5.24e+01 -1.0 9.19e+02 - 4.97e-04 9.89e-0
3h 1
2 8.4366834e+02 9.17e+02 5.24e+01 -1.0 8.02e+02 - 1.11e-04 7.86e-0
4h 1
3 7.9632468e+02 9.15e+02 5.24e+01 -1.0 9.16e+02 - 7.75e-04 1.79e-0
3h 1
4 2.6745043e+02 8.95e+02 5.24e+01 -1.0 9.15e+02 - 2.72e-03 2.16e-0
2f 1
5 1.1509886e+04 6.26e-02 8.04e+01 -1.0 8.95e+02 - 5.73e-02 1.00e+0
0h 1
11 1.763947e+04 1.632511e+04 2.220085e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1156838e+02 1.57e+04 5.50e+01 -1.0 1.59e+04 - 1.75e-04 9.80e-0
3f 1
2 7.0871566e+02 1.57e+04 5.50e+01 -1.0 1.51e+04 - 4.89e-05 1.03e-0
4h 1
3 7.0550984e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 6.01e-06 2.58e-0
4h 1
4 7.0179852e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 2.63e-04 3.09e-0
4h 1
5 4.8839937e+02 1.54e+04 5.39e+01 -1.0 1.57e+04 - 6.05e-04 1.89e-0
2f 1
6 2.6293554e+04 7.61e-02 8.69e+01 -1.0 1.54e+04 - 2.53e-02 1.00e+0
0h 1
7 1.7887995e+04 7.33e-02 7.33e+01 -1.0 7.33e+01 - 1.65e-01 3.99e-0
2f 1
8 1.6628596e+04 4.64e-02 3.40e+01 -1.0 1.96e+01 - 5.31e-01 3.77e-0
1f 1
9 1.6879115e+04 4.07e-02 1.01e+01 -1.0 1.34e+01 - 5.66e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6796888e+04 6.78e-03 1.94e-01 -1.0 8.25e-01 - 9.90e-01 1.00e+0
0h 1
11 1.6500017e+04 7.53e-04 2.01e-01 -1.7 5.67e+00 - 1.00e+00 8.96e-0
1f 1
12 1.6474850e+04 7.85e-04 1.13e-02 -1.7 1.98e+01 - 1.00e+00 1.00e+0
0f 1
13 1.6354389e+04 1.17e-03 4.57e-02 -3.8 2.69e+01 - 8.09e-01 8.79e-0
1f 1
14 1.6326133e+04 1.48e-03 4.99e-02 -3.8 1.88e+00 - 8.54e-01 7.90e-0
1h 1
15 1.6326040e+04 2.92e-06 7.61e-04 -3.8 1.02e-01 - 1.00e+00 1.00e+0
0h 1
16 1.6325124e+04 2.89e-07 6.50e-04 -5.7 1.49e-01 - 1.00e+00 9.88e-0
1h 1
17 1.6325118e+04 3.78e-11 6.23e-09 -5.7 4.12e-01 - 1.00e+00 1.00e+0
0f 1
18 1.6325105e+04 6.30e-11 2.05e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.6325105196541916e+01 1.6325105196541916e+0
4
Dual infeasibility......: 2.0519772768168457e-09 2.0519772768168457e-0
6
Constraint violation....: 6.2995483829375587e-11 6.2995483829375587e-1
1
Complementarity.........: 2.8881033039064533e-09 2.8881033039064533e-0
6
Overall NLP error.......: 2.8881033039064533e-09 2.8881033039064533e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4812475e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 4.08e-04 9.80e-0
3f 1
2 8.4532769e+02 1.50e+04 5.24e+01 -1.0 1.48e+04 - 9.25e-05 1.00e-0
4h 1
3 8.3756953e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 2.87e-06 5.97e-0
4f 1
4 5.6583730e+02 1.46e+04 5.26e+01 -1.0 1.50e+04 - 6.38e-04 2.16e-0
2h 1
5 2.6666378e+04 5.76e-02 8.10e+01 -1.0 1.46e+04 - 4.61e-02 1.00e+0
0h 1
6 1.8142507e+04 5.40e-02 5.28e+01 -1.0 7.94e+01 - 3.40e-01 5.65e-0
2f 1
7 1.6074145e+04 3.26e-02 2.87e+01 -1.0 4.22e+01 - 4.65e-01 5.24e-0
1f 1
8 1.6588609e+04 1.26e-02 2.77e+00 -1.0 2.02e+01 - 8.56e-01 5.00e-0
1f 2
9 1.6077898e+04 5.03e-03 1.88e-01 -1.0 1.04e+01 - 9.56e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5781790e+04 1.28e-03 4.96e-01 -1.7 4.22e+00 - 1.00e+00 7.91e-0
1f 1
11 1.5747694e+04 3.74e-04 2.61e-02 -1.7 1.60e+01 - 1.00e+00 1.00e+0
0f 1
12 1.5604642e+04 1.15e-03 1.16e-01 -3.8 1.99e+01 - 7.67e-01 9.21e-0
1f 1
13 1.5574636e+04 1.45e-03 3.33e-02 -3.8 2.12e+00 - 8.20e-01 7.39e-0
1h 1
14 1.5574991e+04 3.57e-06 3.37e-02 -3.8 4.06e-01 - 9.80e-01 1.00e+0
0h 1
15 1.5574087e+04 8.73e-05 3.47e-04 -3.8 1.22e-02 - 1.00e+00 1.00e+0
0h 1
16 1.5573013e+04 1.52e-05 7.56e-03 -5.7 1.49e-01 - 9.12e-01 9.84e-0
1h 1
17 1.5572963e+04 4.76e-07 1.66e-06 -5.7 2.39e-03 - 1.00e+00 1.00e+0
0h 1
18 1.5572948e+04 4.63e-09 3.66e-07 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
19 1.5572948e+04 1.67e-14 3.61e-14 -8.6 1.45e-07 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.5572948081176254e+01 1.5572948081176253e+0
4
Dual infeasibility......: 3.6126461580514580e-14 3.6126461580514580e-1
1
Constraint violation....: 1.6696750116921517e-14 1.6696750116921517e-1
4
Complementarity.........: 2.5059090985041020e-09 2.5059090985041021e-0
6
Overall NLP error.......: 2.5059090985041020e-09 2.5059090985041021e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2434766e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.31e-04 9.80e-0
3f 1
2 8.2152701e+02 1.39e+04 5.24e+01 -1.0 1.37e+04 - 9.41e-05 1.01e-0
4h 1
3 8.1250184e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 3.07e-06 6.34e-0
4f 1
4 5.2382711e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 6.80e-04 2.10e-0
2h 1
5 2.5354643e+04 5.52e-02 8.24e+01 -1.0 1.36e+04 - 3.86e-02 1.00e+0
0h 1
6 1.6863928e+04 5.27e-02 5.58e+01 -1.0 8.05e+01 - 3.19e-01 5.02e-0
2f 1
7 1.4889456e+04 3.73e-02 2.98e+01 -1.0 3.93e+01 - 4.70e-01 5.04e-0
1f 1
8 1.5234767e+04 2.27e-02 1.38e+01 -1.0 2.05e+01 - 4.01e-01 1.25e-0
1f 4
9 1.4978917e+04 6.02e-03 3.94e-01 -1.0 4.93e+00 - 9.79e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4673187e+04 1.43e-03 4.07e-01 -1.7 5.54e+00 - 1.00e+00 8.25e-0
1f 1
11 1.4632038e+04 9.15e-04 1.45e-02 -1.7 1.80e+01 - 1.00e+00 1.00e+0
0f 1
12 1.4504079e+04 1.44e-03 9.78e-02 -3.8 1.99e+01 - 7.88e-01 9.29e-0
1f 1
13 1.4480558e+04 1.62e-03 8.53e-02 -3.8 1.71e+00 - 8.43e-01 7.51e-0
1h 1
14 1.4481004e+04 3.34e-06 8.55e-04 -3.8 3.45e-01 - 1.00e+00 1.00e+0
0h 1
15 1.4480071e+04 2.80e-07 6.76e-04 -5.7 1.49e-01 - 1.00e+00 9.87e-0
1h 1
16 1.4480065e+04 3.64e-11 6.70e-09 -5.7 2.75e-01 - 1.00e+00 1.00e+0
0f 1
17 1.4480052e+04 6.30e-11 2.17e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.4480051748814896e+01 1.4480051748814896e+0
4
Dual infeasibility......: 2.1734478044382900e-09 2.1734478044382900e-0
6
Constraint violation....: 6.2998647964995769e-11 6.2998647964995769e-1
1
Complementarity.........: 2.8881015648076340e-09 2.8881015648076342e-0
6
Overall NLP error.......: 2.8881015648076340e-09 2.8881015648076342e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.3448537e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.60e-04 9.80e-0
3f 1
2 8.3166818e+02 1.27e+04 5.24e+01 -1.0 1.24e+04 - 9.37e-05 1.01e-0
4h 1
3 8.2086687e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 3.38e-06 7.01e-0
4f 1
4 5.0473429e+02 1.24e+04 5.26e+01 -1.0 1.26e+04 - 7.58e-04 2.13e-0
2h 1
5 2.4156761e+04 5.63e-02 8.18e+01 -1.0 1.24e+04 - 4.17e-02 1.00e+0
0h 1
6 1.5695527e+04 5.30e-02 5.21e+01 -1.0 8.00e+01 - 3.58e-01 5.29e-0
2f 1
7 1.3646538e+04 3.44e-02 2.81e+01 -1.0 4.13e+01 - 4.66e-01 5.18e-0
1f 1
8 1.3977555e+04 2.20e-02 1.22e+01 -1.0 2.04e+01 - 4.17e-01 1.25e-0
1f 4
9 1.3780310e+04 5.28e-03 5.87e-01 -1.0 3.97e+00 - 9.65e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3450458e+04 1.47e-03 5.31e-01 -1.7 6.66e+00 - 1.00e+00 7.88e-0
1f 1
11 1.3387092e+04 1.02e-03 2.01e-02 -1.7 1.86e+01 - 1.00e+00 1.00e+0
0f 1
12 1.3259173e+04 1.48e-03 8.98e-02 -3.8 1.99e+01 - 7.81e-01 9.08e-0
1f 1
13 1.3233598e+04 1.84e-03 1.11e-01 -3.8 1.84e+00 - 8.39e-01 7.34e-0
1h 1
14 1.3233966e+04 3.90e-06 1.06e-03 -3.8 4.81e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3233071e+04 2.30e-07 8.08e-04 -5.7 1.49e-01 - 1.00e+00 9.85e-0
1h 1
16 1.3233064e+04 3.12e-11 7.47e-09 -5.7 1.03e-01 - 1.00e+00 1.00e+0
0f 1
17 1.3233051e+04 6.30e-11 2.29e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.3233050900003764e+01 1.3233050900003764e+0
4
Dual infeasibility......: 2.2926245287148872e-09 2.2926245287148872e-0
6
Constraint violation....: 6.3002617012308804e-11 6.3002617012308804e-1
1
Complementarity.........: 2.8880881791030432e-09 2.8880881791030432e-0
6
Overall NLP error.......: 2.8880881791030432e-09 2.8880881791030432e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8868934e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 6.74e-04 9.80e-0
3h 1
2 8.8592105e+02 1.11e+04 5.24e+01 -1.0 1.09e+04 - 8.82e-05 1.01e-0
4h 1
3 8.7191843e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 3.98e-06 8.53e-0
4f 1
4 5.1245584e+02 1.09e+04 5.25e+01 -1.0 1.11e+04 - 9.38e-04 2.25e-0
2h 1
5 2.3065904e+04 6.30e-02 7.86e+01 -1.0 1.09e+04 - 6.29e-02 1.00e+0
0h 1
6 1.4736090e+04 5.81e-02 5.05e+01 -1.0 5.64e+01 - 3.42e-01 7.15e-0
2f 1
7 1.3435036e+04 2.95e-02 2.32e+01 -1.0 2.69e+01 - 5.30e-01 4.51e-0
1f 1
8 1.2792822e+04 9.06e-03 1.25e+00 -1.0 1.02e+01 - 9.26e-01 7.86e-0
1f 1
9 1.3092994e+04 2.81e-04 7.74e-02 -1.0 3.60e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2435674e+04 2.12e-03 8.35e-02 -2.5 5.17e+00 - 8.68e-01 8.73e-0
1f 1
11 1.2302054e+04 1.43e-03 2.25e-01 -2.5 9.28e-01 - 1.00e+00 7.04e-0
1f 1
12 1.2305518e+04 3.37e-06 8.02e-03 -2.5 1.25e-01 - 1.00e+00 1.00e+0
0h 1
13 1.2286996e+04 2.71e-06 1.35e-01 -3.8 2.68e+00 - 9.82e-01 8.64e-0
1f 1
14 1.2283630e+04 4.17e-04 1.05e-03 -3.8 3.64e-01 - 1.00e+00 1.00e+0
0f 1
15 1.2282775e+04 2.20e-05 1.33e-02 -5.7 1.49e-01 - 8.48e-01 1.00e+0
0h 1
16 1.2282662e+04 2.24e-05 4.75e-05 -5.7 7.83e-03 - 1.00e+00 1.00e+0
0h 1
17 1.2282667e+04 6.32e-08 2.48e-06 -5.7 3.70e-04 - 1.00e+00 1.00e+0
0h 1
18 1.2282653e+04 1.58e-08 3.78e-05 -8.6 1.84e-03 - 9.98e-01 9.60e-0
1h 1
19 1.2282653e+04 3.67e-12 4.32e-11 -8.6 7.34e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.2282652913680252e+01 1.2282652913680251e+0
4
Dual infeasibility......: 4.3180367303606315e-11 4.3180367303606315e-0
8
Constraint violation....: 3.6652902934974918e-12 3.6652902934974918e-1
2
Complementarity.........: 2.5100238651941494e-09 2.5100238651941494e-0
6
Overall NLP error.......: 2.5100238651941494e-09 2.5100238651941494e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891839e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0614875e+02 9.19e+03 5.23e+01 -1.0 8.94e+03 - 8.31e-05 1.02e-0
4h 1
3 8.8589053e+02 9.18e+03 5.23e+01 -1.0 9.18e+03 - 4.99e-06 1.11e-0
3f 1
4 4.8290407e+02 8.97e+03 5.24e+01 -1.0 9.18e+03 - 1.26e-03 2.28e-0
2h 1
5 2.1194856e+04 6.67e-02 7.66e+01 -1.0 8.97e+03 - 8.32e-02 1.00e+0
0h 1
6 1.3110859e+04 6.01e-02 3.76e+01 -1.0 2.89e+01 - 4.83e-01 9.02e-0
2f 1
7 1.1611939e+04 1.94e-02 1.53e+01 -1.0 1.53e+01 - 6.18e-01 7.42e-0
1f 1
8 1.1669715e+04 5.64e-03 1.25e+00 -1.0 2.10e+00 - 9.91e-01 5.00e-0
1f 2
9 1.1851856e+04 3.17e-04 6.99e-02 -1.0 2.45e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1303065e+04 2.21e-03 9.19e-02 -2.5 2.21e+01 - 8.56e-01 8.21e-0
1f 1
11 1.1134535e+04 2.12e-03 4.58e-01 -2.5 3.77e+00 - 1.00e+00 7.49e-0
1f 1
12 1.1105283e+04 1.58e-04 4.78e-03 -2.5 9.43e-01 - 1.00e+00 1.00e+0
0h 1
13 1.1088904e+04 4.25e-05 1.63e-01 -3.8 2.68e+00 - 1.00e+00 7.50e-0
1h 1
14 1.1084573e+04 1.45e-07 3.58e-04 -3.8 6.70e-01 - 1.00e+00 1.00e+0
0f 1
15 1.1083348e+04 2.78e-08 9.22e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 1.1083335e+04 1.87e-12 1.33e-08 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
17 1.1083321e+04 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.1083320722694786e+01 1.1083320722694785e+0
4
Dual infeasibility......: 4.4776953830878037e-09 4.4776953830878037e-0
6
Constraint violation....: 2.6304861067139029e-12 2.6304861067139029e-1
2
Complementarity.........: 3.6085004276148795e-09 3.6085004276148792e-0
6
Overall NLP error.......: 4.4776953830878037e-09 4.4776953830878037e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2299660e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1994562e+02 6.71e+03 5.23e+01 -1.0 5.82e+03 - 3.44e-05 1.14e-0
4h 1
3 7.2850963e+02 6.64e+03 5.23e+01 -1.0 6.70e+03 - 1.95e-05 9.17e-0
3f 1
4 4.9339562e+02 6.50e+03 5.19e+01 -1.0 6.64e+03 - 1.16e-02 2.10e-0
2h 1
5 1.5628517e+04 8.10e-02 7.81e+01 -1.0 6.50e+03 - 8.90e-02 1.00e+0
0h 1
6 1.0636045e+04 7.19e-02 2.13e+01 -1.0 1.24e+01 - 7.05e-01 1.06e-0
1f 1
7 9.4596864e+03 2.23e-02 3.10e+00 -1.0 9.08e+00 - 8.57e-01 8.74e-0
1f 1
8 9.7561576e+03 1.77e-02 1.82e-01 -1.0 2.44e+00 - 9.94e-01 9.15e-0
1f 1
9 9.2870675e+03 8.78e-03 4.56e-01 -2.5 2.19e+00 - 7.53e-01 9.50e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.2214311e+03 2.56e-03 1.28e-01 -2.5 1.43e+00 - 7.74e-01 6.96e-0
1h 1
11 9.2036689e+03 4.09e-04 5.20e-02 -2.5 6.61e-01 - 1.00e+00 9.35e-0
1h 1
12 9.2097361e+03 1.39e-05 4.97e-03 -2.5 6.98e-02 - 1.00e+00 1.00e+0
0f 1
13 9.1844874e+03 1.12e-05 6.41e-03 -3.8 5.36e+00 - 1.00e+00 9.69e-0
1f 1
14 9.1841586e+03 1.60e-08 1.23e-05 -3.8 1.64e-01 - 1.00e+00 1.00e+0
0f 1
15 9.1828155e+03 1.79e-08 5.06e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0f 1
16 9.1828008e+03 6.41e-13 4.12e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 9.1828007616537342e+00 9.1828007616537343e+0
3
Dual infeasibility......: 4.1158728316293032e-10 4.1158728316293032e-0
7
Constraint violation....: 6.4076521866240910e-13 6.4076521866240910e-1
3
Complementarity.........: 2.5986131472907057e-09 2.5986131472907059e-0
6
Overall NLP error.......: 2.5986131472907057e-09 2.5986131472907059e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3004795e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 2.02e-03 9.80e-0
3h 1
2 9.2712367e+02 4.77e+03 5.23e+01 -1.0 4.47e+03 - 6.97e-05 1.06e-0
4h 1
3 8.6230721e+02 4.76e+03 5.23e+01 -1.0 4.77e+03 - 1.09e-05 2.80e-0
3f 1
4 3.9458856e+02 4.65e+03 5.23e+01 -1.0 4.76e+03 - 3.78e-03 2.20e-0
2h 1
5 1.5936731e+04 7.51e-02 7.75e+01 -1.0 4.65e+03 - 7.99e-02 1.00e+0
0h 1
6 9.0816127e+03 6.78e-02 2.29e+01 -1.0 8.31e+00 - 6.77e-01 9.05e-0
2f 1
7 7.8525062e+03 3.47e-02 8.39e+00 -1.0 6.89e+00 - 7.10e-01 1.00e+0
0f 1
8 8.1952987e+03 2.05e-02 2.98e-01 -1.0 2.41e+00 - 9.96e-01 9.69e-0
1f 1
9 7.7640020e+03 3.95e-03 3.54e-01 -1.7 1.12e+01 - 8.33e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.7107177e+03 7.81e-04 3.48e-02 -1.7 7.24e+00 - 1.00e+00 1.00e+0
0h 1
11 7.5664016e+03 4.99e-04 2.40e-02 -2.5 1.64e+01 - 9.77e-01 9.84e-0
1f 1
12 7.5511474e+03 1.19e-04 1.70e-01 -3.8 2.89e+00 - 9.96e-01 7.71e-0
1h 1
13 7.5477479e+03 2.23e-07 1.25e-04 -3.8 6.61e-01 - 1.00e+00 1.00e+0
0f 1
14 7.5465612e+03 1.74e-08 3.02e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
15 7.5465477e+03 1.28e-12 4.23e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 7.5465477168338326e+00 7.5465477168338321e+0
3
Dual infeasibility......: 4.2290101036258925e-10 4.2290101036258925e-0
7
Constraint violation....: 1.2840423169180326e-12 1.2840423169180326e-1
2
Complementarity.........: 2.5905430566376490e-09 2.5905430566376489e-0
6
Overall NLP error.......: 2.5905430566376490e-09 2.5905430566376489e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6658302e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 4.97e-04 9.81e-0
3f 1
2 8.6365170e+02 3.24e+03 5.24e+01 -1.0 3.03e+03 - 9.59e-05 1.06e-0
4h 1
3 7.9164439e+02 3.23e+03 5.24e+01 -1.0 3.24e+03 - 1.34e-05 2.94e-0
3f 1
4 3.2269649e+02 3.17e+03 5.24e+01 -1.0 3.23e+03 - 4.33e-03 2.11e-0
2h 1
5 1.3532414e+04 6.35e-02 8.05e+01 -1.0 3.17e+03 - 5.89e-02 1.00e+0
0h 1
6 6.4324764e+03 5.86e-02 4.63e+01 -1.0 6.47e+01 - 4.10e-01 7.06e-0
2f 1
7 4.8641756e+03 3.05e-02 2.15e+01 -1.0 3.76e+01 - 5.25e-01 4.45e-0
1f 1
8 4.4515440e+03 1.21e-02 1.93e+00 -1.0 1.04e+01 - 9.23e-01 1.00e+0
0f 1
9 4.6903276e+03 4.06e-04 6.36e-02 -1.0 4.25e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2205020e+03 5.03e-04 7.11e-01 -2.5 6.93e+00 - 8.96e-01 6.21e-0
1f 1
11 4.1366846e+03 2.39e-04 3.87e-01 -2.5 2.43e+00 - 8.90e-01 1.00e+0
0h 1
12 4.1101121e+03 5.79e-03 1.75e-01 -2.5 1.74e+00 - 1.00e+00 6.83e-0
1h 1
13 4.1031715e+03 5.46e-04 4.14e-03 -2.5 3.56e-01 - 1.00e+00 1.00e+0
0f 1
14 4.0873945e+03 1.16e-03 3.01e-02 -3.8 2.68e+00 - 8.04e-01 1.00e+0
0h 1
15 4.0842958e+03 2.39e-03 1.07e-03 -3.8 4.80e-02 - 1.00e+00 1.00e+0
0h 1
16 4.0846634e+03 4.13e-05 1.38e-04 -3.8 1.45e-02 - 1.00e+00 1.00e+0
0h 1
17 4.0833438e+03 1.04e-04 4.02e-04 -5.7 1.49e-01 - 9.51e-01 9.80e-0
1h 1
18 4.0833356e+03 2.19e-05 3.60e-03 -5.7 2.93e-03 - 1.00e+00 7.90e-0
1h 1
19 4.0833393e+03 8.57e-09 1.14e-06 -5.7 6.15e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 4.0833246e+03 8.99e-09 1.93e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
21 4.0833244e+03 1.37e-12 6.48e-11 -8.6 3.06e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 4.0833243812525053e+00 4.0833243812525052e+0
3
Dual infeasibility......: 6.4795731161157915e-11 6.4795731161157915e-0
8
Constraint violation....: 1.3739009929736312e-12 1.3739009929736312e-1
2
Complementarity.........: 2.5092130211834238e-09 2.5092130211834239e-0
6
Overall NLP error.......: 2.5092130211834238e-09 2.5092130211834239e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8047271e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.82e-0
3h 1
2 8.7571780e+02 2.00e+03 5.24e+01 -1.0 1.11e+03 - 4.57e-05 1.77e-0
4h 1
3 2.9373644e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 9.83e-05 2.27e-0
2f 1
4 1.4280611e+04 6.09e-02 7.92e+01 -1.0 1.95e+03 - 5.49e-02 1.00e+0
0h 1
5 5.5544141e+03 5.66e-02 5.35e+01 -1.0 6.57e+01 - 3.12e-01 6.38e-0
2f 1
6 4.1958834e+03 3.11e-02 2.65e+01 -1.0 3.24e+01 - 4.93e-01 4.18e-0
1f 1
7 3.3759781e+03 1.36e-02 2.17e+00 -1.0 1.11e+01 - 9.19e-01 9.26e-0
1f 1
8 3.8304846e+03 4.15e-04 1.08e-01 -1.0 5.03e+00 - 9.98e-01 1.00e+0
0f 1
9 3.1614109e+03 1.16e-03 7.21e-02 -1.7 4.89e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.1115004e+03 6.66e-04 2.53e+00 -2.5 4.38e+01 - 1.00e+00 4.28e-0
1h 1
11 3.0653087e+03 7.86e-05 1.89e-02 -2.5 2.48e+01 - 1.00e+00 1.00e+0
0f 1
12 3.0435955e+03 3.47e-04 8.59e-02 -3.8 8.05e+00 - 7.42e-01 1.00e+0
0h 1
13 3.0406900e+03 1.74e-03 2.30e-03 -3.8 3.85e-02 - 9.23e-01 1.00e+0
0h 1
14 3.0407787e+03 9.58e-05 7.87e-05 -3.8 1.29e-02 - 1.00e+00 1.00e+0
0h 1
15 3.0392740e+03 1.37e-04 1.15e-03 -5.7 4.46e-01 - 9.17e-01 1.00e+0
0h 1
16 3.0392305e+03 3.50e-05 7.44e-06 -5.7 8.71e-03 - 1.00e+00 1.00e+0
0h 1
17 3.0392357e+03 3.09e-07 4.27e-06 -5.7 8.02e-04 - 1.00e+00 1.00e+0
0h 1
18 3.0392192e+03 2.90e-08 4.20e-05 -8.6 5.53e-03 - 1.00e+00 9.52e-0
1h 1
19 3.0392184e+03 5.74e-12 5.90e-11 -8.6 2.66e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 3.0392183864216595e+00 3.0392183864216595e+0
3
Dual infeasibility......: 5.9034066307881493e-11 5.9034066307881493e-0
8
Constraint violation....: 5.7392979257997467e-12 5.7392979257997467e-1
2
Complementarity.........: 2.7475050498572347e-09 2.7475050498572346e-0
6
Overall NLP error.......: 2.7475050498572347e-09 2.7475050498572346e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 40
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 20
inequality constraints with only lower bounds: 11
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6492522e+02 9.17e+02 5.24e+01 -1.0 9.19e+02 - 4.97e-04 9.89e-0
3h 1
2 8.4366834e+02 9.17e+02 5.24e+01 -1.0 8.02e+02 - 1.11e-04 7.86e-0
4h 1
3 7.9632468e+02 9.15e+02 5.24e+01 -1.0 9.16e+02 - 7.75e-04 1.79e-0
3h 1
4 2.6745043e+02 8.95e+02 5.24e+01 -1.0 9.15e+02 - 2.72e-03 2.16e-0
2f 1
5 1.1509886e+04 6.26e-02 8.04e+01 -1.0 8.95e+02 - 5.73e-02 1.00e+0
0h 1
6 4.1375859e+03 5.79e-02 4.80e+01 -1.0 6.60e+01 - 3.90e-01 6.85e-0
2f 1
7 2.5657939e+03 3.04e-02 2.29e+01 -1.0 3.78e+01 - 5.13e-01 4.43e-0
1f 1
8 2.1264294e+03 1.26e-02 2.06e+00 -1.0 1.05e+01 - 9.22e-01 1.00e+0
0f 1
9 2.3800172e+03 3.95e-04 8.64e-02 -1.0 4.28e+00 - 9.70e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8943663e+03 5.07e-04 3.77e-01 -2.5 7.13e+00 - 7.78e-01 6.32e-0
1f 1
11 1.8194648e+03 1.81e-04 5.76e-01 -2.5 5.49e+00 - 8.48e-01 1.00e+0
0h 1
12 1.7869278e+03 1.04e-03 2.34e-02 -2.5 4.39e+00 - 1.00e+00 1.00e+0
0h 1
13 1.7621976e+03 1.70e-03 5.93e-02 -3.8 1.42e+01 - 7.15e-01 1.00e+0
0h 1
14 1.7589700e+03 3.68e-03 3.28e-02 -3.8 6.56e-01 - 4.41e-01 1.00e+0
0h 1
15 1.7591923e+03 4.32e-05 2.38e-04 -3.8 1.46e-02 - 1.00e+00 1.00e+0
0h 1
16 1.7571814e+03 1.48e-04 9.45e-04 -5.7 7.47e-01 - 9.35e-01 9.98e-0
1h 1
17 1.7571821e+03 4.53e-05 5.30e-03 -5.7 1.98e-03 - 1.00e+00 6.96e-0
1h 1
18 1.7571954e+03 1.75e-08 1.58e-06 -5.7 1.49e-04 - 1.00e+00 1.00e+0
0f 1
19 1.7571733e+03 1.00e-08 2.46e-05 -8.6 9.21e-03 - 1.00e+00 9.81e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7571729e+03 1.76e-12 9.44e-11 -8.6 1.73e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.7571729198368862e+00 1.7571729198368862e+0
3
Dual infeasibility......: 9.4367720748542344e-11 9.4367720748542344e-0
8
Constraint violation....: 1.7564838472594602e-12 1.7564838472594602e-1
2
Complementarity.........: 2.6511281156403616e-09 2.6511281156403615e-0
6
Overall NLP error.......: 2.6511281156403616e-09 2.6511281156403615e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101443e-01 6.4890146112101445e+0
2
Dual infeasibility......: 4.9126605687865646e-09 4.9126605687865646e-0
6
Constraint violation....: 6.2123811650494076e-09 6.2123811650494076e-0
9
Complementarity.........: 4.3646094984748900e-09 4.3646094984748899e-0
6
Overall NLP error.......: 6.2123811650494076e-09 4.9126605687865646e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318724210404e-09 2.1031318724210404e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896910881e-09 2.8882108896910880e-0
6
Overall NLP error.......: 2.8882108896910881e-09 2.8882108896910880e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101443e-01 6.4890146112101445e+0
2
Dual infeasibility......: 4.9126605687865646e-09 4.9126605687865646e-0
6
Constraint violation....: 6.2123811650494076e-09 6.2123811650494076e-0
9
Complementarity.........: 4.3646094984748900e-09 4.3646094984748899e-0
6
Overall NLP error.......: 6.2123811650494076e-09 4.9126605687865646e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.05e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.57e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235660133e+00 1.6104063235660133e+0
3
Dual infeasibility......: 2.4574703683349549e-12 2.4574703683349549e-0
9
Constraint violation....: 7.5703156732291306e-16 7.5703156732291306e-1
6
Complementarity.........: 2.5062163919681810e-09 2.5062163919681812e-0
6
Overall NLP error.......: 2.5062163919681810e-09 2.5062163919681812e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2278083e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 3.31e-04 9.87e-0
3h 1
2 8.0391474e+02 9.17e+02 5.24e+01 -1.0 7.85e+02 - 8.87e-05 6.88e-0
4h 1
3 2.4271271e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 6.68e-04 2.10e-0
2h 1
4 1.2385916e+04 5.52e-02 8.23e+01 -1.0 8.98e+02 - 3.86e-02 1.00e+0
0h 1
5 3.8851959e+03 5.26e-02 5.59e+01 -1.0 8.06e+01 - 3.19e-01 5.02e-0
2f 1
6 1.9099004e+03 3.73e-02 2.99e+01 -1.0 3.93e+01 - 4.69e-01 5.04e-0
1f 1
7 4.6737272e+03 1.22e-02 2.67e+01 -1.0 2.06e+01 - 4.01e-01 1.00e+0
0h 1
8 1.8754601e+03 1.19e-02 1.01e+00 -1.0 2.53e+01 - 9.88e-01 8.94e-0
1f 1
9 2.0005994e+03 1.84e-04 4.66e-02 -1.0 3.18e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7351413e+03 2.16e-04 1.24e+00 -2.5 1.71e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5469297e+03 3.76e-03 1.33e-01 -2.5 7.60e+00 - 7.95e-01 1.00e+0
0f 1
12 1.5237159e+03 5.30e-03 3.11e-01 -2.5 1.84e+00 - 1.00e+00 7.66e-0
1h 1
13 1.5360639e+03 2.44e-04 4.74e-03 -2.5 7.11e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5034784e+03 1.70e-04 2.15e-02 -3.8 1.62e+01 - 9.91e-01 9.29e-0
1h 1
15 1.5021214e+03 7.21e-07 6.83e-05 -3.8 1.10e+00 - 1.00e+00 1.00e+0
0h 1
16 1.5003172e+03 3.77e-07 1.78e-04 -5.7 8.92e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003154e+03 3.79e-11 2.92e-09 -5.7 4.18e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.11e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932788833760e+00 1.5002932788833759e+0
3
Dual infeasibility......: 2.1737235539602137e-09 2.1737235539602137e-0
6
Constraint violation....: 6.2995469951587779e-11 6.2995469951587779e-1
1
Complementarity.........: 2.8882174399884947e-09 2.8882174399884946e-0
6
Overall NLP error.......: 2.8882174399884947e-09 2.8882174399884946e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6534772e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 4.97e-04 9.87e-0
3h 1
2 8.4418057e+02 9.17e+02 5.24e+01 -1.0 8.02e+02 - 8.70e-05 7.83e-0
4h 1
3 2.6276094e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 7.65e-04 2.20e-0
2h 1
4 1.2724514e+04 5.99e-02 8.02e+01 -1.0 8.97e+02 - 5.06e-02 1.00e+0
0h 1
5 4.2755874e+03 5.59e-02 5.32e+01 -1.0 7.28e+01 - 3.26e-01 6.05e-0
2f 1
12 1.402308e+04 1.632511e+04 2.275230e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2433855e+02 1.57e+04 5.24e+01 -1.0 1.59e+04 - 3.31e-04 9.80e-0
3h 1
2 8.2143053e+02 1.57e+04 5.24e+01 -1.0 1.45e+04 - 3.13e-05 1.08e-0
4h 1
3 8.1937362e+02 1.57e+04 5.24e+01 -1.0 1.56e+04 - 1.14e-05 1.64e-0
4h 1
4 8.1812832e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 1.75e-04 1.01e-0
4h 1
5 5.6141973e+02 1.54e+04 5.26e+01 -1.0 1.57e+04 - 2.83e-04 2.13e-0
2f 1
6 2.7338038e+04 5.50e-02 8.23e+01 -1.0 1.54e+04 - 3.82e-02 1.00e+0
0h 1
7 1.8720726e+04 5.25e-02 5.69e+01 -1.0 8.16e+01 - 3.07e-01 4.97e-0
2f 1
8 1.6736259e+04 3.74e-02 3.05e+01 -1.0 3.92e+01 - 4.68e-01 5.06e-0
1f 1
9 1.7083627e+04 2.26e-02 1.43e+01 -1.0 2.07e+01 - 3.99e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6823377e+04 6.03e-03 4.10e-01 -1.0 5.00e+00 - 9.78e-01 1.00e+0
0h 1
11 1.6517359e+04 1.44e-03 4.09e-01 -1.7 5.55e+00 - 1.00e+00 8.24e-0
1f 1
12 1.6485002e+04 9.27e-04 1.43e-02 -1.7 2.69e+01 - 1.00e+00 1.00e+0
0f 1
13 1.6361541e+04 1.22e-03 2.04e-02 -3.8 3.46e+01 - 7.89e-01 8.11e-0
1f 1
14 1.6326528e+04 1.84e-03 4.85e-02 -3.8 2.22e+00 - 8.37e-01 7.83e-0
1h 1
15 1.6325937e+04 1.24e-05 6.85e-03 -3.8 3.58e-02 - 1.00e+00 9.93e-0
1h 1
16 1.6326164e+04 2.11e-07 4.62e-06 -3.8 3.32e-01 - 1.00e+00 1.00e+0
0f 1
17 1.6325118e+04 4.09e-07 2.37e-04 -5.7 1.49e-01 - 1.00e+00 9.95e-0
1h 1
18 1.6325118e+04 4.21e-11 3.33e-09 -5.7 1.26e-03 - 1.00e+00 1.00e+0
0f 1
19 1.6325105e+04 6.30e-11 2.17e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.6325105196442124e+01 1.6325105196442124e+0
4
Dual infeasibility......: 2.1737050066855967e-09 2.1737050066855967e-0
6
Constraint violation....: 6.2994706673258349e-11 6.2994706673258349e-1
1
Complementarity.........: 2.8882097768322562e-09 2.8882097768322561e-0
6
Overall NLP error.......: 2.8882097768322562e-09 2.8882097768322561e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9092742e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 6.99e-04 9.80e-0
3h 1
2 8.8813257e+02 1.50e+04 5.24e+01 -1.0 1.42e+04 - 4.17e-05 1.04e-0
4h 1
3 8.5687488e+02 1.49e+04 5.24e+01 -1.0 1.50e+04 - 7.07e-06 2.49e-0
3h 1
4 6.1833890e+02 1.46e+04 5.24e+01 -1.0 1.49e+04 - 2.68e-03 2.18e-0
2h 1
5 2.6204248e+04 6.52e-02 7.84e+01 -1.0 1.46e+04 - 7.05e-02 1.00e+0
0h 1
6 1.8535252e+04 5.95e-02 4.67e+01 -1.0 5.11e+01 - 3.88e-01 7.97e-0
2f 1
7 1.7224251e+04 2.80e-02 1.95e+01 -1.0 2.45e+01 - 5.70e-01 4.85e-0
1f 1
8 1.6735521e+04 5.60e-03 1.11e+00 -1.0 9.12e+00 - 9.33e-01 7.49e-0
1f 1
9 1.6992070e+04 2.68e-04 7.23e-02 -1.0 4.01e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6382930e+04 2.14e-03 8.33e-02 -2.5 4.60e+00 - 8.66e-01 8.46e-0
1f 1
11 1.6204715e+04 2.15e-03 2.08e-01 -2.5 9.64e-01 - 1.00e+00 8.32e-0
1f 1
12 1.6188524e+04 8.82e-05 3.90e-03 -2.5 1.39e-01 - 1.00e+00 1.00e+0
0h 1
13 1.6176210e+04 4.70e-05 1.10e+00 -3.8 5.36e+00 - 1.00e+00 4.97e-0
1h 1
14 1.6171552e+04 3.43e-07 1.11e-01 -3.8 2.69e+00 - 9.68e-01 1.00e+0
0f 1
15 1.6170518e+04 1.55e-08 1.79e-03 -3.8 3.29e-02 - 1.00e+00 1.00e+0
0H 1
16 1.6170715e+04 1.15e-05 2.77e-04 -3.8 3.79e-03 - 1.00e+00 1.00e+0
0f 1
17 1.6169805e+04 1.87e-06 6.31e-02 -5.7 2.97e-01 - 7.77e-01 9.69e-0
1h 1
18 1.6169628e+04 1.24e-05 2.12e-04 -5.7 9.35e-03 - 1.00e+00 1.00e+0
0f 1
19 1.6169634e+04 2.72e-08 2.14e-06 -5.7 2.58e-04 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6169617e+04 2.73e-08 7.95e-06 -8.6 3.68e-03 - 9.82e-01 9.88e-0
1h 1
21 1.6169617e+04 2.83e-13 3.31e-11 -8.6 4.37e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.6169616801559851e+01 1.6169616801559851e+0
4
Dual infeasibility......: 3.3090664732431785e-11 3.3090664732431785e-0
8
Constraint violation....: 2.8332891588433995e-13 2.8332891588433995e-1
3
Complementarity.........: 2.6964183452043889e-09 2.6964183452043887e-0
6
Overall NLP error.......: 2.6964183452043889e-09 2.6964183452043887e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6663159e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 4.97e-04 9.80e-0
3h 1
2 8.6380231e+02 1.39e+04 5.24e+01 -1.0 1.32e+04 - 4.46e-05 1.04e-0
4h 1
3 8.6189920e+02 1.39e+04 5.24e+01 -1.0 1.38e+04 - 7.32e-06 1.36e-0
4h 1
4 8.5956800e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 1.42e-04 1.69e-0
4h 1
5 5.5559471e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 3.19e-04 2.23e-0
2f 1
6 2.5865965e+04 5.95e-02 8.01e+01 -1.0 1.36e+04 - 4.99e-02 1.00e+0
0h 1
7 1.7271606e+04 5.56e-02 5.37e+01 -1.0 7.37e+01 - 3.19e-01 5.97e-0
2f 1
8 1.5682451e+04 3.01e-02 2.81e+01 -1.0 3.89e+01 - 4.72e-01 4.32e-0
1f 1
9 1.5398040e+04 1.45e-02 2.57e+00 -1.0 1.10e+01 - 9.18e-01 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5229852e+04 7.13e-03 1.83e+00 -1.0 8.13e+00 - 9.96e-01 5.00e-0
1f 2
11 1.5352742e+04 5.62e-04 4.21e-02 -1.0 1.18e+02 - 1.00e+00 1.00e+0
0f 1
12 1.4900935e+04 4.47e-04 9.63e-01 -2.5 1.32e+02 - 9.17e-01 5.84e-0
1f 1
13 1.4778329e+04 2.21e-04 1.84e-01 -2.5 4.16e+01 - 9.25e-01 9.90e-0
1f 1
14 1.4754470e+04 2.93e-03 1.65e-02 -2.5 2.81e+00 - 1.00e+00 1.00e+0
0f 1
15 1.4741026e+04 8.34e-04 3.62e-02 -3.8 2.82e+00 - 8.02e-01 1.00e+0
0h 1
16 1.4738031e+04 2.28e-03 1.03e-03 -3.8 4.88e-02 - 1.00e+00 1.00e+0
0h 1
17 1.4738260e+04 4.76e-05 1.37e-04 -3.8 1.22e-02 - 1.00e+00 1.00e+0
0h 1
18 1.4736957e+04 1.01e-04 3.33e-04 -5.7 1.49e-01 - 9.50e-01 9.75e-0
1h 1
19 1.4736943e+04 2.31e-05 3.87e-03 -5.7 3.68e-03 - 1.00e+00 7.72e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.4736946e+04 8.99e-09 1.28e-06 -5.7 8.38e-04 - 1.00e+00 1.00e+0
0f 1
21 1.4736932e+04 9.08e-09 1.93e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
22 1.4736931e+04 1.37e-12 6.55e-11 -8.6 3.06e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.4736931392191922e+01 1.4736931392191922e+0
4
Dual infeasibility......: 6.5452710185812364e-11 6.5452710185812364e-0
8
Constraint violation....: 1.3702372569923682e-12 1.3702372569923682e-1
2
Complementarity.........: 2.5092857965282444e-09 2.5092857965282445e-0
6
Overall NLP error.......: 2.5092857965282444e-09 2.5092857965282445e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1596960e+02 1.27e+04 5.23e+01 -1.0 1.28e+04 - 1.20e-03 9.80e-0
3h 1
2 9.1314150e+02 1.27e+04 5.23e+01 -1.0 1.18e+04 - 3.58e-05 1.06e-0
4h 1
3 9.1094164e+02 1.26e+04 5.23e+01 -1.0 1.26e+04 - 9.55e-06 1.48e-0
4h 1
4 9.0809981e+02 1.26e+04 5.23e+01 -1.0 1.26e+04 - 1.55e-04 1.93e-0
4h 1
5 5.6662246e+02 1.23e+04 5.24e+01 -1.0 1.26e+04 - 3.60e-04 2.34e-0
2f 1
6 2.5057621e+04 6.71e-02 7.63e+01 -1.0 1.23e+04 - 8.11e-02 1.00e+0
0h 1
7 1.6757126e+04 6.06e-02 3.18e+01 -1.0 2.07e+01 - 5.53e-01 8.79e-0
2f 1
8 1.5228914e+04 1.64e-02 1.38e+01 -1.0 1.27e+01 - 6.25e-01 8.69e-0
1f 1
9 1.5389344e+04 8.56e-03 6.96e-01 -1.0 3.78e+00 - 9.91e-01 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5055672e+04 7.92e-03 2.43e-01 -1.7 4.29e+00 - 1.00e+00 8.49e-0
1f 1
11 1.4998610e+04 1.27e-03 1.03e-01 -1.7 1.84e+01 - 1.00e+00 1.00e+0
0f 1
12 1.4870090e+04 4.22e-04 1.08e-01 -2.5 2.11e+01 - 9.68e-01 8.76e-0
1h 1
13 1.4856600e+04 2.29e-05 3.38e-03 -2.5 9.47e-01 - 1.00e+00 1.00e+0
0f 1
14 1.4838307e+04 8.68e-06 1.03e-01 -3.8 2.76e+00 - 1.00e+00 8.22e-0
1f 1
15 1.4835312e+04 5.17e-08 7.19e-05 -3.8 4.47e-01 - 1.00e+00 1.00e+0
0f 1
16 1.4834112e+04 1.99e-08 1.57e-04 -5.7 1.49e-01 - 1.00e+00 9.96e-0
1f 1
17 1.4834111e+04 1.81e-12 2.22e-09 -5.7 4.33e-04 - 1.00e+00 1.00e+0
0f 1
18 1.4834096e+04 2.63e-12 1.52e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.4834096269451445e+01 1.4834096269451444e+0
4
Dual infeasibility......: 1.5189622055599373e-09 1.5189622055599373e-0
6
Constraint violation....: 2.6291746557660645e-12 2.6291746557660645e-1
2
Complementarity.........: 2.8635056589881243e-09 2.8635056589881243e-0
6
Overall NLP error.......: 2.8635056589881243e-09 2.8635056589881243e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9481942e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 7.48e-04 9.80e-0
3h 1
2 8.9197823e+02 1.11e+04 5.24e+01 -1.0 1.04e+04 - 4.18e-05 1.06e-0
4h 1
3 8.3527077e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 9.63e-06 3.46e-0
3h 1
4 5.3623937e+02 1.08e+04 5.23e+01 -1.0 1.11e+04 - 3.85e-03 2.15e-0
2h 1
5 2.1933099e+04 6.71e-02 7.79e+01 -1.0 1.08e+04 - 8.01e-02 1.00e+0
0h 1
6 1.4673675e+04 6.05e-02 4.23e+01 -1.0 4.53e+01 - 4.37e-01 8.94e-0
2f 1
7 1.3327687e+04 2.86e-02 1.56e+01 -1.0 2.13e+01 - 6.21e-01 5.45e-0
1f 1
8 1.3017486e+04 4.21e-03 8.87e-01 -1.0 6.85e+00 - 9.49e-01 7.63e-0
1f 1
9 1.3264412e+04 1.26e-04 5.69e-02 -1.0 6.42e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2672550e+04 2.20e-03 8.22e-02 -2.5 3.95e+00 - 8.61e-01 8.47e-0
1f 1
11 1.2504071e+04 2.15e-03 3.45e-01 -2.5 8.59e-01 - 1.00e+00 7.80e-0
1f 1
12 1.2479357e+04 1.51e-04 4.63e-03 -2.5 1.73e-01 - 1.00e+00 1.00e+0
0h 1
13 1.2456714e+04 2.21e-05 3.94e-02 -3.8 5.36e+00 - 1.00e+00 8.88e-0
1h 1
14 1.2455033e+04 5.68e-08 6.01e-04 -3.8 5.99e-01 - 1.00e+00 1.00e+0
0f 1
15 1.2453577e+04 4.28e-08 3.91e-05 -5.7 2.97e-01 - 1.00e+00 9.98e-0
1f 1
16 1.2453579e+04 1.88e-12 1.19e-08 -5.7 4.73e-04 - 1.00e+00 1.00e+0
0f 1
17 1.2453562e+04 2.57e-12 3.30e-06 -8.6 3.68e-03 - 1.00e+00 9.99e-0
1f 1
18 1.2453562e+04 7.11e-15 4.87e-14 -8.6 2.03e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.2453562286257897e+01 1.2453562286257897e+0
4
Dual infeasibility......: 4.8713563808052992e-14 4.8713563808052992e-1
1
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.6370275323070749e-09 2.6370275323070747e-0
6
Overall NLP error.......: 2.6370275323070749e-09 2.6370275323070747e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891076e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0602418e+02 9.19e+03 5.23e+01 -1.0 8.41e+03 - 3.92e-05 1.08e-0
4h 1
3 8.1828316e+02 9.14e+03 5.24e+01 -1.0 9.19e+03 - 1.24e-05 4.81e-0
3h 1
4 5.0911016e+02 8.95e+03 5.22e+01 -1.0 9.14e+03 - 5.53e-03 2.13e-0
2h 1
5 1.9574028e+04 7.15e-02 7.74e+01 -1.0 8.95e+03 - 8.67e-02 1.00e+0
0h 1
6 1.2972291e+04 6.39e-02 3.14e+01 -1.0 2.60e+01 - 5.69e-01 9.74e-0
2f 1
7 1.1456842e+04 1.98e-02 1.02e+01 -1.0 1.50e+01 - 6.92e-01 7.89e-0
1f 1
8 1.1617387e+04 7.35e-03 8.73e-01 -1.0 3.38e+00 - 9.92e-01 5.00e-0
1f 2
9 1.1302521e+04 1.11e-02 3.71e-01 -1.7 1.05e+01 - 6.19e-01 8.28e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1276952e+04 8.26e-04 7.37e-01 -1.7 1.50e+01 - 6.32e-01 1.00e+0
0f 1
11 1.1288987e+04 7.17e-05 3.86e-03 -1.7 1.15e+01 - 1.00e+00 1.00e+0
0h 1
12 1.1113940e+04 5.61e-04 2.52e-02 -3.8 3.53e+01 - 8.38e-01 8.36e-0
1f 1
13 1.1087201e+04 1.46e-04 7.91e-02 -3.8 5.74e+00 - 9.92e-01 8.37e-0
1h 1
14 1.1084767e+04 1.85e-07 9.86e-02 -3.8 9.35e-01 - 9.21e-01 1.00e+0
0h 1
15 1.1084687e+04 4.62e-09 2.90e-05 -3.8 1.57e-04 - 1.00e+00 1.00e+0
0h 1
16 1.1083373e+04 1.92e-08 3.89e-03 -5.7 2.97e-01 - 1.00e+00 9.68e-0
1f 1
17 1.1083337e+04 5.76e-12 2.63e-08 -5.7 9.61e-03 - 1.00e+00 1.00e+0
0f 1
18 1.1083321e+04 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1083320728702322e+01 1.1083320728702322e+0
4
Dual infeasibility......: 4.4780433327875909e-09 4.4780433327875909e-0
6
Constraint violation....: 2.6337890202121628e-12 2.6337890202121628e-1
2
Complementarity.........: 3.6085483577064507e-09 3.6085483577064507e-0
6
Overall NLP error.......: 4.4780433327875909e-09 4.4780433327875909e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891119e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0611351e+02 6.71e+03 5.23e+01 -1.0 6.46e+03 - 8.39e-05 1.03e-0
4h 1
3 8.7440044e+02 6.70e+03 5.23e+01 -1.0 6.70e+03 - 6.84e-06 1.53e-0
3f 1
4 4.2534165e+02 6.54e+03 5.24e+01 -1.0 6.70e+03 - 1.83e-03 2.26e-0
2h 1
5 1.8469067e+04 6.74e-02 7.67e+01 -1.0 6.54e+03 - 8.35e-02 1.00e+0
0h 1
6 1.0609292e+04 6.07e-02 3.68e+01 -1.0 2.85e+01 - 4.94e-01 9.10e-0
2f 1
7 9.1070968e+03 1.97e-02 1.46e+01 -1.0 1.53e+01 - 6.26e-01 7.49e-0
1f 1
8 9.1804481e+03 5.62e-03 1.19e+00 -1.0 2.08e+00 - 9.93e-01 5.00e-0
1f 2
9 9.3751841e+03 2.91e-04 6.67e-02 -1.0 2.88e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.8198146e+03 2.22e-03 9.09e-02 -2.5 2.66e+01 - 8.56e-01 8.23e-0
1f 1
11 8.6513288e+03 2.12e-03 4.55e-01 -2.5 4.37e+00 - 1.00e+00 7.50e-0
1f 1
12 8.6223061e+03 1.56e-04 4.78e-03 -2.5 1.09e+00 - 1.00e+00 1.00e+0
0h 1
13 8.6058823e+03 4.18e-05 1.61e-01 -3.8 2.68e+00 - 1.00e+00 7.51e-0
1h 1
14 8.6015687e+03 1.44e-07 3.57e-04 -3.8 6.67e-01 - 1.00e+00 1.00e+0
0f 1
15 8.6003430e+03 2.79e-08 9.26e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 8.6003307e+03 1.87e-12 1.33e-08 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
17 8.6003159e+03 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 8.6003159080856708e+00 8.6003159080856713e+0
3
Dual infeasibility......: 4.4776954440131895e-09 4.4776954440131895e-0
6
Constraint violation....: 2.6308608069847139e-12 2.6308608069847139e-1
2
Complementarity.........: 3.6085002106059363e-09 3.6085002106059360e-0
6
Overall NLP error.......: 4.4776954440131895e-09 4.4776954440131895e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0890039e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0606063e+02 4.77e+03 5.23e+01 -1.0 4.53e+03 - 8.51e-05 1.04e-0
4h 1
3 8.5674884e+02 4.76e+03 5.23e+01 -1.0 4.77e+03 - 9.62e-06 2.18e-0
3f 1
4 3.8122229e+02 4.65e+03 5.23e+01 -1.0 4.76e+03 - 2.82e-03 2.23e-0
2h 1
5 1.6129511e+04 6.86e-02 7.70e+01 -1.0 4.65e+03 - 8.42e-02 1.00e+0
0h 1
6 8.6428592e+03 6.17e-02 3.53e+01 -1.0 2.77e+01 - 5.15e-01 9.25e-0
2f 1
7 7.1353040e+03 1.99e-02 1.35e+01 -1.0 1.52e+01 - 6.41e-01 7.60e-0
1f 1
8 7.2345504e+03 6.03e-03 1.10e+00 -1.0 2.38e+00 - 9.93e-01 5.00e-0
1f 2
9 7.4467494e+03 2.48e-04 6.11e-02 -1.0 3.13e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.8841153e+03 2.26e-03 8.91e-02 -2.5 2.93e+01 - 8.55e-01 8.27e-0
1f 1
11 6.7163515e+03 2.12e-03 4.49e-01 -2.5 4.53e+00 - 1.00e+00 7.51e-0
1f 1
12 6.6879049e+03 1.53e-04 4.78e-03 -2.5 1.12e+00 - 1.00e+00 1.00e+0
0h 1
13 6.6714076e+03 4.08e-05 1.58e-01 -3.8 2.68e+00 - 1.00e+00 7.53e-0
1h 1
14 6.6671226e+03 1.41e-07 3.55e-04 -3.8 6.62e-01 - 1.00e+00 1.00e+0
0f 1
15 6.6658964e+03 2.80e-08 9.30e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 6.6658841e+03 1.87e-12 1.34e-08 -5.7 2.14e-03 - 1.00e+00 1.00e+0
0f 1
17 6.6658693e+03 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 6.6658693224852570e+00 6.6658693224852568e+0
3
Dual infeasibility......: 4.4776949103371165e-09 4.4776949103371165e-0
6
Constraint violation....: 2.6304444733504795e-12 2.6304444733504795e-1
2
Complementarity.........: 3.6084999013952805e-09 3.6084999013952804e-0
6
Overall NLP error.......: 4.4776949103371165e-09 4.4776949103371165e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2294726e+02 3.24e+03 5.23e+01 -1.0 3.27e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1945201e+02 3.24e+03 5.23e+01 -1.0 2.47e+03 - 3.93e-05 1.30e-0
4h 1
3 3.4573144e+02 3.17e+03 5.24e+01 -1.0 3.24e+03 - 4.04e-05 2.36e-0
2f 1
4 1.5906615e+04 6.81e-02 7.93e+01 -1.0 3.17e+03 - 4.21e-02 1.00e+0
0h 1
5 7.5933644e+03 6.41e-02 5.66e+01 -1.0 2.00e+01 - 2.81e-01 5.33e-0
2f 1
6 6.3092956e+03 1.54e-02 2.51e+01 -1.0 1.01e+01 - 5.90e-01 8.06e-0
1f 1
7 6.3346293e+03 6.22e-03 2.30e-01 -1.0 1.94e+00 - 9.91e-01 1.00e+0
0f 1
8 5.9359407e+03 1.57e-03 8.58e-02 -1.7 4.62e+00 - 9.54e-01 9.66e-0
1f 1
9 5.7816598e+03 1.61e-03 1.69e-01 -2.5 1.12e+00 - 8.36e-01 7.53e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.7447504e+03 3.75e-04 1.05e-01 -2.5 3.41e-01 - 1.00e+00 8.95e-0
1h 1
11 5.7479021e+03 1.32e-05 4.88e-03 -2.5 5.51e-02 - 1.00e+00 1.00e+0
0f 1
12 5.7227200e+03 1.11e-05 6.72e-03 -3.8 5.36e+00 - 1.00e+00 9.67e-0
1f 1
13 5.7223578e+03 1.59e-08 1.26e-05 -3.8 1.71e-01 - 1.00e+00 1.00e+0
0f 1
14 5.7210148e+03 1.79e-08 5.06e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0f 1
15 5.7210000e+03 6.40e-13 4.12e-10 -8.6 3.67e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.7210000265120540e+00 5.7210000265120534e+0
3
Dual infeasibility......: 4.1154465845205068e-10 4.1154465845205068e-0
7
Constraint violation....: 6.4037664060379029e-13 6.4037664060379029e-1
3
Complementarity.........: 3.2986259814474636e-09 3.2986259814474635e-0
6
Overall NLP error.......: 3.2986259814474636e-09 3.2986259814474635e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4538520e+02 2.00e+03 5.24e+01 -1.0 2.02e+03 - 3.98e-04 9.81e-0
3f 1
2 8.4231260e+02 2.00e+03 5.24e+01 -1.0 1.79e+03 - 1.02e-04 1.10e-0
4h 1
3 7.1124430e+02 1.99e+03 5.24e+01 -1.0 2.00e+03 - 2.16e-05 5.05e-0
3f 1
4 2.8981165e+02 1.95e+03 5.20e+01 -1.0 1.99e+03 - 1.05e-02 2.03e-0
2f 1
5 1.0201295e+04 6.58e-02 8.06e+01 -1.0 1.95e+03 - 7.71e-02 1.00e+0
0h 1
6 4.6339951e+03 5.92e-02 2.35e+01 -1.0 5.97e+01 - 6.87e-01 9.29e-0
2f 1
7 2.9806183e+03 3.57e-02 5.61e+00 -1.0 3.57e+01 - 7.27e-01 5.16e-0
1f 1
8 3.4333562e+03 5.70e-03 3.60e-01 -1.0 6.59e+00 - 9.67e-01 1.00e+0
0h 1
9 2.8155727e+03 1.00e-03 1.73e-01 -1.7 9.11e+00 - 1.00e+00 8.65e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.6595013e+03 1.27e-03 3.83e-01 -2.5 6.48e+00 - 7.67e-01 1.00e+0
0h 1
11 2.5900984e+03 2.05e-02 6.76e-02 -2.5 4.11e+00 - 9.30e-01 9.07e-0
1h 1
12 2.6017434e+03 7.28e-04 1.17e-02 -2.5 4.90e-01 - 1.00e+00 1.00e+0
0h 1
13 2.5815687e+03 2.61e-04 5.66e-02 -3.8 2.69e+00 - 9.94e-01 8.74e-0
1h 1
14 2.5805166e+03 1.09e-06 1.27e-04 -3.8 3.36e-01 - 1.00e+00 1.00e+0
0h 1
15 2.5794652e+03 3.43e-07 2.10e-03 -5.7 1.49e-01 - 1.00e+00 9.78e-0
1h 1
16 2.5794567e+03 3.85e-11 2.12e-08 -5.7 3.27e-03 - 1.00e+00 1.00e+0
0f 1
17 2.5794438e+03 6.30e-11 4.40e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 2.5794437785073474e+00 2.5794437785073474e+0
3
Dual infeasibility......: 4.3996645738380990e-09 4.3996645738380990e-0
6
Constraint violation....: 6.3005822781292409e-11 6.3005822781292409e-1
1
Complementarity.........: 3.3091808060641510e-09 3.3091808060641509e-0
6
Overall NLP error.......: 4.3996645738380990e-09 4.3996645738380990e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2208883e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 3.29e-04 9.87e-0
3h 1
2 8.0324402e+02 9.17e+02 5.24e+01 -1.0 7.85e+02 - 8.88e-05 6.87e-0
4h 1
3 2.4240623e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 6.67e-04 2.10e-0
2h 1
4 1.2380496e+04 5.52e-02 8.24e+01 -1.0 8.98e+02 - 3.84e-02 1.00e+0
0h 1
5 3.8796605e+03 5.26e-02 5.61e+01 -1.0 8.06e+01 - 3.16e-01 5.00e-0
2f 1
6 1.9096197e+03 3.75e-02 3.00e+01 -1.0 3.91e+01 - 4.70e-01 5.04e-0
1f 1
7 4.6686769e+03 1.22e-02 2.67e+01 -1.0 2.05e+01 - 4.02e-01 1.00e+0
0h 1
8 1.8748473e+03 1.18e-02 1.00e+00 -1.0 2.53e+01 - 9.88e-01 8.94e-0
1f 1
9 2.0007628e+03 1.82e-04 4.63e-02 -1.0 3.23e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7349604e+03 2.15e-04 1.23e+00 -2.5 1.77e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5468551e+03 3.76e-03 1.33e-01 -2.5 7.59e+00 - 7.96e-01 1.00e+0
0f 1
12 1.5237335e+03 5.33e-03 3.08e-01 -2.5 1.83e+00 - 1.00e+00 7.68e-0
1h 1
13 1.5360585e+03 2.45e-04 4.69e-03 -2.5 7.08e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5034660e+03 1.70e-04 2.13e-02 -3.8 1.62e+01 - 9.91e-01 9.30e-0
1h 1
15 1.5021214e+03 7.20e-07 6.83e-05 -3.8 1.09e+00 - 1.00e+00 1.00e+0
0h 1
16 1.5003171e+03 3.77e-07 1.76e-04 -5.7 8.92e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003154e+03 3.79e-11 2.93e-09 -5.7 3.96e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.11e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932788862435e+00 1.5002932788862436e+0
3
Dual infeasibility......: 2.1694082872857779e-09 2.1694082872857779e-0
6
Constraint violation....: 6.2995469951587779e-11 6.2995469951587779e-1
1
Complementarity.........: 2.8882170416216051e-09 2.8882170416216049e-0
6
Overall NLP error.......: 2.8882170416216051e-09 2.8882170416216049e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.80e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.4977439e+02 7.52e+01 9.06e+01 -1.0 2.60e+01 - 3.82e-04 3.52e-0
2f 1
2 1.1816101e+04 5.63e-02 8.12e+01 -1.0 2.88e+01 - 4.62e-02 1.00e+0
0h 1
3 3.1563753e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.64e-0
2f 1
4 1.0149203e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8287635e+03 7.32e-03 1.59e+01 -1.0 1.90e+01 - 6.03e-01 1.00e+0
0h 1
6 1.1132645e+03 5.44e-03 4.06e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8141234e+02 9.79e-04 2.02e-01 -1.7 5.70e+00 - 1.00e+00 8.92e-0
1h 1
8 7.2726706e+02 8.60e-04 1.29e-02 -1.7 3.47e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0949117e+02 1.50e-03 1.12e-01 -3.8 4.46e+00 - 7.72e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8220777e+02 2.13e-03 7.56e-02 -3.8 2.09e+00 - 8.08e-01 7.38e-0
1h 1
11 5.8339016e+02 7.15e-05 3.62e-02 -3.8 3.05e-02 - 1.00e+00 9.66e-0
1h 1
12 5.8368704e+02 2.74e-07 1.08e-05 -3.8 4.04e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278916e+02 4.12e-07 5.13e-04 -5.7 3.46e-02 - 1.00e+00 9.92e-0
1h 1
14 5.8278859e+02 4.35e-11 3.44e-09 -5.7 2.52e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.61e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753113969633e-01 5.8277753113969629e+0
2
Dual infeasibility......: 2.6142518800031853e-09 2.6142518800031853e-0
6
Constraint violation....: 6.3002117411947722e-11 6.3002117411947722e-1
1
Complementarity.........: 2.8882627475262773e-09 2.8882627475262773e-0
6
Overall NLP error.......: 2.8882627475262773e-09 2.8882627475262773e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1565595e+02 1.10e+02 1.13e+02 -1.0 3.77e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1395951e+04 5.38e-02 8.36e+01 -1.0 4.54e+01 - 3.09e-02 1.00e+0
0h 1
3 2.7823280e+03 5.17e-02 6.49e+01 -1.0 8.43e+01 - 2.27e-01 4.31e-0
2f 1
4 9.8131028e+02 4.24e-02 3.38e+01 -1.0 3.40e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5884667e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.22e-01 1.00e+0
0h 1
6 9.4486055e+02 1.01e-02 8.70e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6263096e+02 4.58e-04 6.61e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536195e+02 1.94e-03 1.93e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379512e+02 3.25e-03 6.09e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140263e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388121e+02 1.57e-04 1.68e-02 -3.8 7.57e-01 - 9.93e-01 9.42e-0
1h 1
12 5.8370190e+02 7.28e-07 6.65e-05 -3.8 8.53e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278678e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.07e-09 -5.7 3.36e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148959088e-01 5.8277753148959084e+0
2
Dual infeasibility......: 2.0876981851050762e-09 2.0876981851050762e-0
6
Constraint violation....: 6.2993804617050841e-11 6.2993804617050841e-1
1
Complementarity.........: 2.8882094113858178e-09 2.8882094113858177e-0
6
Overall NLP error.......: 2.8882094113858178e-09 2.8882094113858177e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.80e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.4977439e+02 7.52e+01 9.06e+01 -1.0 2.60e+01 - 3.82e-04 3.52e-0
2f 1
2 1.1816101e+04 5.63e-02 8.12e+01 -1.0 2.88e+01 - 4.62e-02 1.00e+0
0h 1
3 3.1563753e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.64e-0
2f 1
4 1.0149203e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8287635e+03 7.32e-03 1.59e+01 -1.0 1.90e+01 - 6.03e-01 1.00e+0
0h 1
6 1.1132645e+03 5.44e-03 4.06e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8141234e+02 9.79e-04 2.02e-01 -1.7 5.70e+00 - 1.00e+00 8.92e-0
1h 1
8 7.2726706e+02 8.60e-04 1.29e-02 -1.7 3.47e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0949117e+02 1.50e-03 1.12e-01 -3.8 4.46e+00 - 7.72e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8220777e+02 2.13e-03 7.56e-02 -3.8 2.09e+00 - 8.08e-01 7.38e-0
1h 1
11 5.8339016e+02 7.15e-05 3.62e-02 -3.8 3.05e-02 - 1.00e+00 9.66e-0
1h 1
12 5.8368704e+02 2.74e-07 1.08e-05 -3.8 4.04e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278916e+02 4.12e-07 5.13e-04 -5.7 3.46e-02 - 1.00e+00 9.92e-0
1h 1
14 5.8278859e+02 4.35e-11 3.44e-09 -5.7 2.52e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.61e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753113969633e-01 5.8277753113969629e+0
2
Dual infeasibility......: 2.6142518800031853e-09 2.6142518800031853e-0
6
Constraint violation....: 6.3002117411947722e-11 6.3002117411947722e-1
1
Complementarity.........: 2.8882627475262773e-09 2.8882627475262773e-0
6
Overall NLP error.......: 2.8882627475262773e-09 2.8882627475262773e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.30e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9758662e+02 4.11e+01 5.96e+01 -1.0 1.43e+01 - 6.96e-04 4.22e-0
2f 1
2 1.2224040e+04 6.06e-02 7.87e+01 -1.0 1.80e+01 - 7.04e-02 1.00e+0
0h 1
3 3.6170254e+03 5.54e-02 5.16e+01 -1.0 5.49e+01 - 3.32e-01 7.83e-0
2f 1
4 2.3475033e+03 2.94e-02 2.29e+01 -1.0 2.73e+01 - 5.43e-01 4.45e-0
1f 1
5 1.7453370e+03 8.58e-03 1.20e+00 -1.0 1.00e+01 - 9.27e-01 7.72e-0
1f 1
6 2.0211041e+03 3.36e-04 8.13e-02 -1.0 3.40e+00 - 1.00e+00 1.00e+0
0h 1
7 1.3898953e+03 2.08e-03 8.01e-02 -2.5 4.92e+00 - 8.66e-01 8.53e-0
1f 1
8 1.2104814e+03 2.16e-03 1.86e-01 -2.5 1.04e+00 - 1.00e+00 8.43e-0
1f 1
9 1.1996932e+03 5.04e-05 5.09e-03 -2.5 1.24e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1927678e+03 2.76e-05 1.75e+00 -3.8 9.03e-02 - 1.00e+00 4.75e-0
1h 1
11 1.1900680e+03 1.03e-06 8.89e-02 -3.8 6.93e-02 - 9.43e-01 1.00e+0
0f 1
12 1.1896030e+03 2.46e-05 1.76e-01 -3.8 2.53e-02 - 1.00e+00 4.57e-0
1h 2
13 1.1893757e+03 3.47e-06 1.29e-04 -3.8 1.19e-02 - 1.00e+00 1.00e+0
0h 1
14 1.1886592e+03 6.71e-06 5.58e-02 -5.7 1.33e-02 - 7.11e-01 9.85e-0
1h 1
15 1.1884843e+03 1.84e-05 2.22e-04 -5.7 6.49e-03 - 9.83e-01 1.00e+0
0f 1
16 1.1884884e+03 6.97e-09 1.30e-06 -5.7 1.33e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1884763e+03 1.56e-08 3.71e-05 -8.6 1.74e-04 - 9.91e-01 9.62e-0
1h 1
18 1.1884759e+03 3.55e-12 5.05e-11 -8.6 6.66e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1884759060812946e+00 1.1884759060812946e+0
3
Dual infeasibility......: 5.0545485040025661e-11 5.0545485040025661e-0
8
Constraint violation....: 3.5452751845355124e-12 3.5452751845355124e-1
2
Complementarity.........: 2.5125742128334874e-09 2.5125742128334876e-0
6
Overall NLP error.......: 2.5125742128334874e-09 2.5125742128334876e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2183058e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 3.29e-04 9.88e-0
3h 1
2 8.0089918e+02 9.17e+02 5.24e+01 -1.0 7.99e+02 - 9.95e-05 7.63e-0
4h 1
3 5.3166847e+02 9.08e+02 5.25e+01 -1.0 9.17e+02 - 7.40e-04 1.01e-0
2h 1
4 2.7894246e+02 8.88e+02 5.21e+01 -1.0 9.08e+02 - 1.15e-02 2.18e-0
2f 1
5 8.4113018e+03 6.32e-02 8.19e+01 -1.0 8.88e+02 - 6.31e-02 1.00e+0
0h 1
6 3.4032496e+03 5.76e-02 2.47e+01 -1.0 5.33e+01 - 6.80e-01 8.22e-0
2f 1
7 1.8640343e+03 3.67e-02 6.88e+00 -1.0 3.49e+01 - 6.91e-01 4.95e-0
1f 1
8 2.2961788e+03 6.24e-03 6.29e-01 -1.0 1.31e+00 - 9.50e-01 1.00e+0
0f 1
9 1.6982725e+03 9.68e-04 1.02e+00 -1.7 8.28e+00 - 3.40e-01 8.82e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6725518e+03 1.85e-04 5.24e-01 -1.7 4.71e+00 - 7.22e-01 1.00e+0
0f 1
11 1.6609317e+03 2.82e-04 2.14e-01 -1.7 1.50e+01 - 4.71e-01 1.00e+0
0f 1
12 1.6808419e+03 2.02e-05 3.01e-02 -1.7 2.26e+01 - 8.45e-01 1.00e+0
0f 1
13 1.5599244e+03 1.04e-03 6.01e-02 -2.5 1.95e+01 - 9.10e-01 1.00e+0
0f 1
14 1.5317506e+03 1.29e-03 1.41e-02 -2.5 9.00e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5055975e+03 2.28e-04 1.03e-01 -3.8 1.70e+01 - 1.00e+00 8.36e-0
1h 1
16 1.5021219e+03 3.87e-07 1.19e-04 -3.8 2.49e+00 - 1.00e+00 1.00e+0
0h 1
17 1.5003154e+03 4.03e-07 1.56e-04 -5.7 8.89e-01 - 1.00e+00 9.97e-0
1h 1
18 1.5003154e+03 3.85e-11 2.90e-09 -5.7 1.98e-03 - 1.00e+00 1.00e+0
0f 1
19 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.11e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.5002932787835634e+00 1.5002932787835634e+0
3
Dual infeasibility......: 2.1694149444361948e-09 2.1694149444361948e-0
6
Constraint violation....: 6.2995719751768320e-11 6.2995719751768320e-1
1
Complementarity.........: 2.8882204352437227e-09 2.8882204352437226e-0
6
Overall NLP error.......: 2.8882204352437227e-09 2.8882204352437226e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6444350e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 4.93e-04 9.88e-0
3h 1
2 8.4099069e+02 9.17e+02 5.24e+01 -1.0 8.13e+02 - 9.78e-05 8.68e-0
4h 1
3 4.8927526e+02 9.04e+02 5.24e+01 -1.0 9.17e+02 - 8.43e-04 1.34e-0
2h 1
4 3.2496015e+02 8.82e+02 5.19e+01 -1.0 9.05e+02 - 1.50e-02 2.50e-0
2f 1
13 1.604031e+04 1.632511e+04 2.331304e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1156838e+02 1.57e+04 5.50e+01 -1.0 1.59e+04 - 1.75e-04 9.80e-0
3f 1
2 7.0871565e+02 1.57e+04 5.50e+01 -1.0 1.51e+04 - 4.88e-05 1.03e-0
4h 1
3 6.8558250e+02 1.57e+04 5.49e+01 -1.0 1.57e+04 - 5.99e-06 1.87e-0
3h 1
4 5.0453468e+02 1.54e+04 5.39e+01 -1.0 1.57e+04 - 1.99e-03 1.86e-0
2h 1
5 2.5733347e+04 7.61e-02 8.68e+01 -1.0 1.54e+04 - 2.60e-02 1.00e+0
0h 1
6 1.7881486e+04 7.32e-02 7.10e+01 -1.0 6.80e+01 - 1.91e-01 4.11e-0
2f 1
7 1.6631568e+04 4.65e-02 3.26e+01 -1.0 2.00e+01 - 5.34e-01 3.77e-0
1f 1
8 1.7128217e+04 3.51e-02 1.08e+01 -1.0 1.33e+01 - 5.66e-01 2.50e-0
1f 3
9 1.6801685e+04 7.33e-03 2.50e-01 -1.0 1.69e+00 - 9.82e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6498201e+04 7.25e-04 1.30e+00 -1.7 5.95e+00 - 2.95e-01 9.14e-0
1f 1
11 1.6487229e+04 1.59e-04 6.00e-01 -1.7 5.09e+00 - 6.57e-01 1.00e+0
0f 1
12 1.6476338e+04 1.21e-04 1.28e-01 -1.7 1.00e+01 - 7.34e-01 1.00e+0
0h 1
13 1.6372158e+04 9.14e-04 6.37e-02 -2.5 8.91e+00 - 9.12e-01 1.00e+0
0f 1
14 1.6344500e+04 1.46e-03 1.51e-02 -2.5 4.65e+00 - 1.00e+00 1.00e+0
0h 1
15 1.6328229e+04 2.53e-04 1.01e-01 -3.8 5.58e+00 - 1.00e+00 8.38e-0
1h 1
16 1.6326334e+04 5.98e-07 1.21e-04 -3.8 1.28e+00 - 1.00e+00 1.00e+0
0h 1
17 1.6325118e+04 4.01e-07 1.02e-04 -5.7 2.97e-01 - 1.00e+00 9.98e-0
1h 1
18 1.6325119e+04 3.82e-11 3.01e-09 -5.7 8.89e-02 - 1.00e+00 1.00e+0
0f 1
19 1.6325106e+04 4.79e-11 7.21e-05 -8.6 3.58e-03 - 1.00e+00 8.82e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325105e+04 8.74e-13 2.85e-11 -8.6 2.07e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.6325105198512400e+01 1.6325105198512400e+0
4
Dual infeasibility......: 2.8500999799461189e-11 2.8500999799461189e-0
8
Constraint violation....: 8.7405083171177012e-13 8.7405083171177012e-1
3
Complementarity.........: 3.7369520950542295e-09 3.7369520950542295e-0
6
Overall NLP error.......: 3.7369520950542295e-09 3.7369520950542295e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4811414e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 4.08e-04 9.80e-0
3f 1
2 8.4531706e+02 1.50e+04 5.24e+01 -1.0 1.48e+04 - 9.25e-05 1.00e-0
4h 1
3 8.3755892e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 2.87e-06 5.97e-0
4f 1
4 5.6582851e+02 1.46e+04 5.26e+01 -1.0 1.50e+04 - 6.38e-04 2.16e-0
2h 1
5 2.6666283e+04 5.76e-02 8.10e+01 -1.0 1.46e+04 - 4.61e-02 1.00e+0
0h 1
6 1.8142400e+04 5.40e-02 5.28e+01 -1.0 7.94e+01 - 3.40e-01 5.65e-0
2f 1
7 1.6073711e+04 3.26e-02 2.87e+01 -1.0 4.22e+01 - 4.65e-01 5.24e-0
1f 1
8 1.6589657e+04 1.26e-02 2.77e+00 -1.0 2.02e+01 - 8.55e-01 5.00e-0
1f 2
9 1.6078241e+04 5.03e-03 1.89e-01 -1.0 1.04e+01 - 9.55e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5781764e+04 1.28e-03 4.95e-01 -1.7 4.22e+00 - 1.00e+00 7.91e-0
1f 1
11 1.5747649e+04 3.75e-04 2.61e-02 -1.7 1.61e+01 - 1.00e+00 1.00e+0
0f 1
12 1.5604589e+04 1.15e-03 1.16e-01 -3.8 1.99e+01 - 7.67e-01 9.21e-0
1f 1
13 1.5574499e+04 1.46e-03 3.31e-02 -3.8 2.12e+00 - 8.20e-01 7.40e-0
1h 1
14 1.5574865e+04 3.39e-06 3.13e-02 -3.8 4.04e-01 - 9.82e-01 1.00e+0
0h 1
15 1.5573967e+04 8.57e-05 3.39e-04 -3.8 1.23e-02 - 1.00e+00 1.00e+0
0h 1
16 1.5572894e+04 1.51e-05 7.65e-03 -5.7 1.49e-01 - 9.11e-01 9.84e-0
1h 1
17 1.5572844e+04 4.79e-07 1.69e-06 -5.7 2.42e-03 - 1.00e+00 1.00e+0
0h 1
18 1.5572829e+04 4.63e-09 3.82e-07 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
19 1.5572829e+04 9.33e-15 3.67e-14 -8.6 1.46e-07 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.5572828820784590e+01 1.5572828820784589e+0
4
Dual infeasibility......: 3.6747374950732185e-14 3.6747374950732185e-1
1
Constraint violation....: 9.3258734068513149e-15 9.3258734068513149e-1
5
Complementarity.........: 2.5059091803540256e-09 2.5059091803540257e-0
6
Overall NLP error.......: 2.5059091803540256e-09 2.5059091803540257e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6663159e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 4.97e-04 9.80e-0
3h 1
2 8.6380228e+02 1.39e+04 5.24e+01 -1.0 1.32e+04 - 4.46e-05 1.04e-0
4h 1
3 8.2981808e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 7.27e-06 2.45e-0
3h 1
4 5.7278541e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 2.64e-03 2.13e-0
2h 1
5 2.4870491e+04 6.18e-02 8.04e+01 -1.0 1.36e+04 - 5.47e-02 1.00e+0
0h 1
6 1.7166036e+04 5.73e-02 5.00e+01 -1.0 6.81e+01 - 3.66e-01 6.55e-0
2f 1
7 1.5586788e+04 3.04e-02 2.47e+01 -1.0 3.82e+01 - 4.98e-01 4.39e-0
1f 1
8 1.5108141e+04 1.32e-02 2.24e+00 -1.0 1.07e+01 - 9.21e-01 1.00e+0
0f 1
9 1.5385167e+04 3.90e-04 8.04e-02 -1.0 4.29e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4871095e+04 5.17e-04 5.73e-01 -2.5 7.30e+00 - 8.91e-01 6.62e-0
1f 1
11 1.4791323e+04 2.37e-04 3.76e-01 -2.5 2.48e+00 - 8.87e-01 1.00e+0
0h 1
12 1.4770540e+04 6.21e-03 2.47e-01 -2.5 1.64e+00 - 1.00e+00 5.48e-0
1h 1
13 1.4759458e+04 8.25e-04 6.71e-03 -2.5 5.43e-01 - 1.00e+00 1.00e+0
0f 1
14 1.4740960e+04 1.13e-03 2.85e-02 -3.8 5.36e+00 - 8.14e-01 1.00e+0
0h 1
15 1.4738037e+04 2.14e-03 1.05e-03 -3.8 4.67e-02 - 1.00e+00 1.00e+0
0h 1
16 1.4738429e+04 4.79e-05 1.56e-04 -3.8 1.54e-02 - 1.00e+00 1.00e+0
0h 1
17 1.4736951e+04 1.07e-04 4.46e-04 -5.7 2.97e-01 - 9.51e-01 9.83e-0
1h 1
18 1.4736944e+04 2.17e-05 3.52e-03 -5.7 4.97e-03 - 1.00e+00 7.97e-0
1h 1
19 1.4736948e+04 8.51e-09 1.09e-06 -5.7 1.01e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.4736932e+04 8.96e-09 1.93e-05 -8.6 3.68e-03 - 1.00e+00 9.83e-0
1h 1
21 1.4736931e+04 1.38e-12 6.47e-11 -8.6 6.13e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.4736931393881008e+01 1.4736931393881008e+0
4
Dual infeasibility......: 6.4720553028239907e-11 6.4720553028239901e-0
8
Constraint violation....: 1.3777867735598193e-12 1.3777867735598193e-1
2
Complementarity.........: 2.5116795706607301e-09 2.5116795706607300e-0
6
Overall NLP error.......: 2.5116795706607301e-09 2.5116795706607300e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1597188e+02 1.27e+04 5.23e+01 -1.0 1.28e+04 - 1.20e-03 9.80e-0
3h 1
2 9.1321871e+02 1.27e+04 5.23e+01 -1.0 1.24e+04 - 7.92e-05 1.01e-0
4h 1
3 9.0074018e+02 1.26e+04 5.23e+01 -1.0 1.26e+04 - 3.71e-06 8.43e-0
4f 1
4 5.6875667e+02 1.23e+04 5.24e+01 -1.0 1.26e+04 - 9.20e-04 2.31e-0
2h 1
5 2.4866156e+04 6.77e-02 7.65e+01 -1.0 1.23e+04 - 8.14e-02 1.00e+0
0h 1
6 1.6742845e+04 6.11e-02 3.13e+01 -1.0 2.05e+01 - 5.60e-01 8.85e-0
2f 1
7 1.5215174e+04 1.68e-02 1.34e+01 -1.0 1.27e+01 - 6.30e-01 8.71e-0
1f 1
8 1.5383027e+04 8.76e-03 6.74e-01 -1.0 3.86e+00 - 9.93e-01 5.00e-0
1f 2
9 1.5057082e+04 7.92e-03 2.44e-01 -1.7 6.57e+00 - 1.00e+00 8.49e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4996775e+04 1.27e-03 1.01e-01 -1.7 1.41e+01 - 1.00e+00 1.00e+0
0f 1
11 1.4871041e+04 4.23e-04 1.06e-01 -2.5 1.72e+01 - 9.68e-01 8.78e-0
1h 1
12 1.4856576e+04 2.26e-05 3.37e-03 -2.5 2.08e+00 - 1.00e+00 1.00e+0
0f 1
13 1.4838332e+04 8.63e-06 1.03e-01 -3.8 2.68e+00 - 1.00e+00 8.23e-0
1f 1
14 1.4835312e+04 5.15e-08 7.18e-05 -3.8 4.75e-01 - 1.00e+00 1.00e+0
0f 1
15 1.4834112e+04 1.99e-08 1.57e-04 -5.7 1.49e-01 - 1.00e+00 9.96e-0
1f 1
16 1.4834111e+04 1.81e-12 2.22e-09 -5.7 5.61e-04 - 1.00e+00 1.00e+0
0f 1
17 1.4834096e+04 2.63e-12 1.52e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.4834096271539915e+01 1.4834096271539915e+0
4
Dual infeasibility......: 1.5189622020045165e-09 1.5189622020045165e-0
6
Constraint violation....: 2.6289456722672355e-12 2.6289456722672355e-1
2
Complementarity.........: 2.8635056589632113e-09 2.8635056589632113e-0
6
Overall NLP error.......: 2.8635056589632113e-09 2.8635056589632113e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9482527e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 7.48e-04 9.80e-0
3h 1
2 8.9206259e+02 1.11e+04 5.24e+01 -1.0 1.09e+04 - 8.69e-05 1.01e-0
4h 1
3 8.7788074e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 4.01e-06 8.67e-0
4f 1
4 5.1726064e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 9.54e-04 2.26e-0
2h 1
5 2.3121559e+04 6.40e-02 7.79e+01 -1.0 1.09e+04 - 6.98e-02 1.00e+0
0h 1
6 1.4812165e+04 5.85e-02 4.83e+01 -1.0 4.95e+01 - 3.63e-01 7.77e-0
2f 1
7 1.3505031e+04 2.67e-02 2.10e+01 -1.0 2.28e+01 - 5.57e-01 5.00e-0
1f 1
8 1.3018007e+04 6.85e-03 1.23e+00 -1.0 8.59e+00 - 9.37e-01 7.36e-0
1f 1
9 1.3268789e+04 3.20e-04 7.93e-02 -1.0 2.91e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2683148e+04 2.08e-03 9.07e-02 -2.5 4.28e+00 - 8.62e-01 8.28e-0
1f 1
11 1.2505092e+04 2.17e-03 3.62e-01 -2.5 1.06e+00 - 1.00e+00 7.74e-0
1f 1
12 1.2476207e+04 1.68e-04 5.11e-03 -2.5 2.15e-01 - 1.00e+00 1.00e+0
0h 1
13 1.2456345e+04 2.44e-05 4.31e-02 -3.8 2.68e+00 - 1.00e+00 8.82e-0
1h 1
14 1.2454881e+04 5.88e-08 6.10e-04 -3.8 3.16e-01 - 1.00e+00 1.00e+0
0f 1
15 1.2453574e+04 4.24e-08 1.39e-05 -5.7 1.49e-01 - 1.00e+00 9.99e-0
1f 1
16 1.2453562e+04 6.85e-13 3.99e-09 -8.6 1.93e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.2453562286345193e+01 1.2453562286345192e+0
4
Dual infeasibility......: 3.9883524231043677e-09 3.9883524231043677e-0
6
Constraint violation....: 6.8450800583264026e-13 6.8450800583264026e-1
3
Complementarity.........: 2.7863202819854675e-09 2.7863202819854675e-0
6
Overall NLP error.......: 3.9883524231043677e-09 3.9883524231043677e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891076e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0602418e+02 9.19e+03 5.23e+01 -1.0 8.41e+03 - 3.92e-05 1.08e-0
4h 1
3 8.1828314e+02 9.14e+03 5.24e+01 -1.0 9.19e+03 - 1.24e-05 4.81e-0
3h 1
4 5.0911017e+02 8.95e+03 5.22e+01 -1.0 9.14e+03 - 5.53e-03 2.13e-0
2h 1
5 1.9574027e+04 7.15e-02 7.74e+01 -1.0 8.95e+03 - 8.67e-02 1.00e+0
0h 1
6 1.2972291e+04 6.39e-02 3.14e+01 -1.0 2.60e+01 - 5.69e-01 9.74e-0
2f 1
7 1.1456842e+04 1.98e-02 1.02e+01 -1.0 1.50e+01 - 6.92e-01 7.89e-0
1f 1
8 1.1617387e+04 7.35e-03 8.73e-01 -1.0 3.38e+00 - 9.92e-01 5.00e-0
1f 2
9 1.1302708e+04 1.11e-02 1.49e-01 -1.7 1.07e+01 - 8.20e-01 8.28e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1143259e+04 3.71e-03 1.94e-01 -2.5 2.46e+00 - 8.34e-01 7.50e-0
1h 1
11 1.1106629e+04 7.79e-04 1.06e-02 -2.5 1.68e+00 - 1.00e+00 1.00e+0
0h 1
12 1.1090455e+04 2.38e-04 2.34e-01 -3.8 5.49e+00 - 1.00e+00 6.95e-0
1h 1
13 1.1084710e+04 4.86e-07 3.83e-02 -3.8 1.67e+00 - 9.43e-01 1.00e+0
0f 1
14 1.1084684e+04 6.13e-10 7.92e-06 -3.8 1.18e-04 - 1.00e+00 1.00e+0
0h 1
15 1.1083374e+04 1.87e-08 4.04e-03 -5.7 2.97e-01 - 1.00e+00 9.67e-0
1f 1
16 1.1083337e+04 5.95e-12 2.67e-08 -5.7 9.81e-03 - 1.00e+00 1.00e+0
0f 1
17 1.1083321e+04 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.1083320729054234e+01 1.1083320729054234e+0
4
Dual infeasibility......: 4.4780613943087180e-09 4.4780613943087180e-0
6
Constraint violation....: 2.6337959591060667e-12 2.6337959591060667e-1
2
Complementarity.........: 3.6085519388456817e-09 3.6085519388456815e-0
6
Overall NLP error.......: 4.4780613943087180e-09 4.4780613943087180e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891119e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0611351e+02 6.71e+03 5.23e+01 -1.0 6.46e+03 - 8.39e-05 1.03e-0
4h 1
3 8.7440044e+02 6.70e+03 5.23e+01 -1.0 6.70e+03 - 6.84e-06 1.53e-0
3f 1
4 4.2534165e+02 6.54e+03 5.24e+01 -1.0 6.70e+03 - 1.83e-03 2.26e-0
2h 1
5 1.8469067e+04 6.74e-02 7.67e+01 -1.0 6.54e+03 - 8.35e-02 1.00e+0
0h 1
6 1.0609292e+04 6.07e-02 3.68e+01 -1.0 2.85e+01 - 4.94e-01 9.10e-0
2f 1
7 9.1070968e+03 1.97e-02 1.46e+01 -1.0 1.53e+01 - 6.26e-01 7.49e-0
1f 1
8 9.1804481e+03 5.62e-03 1.19e+00 -1.0 2.08e+00 - 9.93e-01 5.00e-0
1f 2
9 9.3751841e+03 2.91e-04 6.67e-02 -1.0 2.88e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.8198146e+03 2.22e-03 9.09e-02 -2.5 2.66e+01 - 8.56e-01 8.23e-0
1f 1
11 8.6513288e+03 2.12e-03 4.55e-01 -2.5 4.37e+00 - 1.00e+00 7.50e-0
1f 1
12 8.6223061e+03 1.56e-04 4.78e-03 -2.5 1.09e+00 - 1.00e+00 1.00e+0
0h 1
13 8.6058823e+03 4.18e-05 1.61e-01 -3.8 2.68e+00 - 1.00e+00 7.51e-0
1h 1
14 8.6015687e+03 1.44e-07 3.57e-04 -3.8 6.67e-01 - 1.00e+00 1.00e+0
0f 1
15 8.6003430e+03 2.79e-08 9.26e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 8.6003307e+03 1.87e-12 1.33e-08 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
17 8.6003159e+03 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 8.6003159088054772e+00 8.6003159088054763e+0
3
Dual infeasibility......: 4.4776952290158987e-09 4.4776952290158987e-0
6
Constraint violation....: 2.6309232570298491e-12 2.6309232570298491e-1
2
Complementarity.........: 3.6085002106214732e-09 3.6085002106214731e-0
6
Overall NLP error.......: 4.4776952290158987e-09 4.4776952290158987e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8775283e+02 4.77e+03 5.24e+01 -1.0 4.82e+03 - 6.64e-04 9.80e-0
3f 1
2 8.8490545e+02 4.77e+03 5.24e+01 -1.0 4.54e+03 - 9.09e-05 1.04e-0
4h 1
3 8.3891577e+02 4.76e+03 5.24e+01 -1.0 4.77e+03 - 9.27e-06 2.02e-0
3f 1
4 3.6771363e+02 4.66e+03 5.24e+01 -1.0 4.76e+03 - 2.59e-03 2.19e-0
2h 1
5 1.5982222e+04 6.47e-02 7.88e+01 -1.0 4.66e+03 - 6.69e-02 1.00e+0
0h 1
6 8.2942245e+03 5.93e-02 4.78e+01 -1.0 5.43e+01 - 3.77e-01 7.64e-0
2f 1
7 6.9811109e+03 2.94e-02 2.07e+01 -1.0 2.67e+01 - 5.54e-01 4.62e-0
1f 1
8 6.4193393e+03 6.17e-03 1.02e+00 -1.0 9.91e+00 - 9.28e-01 7.77e-0
1f 1
9 6.6977348e+03 2.38e-04 6.93e-02 -1.0 3.42e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0467842e+03 2.17e-03 8.37e-02 -2.5 5.05e+00 - 8.70e-01 8.75e-0
1f 1
11 5.9396938e+03 1.10e-03 4.47e-01 -2.5 8.28e-01 - 1.00e+00 6.10e-0
1f 1
12 5.9395944e+03 2.61e-06 8.30e-03 -2.5 1.67e-01 - 1.00e+00 1.00e+0
0h 1
13 5.9215589e+03 6.87e-06 1.24e-02 -3.8 2.68e+00 - 9.05e-01 8.92e-0
1f 1
14 5.9183066e+03 4.65e-04 4.13e-04 -3.8 2.89e-01 - 1.00e+00 1.00e+0
0f 1
15 5.9173127e+03 6.28e-05 1.14e-02 -5.7 1.49e-01 - 8.14e-01 1.00e+0
0h 1
16 5.9171977e+03 3.58e-05 4.03e-05 -5.7 9.65e-03 - 1.00e+00 1.00e+0
0h 1
17 5.9171990e+03 1.44e-06 2.56e-05 -5.7 1.50e-03 - 1.00e+00 9.93e-0
1h 1
18 5.9172014e+03 3.51e-08 4.96e-07 -5.7 2.91e-04 - 1.00e+00 1.00e+0
0f 1
19 5.9171868e+03 3.95e-08 7.31e-06 -8.6 1.84e-03 - 9.97e-01 9.81e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 5.9171865e+03 5.37e-13 2.98e-11 -8.6 3.55e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 5.9171865328550020e+00 5.9171865328550020e+0
3
Dual infeasibility......: 2.9758895597839254e-11 2.9758895597839254e-0
8
Constraint violation....: 5.3690385470872570e-13 5.3690385470872570e-1
3
Complementarity.........: 2.5100799351769988e-09 2.5100799351769986e-0
6
Overall NLP error.......: 2.5100799351769988e-09 2.5100799351769986e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6653022e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 4.97e-04 9.81e-0
3f 1
2 8.6323248e+02 3.24e+03 5.24e+01 -1.0 2.66e+03 - 5.18e-05 1.21e-0
4h 1
3 5.3831797e+02 3.20e+03 5.25e+01 -1.0 3.24e+03 - 3.12e-05 1.32e-0
2f 1
4 3.9903850e+02 3.13e+03 5.15e+01 -1.0 3.20e+03 - 2.00e-02 2.32e-0
2f 1
5 9.8503215e+03 7.36e-02 7.80e+01 -1.0 3.13e+03 - 1.07e-01 1.00e+0
0h 1
6 5.7440232e+03 6.32e-02 2.21e+01 -1.0 4.61e+01 - 6.97e-01 1.31e-0
1f 1
7 4.3233476e+03 3.42e-02 1.97e+00 -1.0 2.67e+01 - 8.81e-01 6.15e-0
1f 1
8 4.6962640e+03 3.54e-03 1.67e+00 -1.0 4.17e+00 - 6.95e-01 1.00e+0
0f 1
9 4.6038233e+03 2.81e-04 5.35e-01 -1.0 6.60e+00 - 4.15e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2044277e+03 3.06e-04 4.24e-01 -1.7 4.82e+00 - 9.27e-01 7.66e-0
1f 1
11 4.2075269e+03 4.02e-05 4.57e-01 -1.7 1.34e+01 - 7.31e-01 1.00e+0
0f 1
12 4.2097057e+03 5.52e-06 6.73e-04 -1.7 1.24e+01 - 1.00e+00 1.00e+0
0h 1
13 4.1098679e+03 6.21e-05 6.67e-02 -3.8 3.60e+01 - 9.04e-01 8.52e-0
1f 1
14 4.0872350e+03 6.45e-03 7.32e-02 -3.8 5.15e+00 - 5.78e-01 9.88e-0
1h 1
15 4.0845757e+03 2.79e-03 2.14e-03 -3.8 5.88e-02 - 9.70e-01 8.90e-0
1h 1
16 4.0849011e+03 8.78e-05 6.07e-04 -3.8 1.82e-02 - 1.00e+00 1.00e+0
0f 1
17 4.0833250e+03 1.48e-04 8.69e-04 -5.7 2.97e-01 - 9.38e-01 1.00e+0
0h 1
18 4.0833315e+03 4.13e-05 5.44e-03 -5.7 1.11e-03 - 1.00e+00 7.21e-0
1h 1
19 4.0833413e+03 1.16e-08 1.63e-06 -5.7 1.06e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 4.0833246e+03 9.32e-09 2.06e-05 -8.6 3.68e-03 - 1.00e+00 9.83e-0
1h 1
21 4.0833244e+03 1.51e-12 7.23e-11 -8.6 6.33e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 4.0833243815878699e+00 4.0833243815878700e+0
3
Dual infeasibility......: 7.2339609097977223e-11 7.2339609097977223e-0
8
Constraint violation....: 1.5069057113237250e-12 1.5069057113237250e-1
2
Complementarity.........: 2.7881993874541952e-09 2.7881993874541950e-0
6
Overall NLP error.......: 2.7881993874541952e-09 2.7881993874541950e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4528265e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 3.98e-04 9.81e-0
3f 1
2 8.4160377e+02 2.00e+03 5.24e+01 -1.0 1.48e+03 - 5.91e-05 1.33e-0
4h 1
3 8.3224172e+02 2.00e+03 5.24e+01 -1.0 1.99e+03 - 4.98e-05 3.61e-0
4h 1
4 2.7582867e+02 1.95e+03 6.93e+01 -1.0 2.00e+03 - 4.04e-04 2.17e-0
2f 1
5 1.3772437e+04 5.71e-02 8.11e+01 -1.0 1.95e+03 - 4.53e-02 1.00e+0
0h 1
6 5.1464867e+03 5.36e-02 5.31e+01 -1.0 8.07e+01 - 3.38e-01 5.57e-0
2f 1
7 3.0119742e+03 3.39e-02 2.90e+01 -1.0 4.23e+01 - 4.63e-01 5.38e-0
1f 1
8 4.9722341e+03 8.65e-03 1.59e+01 -1.0 2.30e+01 - 5.99e-01 1.00e+0
0h 1
9 3.1091858e+03 6.68e-03 3.88e-01 -1.0 1.98e+01 - 9.68e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.7875005e+03 1.03e-03 8.62e-02 -1.7 5.39e+00 - 9.47e-01 9.00e-0
1f 1
11 2.6524507e+03 1.31e-03 3.02e-01 -2.5 5.80e+00 - 7.62e-01 1.00e+0
0h 1
12 2.5938399e+03 6.24e-03 4.14e-02 -2.5 3.25e+00 - 1.00e+00 1.00e+0
0h 1
13 2.6039045e+03 2.60e-04 5.70e-03 -2.5 4.52e-01 - 1.00e+00 1.00e+0
0h 1
14 2.5811576e+03 2.40e-04 4.66e-02 -3.8 3.81e+00 - 9.86e-01 8.80e-0
1h 1
15 2.5805180e+03 2.04e-06 1.55e-04 -3.8 5.18e-02 - 1.00e+00 1.00e+0
0h 1
16 2.5794636e+03 3.16e-07 2.12e-03 -5.7 1.54e-01 - 1.00e+00 9.78e-0
1h 1
17 2.5794567e+03 3.68e-11 2.12e-08 -5.7 1.65e-03 - 1.00e+00 1.00e+0
0f 1
18 2.5794438e+03 6.30e-11 4.40e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 2.5794437782313504e+00 2.5794437782313503e+0
3
Dual infeasibility......: 4.3996212322934005e-09 4.3996212322934005e-0
6
Constraint violation....: 6.3010235917815294e-11 6.3010235917815294e-1
1
Complementarity.........: 3.2999063458278082e-09 3.2999063458278083e-0
6
Overall NLP error.......: 4.3996212322934005e-09 4.3996212322934005e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6444153e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 4.93e-04 9.88e-0
3h 1
2 8.4098893e+02 9.17e+02 5.24e+01 -1.0 8.13e+02 - 9.78e-05 8.68e-0
4h 1
3 4.8928101e+02 9.04e+02 5.24e+01 -1.0 9.17e+02 - 8.43e-04 1.34e-0
2h 1
4 3.2495587e+02 8.82e+02 5.19e+01 -1.0 9.05e+02 - 1.50e-02 2.49e-0
2f 1
5 8.1094962e+03 7.00e-02 7.78e+01 -1.0 8.82e+02 - 1.06e-01 1.00e+0
0h 1
6 3.4847588e+03 6.05e-02 2.21e+01 -1.0 5.28e+01 - 6.91e-01 1.25e-0
1f 1
7 2.0745482e+03 3.36e-02 2.24e+00 -1.0 2.85e+01 - 9.09e-01 5.67e-0
1f 1
8 2.2822613e+03 4.80e-03 2.88e+00 -1.0 5.38e+00 - 3.66e-01 1.00e+0
0f 1
9 2.2629314e+03 5.52e-04 7.42e-01 -1.0 4.77e+00 - 5.04e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8832785e+03 4.31e-04 6.20e-01 -1.7 5.34e+00 - 9.32e-01 6.81e-0
1f 1
11 1.8840782e+03 5.10e-05 1.23e+00 -1.7 2.21e+01 - 4.11e-01 1.00e+0
0f 1
12 1.8967479e+03 7.00e-06 1.04e-01 -1.7 2.75e+01 - 8.97e-01 1.00e+0
0f 1
13 1.7934227e+03 6.41e-05 1.96e-02 -2.5 3.49e+01 - 1.00e+00 9.81e-0
1f 1
14 1.7534729e+03 3.02e-03 8.00e-02 -3.8 2.44e+01 - 6.44e-01 9.85e-0
1f 1
15 1.7489942e+03 5.75e-03 1.28e-02 -3.8 2.89e-01 - 8.44e-01 1.00e+0
0h 1
16 1.7494910e+03 6.38e-05 5.78e-04 -3.8 1.51e-02 - 1.00e+00 1.00e+0
0h 1
17 1.7473671e+03 1.35e-04 9.12e-04 -5.7 8.93e-01 - 9.38e-01 1.00e+0
0h 1
18 1.7473735e+03 4.10e-05 6.19e-03 -5.7 1.40e-03 - 1.00e+00 6.96e-0
1h 1
19 1.7473858e+03 1.40e-08 1.49e-06 -5.7 3.01e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7473620e+03 9.28e-09 2.49e-05 -8.6 1.11e-02 - 1.00e+00 9.82e-0
1h 1
21 1.7473616e+03 1.79e-12 9.28e-11 -8.6 2.04e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.7473615825211104e+00 1.7473615825211104e+0
3
Dual infeasibility......: 9.2848702265949768e-11 9.2848702265949768e-0
8
Constraint violation....: 1.7947865416090281e-12 1.7947865416090281e-1
2
Complementarity.........: 2.6067362166142283e-09 2.6067362166142281e-0
6
Overall NLP error.......: 2.6067362166142283e-09 2.6067362166142281e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146111909819e-01 6.4890146111909814e+0
2
Dual infeasibility......: 4.9126605652881068e-09 4.9126605652881068e-0
6
Constraint violation....: 6.2123811650494076e-09 6.2123811650494076e-0
9
Complementarity.........: 4.3646094984414694e-09 4.3646094984414694e-0
6
Overall NLP error.......: 6.2123811650494076e-09 4.9126605652881068e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933520e-01 5.8277753147933515e+0
2
Dual infeasibility......: 2.1031318725023556e-09 2.1031318725023556e-0
6
Constraint violation....: 6.2994401361926577e-11 6.2994401361926577e-1
1
Complementarity.........: 2.8882108897045252e-09 2.8882108897045253e-0
6
Overall NLP error.......: 2.8882108897045252e-09 2.8882108897045253e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146111909819e-01 6.4890146111909814e+0
2
Dual infeasibility......: 4.9126605652881068e-09 4.9126605652881068e-0
6
Constraint violation....: 6.2123811650494076e-09 6.2123811650494076e-0
9
Complementarity.........: 4.3646094984414694e-09 4.3646094984414694e-0
6
Overall NLP error.......: 6.2123811650494076e-09 4.9126605652881068e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.05e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.86e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235598156e+00 1.6104063235598155e+0
3
Dual infeasibility......: 2.4576161306035250e-12 2.4576161306035250e-0
9
Constraint violation....: 7.8624751773685904e-15 7.8624751773685904e-1
5
Complementarity.........: 2.5062163919694797e-09 2.5062163919694797e-0
6
Overall NLP error.......: 2.5062163919694797e-09 2.5062163919694797e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2182822e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 3.29e-04 9.88e-0
3h 1
2 7.9676465e+02 9.17e+02 5.24e+01 -1.0 8.18e+02 - 9.72e-05 9.15e-0
4h 1
3 2.4281540e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 9.07e-04 2.09e-0
2h 1
4 1.2255626e+04 5.54e-02 8.24e+01 -1.0 8.98e+02 - 3.87e-02 1.00e+0
0h 1
5 3.8688256e+03 5.28e-02 5.51e+01 -1.0 7.96e+01 - 3.28e-01 5.05e-0
2f 1
6 1.9078235e+03 3.74e-02 2.93e+01 -1.0 3.92e+01 - 4.72e-01 5.02e-0
1f 1
7 4.6515021e+03 1.22e-02 2.62e+01 -1.0 2.04e+01 - 4.04e-01 1.00e+0
0h 1
8 1.8738237e+03 1.17e-02 9.61e-01 -1.0 2.50e+01 - 9.88e-01 8.98e-0
1f 1
9 1.6952046e+03 5.07e-04 6.26e-02 -1.7 6.87e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5627585e+03 1.96e-03 2.18e-01 -2.5 1.24e+01 - 7.44e-01 1.00e+0
0f 1
11 1.5309891e+03 3.66e-03 1.02e-01 -2.5 2.11e+00 - 1.00e+00 9.20e-0
1h 1
12 1.5388592e+03 1.30e-04 3.48e-03 -2.5 1.17e+00 - 1.00e+00 1.00e+0
0h 1
13 1.5037282e+03 1.63e-04 2.14e-02 -3.8 1.88e+01 - 9.93e-01 9.32e-0
1h 1
14 1.5022722e+03 7.63e-07 7.14e-05 -3.8 1.23e+00 - 1.00e+00 1.00e+0
0f 1
15 1.5003195e+03 3.78e-07 1.76e-04 -5.7 1.04e+00 - 1.00e+00 9.96e-0
1h 1
16 1.5003172e+03 3.80e-11 2.94e-09 -5.7 1.08e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.29e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5002932812957774e+00 1.5002932812957774e+0
3
Dual infeasibility......: 2.1693814410207835e-09 2.1693814410207835e-0
6
Constraint violation....: 6.2995483829375587e-11 6.2995483829375587e-1
1
Complementarity.........: 2.8882169852869782e-09 2.8882169852869780e-0
6
Overall NLP error.......: 2.8882169852869782e-09 2.8882169852869780e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
1 8.6444121e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 4.93e-04 9.88e-0
3h 1
2 8.3543143e+02 9.17e+02 5.24e+01 -1.0 8.33e+02 - 9.54e-05 1.07e-0
3h 1
3 2.6287543e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 1.07e-03 2.19e-0
2h 1
4 1.2568971e+04 6.01e-02 8.03e+01 -1.0 8.97e+02 - 5.11e-02 1.00e+0
0h 1
5 4.2524289e+03 5.61e-02 5.27e+01 -1.0 7.22e+01 - 3.33e-01 6.11e-0
2f 1
6 2.6510992e+03 3.01e-02 2.72e+01 -1.0 3.89e+01 - 4.78e-01 4.36e-0
1f 1
14 1.337036e+04 1.632511e+04 2.387056e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1155551e+02 1.57e+04 5.50e+01 -1.0 1.59e+04 - 1.75e-04 9.80e-0
3f 1
2 7.0865066e+02 1.57e+04 5.50e+01 -1.0 1.45e+04 - 3.33e-05 1.07e-0
4h 1
3 7.0538070e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 1.08e-05 2.63e-0
4h 1
4 6.9524010e+02 1.57e+04 5.49e+01 -1.0 1.57e+04 - 2.71e-04 8.44e-0
4h 1
5 4.9656114e+02 1.54e+04 5.39e+01 -1.0 1.57e+04 - 1.16e-03 1.89e-0
2f 1
6 2.6010861e+04 7.61e-02 8.68e+01 -1.0 1.54e+04 - 2.57e-02 1.00e+0
0h 1
7 1.7885338e+04 7.32e-02 7.22e+01 -1.0 7.06e+01 - 1.77e-01 4.05e-0
2f 1
8 1.6630536e+04 4.63e-02 3.34e+01 -1.0 1.98e+01 - 5.32e-01 3.77e-0
1f 1
9 1.7129485e+04 3.51e-02 1.37e+01 -1.0 1.34e+01 - 5.66e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6801258e+04 7.42e-03 1.29e+00 -1.0 1.49e+00 - 9.10e-01 1.00e+0
0h 1
11 1.6816912e+04 2.00e-04 1.94e+00 -1.0 3.79e+00 - 2.06e-01 1.00e+0
0f 1
12 1.6826145e+04 5.88e-06 7.35e-01 -1.0 4.22e+00 - 6.41e-01 1.00e+0
0f 1
13 1.6529367e+04 2.30e-04 3.72e-01 -1.7 4.73e+00 - 9.09e-01 8.07e-0
1f 1
14 1.6484982e+04 6.31e-04 1.92e-01 -1.7 1.32e+01 - 6.90e-01 1.00e+0
0f 1
15 1.6370484e+04 1.15e-03 7.14e-02 -2.5 1.22e+01 - 9.00e-01 1.00e+0
0f 1
16 1.6344712e+04 1.45e-03 1.59e-02 -2.5 4.62e+00 - 1.00e+00 1.00e+0
0h 1
17 1.6328234e+04 2.53e-04 1.01e-01 -3.8 5.68e+00 - 1.00e+00 8.38e-0
1h 1
18 1.6326331e+04 8.58e-07 1.26e-04 -3.8 8.39e-01 - 1.00e+00 1.00e+0
0h 1
19 1.6325118e+04 3.97e-07 1.05e-04 -5.7 2.97e-01 - 1.00e+00 9.98e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325119e+04 3.83e-11 3.04e-09 -5.7 1.77e-02 - 1.00e+00 1.00e+0
0f 1
21 1.6325107e+04 4.78e-11 7.24e-05 -8.6 3.58e-03 - 1.00e+00 8.82e-0
1h 1
22 1.6325105e+04 8.81e-13 2.87e-11 -8.6 4.39e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.6325105198518731e+01 1.6325105198518731e+0
4
Dual infeasibility......: 2.8705870791051849e-11 2.8705870791051849e-0
8
Constraint violation....: 8.8075380322294450e-13 8.8075380322294450e-1
3
Complementarity.........: 3.7432997107494664e-09 3.7432997107494664e-0
6
Overall NLP error.......: 3.7432997107494664e-09 3.7432997107494664e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9876944e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.75e-04 9.80e-0
3f 1
2 7.9589769e+02 1.50e+04 5.25e+01 -1.0 1.43e+04 - 4.75e-05 1.03e-0
4h 1
3 7.6855772e+02 1.49e+04 5.25e+01 -1.0 1.50e+04 - 6.43e-06 2.05e-0
3h 1
4 5.4431266e+02 1.46e+04 5.26e+01 -1.0 1.49e+04 - 2.19e-03 2.00e-0
2h 1
5 2.5504371e+04 5.52e-02 8.37e+01 -1.0 1.46e+04 - 3.49e-02 1.00e+0
0h 1
6 1.7685869e+04 5.28e-02 5.75e+01 -1.0 7.44e+01 - 3.15e-01 4.82e-0
2f 1
7 1.5945344e+04 4.23e-02 2.90e+01 -1.0 3.45e+01 - 4.93e-01 4.66e-0
1f 1
8 1.6258514e+04 2.65e-02 1.21e+01 -1.0 1.78e+01 - 4.37e-01 1.25e-0
1f 4
9 1.6022809e+04 6.10e-03 1.38e-01 -1.0 4.87e+00 - 9.92e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5738177e+04 1.23e-03 2.92e-01 -1.7 6.98e+00 - 1.00e+00 8.62e-0
1f 1
11 1.5729527e+04 7.40e-04 1.21e-02 -1.7 3.35e+01 - 1.00e+00 1.00e+0
0f 1
12 1.5585586e+04 1.34e-03 9.10e-02 -3.8 3.98e+01 - 7.97e-01 9.32e-0
1f 1
13 1.5560342e+04 1.49e-03 6.43e-02 -3.8 2.69e+00 - 8.47e-01 7.71e-0
1h 1
14 1.5560316e+04 2.72e-06 7.50e-04 -3.8 6.15e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5559225e+04 3.13e-07 6.12e-04 -5.7 2.97e-01 - 1.00e+00 9.88e-0
1h 1
16 1.5559217e+04 3.91e-11 6.21e-09 -5.7 1.04e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5559202e+04 6.30e-11 2.10e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5559202124490429e+01 1.5559202124490430e+0
4
Dual infeasibility......: 2.0959922560997947e-09 2.0959922560997947e-0
6
Constraint violation....: 6.2996677319127059e-11 6.2996677319127059e-1
1
Complementarity.........: 2.9291031039843535e-09 2.9291031039843535e-0
6
Overall NLP error.......: 2.9291031039843535e-09 2.9291031039843535e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4409921e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.92e-04 9.80e-0
3f 1
2 8.4129501e+02 1.39e+04 5.24e+01 -1.0 1.37e+04 - 9.29e-05 1.01e-0
4h 1
3 8.3224662e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 3.09e-06 6.42e-0
4f 1
4 5.3904316e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 6.89e-04 2.15e-0
2h 1
5 2.5524780e+04 5.72e-02 8.12e+01 -1.0 1.36e+04 - 4.53e-02 1.00e+0
0h 1
6 1.7022367e+04 5.37e-02 5.25e+01 -1.0 7.99e+01 - 3.46e-01 5.59e-0
2f 1
7 1.4909735e+04 3.42e-02 2.85e+01 -1.0 4.22e+01 - 4.65e-01 5.33e-0
1f 1
8 1.5382509e+04 1.84e-02 7.95e+00 -1.0 2.05e+01 - 5.93e-01 2.50e-0
1f 3
9 1.5063993e+04 5.25e-03 5.45e-01 -1.0 6.13e+00 - 9.52e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4709825e+04 1.46e-03 5.12e-01 -1.7 6.60e+00 - 1.00e+00 7.86e-0
1f 1
11 1.4650699e+04 7.05e-04 2.55e-02 -1.7 1.84e+01 - 1.00e+00 1.00e+0
0f 1
12 1.4510525e+04 1.45e-03 1.16e-01 -3.8 1.99e+01 - 7.66e-01 9.24e-0
1f 1
13 1.4479291e+04 2.48e-03 5.55e-02 -3.8 2.23e+00 - 8.16e-01 7.61e-0
1h 1
14 1.4480758e+04 1.88e-04 8.04e-02 -3.8 3.54e-01 - 1.00e+00 9.38e-0
1h 1
15 1.4481114e+04 4.06e-07 1.78e-05 -3.8 3.25e-02 - 1.00e+00 1.00e+0
0f 1
16 1.4480069e+04 4.15e-07 1.00e-03 -5.7 1.49e-01 - 1.00e+00 9.87e-0
1h 1
17 1.4480065e+04 4.53e-11 4.87e-09 -5.7 5.05e-03 - 1.00e+00 1.00e+0
0f 1
18 1.4480052e+04 6.30e-11 3.21e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.4480051750124421e+01 1.4480051750124421e+0
4
Dual infeasibility......: 3.2099173557475946e-09 3.2099173557475946e-0
6
Constraint violation....: 6.3005753392353370e-11 6.3005753392353370e-1
1
Complementarity.........: 2.9199716300075958e-09 2.9199716300075956e-0
6
Overall NLP error.......: 3.2099173557475946e-09 3.2099173557475946e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4411648e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.92e-04 9.80e-0
3f 1
2 8.4130784e+02 1.27e+04 5.24e+01 -1.0 1.24e+04 - 9.31e-05 1.01e-0
4h 1
3 8.3048652e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 3.39e-06 7.05e-0
4f 1
4 5.1193922e+02 1.24e+04 5.26e+01 -1.0 1.26e+04 - 7.64e-04 2.15e-0
2h 1
5 2.4240942e+04 5.73e-02 8.12e+01 -1.0 1.24e+04 - 4.54e-02 1.00e+0
0h 1
6 1.5771941e+04 5.38e-02 5.24e+01 -1.0 7.96e+01 - 3.47e-01 5.61e-0
2f 1
7 1.3662743e+04 3.42e-02 2.84e+01 -1.0 4.22e+01 - 4.66e-01 5.33e-0
1f 1
8 1.4127778e+04 1.84e-02 7.62e+00 -1.0 2.03e+01 - 6.01e-01 2.50e-0
1f 3
9 1.3815869e+04 5.25e-03 5.31e-01 -1.0 6.17e+00 - 9.52e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3462402e+04 1.45e-03 5.11e-01 -1.7 6.55e+00 - 1.00e+00 7.87e-0
1f 1
11 1.3403935e+04 6.93e-04 2.56e-02 -1.7 1.84e+01 - 1.00e+00 1.00e+0
0f 1
12 1.3263613e+04 1.45e-03 1.16e-01 -3.8 1.99e+01 - 7.65e-01 9.24e-0
1f 1
13 1.3232280e+04 2.49e-03 5.41e-02 -3.8 2.24e+00 - 8.16e-01 7.62e-0
1h 1
14 1.3233755e+04 1.90e-04 8.17e-02 -3.8 3.52e-01 - 1.00e+00 9.37e-0
1h 1
15 1.3234113e+04 4.06e-07 1.81e-05 -3.8 3.22e-02 - 1.00e+00 1.00e+0
0f 1
16 1.3233068e+04 4.15e-07 1.01e-03 -5.7 1.49e-01 - 1.00e+00 9.87e-0
1h 1
17 1.3233064e+04 4.53e-11 4.89e-09 -5.7 5.00e-03 - 1.00e+00 1.00e+0
0f 1
18 1.3233051e+04 6.30e-11 3.22e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.3233050903480812e+01 1.3233050903480813e+0
4
Dual infeasibility......: 3.2180802227186001e-09 3.2180802227186001e-0
6
Constraint violation....: 6.3005795025716793e-11 6.3005795025716793e-1
1
Complementarity.........: 2.9228087976003699e-09 2.9228087976003700e-0
6
Overall NLP error.......: 3.2180802227186001e-09 3.2180802227186001e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6525945e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 4.89e-04 9.80e-0
3h 1
2 8.6239321e+02 1.11e+04 5.24e+01 -1.0 1.05e+04 - 4.52e-05 1.05e-0
4h 1
3 8.1125455e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 9.07e-06 3.07e-0
3h 1
4 5.1166894e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 3.38e-03 2.10e-0
2h 1
5 2.1771479e+04 6.23e-02 8.05e+01 -1.0 1.09e+04 - 5.60e-02 1.00e+0
0h 1
6 1.4340966e+04 5.77e-02 4.85e+01 -1.0 6.70e+01 - 3.84e-01 6.72e-0
2f 1
7 1.2737313e+04 3.02e-02 2.35e+01 -1.0 3.84e+01 - 5.07e-01 4.46e-0
1f 1
8 1.2340129e+04 1.23e-02 2.11e+00 -1.0 1.05e+01 - 9.22e-01 1.00e+0
0f 1
9 1.2557311e+04 3.95e-04 6.70e-02 -1.0 4.46e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2087299e+04 4.53e-04 6.88e-01 -2.5 7.10e+00 - 8.98e-01 6.29e-0
1f 1
11 1.1999054e+04 2.85e-04 3.75e-01 -2.5 2.74e+00 - 8.83e-01 1.00e+0
0h 1
12 1.1990828e+04 6.99e-04 4.59e-01 -2.5 1.75e+00 - 1.00e+00 2.01e-0
1h 2
13 1.1966684e+04 9.74e-04 1.11e-02 -2.5 1.14e+00 - 1.00e+00 1.00e+0
0h 1
14 1.1947643e+04 1.34e-03 3.60e-02 -3.8 5.36e+00 - 7.92e-01 1.00e+0
0h 1
15 1.1944305e+04 2.78e-03 9.49e-04 -3.8 4.56e-02 - 1.00e+00 1.00e+0
0h 1
16 1.1944665e+04 3.36e-05 1.76e-04 -3.8 1.36e-02 - 1.00e+00 1.00e+0
0h 1
17 1.1943211e+04 9.83e-05 1.87e-04 -5.7 2.97e-01 - 9.53e-01 9.65e-0
1h 1
18 1.1943187e+04 2.31e-05 4.64e-03 -5.7 1.04e-02 - 1.00e+00 7.65e-0
1h 1
19 1.1943186e+04 7.64e-09 1.37e-06 -5.7 2.43e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.1943170e+04 8.82e-09 2.31e-05 -8.6 3.68e-03 - 1.00e+00 9.83e-0
1h 1
21 1.1943169e+04 1.65e-12 8.21e-11 -8.6 6.37e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.1943169285415170e+01 1.1943169285415170e+0
4
Dual infeasibility......: 8.2055148047066825e-11 8.2055148047066825e-0
8
Constraint violation....: 1.6520118606422329e-12 1.6520118606422329e-1
2
Complementarity.........: 2.7631811482844108e-09 2.7631811482844107e-0
6
Overall NLP error.......: 2.7631811482844108e-09 2.7631811482844107e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8777320e+02 9.19e+03 5.24e+01 -1.0 9.28e+03 - 6.64e-04 9.80e-0
3h 1
2 8.8499164e+02 9.19e+03 5.24e+01 -1.0 8.96e+03 - 8.88e-05 1.02e-0
4h 1
3 8.6604553e+02 9.18e+03 5.24e+01 -1.0 9.18e+03 - 4.81e-06 1.03e-0
3f 1
4 4.6753384e+02 8.97e+03 5.24e+01 -1.0 9.18e+03 - 1.16e-03 2.24e-0
2h 1
5 2.1019834e+04 6.31e-02 7.87e+01 -1.0 8.97e+03 - 6.27e-02 1.00e+0
0h 1
6 1.2779542e+04 5.82e-02 5.04e+01 -1.0 5.68e+01 - 3.45e-01 7.15e-0
2f 1
7 1.1474093e+04 2.98e-02 2.31e+01 -1.0 2.74e+01 - 5.30e-01 4.48e-0
1f 1
8 1.0826912e+04 8.86e-03 1.29e+00 -1.0 1.03e+01 - 9.25e-01 7.95e-0
1f 1
9 1.1132672e+04 2.56e-04 7.50e-02 -1.0 3.69e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.0462579e+04 2.14e-03 9.04e-02 -2.5 5.27e+00 - 8.69e-01 8.83e-0
1f 1
11 1.0356962e+04 1.11e-03 4.48e-01 -2.5 8.53e-01 - 1.00e+00 6.12e-0
1f 1
12 1.0357041e+04 2.64e-06 8.39e-03 -2.5 1.73e-01 - 1.00e+00 1.00e+0
0h 1
13 1.0339021e+04 7.22e-06 6.55e-03 -3.8 2.68e+00 - 9.00e-01 8.93e-0
1f 1
14 1.0335760e+04 4.68e-04 3.83e-04 -3.8 2.86e-01 - 1.00e+00 1.00e+0
0f 1
15 1.0334765e+04 6.30e-05 1.15e-02 -5.7 1.49e-01 - 8.13e-01 1.00e+0
0h 1
16 1.0334649e+04 3.63e-05 4.09e-05 -5.7 9.71e-03 - 1.00e+00 1.00e+0
0h 1
17 1.0334650e+04 1.61e-06 3.43e-05 -5.7 1.54e-03 - 1.00e+00 9.90e-0
1h 1
18 1.0334653e+04 3.53e-08 5.13e-07 -5.7 2.92e-04 - 1.00e+00 1.00e+0
0f 1
19 1.0334638e+04 3.96e-08 7.26e-06 -8.6 1.84e-03 - 9.97e-01 9.81e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.0334638e+04 5.32e-13 2.97e-11 -8.6 3.54e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.0334637935892795e+01 1.0334637935892795e+0
4
Dual infeasibility......: 2.9731377518241446e-11 2.9731377518241446e-0
8
Constraint violation....: 5.3168580649298747e-13 5.3168580649298747e-1
3
Complementarity.........: 2.5100786378754464e-09 2.5100786378754465e-0
6
Overall NLP error.......: 2.5100786378754464e-09 2.5100786378754465e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891119e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0611351e+02 6.71e+03 5.23e+01 -1.0 6.46e+03 - 8.39e-05 1.03e-0
4h 1
3 8.7440044e+02 6.70e+03 5.23e+01 -1.0 6.70e+03 - 6.84e-06 1.53e-0
3f 1
4 4.2534165e+02 6.54e+03 5.24e+01 -1.0 6.70e+03 - 1.83e-03 2.26e-0
2h 1
5 1.8469067e+04 6.74e-02 7.67e+01 -1.0 6.54e+03 - 8.35e-02 1.00e+0
0h 1
6 1.0609292e+04 6.07e-02 3.68e+01 -1.0 2.85e+01 - 4.94e-01 9.10e-0
2f 1
7 9.1070968e+03 1.97e-02 1.46e+01 -1.0 1.53e+01 - 6.26e-01 7.49e-0
1f 1
8 9.1804481e+03 5.62e-03 1.19e+00 -1.0 2.08e+00 - 9.93e-01 5.00e-0
1f 2
9 9.3751841e+03 2.91e-04 6.67e-02 -1.0 2.88e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.8198146e+03 2.22e-03 9.09e-02 -2.5 2.66e+01 - 8.56e-01 8.23e-0
1f 1
11 8.6513288e+03 2.12e-03 4.55e-01 -2.5 4.37e+00 - 1.00e+00 7.50e-0
1f 1
12 8.6223061e+03 1.56e-04 4.78e-03 -2.5 1.09e+00 - 1.00e+00 1.00e+0
0h 1
13 8.6058823e+03 4.18e-05 1.61e-01 -3.8 2.68e+00 - 1.00e+00 7.51e-0
1h 1
14 8.6015687e+03 1.44e-07 3.57e-04 -3.8 6.67e-01 - 1.00e+00 1.00e+0
0f 1
15 8.6003429e+03 2.79e-08 9.26e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 8.6003307e+03 1.87e-12 1.33e-08 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
17 8.6003159e+03 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 8.6003159061640755e+00 8.6003159061640745e+0
3
Dual infeasibility......: 4.4776954070181785e-09 4.4776954070181785e-0
6
Constraint violation....: 2.6308608069847139e-12 2.6308608069847139e-1
2
Complementarity.........: 3.6085002362372856e-09 3.6085002362372855e-0
6
Overall NLP error.......: 4.4776954070181785e-09 4.4776954070181785e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8772454e+02 4.77e+03 5.24e+01 -1.0 4.82e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8463069e+02 4.77e+03 5.24e+01 -1.0 4.12e+03 - 4.65e-05 1.15e-0
4h 1
3 6.9026553e+02 4.73e+03 5.24e+01 -1.0 4.77e+03 - 2.20e-05 8.53e-0
3f 1
4 4.0829903e+02 4.63e+03 5.20e+01 -1.0 4.73e+03 - 1.12e-02 2.07e-0
2h 1
5 1.3286163e+04 7.24e-02 7.77e+01 -1.0 4.63e+03 - 9.89e-02 1.00e+0
0h 1
6 7.8843056e+03 6.35e-02 2.09e+01 -1.0 4.48e+01 - 7.03e-01 1.14e-0
1f 1
7 6.3730705e+03 2.46e-02 2.05e+00 -1.0 2.21e+01 - 9.31e-01 6.56e-0
1f 1
8 6.5551438e+03 3.66e-03 1.05e+00 -1.0 3.60e+00 - 5.52e-01 1.00e+0
0f 1
9 6.7363368e+03 4.50e-04 1.07e+00 -1.0 7.73e+00 - 5.01e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.7271678e+03 7.81e-05 1.45e-01 -1.0 1.43e+01 - 6.31e-01 1.00e+0
0f 1
11 6.1067375e+03 1.84e-03 7.54e-02 -1.7 3.35e+00 - 1.00e+00 1.00e+0
0f 1
12 5.9478902e+03 1.19e-03 2.42e-01 -2.5 2.29e+01 - 9.57e-01 6.70e-0
1f 1
13 5.9424889e+03 1.70e-06 7.41e-03 -2.5 7.51e+00 - 1.00e+00 1.00e+0
0h 1
14 5.9217963e+03 3.93e-06 5.51e-02 -3.8 5.36e+00 - 9.42e-01 8.86e-0
1f 1
15 5.9184146e+03 5.27e-04 6.07e-04 -3.8 6.06e-01 - 1.00e+00 1.00e+0
0f 1
16 5.9173075e+03 5.36e-05 1.05e-02 -5.7 2.97e-01 - 8.29e-01 1.00e+0
0h 1
17 5.9171985e+03 3.23e-05 3.59e-05 -5.7 9.15e-03 - 1.00e+00 1.00e+0
0h 1
18 5.9172014e+03 5.72e-07 6.04e-06 -5.7 1.14e-03 - 1.00e+00 1.00e+0
0h 1
19 5.9171874e+03 3.98e-08 8.06e-05 -8.6 3.68e-03 - 1.00e+00 9.42e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 5.9171865e+03 7.74e-12 6.99e-11 -8.6 2.12e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 5.9171865344066328e+00 5.9171865344066327e+0
3
Dual infeasibility......: 6.9923099039676663e-11 6.9923099039676663e-0
8
Constraint violation....: 7.7390316377545787e-12 7.7390316377545787e-1
2
Complementarity.........: 2.9708766184455537e-09 2.9708766184455536e-0
6
Overall NLP error.......: 2.9708766184455537e-09 2.9708766184455536e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9469463e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3h 1
2 8.9070845e+02 3.24e+03 5.24e+01 -1.0 2.13e+03 - 3.61e-05 1.51e-0
4h 1
3 3.3042115e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 6.40e-05 2.31e-0
2f 1
4 1.5680539e+04 6.28e-02 8.02e+01 -1.0 3.17e+03 - 3.82e-02 1.00e+0
0h 1
5 7.1096017e+03 5.94e-02 5.80e+01 -1.0 5.03e+01 - 2.72e-01 4.93e-0
2f 1
6 5.7281758e+03 2.48e-02 2.85e+01 -1.0 2.32e+01 - 5.13e-01 5.39e-0
1f 1
7 5.1166765e+03 1.01e-02 1.45e+00 -1.0 8.86e+00 - 9.34e-01 7.73e-0
1f 1
8 5.4253178e+03 3.01e-04 8.55e-02 -1.0 3.30e+00 - 1.00e+00 1.00e+0
0f 1
9 4.7998331e+03 2.08e-03 7.85e-02 -2.5 4.79e+00 - 8.62e-01 8.55e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.6289382e+03 2.21e-03 3.37e-01 -2.5 1.04e+00 - 1.00e+00 7.83e-0
1f 1
11 4.6028015e+03 1.45e-04 4.55e-03 -2.5 1.98e-01 - 1.00e+00 1.00e+0
0h 1
12 4.5779290e+03 2.16e-05 4.19e-02 -3.8 8.05e+00 - 1.00e+00 8.86e-0
1h 1
13 4.5759312e+03 5.62e-08 5.97e-04 -3.8 9.12e-01 - 1.00e+00 1.00e+0
0f 1
14 4.5743283e+03 4.27e-08 6.47e-05 -5.7 4.46e-01 - 1.00e+00 9.98e-0
1f 1
15 4.5743286e+03 1.89e-12 1.38e-08 -5.7 1.06e-03 - 1.00e+00 1.00e+0
0f 1
16 4.5743102e+03 2.57e-12 3.30e-06 -8.6 5.53e-03 - 1.00e+00 9.99e-0
1f 1
17 4.5743102e+03 5.46e-15 4.85e-14 -8.6 3.04e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 4.5743101891111211e+00 4.5743101891111210e+0
3
Dual infeasibility......: 4.8501768024684233e-14 4.8501768024684233e-1
1
Constraint violation....: 5.4553394666534037e-15 5.4553394666534037e-1
5
Complementarity.........: 2.6748172880075856e-09 2.6748172880075854e-0
6
Overall NLP error.......: 2.6748172880075856e-09 2.6748172880075854e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1576532e+02 2.00e+03 5.23e+01 -1.0 2.01e+03 - 1.20e-03 9.82e-0
3h 1
2 9.1033524e+02 2.00e+03 5.23e+01 -1.0 1.03e+03 - 3.90e-05 2.05e-0
4h 1
3 9.0264570e+02 2.00e+03 5.23e+01 -1.0 1.99e+03 - 1.27e-04 3.03e-0
4h 1
4 3.1376162e+02 1.95e+03 1.14e+02 -1.0 2.00e+03 - 4.24e-04 2.33e-0
2f 1
5 1.4392164e+04 6.72e-02 7.63e+01 -1.0 1.95e+03 - 8.11e-02 1.00e+0
0h 1
6 6.1025309e+03 6.06e-02 3.17e+01 -1.0 2.07e+01 - 5.54e-01 8.79e-0
2f 1
7 4.5743375e+03 1.64e-02 1.38e+01 -1.0 1.27e+01 - 6.25e-01 8.69e-0
1f 1
8 4.7352567e+03 8.57e-03 6.84e-01 -1.0 3.79e+00 - 9.66e-01 5.00e-0
1f 2
9 4.3999513e+03 8.09e-03 1.65e-01 -1.7 3.28e+00 - 9.33e-01 8.45e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2364293e+03 2.87e-03 2.13e-01 -2.5 1.01e+00 - 8.15e-01 7.27e-0
1h 1
11 4.2006471e+03 5.62e-04 2.39e-02 -2.5 7.65e-01 - 1.00e+00 9.86e-0
1h 1
12 4.1848025e+03 1.24e-04 1.36e-01 -3.8 5.13e+00 - 8.82e-01 7.80e-0
1h 1
13 4.1817191e+03 1.61e-07 5.00e-05 -3.8 1.77e-01 - 1.00e+00 1.00e+0
0f 1
14 4.1805108e+03 1.74e-08 5.24e-04 -5.7 1.80e-01 - 1.00e+00 9.89e-0
1h 1
15 4.1805039e+03 7.08e-13 1.38e-09 -5.7 1.85e-03 - 1.00e+00 1.00e+0
0f 1
16 4.1804892e+03 2.63e-12 1.52e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 4.1804891534643742e+00 4.1804891534643739e+0
3
Dual infeasibility......: 1.5189535701556018e-09 1.5189535701556018e-0
6
Constraint violation....: 2.6283766829671151e-12 2.6283766829671151e-1
2
Complementarity.........: 2.8635066961719338e-09 2.8635066961719336e-0
6
Overall NLP error.......: 2.8635066961719338e-09 2.8635066961719336e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2252293e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 3.31e-04 9.88e-0
3h 1
2 7.9742303e+02 9.17e+02 5.24e+01 -1.0 8.18e+02 - 9.71e-05 9.16e-0
4h 1
3 2.4312288e+02 8.97e+02 5.26e+01 -1.0 9.17e+02 - 9.08e-04 2.09e-0
2h 1
4 1.2260850e+04 5.54e-02 8.24e+01 -1.0 8.98e+02 - 3.89e-02 1.00e+0
0h 1
5 3.8743081e+03 5.28e-02 5.49e+01 -1.0 7.96e+01 - 3.31e-01 5.07e-0
2f 1
6 1.9080741e+03 3.72e-02 2.92e+01 -1.0 3.93e+01 - 4.71e-01 5.03e-0
1f 1
7 4.6563841e+03 1.22e-02 2.61e+01 -1.0 2.04e+01 - 4.03e-01 1.00e+0
0h 1
8 1.8744334e+03 1.17e-02 9.66e-01 -1.0 2.51e+01 - 9.88e-01 8.98e-0
1f 1
9 1.6954233e+03 5.10e-04 6.26e-02 -1.7 6.76e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5627878e+03 1.96e-03 2.19e-01 -2.5 1.25e+01 - 7.43e-01 1.00e+0
0f 1
11 1.5309769e+03 3.67e-03 1.04e-01 -2.5 2.12e+00 - 1.00e+00 9.19e-0
1h 1
12 1.5388648e+03 1.31e-04 3.49e-03 -2.5 1.16e+00 - 1.00e+00 1.00e+0
0h 1
13 1.5037418e+03 1.63e-04 2.17e-02 -3.8 1.88e+01 - 9.93e-01 9.32e-0
1h 1
14 1.5022722e+03 7.65e-07 7.15e-05 -3.8 1.24e+00 - 1.00e+00 1.00e+0
0f 1
15 1.5003196e+03 3.77e-07 1.78e-04 -5.7 1.04e+00 - 1.00e+00 9.96e-0
1h 1
16 1.5003172e+03 3.80e-11 2.94e-09 -5.7 1.11e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.29e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5002932812929022e+00 1.5002932812929021e+0
3
Dual infeasibility......: 2.1737076377439962e-09 2.1737076377439962e-0
6
Constraint violation....: 6.2995622607253665e-11 6.2995622607253665e-1
1
Complementarity.........: 2.8882173926668989e-09 2.8882173926668988e-0
6
Overall NLP error.......: 2.8882173926668989e-09 2.8882173926668988e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.28e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9792022e+02 4.09e+01 5.94e+01 -1.0 1.43e+01 - 6.99e-04 4.23e-0
2f 1
2 1.2226208e+04 6.07e-02 7.87e+01 -1.0 1.80e+01 - 7.07e-02 1.00e+0
0h 1
3 3.6198120e+03 5.54e-02 5.15e+01 -1.0 5.46e+01 - 3.33e-01 7.86e-0
2f 1
4 2.3518136e+03 2.93e-02 2.28e+01 -1.0 2.71e+01 - 5.45e-01 4.46e-0
1f 1
5 1.7557842e+03 8.50e-03 1.17e+00 -1.0 9.97e+00 - 9.27e-01 7.68e-0
1f 1
6 2.0288429e+03 3.41e-04 8.15e-02 -1.0 3.36e+00 - 1.00e+00 1.00e+0
0h 1
7 1.4017677e+03 2.08e-03 8.13e-02 -2.5 4.88e+00 - 8.66e-01 8.50e-0
1f 1
8 1.2221186e+03 2.16e-03 2.04e-01 -2.5 1.05e+00 - 1.00e+00 8.34e-0
1f 1
9 1.2056881e+03 8.29e-05 3.94e-03 -2.5 1.47e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1964862e+03 4.50e-05 1.20e+00 -3.8 9.56e-02 - 1.00e+00 4.86e-0
1h 1
11 1.1944260e+03 3.81e-07 1.16e-01 -3.8 4.16e-02 - 9.65e-01 1.00e+0
0f 1
12 1.1933751e+03 2.37e-08 2.01e-03 -3.8 3.32e-02 - 1.00e+00 1.00e+0
0H 1
13 1.1935802e+03 1.35e-05 3.08e-04 -3.8 4.28e-03 - 1.00e+00 1.00e+0
0f 1
14 1.1929524e+03 2.10e-06 6.04e-02 -5.7 1.24e-02 - 7.79e-01 9.70e-0
1h 1
15 1.1927877e+03 1.23e-05 2.01e-04 -5.7 5.02e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1927934e+03 2.14e-08 1.78e-06 -5.7 2.27e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1927802e+03 2.61e-08 2.54e-06 -8.6 2.38e-04 - 9.83e-01 9.85e-0
1h 1
18 1.1927801e+03 4.57e-13 3.48e-11 -8.6 2.60e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1927800696974298e+00 1.1927800696974298e+0
3
Dual infeasibility......: 3.4834170214453748e-11 3.4834170214453748e-0
8
Constraint violation....: 4.5652370772586437e-13 4.5652370772586437e-1
3
Complementarity.........: 2.5123551813251614e-09 2.5123551813251614e-0
6
Overall NLP error.......: 2.5123551813251614e-09 2.5123551813251614e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1582576e+02 1.09e+02 1.13e+02 -1.0 3.76e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1398370e+04 5.38e-02 8.36e+01 -1.0 4.53e+01 - 3.10e-02 1.00e+0
0h 1
3 2.7845901e+03 5.17e-02 6.49e+01 -1.0 8.43e+01 - 2.27e-01 4.32e-0
2f 1
4 9.8152882e+02 4.24e-02 3.38e+01 -1.0 3.41e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5906778e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.22e-01 1.00e+0
0h 1
6 9.4490441e+02 1.01e-02 8.72e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6264654e+02 4.59e-04 6.60e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536437e+02 1.94e-03 1.94e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379715e+02 3.25e-03 6.12e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140238e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388159e+02 1.57e-04 1.69e-02 -3.8 7.57e-01 - 9.93e-01 9.41e-0
1h 1
12 5.8370191e+02 7.28e-07 6.65e-05 -3.8 8.62e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278679e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.06e-09 -5.7 3.40e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148938205e-01 5.8277753148938200e+0
2
Dual infeasibility......: 2.0880115075224208e-09 2.0880115075224208e-0
6
Constraint violation....: 6.2994054417231382e-11 6.2994054417231382e-1
1
Complementarity.........: 2.8882094420347794e-09 2.8882094420347795e-0
6
Overall NLP error.......: 2.8882094420347794e-09 2.8882094420347795e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.78e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5000575e+02 7.50e+01 9.04e+01 -1.0 2.59e+01 - 3.83e-04 3.52e-0
2f 1
2 1.1818546e+04 5.63e-02 8.12e+01 -1.0 2.87e+01 - 4.64e-02 1.00e+0
0h 1
3 3.1583161e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.65e-0
2f 1
4 1.0154149e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8164779e+03 7.28e-03 1.55e+01 -1.0 1.92e+01 - 6.10e-01 1.00e+0
0h 1
6 1.1189268e+03 5.40e-03 4.04e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8232674e+02 9.97e-04 2.09e-01 -1.7 5.71e+00 - 1.00e+00 8.88e-0
1h 1
8 7.2806667e+02 8.48e-04 1.34e-02 -1.7 3.45e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0978200e+02 1.50e-03 1.13e-01 -3.8 4.49e+00 - 7.71e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8216668e+02 2.17e-03 7.27e-02 -3.8 2.11e+00 - 8.07e-01 7.39e-0
1h 1
11 5.8336969e+02 9.23e-05 4.64e-02 -3.8 3.15e-02 - 1.00e+00 9.57e-0
1h 1
12 5.8368715e+02 2.81e-07 1.30e-05 -3.8 3.37e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278926e+02 4.12e-07 5.35e-04 -5.7 3.47e-02 - 1.00e+00 9.91e-0
1h 1
14 5.8278859e+02 4.35e-11 3.51e-09 -5.7 2.16e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.65e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753111869768e-01 5.8277753111869765e+0
2
Dual infeasibility......: 2.6458543385623338e-09 2.6458543385623338e-0
6
Constraint violation....: 6.3002020267433068e-11 6.3002020267433068e-1
1
Complementarity.........: 2.8882674692901054e-09 2.8882674692901054e-0
6
Overall NLP error.......: 2.8882674692901054e-09 2.8882674692901054e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.28e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9792022e+02 4.09e+01 5.94e+01 -1.0 1.43e+01 - 6.99e-04 4.23e-0
2f 1
2 1.2226208e+04 6.07e-02 7.87e+01 -1.0 1.80e+01 - 7.07e-02 1.00e+0
0h 1
3 3.6198120e+03 5.54e-02 5.15e+01 -1.0 5.46e+01 - 3.33e-01 7.86e-0
2f 1
4 2.3518136e+03 2.93e-02 2.28e+01 -1.0 2.71e+01 - 5.45e-01 4.46e-0
1f 1
5 1.7557842e+03 8.50e-03 1.17e+00 -1.0 9.97e+00 - 9.27e-01 7.68e-0
1f 1
6 2.0288429e+03 3.41e-04 8.15e-02 -1.0 3.36e+00 - 1.00e+00 1.00e+0
0h 1
7 1.4017677e+03 2.08e-03 8.13e-02 -2.5 4.88e+00 - 8.66e-01 8.50e-0
1f 1
8 1.2221186e+03 2.16e-03 2.04e-01 -2.5 1.05e+00 - 1.00e+00 8.34e-0
1f 1
9 1.2056881e+03 8.29e-05 3.94e-03 -2.5 1.47e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1964862e+03 4.50e-05 1.20e+00 -3.8 9.56e-02 - 1.00e+00 4.86e-0
1h 1
11 1.1944260e+03 3.81e-07 1.16e-01 -3.8 4.16e-02 - 9.65e-01 1.00e+0
0f 1
12 1.1933751e+03 2.37e-08 2.01e-03 -3.8 3.32e-02 - 1.00e+00 1.00e+0
0H 1
13 1.1935802e+03 1.35e-05 3.08e-04 -3.8 4.28e-03 - 1.00e+00 1.00e+0
0f 1
14 1.1929524e+03 2.10e-06 6.04e-02 -5.7 1.24e-02 - 7.79e-01 9.70e-0
1h 1
15 1.1927877e+03 1.23e-05 2.01e-04 -5.7 5.02e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1927934e+03 2.14e-08 1.78e-06 -5.7 2.27e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1927802e+03 2.61e-08 2.54e-06 -8.6 2.38e-04 - 9.83e-01 9.85e-0
1h 1
18 1.1927801e+03 4.57e-13 3.48e-11 -8.6 2.60e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1927800696974298e+00 1.1927800696974298e+0
3
Dual infeasibility......: 3.4834170214453748e-11 3.4834170214453748e-0
8
Constraint violation....: 4.5652370772586437e-13 4.5652370772586437e-1
3
Complementarity.........: 2.5123551813251614e-09 2.5123551813251614e-0
6
Overall NLP error.......: 2.5123551813251614e-09 2.5123551813251614e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 40
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 20
inequality constraints with only lower bounds: 11
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2226548e+02 9.17e+02 5.24e+01 -1.0 9.19e+02 - 3.31e-04 9.89e-0
3h 1
2 7.9567419e+02 9.17e+02 5.24e+01 -1.0 8.24e+02 - 1.08e-04 9.71e-0
4h 1
3 2.4325600e+02 8.97e+02 5.26e+01 -1.0 9.17e+02 - 9.56e-04 2.09e-0
2h 1
4 1.2231736e+04 5.55e-02 8.38e+01 -1.0 8.98e+02 - 2.32e-02 1.00e+0
0h 1
5 3.9591307e+03 5.36e-02 6.86e+01 -1.0 8.19e+01 - 1.86e-01 3.68e-0
2f 1
6 1.9812308e+03 4.37e-02 3.67e+01 -1.0 3.39e+01 - 4.72e-01 5.47e-0
1f 1
7 2.6523735e+03 1.86e-02 2.12e+01 -1.0 1.93e+01 - 3.72e-01 2.50e-0
1f 3
8 1.9462783e+03 7.68e-03 4.04e-01 -1.0 1.01e+01 - 9.83e-01 1.00e+0
0f 1
9 1.6820695e+03 1.34e-03 2.81e-01 -1.7 4.79e+00 - 1.00e+00 8.75e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7931170e+03 9.77e-04 1.28e-02 -1.7 1.58e+02 - 1.00e+00 1.00e+0
0f 1
11 1.5500476e+03 1.17e-03 4.79e-02 -2.5 1.43e+02 - 9.21e-01 1.00e+0
0f 1
12 1.5343737e+03 1.24e-03 1.48e-02 -2.5 1.18e+00 - 1.00e+00 1.00e+0
0h 1
13 1.5061814e+03 2.17e-04 1.03e-01 -3.8 1.94e+01 - 1.00e+00 8.36e-0
1h 1
14 1.5022692e+03 4.11e-07 1.29e-04 -3.8 2.88e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5003178e+03 4.02e-07 1.62e-04 -5.7 1.04e+00 - 1.00e+00 9.97e-0
1h 1
16 1.5003172e+03 3.88e-11 2.93e-09 -5.7 4.57e-02 - 1.00e+00 1.00e+0
0f 1
17 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.29e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5002932811325531e+00 1.5002932811325531e+0
3
Dual infeasibility......: 2.1737243002627324e-09 2.1737243002627324e-0
6
Constraint violation....: 6.2995830774070782e-11 6.2995830774070782e-1
1
Complementarity.........: 2.8882202481573554e-09 2.8882202481573553e-0
6
Overall NLP error.......: 2.8882202481573554e-09 2.8882202481573553e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6492449e+02 9.17e+02 5.24e+01 -1.0 9.19e+02 - 4.97e-04 9.89e-0
3h 1
2 8.3429719e+02 9.16e+02 5.24e+01 -1.0 8.37e+02 - 1.07e-04 1.13e-0
3h 1
3 2.6334808e+02 8.96e+02 5.25e+01 -1.0 9.16e+02 - 1.12e-03 2.18e-0
2h 1
4 1.2547951e+04 6.03e-02 8.25e+01 -1.0 8.97e+02 - 2.44e-02 1.00e+0
0h 1
5 4.4093479e+03 5.78e-02 6.61e+01 -1.0 6.99e+01 - 2.02e-01 3.77e-0
2f 1
6 2.4528855e+03 3.38e-02 3.55e+01 -1.0 3.12e+01 - 4.78e-01 6.14e-0
1f 1
15 1.262857e+04 1.632511e+04 2.447097e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6793774e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.80e-0
3h 1
2 7.6493635e+02 1.57e+04 5.25e+01 -1.0 1.38e+04 - 2.52e-05 1.13e-0
4h 1
3 7.6257773e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 1.75e-05 1.86e-0
4h 1
4 7.5920183e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 2.02e-04 2.73e-0
4h 1
5 5.2209118e+02 1.54e+04 5.27e+01 -1.0 1.57e+04 - 4.94e-04 2.00e-0
2f 1
6 2.6772078e+04 6.08e-02 8.48e+01 -1.0 1.54e+04 - 2.95e-02 1.00e+0
0h 1
7 1.8272479e+04 5.85e-02 6.75e+01 -1.0 7.94e+01 - 2.10e-01 4.28e-0
2f 1
8 1.6691795e+04 4.49e-02 3.34e+01 -1.0 2.87e+01 - 5.00e-01 4.36e-0
1f 1
9 1.6987766e+04 3.06e-02 1.35e+01 -1.0 1.62e+01 - 4.67e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6780517e+04 5.30e-03 3.57e-01 -1.0 3.74e+00 - 9.80e-01 1.00e+0
0h 1
11 1.6494882e+04 1.03e-03 1.44e+00 -1.7 4.60e+00 - 2.96e-01 8.81e-0
1f 1
12 1.6483684e+04 1.63e-04 7.99e-01 -1.7 2.69e+00 - 6.08e-01 1.00e+0
0f 1
13 1.6468924e+04 1.15e-04 2.48e-01 -1.7 5.97e+00 - 6.39e-01 1.00e+0
0f 1
14 1.6477333e+04 1.69e-05 6.69e-02 -1.7 1.16e+01 - 7.18e-01 1.00e+0
0h 1
15 1.6369539e+04 9.31e-04 5.27e-02 -2.5 1.17e+01 - 9.22e-01 1.00e+0
0f 1
16 1.6345063e+04 1.17e-03 1.24e-02 -2.5 4.63e+00 - 1.00e+00 1.00e+0
0h 1
17 1.6327966e+04 1.98e-04 8.85e-02 -3.8 5.80e+00 - 1.00e+00 8.50e-0
1h 1
18 1.6326334e+04 5.72e-07 1.04e-04 -3.8 7.04e-01 - 1.00e+00 1.00e+0
0h 1
19 1.6325117e+04 4.00e-07 1.10e-04 -5.7 2.98e-01 - 1.00e+00 9.97e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325119e+04 3.81e-11 2.99e-09 -5.7 2.41e-03 - 1.00e+00 1.00e+0
0f 1
21 1.6325107e+04 4.78e-11 7.34e-05 -8.6 3.58e-03 - 1.00e+00 8.81e-0
1h 1
22 1.6325105e+04 8.92e-13 2.93e-11 -8.6 1.41e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.6325105198530192e+01 1.6325105198530191e+0
4
Dual infeasibility......: 2.9318655729201445e-11 2.9318655729201445e-0
8
Constraint violation....: 8.9167562222769448e-13 8.9167562222769448e-1
3
Complementarity.........: 3.7547923164367954e-09 3.7547923164367955e-0
6
Overall NLP error.......: 3.7547923164367954e-09 3.7547923164367955e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6808319e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.29e-04 9.80e-0
3f 1
2 7.6514456e+02 1.50e+04 5.25e+01 -1.0 1.37e+04 - 3.27e-05 1.08e-0
4h 1
3 7.6314918e+02 1.50e+04 5.25e+01 -1.0 1.49e+04 - 1.15e-05 1.48e-0
4h 1
4 7.5669628e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 1.57e-04 4.89e-0
4h 1
5 5.0810924e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 6.58e-04 1.99e-0
2f 1
6 2.5944637e+04 6.09e-02 8.48e+01 -1.0 1.47e+04 - 2.96e-02 1.00e+0
0h 1
7 1.7504167e+04 5.85e-02 6.72e+01 -1.0 7.88e+01 - 2.13e-01 4.29e-0
2f 1
8 1.5925913e+04 4.49e-02 3.32e+01 -1.0 2.87e+01 - 5.01e-01 4.36e-0
1f 1
9 1.6221366e+04 3.07e-02 1.33e+01 -1.0 1.62e+01 - 4.68e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6014824e+04 5.31e-03 1.65e-01 -1.0 3.76e+00 - 9.91e-01 1.00e+0
0h 1
11 1.5731858e+04 1.04e-03 2.43e-01 -1.7 4.88e+00 - 1.00e+00 8.80e-0
1f 1
12 1.5730100e+04 7.52e-04 1.38e-01 -1.7 3.77e+01 - 4.69e-01 1.00e+0
0f 1
13 1.5594734e+04 1.06e-03 5.81e-02 -2.5 3.82e+01 - 9.18e-01 1.00e+0
0f 1
14 1.5579233e+04 1.11e-03 1.43e-02 -2.5 1.60e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5562347e+04 1.94e-04 9.47e-02 -3.8 5.46e+00 - 1.00e+00 8.45e-0
1h 1
16 1.5560426e+04 1.24e-06 1.21e-04 -3.8 8.06e-01 - 1.00e+00 1.00e+0
0h 1
17 1.5559215e+04 3.91e-07 1.15e-04 -5.7 2.97e-01 - 1.00e+00 9.97e-0
1h 1
18 1.5559217e+04 3.84e-11 3.05e-09 -5.7 1.18e-02 - 1.00e+00 1.00e+0
0f 1
19 1.5559202e+04 6.30e-11 2.07e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.5559202124476966e+01 1.5559202124476966e+0
4
Dual infeasibility......: 2.0695843181414898e-09 2.0695843181414898e-0
6
Constraint violation....: 6.2993527061294685e-11 6.2993527061294685e-1
1
Complementarity.........: 2.9541980817710124e-09 2.9541980817710123e-0
6
Overall NLP error.......: 2.9541980817710124e-09 2.9541980817710123e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.3158163e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.51e-04 9.80e-0
3h 1
2 8.2871947e+02 1.39e+04 5.24e+01 -1.0 1.32e+04 - 4.66e-05 1.04e-0
4h 1
3 8.1812353e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 7.05e-06 7.45e-0
4f 1
4 8.0164760e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 7.54e-04 1.21e-0
3h 1
5 5.4884079e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 2.65e-03 2.11e-0
2f 1
6 2.4192405e+04 5.85e-02 8.23e+01 -1.0 1.36e+04 - 4.49e-02 1.00e+0
0h 1
7 1.6806121e+04 5.48e-02 4.66e+01 -1.0 7.15e+01 - 4.25e-01 5.75e-0
2f 1
8 1.4883755e+04 3.66e-02 2.35e+01 -1.0 4.02e+01 - 4.96e-01 5.02e-0
1f 1
9 1.5246939e+04 2.01e-02 4.43e+00 -1.0 1.10e+01 - 6.44e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5019233e+04 4.99e-03 2.32e-01 -1.0 4.19e+00 - 9.70e-01 1.00e+0
0h 1
11 1.4687291e+04 1.28e-03 4.43e-01 -1.7 5.85e+00 - 1.00e+00 8.08e-0
1f 1
12 1.4644482e+04 7.39e-04 2.13e-02 -1.7 2.48e+01 - 1.00e+00 1.00e+0
0f 1
13 1.4520963e+04 1.19e-03 2.13e-02 -3.8 3.60e+01 - 7.77e-01 7.79e-0
1f 1
14 1.4481461e+04 2.07e-03 4.16e-02 -3.8 2.44e+00 - 8.28e-01 7.86e-0
1h 1
15 1.4480853e+04 8.33e-05 4.01e-02 -3.8 3.52e-02 - 1.00e+00 9.59e-0
1h 1
16 1.4481111e+04 2.64e-07 1.19e-05 -3.8 1.14e-01 - 1.00e+00 1.00e+0
0f 1
17 1.4480064e+04 4.10e-07 2.76e-04 -5.7 1.50e-01 - 1.00e+00 9.95e-0
1h 1
18 1.4480065e+04 4.23e-11 3.20e-09 -5.7 3.35e-04 - 1.00e+00 1.00e+0
0f 1
19 1.4480052e+04 6.30e-11 2.24e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.4480051750631345e+01 1.4480051750631344e+0
4
Dual infeasibility......: 2.2427192248823923e-09 2.2427192248823923e-0
6
Constraint violation....: 6.2996038940887900e-11 6.2996038940887900e-1
1
Complementarity.........: 2.8882164495430781e-09 2.8882164495430781e-0
6
Overall NLP error.......: 2.8882164495430781e-09 2.8882164495430781e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.3798157e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.71e-04 9.80e-0
3h 1
2 8.3511097e+02 1.27e+04 5.24e+01 -1.0 1.20e+04 - 4.65e-05 1.04e-0
4h 1
3 8.2793681e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 7.78e-06 4.65e-0
4f 1
4 8.1812874e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 4.72e-04 6.51e-0
4h 1
5 5.1416787e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 1.31e-03 2.14e-0
2f 1
6 2.3712103e+04 5.76e-02 8.17e+01 -1.0 1.24e+04 - 4.46e-02 1.00e+0
0h 1
7 1.5677885e+04 5.41e-02 5.02e+01 -1.0 7.65e+01 - 3.78e-01 5.61e-0
2f 1
8 1.3650763e+04 3.52e-02 2.65e+01 -1.0 4.14e+01 - 4.77e-01 5.18e-0
1f 1
9 1.4089193e+04 1.92e-02 7.56e+00 -1.0 1.50e+01 - 5.80e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3798310e+04 5.10e-03 4.30e-01 -1.0 4.86e+00 - 9.60e-01 1.00e+0
0h 1
11 1.3451442e+04 1.37e-03 4.81e-01 -1.7 6.46e+00 - 1.00e+00 7.97e-0
1f 1
12 1.3404650e+04 8.15e-04 2.26e-02 -1.7 3.03e+01 - 1.00e+00 1.00e+0
0f 1
13 1.3260164e+04 1.47e-03 8.84e-02 -3.8 3.54e+01 - 7.71e-01 8.96e-0
1f 1
14 1.3232985e+04 2.03e-03 9.76e-02 -3.8 2.03e+00 - 8.27e-01 7.37e-0
1h 1
15 1.3233924e+04 3.36e-06 1.21e-03 -3.8 3.48e-02 - 1.00e+00 1.00e+0
0h 1
16 1.3233071e+04 2.28e-07 9.40e-04 -5.7 1.50e-01 - 1.00e+00 9.84e-0
1h 1
17 1.3233064e+04 2.81e-11 7.88e-09 -5.7 4.43e-02 - 1.00e+00 1.00e+0
0f 1
18 1.3233051e+04 6.30e-11 2.40e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.3233050903949836e+01 1.3233050903949836e+0
4
Dual infeasibility......: 2.3970823894504740e-09 2.3970823894504740e-0
6
Constraint violation....: 6.3005670125626523e-11 6.3005670125626523e-1
1
Complementarity.........: 2.8880833064512288e-09 2.8880833064512286e-0
6
Overall NLP error.......: 2.8880833064512288e-09 2.8880833064512286e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6220216e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 4.73e-04 9.80e-0
3h 1
2 8.5921653e+02 1.11e+04 5.24e+01 -1.0 9.81e+03 - 3.06e-05 1.12e-0
4h 1
3 7.2112506e+02 1.10e+04 5.24e+01 -1.0 1.11e+04 - 1.68e-05 8.26e-0
3h 1
4 5.7313115e+02 1.08e+04 5.22e+01 -1.0 1.10e+04 - 9.16e-03 2.04e-0
2h 1
5 1.9792923e+04 6.65e-02 8.02e+01 -1.0 1.08e+04 - 7.18e-02 1.00e+0
0h 1
6 1.4028484e+04 6.02e-02 2.73e+01 -1.0 5.88e+01 - 6.35e-01 8.68e-0
2f 1
7 1.2387782e+04 3.18e-02 5.16e+00 -1.0 3.65e+01 - 7.68e-01 5.01e-0
1f 1
8 1.2374005e+04 7.08e-03 5.53e-01 -1.0 8.51e+00 - 9.42e-01 1.00e+0
0f 1
9 1.2046897e+04 1.92e-03 9.85e-02 -1.7 5.25e+00 - 7.83e-01 7.39e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1946083e+04 2.78e-04 2.51e-01 -2.5 3.27e+00 - 9.06e-01 1.00e+0
0h 1
11 1.1923489e+04 1.91e-03 2.85e-02 -2.5 2.94e+00 - 1.00e+00 9.39e-0
1h 1
12 1.1927401e+04 6.87e-04 1.25e-03 -2.5 1.26e+00 - 1.00e+00 1.00e+0
0f 1
13 1.1905571e+04 1.52e-03 4.45e-02 -3.8 8.04e+00 - 7.81e-01 1.00e+0
0h 1
14 1.1901378e+04 4.28e-03 9.31e-04 -3.8 5.59e-02 - 1.00e+00 1.00e+0
0h 1
15 1.1901528e+04 1.10e-05 1.32e-04 -3.8 5.64e-03 - 1.00e+00 1.00e+0
0h 1
16 1.1900183e+04 5.40e-05 2.50e-03 -5.7 4.46e-01 - 9.62e-01 8.32e-0
1h 1
17 1.1899963e+04 9.37e-06 1.54e-03 -5.7 7.49e-02 - 1.00e+00 8.72e-0
1h 1
18 1.1899945e+04 8.76e-09 7.08e-06 -5.7 9.56e-03 - 1.00e+00 1.00e+0
0f 1
19 1.1899926e+04 1.13e-08 5.09e-05 -8.6 5.53e-03 - 1.00e+00 9.77e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.1899925e+04 3.68e-12 4.88e-10 -8.6 1.27e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.1899925324467199e+01 1.1899925324467200e+0
4
Dual infeasibility......: 4.8840055949491783e-10 4.8840055949491783e-0
7
Constraint violation....: 3.6758374122314308e-12 3.6758374122314308e-1
2
Complementarity.........: 3.1881669630786540e-09 3.1881669630786541e-0
6
Overall NLP error.......: 3.1881669630786540e-09 3.1881669630786541e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8776327e+02 9.19e+03 5.24e+01 -1.0 9.28e+03 - 6.64e-04 9.80e-0
3h 1
2 8.8487848e+02 9.19e+03 5.24e+01 -1.0 8.49e+03 - 4.35e-05 1.07e-0
4h 1
3 8.1017701e+02 9.15e+03 5.24e+01 -1.0 9.19e+03 - 1.14e-05 4.07e-0
3h 1
4 4.8829987e+02 8.96e+03 5.23e+01 -1.0 9.15e+03 - 4.62e-03 2.12e-0
2h 1
5 1.9624072e+04 6.67e-02 7.88e+01 -1.0 8.96e+03 - 7.36e-02 1.00e+0
0h 1
6 1.2613352e+04 6.06e-02 4.34e+01 -1.0 5.13e+01 - 4.30e-01 8.42e-0
2f 1
7 1.1287964e+04 2.91e-02 1.67e+01 -1.0 2.55e+01 - 6.00e-01 4.84e-0
1f 1
8 1.0844638e+04 5.12e-03 9.75e-01 -1.0 9.16e+00 - 9.34e-01 7.59e-0
1f 1
9 1.1096445e+04 1.87e-04 6.07e-02 -1.0 4.66e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.0465431e+04 2.23e-03 8.01e-02 -2.5 4.76e+00 - 8.70e-01 8.69e-0
1f 1
11 1.0359674e+04 1.08e-03 4.55e-01 -2.5 7.61e-01 - 1.00e+00 6.04e-0
1f 1
12 1.0359707e+04 2.49e-06 8.14e-03 -2.5 1.53e-01 - 1.00e+00 1.00e+0
0h 1
13 1.0339422e+04 6.17e-06 2.39e-02 -3.8 5.36e+00 - 9.14e-01 8.89e-0
1f 1
14 1.0335906e+04 4.60e-04 4.72e-04 -3.8 5.91e-01 - 1.00e+00 1.00e+0
0f 1
15 1.0334764e+04 6.26e-05 1.12e-02 -5.7 2.97e-01 - 8.14e-01 1.00e+0
0h 1
16 1.0334651e+04 3.51e-05 3.92e-05 -5.7 9.55e-03 - 1.00e+00 1.00e+0
0h 1
17 1.0334652e+04 1.18e-06 1.11e-05 -5.7 1.44e-03 - 1.00e+00 9.97e-0
1h 1
18 1.0334638e+04 2.43e-09 9.98e-08 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
19 1.0334638e+04 3.47e-15 3.66e-14 -8.6 3.44e-07 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.0334637937416408e+01 1.0334637937416408e+0
4
Dual infeasibility......: 3.6596737665925040e-14 3.6596737665925040e-1
1
Constraint violation....: 3.4735127630399940e-15 3.4735127630399940e-1
5
Complementarity.........: 2.5509114136901351e-09 2.5509114136901351e-0
6
Overall NLP error.......: 2.5509114136901351e-09 2.5509114136901351e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3710605e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 3.06e-03 9.80e-0
3h 1
2 9.3410771e+02 6.71e+03 5.23e+01 -1.0 6.33e+03 - 5.53e-05 1.05e-0
4h 1
3 8.7601628e+02 6.69e+03 5.23e+01 -1.0 6.70e+03 - 8.90e-06 2.62e-0
3f 1
4 4.4078555e+02 6.54e+03 5.23e+01 -1.0 6.69e+03 - 3.32e-03 2.17e-0
2h 1
5 1.7952487e+04 7.75e-02 7.79e+01 -1.0 6.54e+03 - 7.84e-02 1.00e+0
0h 1
6 1.1162158e+04 7.00e-02 2.30e+01 -1.0 4.32e+00 - 6.80e-01 8.97e-0
2f 1
7 1.0161093e+04 3.32e-02 7.43e+00 -1.0 4.23e+00 - 7.42e-01 1.00e+0
0f 1
8 1.0283900e+04 1.70e-02 7.27e-01 -1.0 1.10e+00 - 9.96e-01 4.94e-0
1f 2
9 1.0000013e+04 8.27e-03 3.35e-01 -1.7 1.28e+01 - 1.00e+00 8.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.9361941e+03 1.02e-03 1.04e-01 -1.7 8.95e+00 - 1.00e+00 1.00e+0
0f 1
11 9.8169976e+03 2.77e-04 1.12e-01 -2.5 1.73e+01 - 9.89e-01 8.85e-0
1f 1
12 9.8069007e+03 4.94e-06 1.10e-03 -2.5 1.95e+00 - 1.00e+00 1.00e+0
0f 1
13 9.7851225e+03 5.56e-06 7.61e-04 -3.8 2.68e+00 - 1.00e+00 1.00e+0
0f 1
14 9.7842068e+03 3.44e-09 3.52e-06 -5.7 1.48e-01 - 1.00e+00 1.00e+0
0h 1
15 9.7841926e+03 2.34e-12 4.09e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 9.7841925657888140e+00 9.7841925657888132e+0
3
Dual infeasibility......: 4.0868829585060277e-10 4.0868829585060277e-0
7
Constraint violation....: 2.3424595596566178e-12 2.3424595596566178e-1
2
Complementarity.........: 2.5729802584926526e-09 2.5729802584926525e-0
6
Overall NLP error.......: 2.5729802584926526e-09 2.5729802584926525e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0885267e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0522538e+02 4.77e+03 5.23e+01 -1.0 3.40e+03 - 2.93e-05 1.39e-0
4h 1
3 3.7446895e+02 4.66e+03 5.24e+01 -1.0 4.77e+03 - 4.82e-05 2.34e-0
2f 1
4 1.7343624e+04 6.51e-02 8.03e+01 -1.0 4.66e+03 - 3.33e-02 1.00e+0
0h 1
5 8.8835455e+03 6.19e-02 6.15e+01 -1.0 3.76e+01 - 2.33e-01 4.52e-0
2f 1
6 7.5996542e+03 2.03e-02 2.88e+01 -1.0 1.63e+01 - 5.42e-01 6.20e-0
1f 1
7 7.1823993e+03 5.79e-03 8.85e-01 -1.0 5.30e+00 - 9.57e-01 7.82e-0
1f 1
8 7.4476291e+03 1.69e-04 6.59e-02 -1.0 5.07e+00 - 1.00e+00 1.00e+0
0f 1
9 6.8807542e+03 2.12e-03 8.08e-02 -2.5 3.15e+00 - 8.55e-01 8.48e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.7194703e+03 2.16e-03 4.17e-01 -2.5 9.54e-01 - 1.00e+00 7.62e-0
1f 1
11 6.6937548e+03 1.24e-04 4.69e-03 -2.5 2.10e-01 - 1.00e+00 1.00e+0
0h 1
12 6.6728221e+03 3.31e-05 1.45e-01 -3.8 8.04e+00 - 1.00e+00 7.62e-0
1h 1
13 6.6674261e+03 1.25e-07 3.38e-04 -3.8 1.91e+00 - 1.00e+00 1.00e+0
0f 1
14 6.6659052e+03 2.85e-08 9.91e-04 -5.7 4.46e-01 - 1.00e+00 9.85e-0
1h 1
15 6.6658878e+03 1.92e-12 1.39e-08 -5.7 6.69e-03 - 1.00e+00 1.00e+0
0f 1
16 6.6658693e+03 2.63e-12 4.48e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.6658693270133211e+00 6.6658693270133208e+0
3
Dual infeasibility......: 4.4776952658796196e-09 4.4776952658796196e-0
6
Constraint violation....: 2.6307983569395788e-12 2.6307983569395788e-1
2
Complementarity.........: 3.6084978097939949e-09 3.6084978097939950e-0
6
Overall NLP error.......: 4.4776952658796196e-09 4.4776952658796196e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2298268e+02 3.24e+03 5.23e+01 -1.0 3.27e+03 - 1.51e-03 9.81e-0
3h 1
2 9.2003557e+02 3.24e+03 5.23e+01 -1.0 2.98e+03 - 7.92e-05 1.08e-0
4h 1
3 8.2924045e+02 3.23e+03 5.23e+01 -1.0 3.24e+03 - 1.50e-05 3.73e-0
3f 1
4 3.5764794e+02 3.16e+03 5.22e+01 -1.0 3.23e+03 - 5.83e-03 2.18e-0
2h 1
5 1.3704663e+04 7.54e-02 7.77e+01 -1.0 3.16e+03 - 8.28e-02 1.00e+0
0h 1
6 7.3446410e+03 6.78e-02 2.26e+01 -1.0 1.31e+01 - 6.82e-01 9.46e-0
2f 1
7 6.0810712e+03 2.03e-02 7.24e+00 -1.0 9.63e+00 - 7.16e-01 8.72e-0
1f 1
8 6.2085934e+03 1.09e-02 6.05e-01 -1.0 2.64e+00 - 9.96e-01 4.67e-0
1f 2
9 5.9253757e+03 1.11e-02 2.98e-01 -1.7 1.18e+01 - 1.00e+00 8.14e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8752347e+03 1.11e-03 1.28e-01 -1.7 1.00e+01 - 1.00e+00 9.65e-0
1h 1
11 5.7570006e+03 4.14e-04 1.11e-01 -2.5 1.70e+01 - 9.54e-01 8.70e-0
1h 1
12 5.7430581e+03 1.61e-05 3.35e-03 -2.5 2.14e+00 - 1.00e+00 1.00e+0
0f 1
13 5.7235010e+03 5.14e-06 3.47e-02 -3.8 2.68e+00 - 1.00e+00 9.15e-0
1f 1
14 5.7222072e+03 1.38e-08 1.87e-05 -3.8 2.27e-01 - 1.00e+00 1.00e+0
0f 1
15 5.7210130e+03 1.79e-08 5.07e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0f 1
16 5.7210000e+03 6.40e-13 4.11e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 5.7210000287776710e+00 5.7210000287776711e+0
3
Dual infeasibility......: 4.1054922785956023e-10 4.1054922785956023e-0
7
Constraint violation....: 6.3965499563778394e-13 6.3965499563778394e-1
3
Complementarity.........: 2.5983435457863236e-09 2.5983435457863236e-0
6
Overall NLP error.......: 2.5983435457863236e-09 2.5983435457863236e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8064252e+02 2.00e+03 5.24e+01 -1.0 2.02e+03 - 5.97e-04 9.81e-0
3f 1
2 8.7760033e+02 2.00e+03 5.24e+01 -1.0 1.79e+03 - 9.81e-05 1.11e-0
4h 1
3 7.4188986e+02 1.99e+03 5.24e+01 -1.0 2.00e+03 - 2.20e-05 5.30e-0
3f 1
4 3.0853037e+02 1.94e+03 5.19e+01 -1.0 1.99e+03 - 1.13e-02 2.08e-0
2f 1
5 1.0454262e+04 7.18e-02 7.81e+01 -1.0 1.94e+03 - 1.01e-01 1.00e+0
0h 1
6 4.9583655e+03 6.28e-02 2.13e+01 -1.0 4.92e+01 - 7.01e-01 1.16e-0
1f 1
7 3.4679380e+03 2.85e-02 2.35e+00 -1.0 2.41e+01 - 9.37e-01 6.11e-0
1f 1
8 3.5502765e+03 4.69e-03 1.40e-01 -1.0 3.47e+00 - 1.00e+00 1.00e+0
0f 1
9 3.0919875e+03 1.73e-03 2.74e-01 -2.5 3.67e+00 - 8.96e-01 7.84e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.0656701e+03 1.76e-05 1.17e-02 -2.5 4.34e-01 - 1.00e+00 1.00e+0
0h 1
11 3.0443579e+03 3.86e-04 9.45e-02 -3.8 2.69e+00 - 7.24e-01 9.81e-0
1f 1
12 3.0404046e+03 2.37e-03 5.59e-03 -3.8 4.63e-02 - 8.29e-01 1.00e+0
0h 1
13 3.0405027e+03 1.41e-04 1.23e-04 -3.8 1.70e-02 - 1.00e+00 1.00e+0
0h 1
14 3.0392764e+03 1.55e-04 1.25e-03 -5.7 1.49e-01 - 9.12e-01 1.00e+0
0h 1
15 3.0392276e+03 4.25e-05 1.02e-05 -5.7 9.60e-03 - 1.00e+00 1.00e+0
0h 1
16 3.0392312e+03 9.25e-07 6.70e-06 -5.7 1.39e-03 - 1.00e+00 1.00e+0
0h 1
17 3.0392191e+03 6.89e-08 7.06e-05 -8.6 1.84e-03 - 1.00e+00 9.41e-0
1h 1
18 3.0392184e+03 8.32e-12 9.00e-11 -8.6 1.08e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 3.0392183892498714e+00 3.0392183892498715e+0
3
Dual infeasibility......: 8.9990918931353352e-11 8.9990918931353352e-0
8
Constraint violation....: 8.3232309933123361e-12 8.3232309933123361e-1
2
Complementarity.........: 2.5077806590790467e-09 2.5077806590790466e-0
6
Overall NLP error.......: 2.5077806590790467e-09 2.5077806590790466e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 40
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 20
inequality constraints with only lower bounds: 11
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6492449e+02 9.17e+02 5.24e+01 -1.0 9.19e+02 - 4.97e-04 9.89e-0
3h 1
2 8.3429719e+02 9.16e+02 5.24e+01 -1.0 8.37e+02 - 1.07e-04 1.13e-0
3h 1
3 2.6334808e+02 8.96e+02 5.25e+01 -1.0 9.16e+02 - 1.12e-03 2.18e-0
2h 1
4 1.2547951e+04 6.03e-02 8.25e+01 -1.0 8.97e+02 - 2.44e-02 1.00e+0
0h 1
5 4.4093479e+03 5.78e-02 6.61e+01 -1.0 6.99e+01 - 2.02e-01 3.77e-0
2f 1
6 2.4528855e+03 3.38e-02 3.55e+01 -1.0 3.12e+01 - 4.78e-01 6.14e-0
1f 1
7 2.2633860e+03 7.17e-03 2.37e+00 -1.0 7.75e+00 - 9.39e-01 1.00e+0
0f 1
8 2.2579762e+03 6.84e-04 6.47e-02 -1.0 4.83e+00 - 9.90e-01 1.00e+0
0f 1
9 1.8759715e+03 3.59e-04 8.62e-01 -2.5 6.78e+00 - 9.16e-01 6.01e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8129050e+03 1.58e-04 1.77e-01 -2.5 1.10e+01 - 9.39e-01 1.00e+0
0f 1
11 1.7920305e+03 3.86e-03 2.47e-02 -2.5 1.62e+00 - 1.00e+00 1.00e+0
0h 1
12 1.7615717e+03 7.09e-04 3.62e-02 -3.8 1.94e+01 - 7.98e-01 1.00e+0
0h 1
13 1.7592136e+03 1.82e-03 1.04e-03 -3.8 3.17e-01 - 9.82e-01 1.00e+0
0h 1
14 1.7594076e+03 5.04e-05 1.43e-04 -3.8 1.26e-02 - 1.00e+00 1.00e+0
0h 1
15 1.7572306e+03 1.02e-04 3.47e-04 -5.7 1.04e+00 - 9.50e-01 9.75e-0
1h 1
16 1.7572007e+03 2.35e-05 3.87e-03 -5.7 2.47e-02 - 1.00e+00 7.71e-0
1h 1
17 1.7571989e+03 9.13e-09 1.29e-06 -5.7 5.67e-03 - 1.00e+00 1.00e+0
0f 1
18 1.7571733e+03 9.09e-09 1.93e-05 -8.6 1.29e-02 - 1.00e+00 9.83e-0
1h 1
19 1.7571729e+03 1.37e-12 6.57e-11 -8.6 2.14e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.7571729246215195e+00 1.7571729246215195e+0
3
Dual infeasibility......: 6.5678669862222517e-11 6.5678669862222517e-0
8
Constraint violation....: 1.3721246361342310e-12 1.3721246361342310e-1
2
Complementarity.........: 2.5797855003867790e-09 2.5797855003867787e-0
6
Overall NLP error.......: 2.5797855003867790e-09 2.5797855003867787e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101532e-01 6.4890146112101536e+0
2
Dual infeasibility......: 4.9126605618476707e-09 4.9126605618476707e-0
6
Constraint violation....: 6.2123811650494076e-09 6.2123811650494076e-0
9
Complementarity.........: 4.3646094984857658e-09 4.3646094984857658e-0
6
Overall NLP error.......: 6.2123811650494076e-09 4.9126605618476707e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318724481455e-09 2.1031318724481455e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896894379e-09 2.8882108896894380e-0
6
Overall NLP error.......: 2.8882108896894379e-09 2.8882108896894380e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101532e-01 6.4890146112101536e+0
2
Dual infeasibility......: 4.9126605618476707e-09 4.9126605618476707e-0
6
Constraint violation....: 6.2123811650494076e-09 6.2123811650494076e-0
9
Complementarity.........: 4.3646094984857658e-09 4.3646094984857658e-0
6
Overall NLP error.......: 6.2123811650494076e-09 4.9126605618476707e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.07e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.57e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235660175e+00 1.6104063235660176e+0
3
Dual infeasibility......: 2.4573593460192575e-12 2.4573593460192575e-0
9
Constraint violation....: 7.5703172614159067e-16 7.5703172614159067e-1
6
Complementarity.........: 2.5062163919681781e-09 2.5062163919681782e-0
6
Overall NLP error.......: 2.5062163919681781e-09 2.5062163919681782e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2355451e+02 9.17e+02 5.24e+01 -1.0 9.24e+02 - 3.31e-04 9.84e-0
3f 1
2 8.1662500e+02 9.17e+02 5.24e+01 -1.0 5.55e+02 - 7.26e-05 2.50e-0
4h 1
3 2.4196991e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 1.96e-04 2.12e-0
2f 1
4 1.2636833e+04 5.48e-02 8.23e+01 -1.0 8.98e+02 - 3.79e-02 1.00e+0
0h 1
5 3.9066543e+03 5.23e-02 5.77e+01 -1.0 8.26e+01 - 2.96e-01 4.93e-0
2f 1
6 1.9129688e+03 3.74e-02 3.11e+01 -1.0 3.92e+01 - 4.66e-01 5.08e-0
1f 1
7 4.7067283e+03 1.23e-02 2.76e+01 -1.0 2.08e+01 - 3.97e-01 1.00e+0
0h 1
8 1.8774461e+03 1.23e-02 1.09e+00 -1.0 2.59e+01 - 9.87e-01 8.86e-0
1f 1
9 1.9927655e+03 2.09e-04 4.90e-02 -1.0 2.51e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7260747e+03 2.23e-04 1.23e+00 -2.5 1.90e+01 - 9.37e-01 5.95e-0
1f 1
11 1.5380610e+03 3.77e-03 1.32e-01 -2.5 7.57e+00 - 7.96e-01 1.00e+0
0f 1
12 1.5153061e+03 4.98e-03 3.07e-01 -2.5 1.80e+00 - 1.00e+00 7.69e-0
1h 1
13 1.5275650e+03 2.35e-04 4.67e-03 -2.5 7.22e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5024753e+03 1.70e-04 2.15e-02 -3.8 8.08e+00 - 9.90e-01 9.29e-0
1h 1
15 1.5016701e+03 7.28e-07 6.85e-05 -3.8 5.51e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003100e+03 3.77e-07 1.78e-04 -5.7 4.46e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003099e+03 3.79e-11 2.92e-09 -5.7 4.21e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932720251907e+00 1.5002932720251906e+0
3
Dual infeasibility......: 2.1737235191691825e-09 2.1737235191691825e-0
6
Constraint violation....: 6.2995539340526818e-11 6.2995539340526818e-1
1
Complementarity.........: 2.9340826111776596e-09 2.9340826111776598e-0
6
Overall NLP error.......: 2.9340826111776596e-09 2.9340826111776598e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6598311e+02 9.17e+02 5.24e+01 -1.0 9.24e+02 - 4.97e-04 9.84e-0
3h 1
2 8.5884059e+02 9.17e+02 5.24e+01 -1.0 5.71e+02 - 7.06e-05 2.62e-0
4h 1
3 2.6203260e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 2.08e-04 2.23e-0
2f 1
4 1.3003571e+04 5.93e-02 8.01e+01 -1.0 8.97e+02 - 4.95e-02 1.00e+0
0h 1
5 4.3038712e+03 5.54e-02 5.41e+01 -1.0 7.44e+01 - 3.14e-01 5.91e-0
2f 1
16 1.423631e+04 1.632511e+04 2.505456e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1155551e+02 1.57e+04 5.50e+01 -1.0 1.59e+04 - 1.75e-04 9.80e-0
3f 1
2 7.0865065e+02 1.57e+04 5.50e+01 -1.0 1.45e+04 - 3.33e-05 1.07e-0
4h 1
3 7.0345127e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 1.08e-05 4.19e-0
4h 1
4 6.8469128e+02 1.57e+04 5.49e+01 -1.0 1.57e+04 - 4.26e-04 1.59e-0
3h 1
5 5.1313580e+02 1.54e+04 5.39e+01 -1.0 1.57e+04 - 2.16e-03 1.90e-0
2f 1
6 2.5462656e+04 7.60e-02 8.67e+01 -1.0 1.54e+04 - 2.64e-02 1.00e+0
0h 1
7 1.7880418e+04 7.30e-02 6.95e+01 -1.0 6.56e+01 - 2.07e-01 4.18e-0
2f 1
8 1.6632334e+04 4.69e-02 3.18e+01 -1.0 2.02e+01 - 5.36e-01 3.78e-0
1f 1
9 1.7127435e+04 3.50e-02 1.92e+01 -1.0 1.33e+01 - 5.65e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6801704e+04 7.21e-03 2.12e+00 -1.0 1.95e+00 - 8.44e-01 1.00e+0
0h 1
11 1.6815920e+04 2.09e-04 1.78e+00 -1.0 3.45e+00 - 3.01e-01 1.00e+0
0f 1
12 1.6823432e+04 6.06e-06 7.02e-01 -1.0 2.96e+00 - 6.26e-01 1.00e+0
0f 1
13 1.6526577e+04 2.28e-04 3.41e-01 -1.7 4.74e+00 - 8.94e-01 8.04e-0
1f 1
14 1.6480059e+04 6.01e-04 2.57e-01 -1.7 1.00e+01 - 6.31e-01 1.00e+0
0f 1
15 1.6484519e+04 5.37e-05 3.67e-02 -1.7 1.43e+01 - 8.39e-01 1.00e+0
0h 1
16 1.6365306e+04 9.63e-04 4.39e-02 -2.5 2.36e+01 - 9.29e-01 1.00e+0
0f 1
17 1.6345107e+04 1.05e-03 1.12e-02 -2.5 1.56e+00 - 1.00e+00 1.00e+0
0h 1
18 1.6327891e+04 1.76e-04 8.10e-02 -3.8 5.61e+00 - 1.00e+00 8.58e-0
1h 1
19 1.6326333e+04 5.90e-07 9.62e-05 -3.8 6.69e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325117e+04 4.00e-07 1.04e-04 -5.7 2.97e-01 - 1.00e+00 9.98e-0
1h 1
21 1.6325119e+04 3.81e-11 3.00e-09 -5.7 7.14e-03 - 1.00e+00 1.00e+0
0f 1
22 1.6325107e+04 4.75e-11 7.40e-05 -8.6 3.58e-03 - 1.00e+00 8.79e-0
1h 1
23 1.6325105e+04 9.20e-13 3.00e-11 -8.6 1.99e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 23
(scaled) (unscaled)
Objective...............: 1.6325105198559118e+01 1.6325105198559118e+0
4
Dual infeasibility......: 2.9992942626576050e-11 2.9992942626576050e-0
8
Constraint violation....: 9.2009733165809848e-13 9.2009733165809848e-1
3
Complementarity.........: 3.7838000838159327e-09 3.7838000838159325e-0
6
Overall NLP error.......: 3.7838000838159327e-09 3.7838000838159325e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 24
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 24
Number of inequality constraint Jacobian evaluations = 24
Number of Lagrangian Hessian evaluations = 23
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9875302e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.75e-04 9.80e-0
3h 1
2 7.9573362e+02 1.50e+04 5.25e+01 -1.0 1.30e+04 - 2.48e-05 1.14e-0
4h 1
3 7.9441039e+02 1.50e+04 5.25e+01 -1.0 1.48e+04 - 1.88e-05 9.83e-0
5h 1
4 7.9200355e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 1.15e-04 1.82e-0
4h 1
5 5.2516684e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 3.03e-04 2.06e-0
2f 1
6 2.6386534e+04 5.38e-02 8.35e+01 -1.0 1.47e+04 - 3.31e-02 1.00e+0
0h 1
7 1.7750238e+04 5.16e-02 6.32e+01 -1.0 8.19e+01 - 2.45e-01 4.55e-0
2f 1
8 1.5954429e+04 4.21e-02 3.28e+01 -1.0 3.42e+01 - 4.81e-01 4.73e-0
1f 1
9 1.6278974e+04 2.57e-02 1.47e+01 -1.0 1.85e+01 - 4.24e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6017622e+04 6.14e-03 1.87e-01 -1.0 5.25e+00 - 9.90e-01 1.00e+0
0h 1
11 1.5734205e+04 1.24e-03 2.90e-01 -1.7 4.59e+00 - 1.00e+00 8.64e-0
1f 1
12 1.5733935e+04 7.86e-04 1.13e-02 -1.7 4.13e+01 - 1.00e+00 1.00e+0
0f 1
13 1.5583995e+04 1.32e-03 8.19e-02 -3.8 4.86e+01 - 7.98e-01 9.19e-0
1f 1
14 1.5559832e+04 1.50e-03 6.28e-01 -3.8 1.75e+00 - 6.58e-02 7.74e-0
1h 1
15 1.5560173e+04 5.13e-05 1.54e-02 -3.8 6.13e-02 - 1.00e+00 9.82e-0
1h 1
16 1.5560411e+04 3.36e-07 4.84e-06 -3.8 2.63e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5559217e+04 4.12e-07 1.99e-04 -5.7 2.98e-01 - 1.00e+00 9.96e-0
1h 1
18 1.5559217e+04 4.19e-11 3.43e-09 -5.7 9.70e-04 - 1.00e+00 1.00e+0
0f 1
19 1.5559202e+04 6.30e-11 2.10e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.5559202124467086e+01 1.5559202124467087e+0
4
Dual infeasibility......: 2.0961912407528089e-09 2.0961912407528089e-0
6
Constraint violation....: 6.2993874005989881e-11 6.2993874005989881e-1
1
Complementarity.........: 2.8882025834973344e-09 2.8882025834973344e-0
6
Overall NLP error.......: 2.8882025834973344e-09 2.8882025834973344e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8639132e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 6.50e-04 9.80e-0
3h 1
2 8.8349734e+02 1.39e+04 5.24e+01 -1.0 1.24e+04 - 2.78e-05 1.11e-0
4h 1
3 8.7990140e+02 1.39e+04 5.24e+01 -1.0 1.38e+04 - 1.44e-05 2.62e-0
4h 1
4 8.7766307e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 2.75e-04 1.65e-0
4h 1
5 5.7394978e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 4.59e-04 2.28e-0
2f 1
6 2.5929973e+04 6.24e-02 7.88e+01 -1.0 1.36e+04 - 6.03e-02 1.00e+0
0h 1
7 1.7493443e+04 5.77e-02 5.15e+01 -1.0 5.91e+01 - 3.32e-01 6.90e-0
2f 1
8 1.6183321e+04 3.02e-02 2.42e+01 -1.0 2.86e+01 - 5.18e-01 4.38e-0
1f 1
9 1.5480984e+04 1.03e-02 1.50e+00 -1.0 1.06e+01 - 9.23e-01 8.21e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5814319e+04 2.35e-04 1.16e-01 -1.0 3.99e+00 - 9.52e-01 1.00e+0
0f 1
11 1.5108885e+04 2.12e-03 1.03e-01 -2.5 5.66e+00 - 8.70e-01 9.02e-0
1f 1
12 1.5048115e+04 1.04e-03 1.14e+00 -2.5 6.58e-01 - 1.00e+00 4.76e-0
1h 1
13 1.5044374e+04 4.60e-06 8.91e-03 -2.5 3.18e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5026913e+04 2.94e-05 6.44e-02 -3.8 3.42e+00 - 8.42e-01 9.26e-0
1f 1
15 1.5024168e+04 6.17e-04 1.06e-03 -3.8 1.03e-01 - 1.00e+00 1.00e+0
0f 1
16 1.5023068e+04 1.21e-04 7.65e-03 -5.7 1.54e-01 - 8.17e-01 1.00e+0
0h 1
17 1.5022968e+04 5.13e-05 2.36e-05 -5.7 1.12e-02 - 1.00e+00 1.00e+0
0h 1
18 1.5022966e+04 5.83e-06 8.74e-05 -5.7 2.74e-03 - 1.00e+00 9.65e-0
1h 1
19 1.5022970e+04 5.34e-08 8.59e-07 -5.7 3.55e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5022955e+04 5.60e-08 4.09e-06 -8.6 1.84e-03 - 9.98e-01 9.85e-0
1h 1
21 1.5022955e+04 2.36e-13 2.61e-11 -8.6 2.70e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.5022954660216765e+01 1.5022954660216765e+0
4
Dual infeasibility......: 2.6054721765511410e-11 2.6054721765511410e-0
8
Constraint violation....: 2.3622770406461768e-13 2.3622770406461768e-1
3
Complementarity.........: 2.5095709527312800e-09 2.5095709527312801e-0
6
Overall NLP error.......: 2.5095709527312800e-09 2.5095709527312801e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1596733e+02 1.27e+04 5.23e+01 -1.0 1.28e+04 - 1.20e-03 9.80e-0
3h 1
2 9.1299511e+02 1.27e+04 5.23e+01 -1.0 1.08e+04 - 2.19e-05 1.16e-0
4h 1
3 9.0966910e+02 1.26e+04 5.23e+01 -1.0 1.26e+04 - 2.00e-05 2.24e-0
4h 1
4 9.0745073e+02 1.26e+04 5.23e+01 -1.0 1.26e+04 - 2.42e-04 1.51e-0
4h 1
5 5.6728500e+02 1.23e+04 5.24e+01 -1.0 1.26e+04 - 4.11e-04 2.34e-0
2f 1
6 2.4996785e+04 6.73e-02 7.64e+01 -1.0 1.23e+04 - 8.12e-02 1.00e+0
0h 1
7 1.6752690e+04 6.08e-02 3.16e+01 -1.0 2.06e+01 - 5.55e-01 8.81e-0
2f 1
8 1.5224612e+04 1.65e-02 1.37e+01 -1.0 1.27e+01 - 6.26e-01 8.70e-0
1f 1
9 1.5387313e+04 8.62e-03 6.87e-01 -1.0 3.81e+00 - 9.87e-01 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5054343e+04 7.95e-03 2.45e-01 -1.7 3.28e+00 - 1.00e+00 8.48e-0
1f 1
11 1.5010297e+04 1.27e-03 1.03e-01 -1.7 3.10e+01 - 1.00e+00 1.00e+0
0f 1
12 1.4866893e+04 4.22e-04 1.08e-01 -2.5 3.80e+01 - 9.68e-01 8.77e-0
1f 1
13 1.4857173e+04 2.29e-05 3.38e-03 -2.5 2.80e+00 - 1.00e+00 1.00e+0
0f 1
14 1.4838255e+04 8.67e-06 1.03e-01 -3.8 3.51e+00 - 1.00e+00 8.22e-0
1f 1
15 1.4835311e+04 5.17e-08 7.19e-05 -3.8 3.96e-01 - 1.00e+00 1.00e+0
0f 1
16 1.4834112e+04 1.99e-08 1.57e-04 -5.7 1.48e-01 - 1.00e+00 9.96e-0
1f 1
17 1.4834111e+04 1.81e-12 2.22e-09 -5.7 1.04e-04 - 1.00e+00 1.00e+0
0f 1
18 1.4834096e+04 2.63e-12 1.52e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.4834096273729246e+01 1.4834096273729247e+0
4
Dual infeasibility......: 1.5189618318490009e-09 1.5189618318490009e-0
6
Constraint violation....: 2.6290011834184668e-12 2.6290011834184668e-1
2
Complementarity.........: 2.8635056587050991e-09 2.8635056587050992e-0
6
Overall NLP error.......: 2.8635056587050991e-09 2.8635056587050992e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6661550e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 4.97e-04 9.80e-0
3h 1
2 8.6363291e+02 1.11e+04 5.24e+01 -1.0 9.79e+03 - 3.03e-05 1.12e-0
4h 1
3 7.2333567e+02 1.10e+04 5.24e+01 -1.0 1.11e+04 - 1.69e-05 8.42e-0
3h 1
4 5.7808673e+02 1.08e+04 5.22e+01 -1.0 1.10e+04 - 9.34e-03 2.05e-0
2h 1
5 1.9796510e+04 6.72e-02 7.99e+01 -1.0 1.08e+04 - 7.46e-02 1.00e+0
0h 1
6 1.4065448e+04 6.07e-02 2.67e+01 -1.0 5.76e+01 - 6.41e-01 8.95e-0
2f 1
7 1.2504239e+04 3.06e-02 3.42e+00 -1.0 3.47e+01 - 8.19e-01 4.95e-0
1f 1
8 1.2326032e+04 8.78e-03 4.28e-01 -1.0 9.08e+00 - 9.42e-01 1.00e+0
0f 1
9 1.2079566e+04 2.22e-03 3.43e-01 -1.7 3.96e+00 - 6.64e-01 7.47e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2079708e+04 1.73e-04 1.05e+00 -1.7 9.87e+00 - 4.63e-01 1.00e+0
0f 1
11 1.2080022e+04 4.71e-05 1.79e-01 -1.7 1.31e+01 - 7.98e-01 1.00e+0
0f 1
12 1.2000568e+04 5.85e-05 4.27e-02 -2.5 1.26e+01 - 1.00e+00 9.62e-0
1f 1
13 1.1987947e+04 2.32e-03 1.66e-03 -2.5 6.80e+00 - 1.00e+00 1.00e+0
0f 1
14 1.1967324e+04 9.27e-04 2.97e-02 -3.8 8.04e+00 - 8.18e-01 1.00e+0
0h 1
15 1.1963782e+04 3.03e-03 1.09e-03 -3.8 4.60e-02 - 1.00e+00 1.00e+0
0h 1
16 1.1964208e+04 4.20e-05 1.23e-04 -3.8 1.37e-02 - 1.00e+00 1.00e+0
0h 1
17 1.1962608e+04 1.01e-04 3.76e-04 -5.7 4.46e-01 - 9.51e-01 9.78e-0
1h 1
18 1.1962593e+04 2.18e-05 3.73e-03 -5.7 9.59e-03 - 1.00e+00 7.86e-0
1h 1
19 1.1962595e+04 8.52e-09 1.17e-06 -5.7 2.06e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.1962577e+04 8.99e-09 1.93e-05 -8.6 5.53e-03 - 1.00e+00 9.83e-0
1h 1
21 1.1962576e+04 1.37e-12 6.48e-11 -8.6 9.18e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.1962576481670661e+01 1.1962576481670661e+0
4
Dual infeasibility......: 6.4815027162138716e-11 6.4815027162138710e-0
8
Constraint violation....: 1.3741230375785563e-12 1.3741230375785563e-1
2
Complementarity.........: 3.0615462878392792e-09 3.0615462878392793e-0
6
Overall NLP error.......: 3.0615462878392792e-09 3.0615462878392793e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891076e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0602418e+02 9.19e+03 5.23e+01 -1.0 8.41e+03 - 3.92e-05 1.08e-0
4h 1
3 8.1828316e+02 9.14e+03 5.24e+01 -1.0 9.19e+03 - 1.24e-05 4.81e-0
3h 1
4 5.0911016e+02 8.95e+03 5.22e+01 -1.0 9.14e+03 - 5.53e-03 2.13e-0
2h 1
5 1.9574028e+04 7.15e-02 7.74e+01 -1.0 8.95e+03 - 8.67e-02 1.00e+0
0h 1
6 1.2972291e+04 6.39e-02 3.14e+01 -1.0 2.60e+01 - 5.69e-01 9.74e-0
2f 1
7 1.1456842e+04 1.98e-02 1.02e+01 -1.0 1.50e+01 - 6.92e-01 7.89e-0
1f 1
8 1.1617387e+04 7.35e-03 8.73e-01 -1.0 3.38e+00 - 9.92e-01 5.00e-0
1f 2
9 1.1302507e+04 1.11e-02 3.88e-01 -1.7 1.04e+01 - 6.07e-01 8.28e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1277358e+04 8.18e-04 7.36e-01 -1.7 1.48e+01 - 6.35e-01 1.00e+0
0f 1
11 1.1288846e+04 6.89e-05 3.72e-03 -1.7 1.16e+01 - 1.00e+00 1.00e+0
0h 1
12 1.1113971e+04 5.62e-04 2.52e-02 -3.8 3.52e+01 - 8.37e-01 8.36e-0
1f 1
13 1.1087199e+04 1.46e-04 7.90e-02 -3.8 5.73e+00 - 9.91e-01 8.37e-0
1h 1
14 1.1084767e+04 1.86e-07 9.94e-02 -3.8 9.33e-01 - 9.21e-01 1.00e+0
0h 1
15 1.1084687e+04 4.63e-09 2.91e-05 -3.8 1.57e-04 - 1.00e+00 1.00e+0
0h 1
16 1.1083373e+04 1.92e-08 3.89e-03 -5.7 2.97e-01 - 1.00e+00 9.68e-0
1f 1
17 1.1083337e+04 5.76e-12 2.63e-08 -5.7 9.61e-03 - 1.00e+00 1.00e+0
0f 1
18 1.1083321e+04 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1083320725060162e+01 1.1083320725060161e+0
4
Dual infeasibility......: 4.4780433403037378e-09 4.4780433403037378e-0
6
Constraint violation....: 2.6337959591060667e-12 2.6337959591060667e-1
2
Complementarity.........: 3.6085483782813947e-09 3.6085483782813947e-0
6
Overall NLP error.......: 4.4780433403037378e-09 4.4780433403037378e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2300862e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.80e-0
3h 1
2 9.2018520e+02 6.71e+03 5.23e+01 -1.0 6.43e+03 - 7.59e-05 1.03e-0
4h 1
3 8.8417722e+02 6.69e+03 5.23e+01 -1.0 6.70e+03 - 7.25e-06 1.73e-0
3f 1
4 4.3415243e+02 6.54e+03 5.24e+01 -1.0 6.69e+03 - 2.08e-03 2.26e-0
2h 1
5 1.8486104e+04 7.08e-02 7.69e+01 -1.0 6.54e+03 - 8.04e-02 1.00e+0
0h 1
6 1.0916142e+04 6.40e-02 2.32e+01 -1.0 1.36e+01 - 6.65e-01 8.89e-0
2f 1
7 9.6154376e+03 1.98e-02 9.31e+00 -1.0 9.91e+00 - 6.64e-01 8.81e-0
1f 1
8 9.7199903e+03 1.05e-02 6.35e-01 -1.0 2.75e+00 - 9.95e-01 4.77e-0
1f 2
9 9.3967776e+03 9.36e-03 2.78e-01 -1.7 9.45e+00 - 1.00e+00 8.30e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.3672965e+03 2.18e-03 9.40e-01 -1.7 1.18e+01 - 1.00e+00 4.90e-0
1h 2
11 9.3624199e+03 2.10e-04 1.67e-02 -1.7 6.01e+00 - 1.00e+00 1.00e+0
0h 1
12 9.2069203e+03 4.79e-04 2.44e-02 -3.8 2.00e+01 - 8.46e-01 8.30e-0
1f 1
13 9.1886242e+03 1.49e-04 2.05e-01 -3.8 3.34e+00 - 9.89e-01 7.21e-0
1h 1
14 9.1840024e+03 3.89e-07 3.07e-04 -3.8 9.33e-01 - 1.00e+00 1.00e+0
0h 1
15 9.1828139e+03 1.95e-08 4.40e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
16 9.1828008e+03 7.97e-13 4.82e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 9.1828007655627122e+00 9.1828007655627116e+0
3
Dual infeasibility......: 4.8230733912204735e-10 4.8230733912204735e-0
7
Constraint violation....: 7.9651563122951075e-13 7.9651563122951075e-1
3
Complementarity.........: 2.6134527997899259e-09 2.6134527997899260e-0
6
Overall NLP error.......: 2.6134527997899259e-09 2.6134527997899260e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3004795e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 2.02e-03 9.80e-0
3h 1
2 9.2712367e+02 4.77e+03 5.23e+01 -1.0 4.47e+03 - 6.97e-05 1.06e-0
4h 1
3 8.6230721e+02 4.76e+03 5.23e+01 -1.0 4.77e+03 - 1.09e-05 2.80e-0
3f 1
4 3.9458856e+02 4.65e+03 5.23e+01 -1.0 4.76e+03 - 3.78e-03 2.20e-0
2h 1
5 1.5936731e+04 7.51e-02 7.75e+01 -1.0 4.65e+03 - 7.99e-02 1.00e+0
0h 1
6 9.0816127e+03 6.78e-02 2.29e+01 -1.0 8.31e+00 - 6.77e-01 9.05e-0
2f 1
7 7.8525062e+03 3.47e-02 8.39e+00 -1.0 6.89e+00 - 7.10e-01 1.00e+0
0f 1
8 8.1952987e+03 2.05e-02 2.98e-01 -1.0 2.41e+00 - 9.96e-01 9.69e-0
1f 1
9 7.7640020e+03 3.95e-03 3.54e-01 -1.7 1.12e+01 - 8.33e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.7107177e+03 7.81e-04 3.48e-02 -1.7 7.24e+00 - 1.00e+00 1.00e+0
0h 1
11 7.5664017e+03 4.99e-04 2.40e-02 -2.5 1.64e+01 - 9.77e-01 9.84e-0
1f 1
12 7.5511474e+03 1.19e-04 1.70e-01 -3.8 2.89e+00 - 9.96e-01 7.71e-0
1h 1
13 7.5477479e+03 2.23e-07 1.25e-04 -3.8 6.61e-01 - 1.00e+00 1.00e+0
0f 1
14 7.5465612e+03 1.74e-08 3.02e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
15 7.5465477e+03 1.28e-12 4.23e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 7.5465477232672384e+00 7.5465477232672383e+0
3
Dual infeasibility......: 4.2290145445561075e-10 4.2290145445561075e-0
7
Constraint violation....: 1.2839174168277623e-12 1.2839174168277623e-1
2
Complementarity.........: 2.5905430566376051e-09 2.5905430566376052e-0
6
Overall NLP error.......: 2.5905430566376051e-09 2.5905430566376052e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6658302e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 4.97e-04 9.81e-0
3f 1
2 8.6365170e+02 3.24e+03 5.24e+01 -1.0 3.03e+03 - 9.59e-05 1.06e-0
4h 1
3 7.9164439e+02 3.23e+03 5.24e+01 -1.0 3.24e+03 - 1.34e-05 2.94e-0
3f 1
4 3.2269649e+02 3.17e+03 5.24e+01 -1.0 3.23e+03 - 4.33e-03 2.11e-0
2h 1
5 1.3532414e+04 6.35e-02 8.05e+01 -1.0 3.17e+03 - 5.89e-02 1.00e+0
0h 1
6 6.4324764e+03 5.86e-02 4.63e+01 -1.0 6.47e+01 - 4.10e-01 7.06e-0
2f 1
7 4.8641757e+03 3.05e-02 2.15e+01 -1.0 3.76e+01 - 5.25e-01 4.45e-0
1f 1
8 4.4515440e+03 1.21e-02 1.93e+00 -1.0 1.04e+01 - 9.23e-01 1.00e+0
0f 1
9 4.6903276e+03 4.06e-04 6.36e-02 -1.0 4.25e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2205020e+03 5.03e-04 7.11e-01 -2.5 6.93e+00 - 8.96e-01 6.21e-0
1f 1
11 4.1366846e+03 2.39e-04 3.87e-01 -2.5 2.43e+00 - 8.90e-01 1.00e+0
0h 1
12 4.1101121e+03 5.79e-03 1.75e-01 -2.5 1.74e+00 - 1.00e+00 6.83e-0
1h 1
13 4.1031715e+03 5.46e-04 4.14e-03 -2.5 3.56e-01 - 1.00e+00 1.00e+0
0f 1
14 4.0873945e+03 1.16e-03 3.01e-02 -3.8 2.68e+00 - 8.04e-01 1.00e+0
0h 1
15 4.0842958e+03 2.39e-03 1.07e-03 -3.8 4.80e-02 - 1.00e+00 1.00e+0
0h 1
16 4.0846634e+03 4.13e-05 1.38e-04 -3.8 1.45e-02 - 1.00e+00 1.00e+0
0h 1
17 4.0833438e+03 1.04e-04 4.02e-04 -5.7 1.49e-01 - 9.51e-01 9.80e-0
1h 1
18 4.0833356e+03 2.19e-05 3.60e-03 -5.7 2.93e-03 - 1.00e+00 7.90e-0
1h 1
19 4.0833393e+03 8.57e-09 1.14e-06 -5.7 6.15e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 4.0833246e+03 8.99e-09 1.93e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
21 4.0833244e+03 1.37e-12 6.48e-11 -8.6 3.06e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 4.0833243877633247e+00 4.0833243877633245e+0
3
Dual infeasibility......: 6.4795731203352398e-11 6.4795731203352398e-0
8
Constraint violation....: 1.3742340598810188e-12 1.3742340598810188e-1
2
Complementarity.........: 2.5092130211834999e-09 2.5092130211834997e-0
6
Overall NLP error.......: 2.5092130211834999e-09 2.5092130211834997e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1583257e+02 2.00e+03 5.23e+01 -1.0 2.01e+03 - 1.20e-03 9.81e-0
3h 1
2 9.1195716e+02 2.00e+03 5.23e+01 -1.0 1.37e+03 - 4.87e-05 1.44e-0
4h 1
3 3.1303385e+02 1.95e+03 5.24e+01 -1.0 2.00e+03 - 6.04e-05 2.36e-0
2f 1
4 1.4608110e+04 6.65e-02 7.72e+01 -1.0 1.95e+03 - 6.92e-02 1.00e+0
0h 1
5 6.1485043e+03 6.09e-02 3.60e+01 -1.0 2.22e+01 - 5.08e-01 7.70e-0
2f 1
6 4.6744427e+03 1.15e-02 1.62e+01 -1.0 1.30e+01 - 6.04e-01 8.35e-0
1f 1
7 4.8737737e+03 2.78e-03 1.38e-01 -1.0 3.28e+00 - 9.92e-01 1.00e+0
0f 1
8 4.4144339e+03 1.77e-03 1.46e-01 -1.7 7.19e+00 - 1.00e+00 1.00e+0
0f 1
9 4.2301358e+03 2.01e-03 3.83e-01 -2.5 2.11e+00 - 1.00e+00 7.84e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2032537e+03 1.87e-04 1.95e-02 -2.5 4.38e-01 - 1.00e+00 9.81e-0
1f 1
11 4.1817214e+03 1.90e-06 1.87e-02 -3.8 5.38e+00 - 9.84e-01 1.00e+0
0h 1
12 4.1818471e+03 1.75e-09 4.85e-06 -3.8 6.74e-03 - 1.00e+00 1.00e+0
0h 1
13 4.1805081e+03 1.80e-08 1.81e-04 -5.7 2.97e-01 - 1.00e+00 9.96e-0
1f 1
14 4.1805057e+03 1.80e-12 2.29e-09 -5.7 1.19e-03 - 1.00e+00 1.00e+0
0f 1
15 4.1804892e+03 2.63e-12 8.72e-08 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
16 4.1804892e+03 3.55e-15 2.53e-14 -8.6 5.00e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 4.1804891566574991e+00 4.1804891566574988e+0
3
Dual infeasibility......: 2.5313084961453569e-14 2.5313084961453569e-1
1
Constraint violation....: 3.5527136788005009e-15 3.5527136788005009e-1
5
Complementarity.........: 4.9929054581447223e-09 4.9929054581447225e-0
6
Overall NLP error.......: 4.9929054581447223e-09 4.9929054581447225e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0841171e+02 9.17e+02 5.23e+01 -1.0 9.24e+02 - 1.00e-03 9.84e-0
3h 1
2 9.0017350e+02 9.17e+02 5.23e+01 -1.0 6.22e+02 - 6.48e-05 3.07e-0
4h 1
3 2.8418413e+02 8.96e+02 5.24e+01 -1.0 9.17e+02 - 2.54e-04 2.33e-0
2f 1
4 1.3379258e+04 6.54e-02 7.63e+01 -1.0 8.96e+02 - 8.26e-02 1.00e+0
0h 1
5 4.8738581e+03 5.90e-02 3.91e+01 -1.0 2.98e+01 - 4.61e-01 8.88e-0
2f 1
6 3.3817827e+03 1.88e-02 1.64e+01 -1.0 1.54e+01 - 6.04e-01 7.30e-0
1f 1
7 3.4376624e+03 5.20e-03 2.21e-01 -1.0 2.14e+00 - 9.88e-01 1.00e+0
0f 1
8 3.0205909e+03 1.48e-03 1.25e-01 -1.7 5.63e+00 - 1.00e+00 1.00e+0
0f 1
9 2.8655043e+03 1.98e-03 4.31e-01 -2.5 2.34e+00 - 1.00e+00 7.80e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8396070e+03 1.68e-04 5.50e-03 -2.5 4.74e-01 - 1.00e+00 1.00e+0
0h 1
11 2.8199124e+03 4.64e-05 1.88e-01 -3.8 8.08e+00 - 1.00e+00 7.34e-0
1h 1
12 2.8139131e+03 1.65e-07 3.72e-04 -3.8 2.12e+00 - 1.00e+00 1.00e+0
0f 1
13 2.8123986e+03 2.70e-08 9.27e-04 -5.7 4.46e-01 - 1.00e+00 9.86e-0
1h 1
14 2.8123821e+03 1.86e-12 1.31e-08 -5.7 6.32e-03 - 1.00e+00 1.00e+0
0f 1
15 2.8123637e+03 2.63e-12 4.48e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 2.8123637092251328e+00 2.8123637092251329e+0
3
Dual infeasibility......: 4.4777017208962115e-09 4.4777017208962115e-0
6
Constraint violation....: 2.6305485567590381e-12 2.6305485567590381e-1
2
Complementarity.........: 3.6085026514249945e-09 3.6085026514249944e-0
6
Overall NLP error.......: 4.4777017208962115e-09 4.4777017208962115e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.02e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 6.36e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643330e+00 1.6104063281643330e+0
3
Dual infeasibility......: 2.4573533589620844e-12 2.4573533589620844e-0
9
Constraint violation....: 6.3603173025546602e-15 6.3603173025546602e-1
5
Complementarity.........: 2.5062163910047551e-09 2.5062163910047549e-0
6
Overall NLP error.......: 2.5062163910047551e-09 2.5062163910047549e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933498e-01 5.8277753147933493e+0
2
Dual infeasibility......: 2.1031320946147231e-09 2.1031320946147231e-0
6
Constraint violation....: 6.2994318095199731e-11 6.2994318095199731e-1
1
Complementarity.........: 2.8882108896903808e-09 2.8882108896903807e-0
6
Overall NLP error.......: 2.8882108896903808e-09 2.8882108896903807e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254210179e-01 6.4890146254210174e+0
2
Dual infeasibility......: 4.9126604771073183e-09 4.9126604771073183e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646095252524453e-09 4.3646095252524449e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126604771073183e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.02e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 6.36e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643330e+00 1.6104063281643330e+0
3
Dual infeasibility......: 2.4573533589620844e-12 2.4573533589620844e-0
9
Constraint violation....: 6.3603173025546602e-15 6.3603173025546602e-1
5
Complementarity.........: 2.5062163910047551e-09 2.5062163910047549e-0
6
Overall NLP error.......: 2.5062163910047551e-09 2.5062163910047549e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2355451e+02 9.17e+02 5.24e+01 -1.0 9.24e+02 - 3.31e-04 9.84e-0
3f 1
2 8.1662500e+02 9.17e+02 5.24e+01 -1.0 5.55e+02 - 7.26e-05 2.50e-0
4h 1
3 2.4196991e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 1.96e-04 2.12e-0
2f 1
4 1.2636833e+04 5.48e-02 8.23e+01 -1.0 8.98e+02 - 3.79e-02 1.00e+0
0h 1
5 3.9066543e+03 5.23e-02 5.77e+01 -1.0 8.26e+01 - 2.96e-01 4.93e-0
2f 1
6 1.9129688e+03 3.74e-02 3.11e+01 -1.0 3.92e+01 - 4.66e-01 5.08e-0
1f 1
7 4.7067283e+03 1.23e-02 2.76e+01 -1.0 2.08e+01 - 3.97e-01 1.00e+0
0h 1
8 1.8774461e+03 1.23e-02 1.09e+00 -1.0 2.59e+01 - 9.87e-01 8.86e-0
1f 1
9 1.9927655e+03 2.09e-04 4.90e-02 -1.0 2.51e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7260747e+03 2.23e-04 1.23e+00 -2.5 1.90e+01 - 9.37e-01 5.95e-0
1f 1
11 1.5380610e+03 3.77e-03 1.32e-01 -2.5 7.57e+00 - 7.96e-01 1.00e+0
0f 1
12 1.5153061e+03 4.98e-03 3.07e-01 -2.5 1.80e+00 - 1.00e+00 7.69e-0
1h 1
13 1.5275650e+03 2.35e-04 4.67e-03 -2.5 7.22e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5024753e+03 1.70e-04 2.15e-02 -3.8 8.08e+00 - 9.90e-01 9.29e-0
1h 1
15 1.5016701e+03 7.28e-07 6.85e-05 -3.8 5.51e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003100e+03 3.77e-07 1.78e-04 -5.7 4.46e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003099e+03 3.79e-11 2.92e-09 -5.7 4.21e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0h 1
1 8.6598311e+02 9.17e+02 5.24e+01 -1.0 9.24e+02 - 4.97e-04 9.84e-0
3h 1
2 8.5884059e+02 9.17e+02 5.24e+01 -1.0 5.71e+02 - 7.06e-05 2.62e-0
4h 1
3 2.6203260e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 2.08e-04 2.23e-0
2f 1
4 1.3003571e+04 5.93e-02 8.01e+01 -1.0 8.97e+02 - 4.95e-02 1.00e+0
0h 1
5 4.3038712e+03 5.54e-02 5.41e+01 -1.0 7.44e+01 - 3.14e-01 5.91e-0
2f 1
17 1.899117e+04 1.632511e+04 2.562585e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2433284e+02 1.57e+04 5.24e+01 -1.0 1.59e+04 - 3.31e-04 9.80e-0
3h 1
2 8.2134529e+02 1.57e+04 5.24e+01 -1.0 1.37e+04 - 2.39e-05 1.14e-0
4h 1
3 8.1844433e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 1.83e-05 2.32e-0
4h 1
4 8.1433885e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 2.48e-04 3.36e-0
4h 1
5 5.6518058e+02 1.54e+04 5.26e+01 -1.0 1.57e+04 - 6.09e-04 2.12e-0
2f 1
6 2.7134240e+04 5.53e-02 8.24e+01 -1.0 1.54e+04 - 3.88e-02 1.00e+0
0h 1
7 1.8703128e+04 5.27e-02 5.53e+01 -1.0 8.00e+01 - 3.26e-01 5.04e-0
2f 1
8 1.6733539e+04 3.72e-02 2.95e+01 -1.0 3.93e+01 - 4.70e-01 5.04e-0
1f 1
9 1.7077820e+04 2.28e-02 1.36e+01 -1.0 2.05e+01 - 4.02e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6824131e+04 6.01e-03 3.87e-01 -1.0 4.89e+00 - 9.79e-01 1.00e+0
0h 1
11 1.6518073e+04 1.43e-03 6.89e-01 -1.7 5.53e+00 - 5.95e-01 8.25e-0
1f 1
12 1.6484462e+04 3.26e-04 7.78e-01 -1.7 4.26e+00 - 4.68e-01 1.00e+0
0f 1
13 1.6474720e+04 9.77e-05 2.21e-01 -1.7 6.86e+00 - 6.68e-01 1.00e+0
0h 1
14 1.6486228e+04 9.35e-06 5.54e-02 -1.7 1.36e+01 - 7.40e-01 1.00e+0
0h 1
15 1.6368002e+04 1.04e-03 6.31e-02 -2.5 1.69e+01 - 9.09e-01 1.00e+0
0f 1
16 1.6344800e+04 1.30e-03 1.46e-02 -2.5 3.82e+00 - 1.00e+00 1.00e+0
0h 1
17 1.6328095e+04 2.33e-04 1.05e-01 -3.8 5.81e+00 - 1.00e+00 8.34e-0
1h 1
18 1.6326333e+04 4.73e-07 1.22e-04 -3.8 7.45e-01 - 1.00e+00 1.00e+0
0h 1
19 1.6325118e+04 4.02e-07 1.59e-04 -5.7 2.97e-01 - 1.00e+00 9.97e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325119e+04 3.86e-11 2.90e-09 -5.7 3.41e-03 - 1.00e+00 1.00e+0
0f 1
21 1.6325107e+04 4.78e-11 7.72e-05 -8.6 3.58e-03 - 1.00e+00 8.81e-0
1h 1
22 1.6325105e+04 8.93e-13 3.08e-11 -8.6 6.02e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.6325105198531233e+01 1.6325105198531233e+0
4
Dual infeasibility......: 3.0828210850449280e-11 3.0828210850449280e-0
8
Constraint violation....: 8.9286911197916652e-13 8.9286911197916652e-1
3
Complementarity.........: 3.7558365785974766e-09 3.7558365785974763e-0
6
Overall NLP error.......: 3.7558365785974766e-09 3.7558365785974763e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9223949e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.64e-04 9.80e-0
3h 1
2 7.8930384e+02 1.50e+04 5.25e+01 -1.0 1.37e+04 - 3.23e-05 1.08e-0
4h 1
3 7.8730744e+02 1.50e+04 5.25e+01 -1.0 1.49e+04 - 1.17e-05 1.49e-0
4h 1
4 7.8081509e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 1.58e-04 4.92e-0
4h 1
5 5.2471193e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 6.62e-04 2.04e-0
2f 1
6 2.6124983e+04 5.41e-02 8.38e+01 -1.0 1.47e+04 - 3.25e-02 1.00e+0
0h 1
7 1.7684632e+04 5.20e-02 6.34e+01 -1.0 7.99e+01 - 2.47e-01 4.52e-0
2f 1
8 1.5947910e+04 4.30e-02 3.24e+01 -1.0 3.30e+01 - 4.87e-01 4.64e-0
1f 1
9 1.6264119e+04 2.69e-02 1.41e+01 -1.0 1.78e+01 - 4.35e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6015849e+04 6.01e-03 1.73e-01 -1.0 4.91e+00 - 9.91e-01 1.00e+0
0h 1
11 1.5733727e+04 1.19e-03 2.76e-01 -1.7 4.70e+00 - 1.00e+00 8.68e-0
1f 1
12 1.5731285e+04 7.65e-04 6.63e-02 -1.7 3.80e+01 - 7.62e-01 1.00e+0
0f 1
13 1.5594602e+04 1.11e-03 5.11e-02 -2.5 3.82e+01 - 9.21e-01 1.00e+0
0f 1
14 1.5579096e+04 1.13e-03 1.36e-02 -2.5 1.58e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5562264e+04 1.94e-04 9.29e-02 -3.8 5.46e+00 - 1.00e+00 8.46e-0
1h 1
16 1.5560429e+04 7.95e-07 1.18e-04 -3.8 7.99e-01 - 1.00e+00 1.00e+0
0h 1
17 1.5559215e+04 3.97e-07 1.22e-04 -5.7 2.97e-01 - 1.00e+00 9.97e-0
1h 1
18 1.5559217e+04 3.84e-11 3.02e-09 -5.7 7.03e-03 - 1.00e+00 1.00e+0
0f 1
19 1.5559202e+04 6.30e-11 2.09e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.5559202124463997e+01 1.5559202124463996e+0
4
Dual infeasibility......: 2.0880534971809361e-09 2.0880534971809361e-0
6
Constraint violation....: 6.2993901761565496e-11 6.2993901761565496e-1
1
Complementarity.........: 2.9564756634149980e-09 2.9564756634149978e-0
6
Overall NLP error.......: 2.9564756634149980e-09 2.9564756634149978e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8360455e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 6.23e-04 9.80e-0
3h 1
2 8.8084268e+02 1.39e+04 5.24e+01 -1.0 1.37e+04 - 8.87e-05 1.01e-0
4h 1
3 8.7160355e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 3.17e-06 6.74e-0
4f 1
4 5.7172081e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 7.25e-04 2.25e-0
2h 1
5 2.5887391e+04 6.21e-02 7.91e+01 -1.0 1.36e+04 - 5.83e-02 1.00e+0
0h 1
6 1.7457269e+04 5.74e-02 5.20e+01 -1.0 6.16e+01 - 3.29e-01 6.73e-0
2f 1
7 1.6126949e+04 3.07e-02 2.49e+01 -1.0 3.03e+01 - 5.10e-01 4.28e-0
1f 1
8 1.5382310e+04 1.09e-02 1.75e+00 -1.0 1.08e+01 - 9.21e-01 8.63e-0
1f 1
9 1.5756543e+04 2.91e-04 7.05e-02 -1.0 4.41e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5020548e+04 1.74e-03 1.11e-01 -2.5 6.01e+00 - 8.74e-01 9.17e-0
1f 1
11 1.5010330e+04 7.89e-06 1.28e-02 -2.5 3.98e-01 - 1.00e+00 1.00e+0
0h 1
12 1.4986515e+04 1.68e-04 9.24e-02 -3.8 2.68e+00 - 7.62e-01 9.61e-0
1f 1
13 1.4983067e+04 1.05e-03 2.27e-03 -3.8 1.04e-01 - 9.22e-01 1.00e+0
0h 1
14 1.4983071e+04 1.01e-04 1.27e-04 -3.8 1.47e-02 - 1.00e+00 1.00e+0
0h 1
15 1.4981882e+04 1.30e-04 2.26e-03 -5.7 1.49e-01 - 8.87e-01 1.00e+0
0h 1
16 1.4981833e+04 3.52e-05 8.58e-06 -5.7 8.91e-03 - 1.00e+00 1.00e+0
0h 1
17 1.4981836e+04 6.52e-07 4.51e-06 -5.7 1.19e-03 - 1.00e+00 1.00e+0
0h 1
18 1.4981823e+04 4.31e-08 3.15e-05 -8.6 1.84e-03 - 1.00e+00 9.58e-0
1h 1
19 1.4981823e+04 4.03e-12 4.45e-11 -8.6 7.82e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.4981822856843033e+01 1.4981822856843033e+0
4
Dual infeasibility......: 4.4511181795745177e-11 4.4511181795745177e-0
8
Constraint violation....: 4.0297765124819307e-12 4.0297765124819307e-1
2
Complementarity.........: 2.5081737704178574e-09 2.5081737704178574e-0
6
Overall NLP error.......: 2.5081737704178574e-09 2.5081737704178574e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4548237e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.98e-04 9.80e-0
3h 1
2 8.4261832e+02 1.27e+04 5.24e+01 -1.0 1.20e+04 - 4.62e-05 1.04e-0
4h 1
3 8.0309467e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 7.81e-06 2.58e-0
3h 1
4 5.2937834e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 2.80e-03 2.08e-0
2h 1
5 2.3335798e+04 5.94e-02 8.14e+01 -1.0 1.24e+04 - 4.97e-02 1.00e+0
0h 1
6 1.5690537e+04 5.54e-02 4.84e+01 -1.0 7.33e+01 - 3.95e-01 6.13e-0
2f 1
7 1.3663628e+04 3.60e-02 2.49e+01 -1.0 4.16e+01 - 4.90e-01 5.24e-0
1f 1
8 1.4305428e+04 1.31e-02 2.79e+00 -1.0 1.59e+01 - 7.96e-01 5.00e-0
1f 2
9 1.3827023e+04 4.20e-03 1.76e-01 -1.0 7.73e+00 - 9.59e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3455833e+04 1.11e-03 3.89e-01 -1.7 5.64e+00 - 1.00e+00 8.15e-0
1f 1
11 1.3431557e+04 4.90e-04 2.48e-02 -1.7 3.49e+01 - 1.00e+00 1.00e+0
0f 1
12 1.3269592e+04 1.39e-03 1.20e-01 -3.8 3.98e+01 - 7.60e-01 9.23e-0
1f 1
13 1.3232163e+04 2.74e-03 2.16e-02 -3.8 3.01e+00 - 8.07e-01 8.28e-0
1h 1
14 1.3233886e+04 3.09e-04 1.34e-01 -3.8 5.17e-01 - 1.00e+00 9.07e-0
1h 1
15 1.3234267e+04 4.98e-07 2.20e-05 -3.8 2.38e-01 - 1.00e+00 1.00e+0
0f 1
16 1.3233079e+04 4.18e-07 2.33e-03 -5.7 2.97e-01 - 1.00e+00 9.77e-0
1h 1
17 1.3233066e+04 4.90e-11 2.26e-08 -5.7 5.81e-02 - 1.00e+00 1.00e+0
0f 1
18 1.3233051e+04 6.30e-11 4.40e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.3233050904389694e+01 1.3233050904389695e+0
4
Dual infeasibility......: 4.3985737550554640e-09 4.3985737550554640e-0
6
Constraint violation....: 6.2986990623237205e-11 6.2986990623237205e-1
1
Complementarity.........: 4.3669662245419586e-09 4.3669662245419581e-0
6
Overall NLP error.......: 4.3985737550554640e-09 4.3985737550554640e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6571625e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 4.92e-04 9.80e-0
3h 1
2 8.6292301e+02 1.11e+04 5.24e+01 -1.0 1.09e+04 - 9.15e-05 1.01e-0
4h 1
3 8.4926251e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 3.90e-06 8.20e-0
4f 1
4 4.9468883e+02 1.09e+04 5.25e+01 -1.0 1.11e+04 - 9.00e-04 2.20e-0
2h 1
5 2.2852100e+04 5.99e-02 8.02e+01 -1.0 1.09e+04 - 5.06e-02 1.00e+0
0h 1
6 1.4463802e+04 5.59e-02 5.30e+01 -1.0 7.28e+01 - 3.29e-01 6.06e-0
2f 1
7 1.2856986e+04 3.00e-02 2.75e+01 -1.0 3.91e+01 - 4.76e-01 4.36e-0
1f 1
8 1.2340816e+04 1.41e-02 2.54e+00 -1.0 1.09e+01 - 9.19e-01 1.00e+0
0f 1
9 1.2641228e+04 4.35e-04 9.14e-02 -1.0 4.29e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2079944e+04 6.35e-04 4.28e-01 -2.5 7.83e+00 - 8.86e-01 7.07e-0
1f 1
11 1.1998678e+04 2.74e-04 3.55e-01 -2.5 2.77e+00 - 8.80e-01 1.00e+0
0h 1
12 1.1992901e+04 6.81e-04 4.87e-01 -2.5 1.53e+00 - 1.00e+00 1.47e-0
1h 2
13 1.1970037e+04 1.36e-03 1.35e-02 -2.5 1.05e+00 - 1.00e+00 1.00e+0
0h 1
14 1.1953569e+04 1.29e-03 3.49e-02 -3.8 2.68e+00 - 7.93e-01 1.00e+0
0h 1
15 1.1950531e+04 2.33e-03 8.95e-04 -3.8 4.07e-02 - 1.00e+00 1.00e+0
0h 1
16 1.1950900e+04 4.08e-05 1.74e-04 -3.8 1.56e-02 - 1.00e+00 1.00e+0
0h 1
17 1.1949565e+04 1.06e-04 3.52e-04 -5.7 1.49e-01 - 9.51e-01 9.76e-0
1h 1
18 1.1949555e+04 2.27e-05 4.14e-03 -5.7 3.59e-03 - 1.00e+00 7.86e-0
1h 1
19 1.1949558e+04 7.89e-09 1.18e-06 -5.7 7.69e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.1949543e+04 8.80e-09 2.14e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
21 1.1949543e+04 1.53e-12 7.32e-11 -8.6 3.12e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.1949542589644668e+01 1.1949542589644669e+0
4
Dual infeasibility......: 7.3241489124637220e-11 7.3241489124637220e-0
8
Constraint violation....: 1.5261125696497402e-12 1.5261125696497402e-1
2
Complementarity.........: 2.5094410821517998e-09 2.5094410821517995e-0
6
Overall NLP error.......: 2.5094410821517998e-09 2.5094410821517995e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891839e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0614875e+02 9.19e+03 5.23e+01 -1.0 8.94e+03 - 8.31e-05 1.02e-0
4h 1
3 8.8589053e+02 9.18e+03 5.23e+01 -1.0 9.18e+03 - 4.99e-06 1.11e-0
3f 1
4 4.8290407e+02 8.97e+03 5.24e+01 -1.0 9.18e+03 - 1.26e-03 2.28e-0
2h 1
5 2.1194856e+04 6.67e-02 7.66e+01 -1.0 8.97e+03 - 8.32e-02 1.00e+0
0h 1
6 1.3110859e+04 6.01e-02 3.76e+01 -1.0 2.89e+01 - 4.83e-01 9.02e-0
2f 1
7 1.1611939e+04 1.94e-02 1.53e+01 -1.0 1.53e+01 - 6.18e-01 7.42e-0
1f 1
8 1.1669715e+04 5.64e-03 1.25e+00 -1.0 2.10e+00 - 9.91e-01 5.00e-0
1f 2
9 1.1851856e+04 3.17e-04 6.99e-02 -1.0 2.45e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1303065e+04 2.21e-03 9.19e-02 -2.5 2.21e+01 - 8.56e-01 8.21e-0
1f 1
11 1.1134535e+04 2.12e-03 4.58e-01 -2.5 3.77e+00 - 1.00e+00 7.49e-0
1f 1
12 1.1105283e+04 1.58e-04 4.78e-03 -2.5 9.43e-01 - 1.00e+00 1.00e+0
0h 1
13 1.1088904e+04 4.25e-05 1.63e-01 -3.8 2.68e+00 - 1.00e+00 7.50e-0
1h 1
14 1.1084573e+04 1.45e-07 3.58e-04 -3.8 6.70e-01 - 1.00e+00 1.00e+0
0f 1
15 1.1083348e+04 2.78e-08 9.22e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 1.1083335e+04 1.87e-12 1.33e-08 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
17 1.1083321e+04 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.1083320728599695e+01 1.1083320728599694e+0
4
Dual infeasibility......: 4.4776955352394849e-09 4.4776955352394849e-0
6
Constraint violation....: 2.6305069233956146e-12 2.6305069233956146e-1
2
Complementarity.........: 3.6085004295034188e-09 3.6085004295034188e-0
6
Overall NLP error.......: 4.4776955352394849e-09 4.4776955352394849e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891119e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0611351e+02 6.71e+03 5.23e+01 -1.0 6.46e+03 - 8.39e-05 1.03e-0
4h 1
3 8.7440044e+02 6.70e+03 5.23e+01 -1.0 6.70e+03 - 6.84e-06 1.53e-0
3f 1
4 4.2534165e+02 6.54e+03 5.24e+01 -1.0 6.70e+03 - 1.83e-03 2.26e-0
2h 1
5 1.8469067e+04 6.74e-02 7.67e+01 -1.0 6.54e+03 - 8.35e-02 1.00e+0
0h 1
6 1.0609292e+04 6.07e-02 3.68e+01 -1.0 2.85e+01 - 4.94e-01 9.10e-0
2f 1
7 9.1070968e+03 1.97e-02 1.46e+01 -1.0 1.53e+01 - 6.26e-01 7.49e-0
1f 1
8 9.1804481e+03 5.62e-03 1.19e+00 -1.0 2.08e+00 - 9.93e-01 5.00e-0
1f 2
9 9.3751841e+03 2.91e-04 6.67e-02 -1.0 2.88e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.8198147e+03 2.22e-03 9.09e-02 -2.5 2.66e+01 - 8.56e-01 8.23e-0
1f 1
11 8.6513288e+03 2.12e-03 4.55e-01 -2.5 4.37e+00 - 1.00e+00 7.50e-0
1f 1
12 8.6223061e+03 1.56e-04 4.78e-03 -2.5 1.09e+00 - 1.00e+00 1.00e+0
0h 1
13 8.6058823e+03 4.18e-05 1.61e-01 -3.8 2.68e+00 - 1.00e+00 7.51e-0
1h 1
14 8.6015687e+03 1.44e-07 3.57e-04 -3.8 6.67e-01 - 1.00e+00 1.00e+0
0f 1
15 8.6003430e+03 2.79e-08 9.26e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 8.6003307e+03 1.87e-12 1.33e-08 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
17 8.6003159e+03 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 8.6003159158168998e+00 8.6003159158169001e+0
3
Dual infeasibility......: 4.4776952272811752e-09 4.4776952272811752e-0
6
Constraint violation....: 2.6306873346371162e-12 2.6306873346371162e-1
2
Complementarity.........: 3.6085002106179668e-09 3.6085002106179668e-0
6
Overall NLP error.......: 4.4776952272811752e-09 4.4776952272811752e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0887653e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0575715e+02 4.77e+03 5.23e+01 -1.0 4.05e+03 - 4.23e-05 1.17e-0
4h 1
3 6.7332355e+02 4.72e+03 5.24e+01 -1.0 4.77e+03 - 2.39e-05 1.03e-0
2f 1
4 4.3700871e+02 4.62e+03 5.18e+01 -1.0 4.72e+03 - 1.38e-02 2.11e-0
2h 1
5 1.3037781e+04 7.91e-02 7.80e+01 -1.0 4.62e+03 - 9.53e-02 1.00e+0
0h 1
6 8.3073569e+03 6.95e-02 2.11e+01 -1.0 2.25e+01 - 7.07e-01 1.14e-0
1f 1
7 6.9813415e+03 1.49e-02 1.23e+00 -1.0 1.41e+01 - 9.43e-01 7.79e-0
1f 1
8 7.2864192e+03 1.03e-02 1.77e-01 -1.0 4.36e+00 - 8.23e-01 9.21e-0
1f 1
9 6.8835261e+03 2.46e-03 5.25e-01 -1.7 4.02e+00 - 7.08e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.8492938e+03 5.83e-04 4.66e-01 -1.7 9.61e+00 - 7.03e-01 1.00e+0
0h 1
11 6.8683193e+03 3.10e-05 4.04e-02 -1.7 1.32e+01 - 9.36e-01 1.00e+0
0h 1
12 6.7001933e+03 4.99e-04 2.21e-02 -2.5 2.44e+01 - 9.71e-01 9.50e-0
1f 1
13 6.6702298e+03 1.37e-04 7.86e-02 -3.8 7.57e+00 - 9.84e-01 8.41e-0
1h 1
14 6.6673145e+03 1.77e-07 9.11e-02 -3.8 1.21e+00 - 9.27e-01 1.00e+0
0h 1
15 6.6672355e+03 4.75e-09 2.84e-05 -3.8 1.66e-04 - 1.00e+00 1.00e+0
0h 1
16 6.6659218e+03 1.92e-08 3.89e-03 -5.7 2.97e-01 - 1.00e+00 9.68e-0
1f 1
17 6.6658859e+03 5.75e-12 2.63e-08 -5.7 9.60e-03 - 1.00e+00 1.00e+0
0f 1
18 6.6658693e+03 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 6.6658693301956093e+00 6.6658693301956091e+0
3
Dual infeasibility......: 4.4780429574960911e-09 4.4780429574960911e-0
6
Constraint violation....: 2.6338653480451057e-12 2.6338653480451057e-1
2
Complementarity.........: 3.6085482634223155e-09 3.6085482634223155e-0
6
Overall NLP error.......: 4.4780429574960911e-09 4.4780429574960911e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9473874e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3h 1
2 8.9143292e+02 3.24e+03 5.24e+01 -1.0 2.62e+03 - 4.85e-05 1.23e-0
4h 1
3 5.1813695e+02 3.19e+03 5.24e+01 -1.0 3.24e+03 - 3.31e-05 1.54e-0
2f 1
4 4.4980604e+02 3.11e+03 5.12e+01 -1.0 3.19e+03 - 2.40e-02 2.62e-0
2f 1
5 9.7252894e+03 8.18e-02 7.70e+01 -1.0 3.11e+03 - 1.16e-01 1.00e+0
0h 1
6 6.1329582e+03 7.03e-02 1.96e+01 -1.0 2.92e+01 - 7.30e-01 1.45e-0
1f 1
7 4.8587712e+03 1.43e-02 1.24e+00 -1.0 1.60e+01 - 9.26e-01 8.10e-0
1f 1
8 5.2628144e+03 6.17e-03 1.25e+00 -1.0 4.14e+00 - 1.50e-01 9.44e-0
1f 1
9 5.4797501e+03 2.78e-03 1.25e+00 -1.0 4.35e+00 - 6.41e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.4445816e+03 1.02e-03 1.98e-01 -1.0 1.14e+01 - 6.02e-01 1.00e+0
0f 1
11 4.8362914e+03 1.99e-03 8.46e-02 -1.7 3.00e+00 - 9.90e-01 1.00e+0
0f 1
12 4.6234880e+03 2.02e-03 6.95e-02 -2.5 1.58e+01 - 8.81e-01 8.44e-0
1f 1
13 4.6005452e+03 1.92e-04 5.49e-03 -2.5 3.38e+00 - 1.00e+00 1.00e+0
0h 1
14 4.5777140e+03 2.70e-05 4.05e-02 -3.8 5.39e+00 - 1.00e+00 8.81e-0
1h 1
15 4.5757756e+03 6.53e-08 6.10e-04 -3.8 6.39e-01 - 1.00e+00 1.00e+0
0f 1
16 4.5743241e+03 4.16e-08 1.62e-05 -5.7 2.97e-01 - 1.00e+00 9.99e-0
1f 1
17 4.5743102e+03 6.95e-13 4.05e-09 -8.6 3.88e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 4.5743101943411899e+00 4.5743101943411903e+0
3
Dual infeasibility......: 4.0475673438239630e-09 4.0475673438239630e-0
6
Constraint violation....: 6.9483307996165422e-13 6.9483307996165422e-1
3
Complementarity.........: 4.6324853124546696e-09 4.6324853124546697e-0
6
Overall NLP error.......: 4.6324853124546696e-09 4.6324853124546697e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4528265e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 3.98e-04 9.81e-0
3f 1
2 8.4160251e+02 2.00e+03 5.24e+01 -1.0 1.48e+03 - 5.90e-05 1.34e-0
4h 1
3 2.7509537e+02 1.95e+03 5.26e+01 -1.0 2.00e+03 - 4.97e-05 2.18e-0
2f 1
4 1.3978763e+04 5.67e-02 8.10e+01 -1.0 1.95e+03 - 4.46e-02 1.00e+0
0h 1
5 5.1663756e+03 5.32e-02 5.38e+01 -1.0 8.22e+01 - 3.29e-01 5.48e-0
2f 1
6 3.0169279e+03 3.33e-02 2.97e+01 -1.0 4.25e+01 - 4.59e-01 5.39e-0
1f 1
7 5.0512416e+03 9.15e-03 1.65e+01 -1.0 2.43e+01 - 5.91e-01 1.00e+0
0h 1
8 3.0927580e+03 7.42e-03 4.15e-01 -1.0 2.10e+01 - 9.67e-01 1.00e+0
0f 1
9 2.7847845e+03 1.00e-03 1.63e-01 -1.7 5.24e+00 - 1.00e+00 9.12e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.6486959e+03 1.59e-03 2.72e-01 -2.5 6.05e+00 - 7.52e-01 1.00e+0
0f 1
11 2.5962169e+03 4.61e-03 3.97e-02 -2.5 2.93e+00 - 1.00e+00 1.00e+0
0h 1
12 2.6062895e+03 2.11e-04 6.40e-03 -2.5 4.76e-01 - 1.00e+00 1.00e+0
0h 1
13 2.5818658e+03 2.58e-04 4.25e-02 -3.8 5.37e+00 - 9.87e-01 8.87e-0
1h 1
14 2.5806677e+03 1.91e-06 1.63e-04 -3.8 6.01e-01 - 1.00e+00 1.00e+0
0h 1
15 2.5794704e+03 3.21e-07 2.10e-03 -5.7 2.97e-01 - 1.00e+00 9.78e-0
1h 1
16 2.5794585e+03 3.73e-11 2.11e-08 -5.7 6.59e-03 - 1.00e+00 1.00e+0
0f 1
17 2.5794438e+03 6.30e-11 4.40e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 2.5794437810633490e+00 2.5794437810633490e+0
3
Dual infeasibility......: 4.3996205525401430e-09 4.3996205525401430e-0
6
Constraint violation....: 6.3009861217544483e-11 6.3009861217544483e-1
1
Complementarity.........: 4.6344766326473944e-09 4.6344766326473943e-0
6
Overall NLP error.......: 4.6344766326473944e-09 4.6344766326473943e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6529006e+02 9.17e+02 5.24e+01 -1.0 9.24e+02 - 4.93e-04 9.84e-0
3h 1
2 8.5815355e+02 9.17e+02 5.24e+01 -1.0 5.70e+02 - 7.06e-05 2.62e-0
4h 1
3 2.6168575e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 2.07e-04 2.23e-0
2f 1
4 1.2997303e+04 5.92e-02 8.01e+01 -1.0 8.97e+02 - 4.92e-02 1.00e+0
0h 1
5 4.2961309e+03 5.53e-02 5.41e+01 -1.0 7.48e+01 - 3.14e-01 5.89e-0
2f 1
6 2.6914289e+03 3.00e-02 2.85e+01 -1.0 3.92e+01 - 4.69e-01 4.33e-0
1f 1
7 2.1380333e+03 1.47e-02 2.66e+00 -1.0 1.10e+01 - 9.18e-01 1.00e+0
0f 1
8 2.4715825e+03 4.58e-04 9.34e-02 -1.0 4.17e+00 - 9.98e-01 1.00e+0
0f 1
9 1.8765119e+03 7.31e-04 3.33e-01 -2.5 8.13e+00 - 8.80e-01 7.38e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8001418e+03 2.69e-04 3.42e-01 -2.5 2.77e+00 - 8.79e-01 1.00e+0
0h 1
11 1.7951097e+03 6.71e-04 4.80e-01 -2.5 1.42e+00 - 9.52e-01 1.32e-0
1h 2
12 1.7733393e+03 1.43e-03 1.43e-02 -2.5 9.93e-01 - 1.00e+00 1.00e+0
0h 1
13 1.7515730e+03 1.28e-03 3.50e-02 -3.8 8.08e+00 - 7.91e-01 1.00e+0
0h 1
14 1.7486334e+03 2.22e-03 8.90e-04 -3.8 3.88e-02 - 1.00e+00 1.00e+0
0h 1
15 1.7490034e+03 4.49e-05 1.68e-04 -3.8 1.64e-02 - 1.00e+00 1.00e+0
0h 1
16 1.7473717e+03 1.08e-04 4.01e-04 -5.7 4.46e-01 - 9.51e-01 9.79e-0
1h 1
17 1.7473590e+03 2.27e-05 3.96e-03 -5.7 9.28e-03 - 1.00e+00 7.90e-0
1h 1
18 1.7473611e+03 8.09e-09 1.14e-06 -5.7 1.95e-03 - 1.00e+00 1.00e+0
0f 1
19 1.7473428e+03 8.83e-09 2.07e-05 -8.6 5.53e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7473425e+03 1.48e-12 7.02e-11 -8.6 9.27e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.7473425164117076e+00 1.7473425164117075e+0
3
Dual infeasibility......: 7.0213349967130470e-11 7.0213349967130470e-0
8
Constraint violation....: 1.4764856004489957e-12 1.4764856004489957e-1
2
Complementarity.........: 2.5093343039654449e-09 2.5093343039654451e-0
6
Overall NLP error.......: 2.5093343039654449e-09 2.5093343039654451e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.04e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.11e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235598023e+00 1.6104063235598023e+0
3
Dual infeasibility......: 2.4576716418374743e-12 2.4576716418374743e-0
9
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5062163919694814e-09 2.5062163919694814e-0
6
Overall NLP error.......: 2.5062163919694814e-09 2.5062163919694814e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933520e-01 5.8277753147933515e+0
2
Dual infeasibility......: 2.1031320945198554e-09 2.1031320945198554e-0
6
Constraint violation....: 6.2994401361926577e-11 6.2994401361926577e-1
1
Complementarity.........: 2.8882108897061754e-09 2.8882108897061753e-0
6
Overall NLP error.......: 2.8882108897061754e-09 2.8882108897061753e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146111909430e-01 6.4890146111909428e+0
2
Dual infeasibility......: 4.9126605652944596e-09 4.9126605652944596e-0
6
Constraint violation....: 6.2123813870940126e-09 6.2123813870940126e-0
9
Complementarity.........: 4.3646094984486179e-09 4.3646094984486175e-0
6
Overall NLP error.......: 6.2123813870940126e-09 4.9126605652944596e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.04e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.11e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235598023e+00 1.6104063235598023e+0
3
Dual infeasibility......: 2.4576716418374743e-12 2.4576716418374743e-0
9
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5062163919694814e-09 2.5062163919694814e-0
6
Overall NLP error.......: 2.5062163919694814e-09 2.5062163919694814e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2260281e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 3.29e-04 9.85e-0
3h 1
2 8.1269907e+02 9.17e+02 5.24e+01 -1.0 6.65e+02 - 7.54e-05 3.59e-0
4h 1
3 2.4184167e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 3.16e-04 2.12e-0
2f 1
4 1.2567184e+04 5.49e-02 8.23e+01 -1.0 8.98e+02 - 3.79e-02 1.00e+0
0h 1
5 3.8955811e+03 5.24e-02 5.75e+01 -1.0 8.21e+01 - 3.00e-01 4.94e-0
2f 1
6 1.9119393e+03 3.76e-02 3.09e+01 -1.0 3.91e+01 - 4.67e-01 5.06e-0
1f 1
7 4.6932178e+03 1.23e-02 2.74e+01 -1.0 2.07e+01 - 3.99e-01 1.00e+0
0h 1
8 1.8763378e+03 1.21e-02 1.06e+00 -1.0 2.57e+01 - 9.88e-01 8.88e-0
1f 1
9 1.9957112e+03 2.00e-04 4.81e-02 -1.0 2.81e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7289247e+03 2.20e-04 1.23e+00 -2.5 1.92e+01 - 9.37e-01 5.95e-0
1f 1
11 1.5409153e+03 3.77e-03 1.32e-01 -2.5 7.57e+00 - 7.97e-01 1.00e+0
0f 1
12 1.5181340e+03 5.10e-03 3.05e-01 -2.5 1.80e+00 - 1.00e+00 7.70e-0
1h 1
13 1.5303935e+03 2.39e-04 4.64e-03 -2.5 7.17e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5027999e+03 1.70e-04 2.13e-02 -3.8 1.08e+01 - 9.90e-01 9.30e-0
1h 1
15 1.5018205e+03 7.25e-07 6.85e-05 -3.8 7.29e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003123e+03 3.77e-07 1.76e-04 -5.7 5.94e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003117e+03 3.79e-11 2.93e-09 -5.7 3.99e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932746921178e+00 1.5002932746921178e+0
3
Dual infeasibility......: 2.1693878831662862e-09 2.1693878831662862e-0
6
Constraint violation....: 6.2995775262919551e-11 6.2995775262919551e-1
1
Complementarity.........: 2.8882170477301834e-09 2.8882170477301833e-0
6
Overall NLP error.......: 2.8882170477301834e-09 2.8882170477301833e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6507751e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 4.93e-04 9.85e-0
3h 1
2 8.5461309e+02 9.17e+02 5.24e+01 -1.0 6.82e+02 - 7.35e-05 3.85e-0
4h 1
3 2.6184915e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 3.42e-04 2.22e-0
2f 1
4 1.2929369e+04 5.93e-02 8.01e+01 -1.0 8.97e+02 - 4.95e-02 1.00e+0
0h 1
5 4.2893364e+03 5.55e-02 5.39e+01 -1.0 7.44e+01 - 3.17e-01 5.92e-0
2f 1
18 1.369771e+04 1.632511e+04 2.621343e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6795632e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.80e-0
3f 1
2 7.6508436e+02 1.57e+04 5.25e+01 -1.0 1.51e+04 - 4.81e-05 1.03e-0
4h 1
3 7.4098983e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 6.06e-06 1.91e-0
3h 1
4 5.3890199e+02 1.54e+04 5.27e+01 -1.0 1.57e+04 - 2.04e-03 1.95e-0
2h 1
5 2.6100191e+04 6.17e-02 8.49e+01 -1.0 1.54e+04 - 3.05e-02 1.00e+0
0h 1
6 1.8236440e+04 5.92e-02 6.40e+01 -1.0 7.32e+01 - 2.50e-01 4.45e-0
2f 1
7 1.6688751e+04 4.55e-02 3.12e+01 -1.0 2.88e+01 - 5.08e-01 4.32e-0
1f 1
8 1.6977986e+04 3.11e-02 1.20e+01 -1.0 1.59e+01 - 4.75e-01 1.25e-0
1f 4
9 1.6782929e+04 5.33e-03 1.52e-01 -1.0 3.86e+00 - 9.92e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6499992e+04 1.04e-03 1.65e-01 -1.7 6.91e+00 - 9.60e-01 8.79e-0
1f 1
11 1.6379499e+04 1.68e-03 1.98e-01 -2.5 4.99e+00 - 8.12e-01 1.00e+0
0f 1
12 1.6340241e+04 2.84e-03 3.76e-02 -2.5 2.32e+00 - 1.00e+00 9.66e-0
1h 1
13 1.6349690e+04 1.37e-04 4.69e-03 -2.5 1.22e+00 - 1.00e+00 1.00e+0
0f 1
14 1.6326586e+04 1.69e-04 1.09e-02 -3.8 5.36e+00 - 9.95e-01 9.56e-0
1h 1
15 1.6326329e+04 5.71e-07 6.44e-05 -3.8 2.34e-01 - 1.00e+00 1.00e+0
0h 1
16 1.6325119e+04 3.81e-07 1.40e-04 -5.7 2.97e-01 - 1.00e+00 9.97e-0
1h 1
17 1.6325120e+04 3.85e-11 3.15e-09 -5.7 1.63e-02 - 1.00e+00 1.00e+0
0f 1
18 1.6325105e+04 6.20e-11 4.56e-06 -8.6 3.68e-03 - 1.00e+00 9.93e-0
1h 1
19 1.6325105e+04 1.42e-14 1.14e-13 -8.6 7.65e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.6325105199705593e+01 1.6325105199705593e+0
4
Dual infeasibility......: 1.1390328296230368e-13 1.1390328296230368e-1
0
Constraint violation....: 1.4210854715202004e-14 1.4210854715202004e-1
4
Complementarity.........: 4.9270831478736562e-09 4.9270831478736558e-0
6
Overall NLP error.......: 4.9270831478736562e-09 4.9270831478736558e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.1741930e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 3.14e-04 9.80e-0
3h 1
2 8.1440672e+02 1.50e+04 5.24e+01 -1.0 1.29e+04 - 2.43e-05 1.15e-0
4h 1
3 8.1302219e+02 1.50e+04 5.24e+01 -1.0 1.48e+04 - 1.92e-05 1.04e-0
4h 1
4 8.1053849e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 1.21e-04 1.89e-0
4h 1
5 5.3939451e+02 1.47e+04 5.26e+01 -1.0 1.50e+04 - 3.16e-04 2.10e-0
2f 1
6 2.6526330e+04 5.47e-02 8.26e+01 -1.0 1.47e+04 - 3.66e-02 1.00e+0
0h 1
7 1.7899394e+04 5.22e-02 5.90e+01 -1.0 8.19e+01 - 2.86e-01 4.83e-0
2f 1
8 1.5967023e+04 3.90e-02 3.14e+01 -1.0 3.78e+01 - 4.71e-01 4.97e-0
1f 1
9 1.6308321e+04 2.33e-02 1.46e+01 -1.0 2.00e+01 - 4.05e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6039316e+04 6.20e-03 3.19e-01 -1.0 5.39e+00 - 9.83e-01 1.00e+0
0h 1
11 1.5743634e+04 1.38e-03 3.60e-01 -1.7 5.10e+00 - 1.00e+00 8.40e-0
1f 1
12 1.5735600e+04 8.66e-04 1.29e-02 -1.7 4.30e+01 - 1.00e+00 1.00e+0
0f 1
13 1.5583742e+04 1.38e-03 8.51e-02 -3.8 4.93e+01 - 7.92e-01 9.16e-0
1f 1
14 1.5559739e+04 1.58e-03 6.06e-01 -3.8 1.76e+00 - 1.38e-01 7.64e-0
1h 1
15 1.5560163e+04 7.96e-05 2.41e-02 -3.8 6.40e-02 - 1.00e+00 9.72e-0
1h 1
16 1.5560411e+04 3.47e-07 6.24e-06 -3.8 4.05e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5559217e+04 4.13e-07 2.22e-04 -5.7 2.98e-01 - 1.00e+00 9.96e-0
1h 1
18 1.5559217e+04 4.21e-11 3.38e-09 -5.7 1.85e-03 - 1.00e+00 1.00e+0
0f 1
19 1.5559202e+04 6.30e-11 2.14e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.5559202124436087e+01 1.5559202124436088e+0
4
Dual infeasibility......: 2.1394978458326683e-09 2.1394978458326683e-0
6
Constraint violation....: 6.2994456873077809e-11 6.2994456873077809e-1
1
Complementarity.........: 2.8882062670152164e-09 2.8882062670152162e-0
6
Overall NLP error.......: 2.8882062670152164e-09 2.8882062670152162e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.1016843e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 2.98e-04 9.80e-0
3f 1
2 8.0729218e+02 1.39e+04 5.24e+01 -1.0 1.33e+04 - 4.74e-05 1.04e-0
4h 1
3 7.7518806e+02 1.39e+04 5.25e+01 -1.0 1.39e+04 - 6.96e-06 2.24e-0
3h 1
4 5.3019665e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 2.41e-03 2.02e-0
2h 1
5 2.4425375e+04 5.59e-02 8.32e+01 -1.0 1.36e+04 - 3.74e-02 1.00e+0
0h 1
6 1.6684394e+04 5.32e-02 5.33e+01 -1.0 7.40e+01 - 3.59e-01 5.04e-0
2f 1
7 1.4870251e+04 4.00e-02 2.71e+01 -1.0 3.68e+01 - 4.90e-01 4.78e-0
1f 1
8 1.5191210e+04 2.51e-02 1.13e+01 -1.0 1.85e+01 - 4.27e-01 1.25e-0
1f 4
9 1.4954704e+04 6.16e-03 1.65e-01 -1.0 4.95e+00 - 9.90e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4663343e+04 1.30e-03 3.24e-01 -1.7 5.96e+00 - 1.00e+00 8.51e-0
1f 1
11 1.4651166e+04 7.63e-04 1.32e-02 -1.7 3.44e+01 - 1.00e+00 1.00e+0
0f 1
12 1.4506224e+04 1.38e-03 9.37e-02 -3.8 3.98e+01 - 7.93e-01 9.31e-0
1f 1
13 1.4481148e+04 1.53e-03 6.86e-02 -3.8 2.72e+00 - 8.45e-01 7.66e-0
1h 1
14 1.4481163e+04 2.88e-06 7.76e-04 -3.8 6.36e-01 - 1.00e+00 1.00e+0
0h 1
15 1.4480074e+04 3.04e-07 6.26e-04 -5.7 2.97e-01 - 1.00e+00 9.88e-0
1h 1
16 1.4480066e+04 3.83e-11 6.34e-09 -5.7 2.14e-01 - 1.00e+00 1.00e+0
0f 1
17 1.4480052e+04 6.30e-11 2.12e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.4480051755091035e+01 1.4480051755091034e+0
4
Dual infeasibility......: 2.1172043007107688e-09 2.1172043007107688e-0
6
Constraint violation....: 6.2996843852580753e-11 6.2996843852580753e-1
1
Complementarity.........: 2.8881068127947905e-09 2.8881068127947906e-0
6
Overall NLP error.......: 2.8881068127947905e-09 2.8881068127947906e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2796007e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.41e-04 9.80e-0
3h 1
2 8.2499338e+02 1.27e+04 5.24e+01 -1.0 1.14e+04 - 3.18e-05 1.10e-0
4h 1
3 8.0839385e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 1.41e-05 1.07e-0
3h 1
4 5.0285458e+02 1.24e+04 5.26e+01 -1.0 1.26e+04 - 1.08e-03 2.09e-0
2h 1
5 2.3966508e+04 5.59e-02 8.31e+01 -1.0 1.24e+04 - 2.93e-02 1.00e+0
0h 1
6 1.5694427e+04 5.35e-02 6.39e+01 -1.0 7.90e+01 - 2.33e-01 4.21e-0
2f 1
7 1.3691083e+04 4.12e-02 3.43e+01 -1.0 3.62e+01 - 4.70e-01 5.37e-0
1f 1
8 1.4032289e+04 2.15e-02 1.77e+01 -1.0 1.97e+01 - 3.77e-01 1.25e-0
1f 4
9 1.3723021e+04 6.51e-03 4.63e-01 -1.0 6.71e+00 - 9.79e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3425876e+04 1.60e-03 4.46e-01 -1.7 5.36e+00 - 1.00e+00 8.13e-0
1f 1
11 1.3434314e+04 9.47e-04 1.15e-01 -1.7 6.54e+01 - 6.25e-01 1.00e+0
0f 1
12 1.3271159e+04 1.21e-03 7.04e-02 -2.5 6.00e+01 - 9.02e-01 1.00e+0
0f 1
13 1.3253168e+04 1.38e-03 1.80e-02 -2.5 1.31e+00 - 1.00e+00 1.00e+0
0h 1
14 1.3236290e+04 2.58e-04 1.21e-01 -3.8 6.27e+00 - 1.00e+00 8.21e-0
1h 1
15 1.3234266e+04 9.52e-07 1.62e-04 -3.8 7.58e-01 - 1.00e+00 1.00e+0
0h 1
16 1.3233063e+04 3.95e-07 1.80e-04 -5.7 2.91e-01 - 1.00e+00 9.96e-0
1h 1
17 1.3233066e+04 3.92e-11 2.95e-09 -5.7 5.06e-02 - 1.00e+00 1.00e+0
0f 1
18 1.3233051e+04 6.30e-11 2.20e-09 -8.6 3.69e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.3233050905623438e+01 1.3233050905623437e+0
4
Dual infeasibility......: 2.2017336165933919e-09 2.2017336165933919e-0
6
Constraint violation....: 6.2996469152309942e-11 6.2996469152309942e-1
1
Complementarity.........: 2.8882223108692092e-09 2.8882223108692091e-0
6
Overall NLP error.......: 2.8882223108692092e-09 2.8882223108692091e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.5738994e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 4.48e-04 9.80e-0
3f 1
2 8.5458772e+02 1.11e+04 5.24e+01 -1.0 1.09e+04 - 9.23e-05 1.01e-0
4h 1
3 8.4098612e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 3.88e-06 8.12e-0
4f 1
4 4.8844490e+02 1.09e+04 5.25e+01 -1.0 1.11e+04 - 8.91e-04 2.18e-0
2h 1
5 2.2775523e+04 5.89e-02 8.07e+01 -1.0 1.09e+04 - 4.84e-02 1.00e+0
0h 1
6 1.4373332e+04 5.51e-02 5.28e+01 -1.0 7.60e+01 - 3.35e-01 5.87e-0
2f 1
7 1.2568605e+04 2.80e-02 2.80e+01 -1.0 4.12e+01 - 4.69e-01 4.70e-0
1f 1
8 1.2465443e+04 1.06e-02 2.59e+00 -1.0 1.30e+01 - 9.19e-01 1.00e+0
0f 1
9 1.2391833e+04 9.87e-04 8.40e-02 -1.0 6.33e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2026834e+04 5.85e-04 1.02e+00 -2.5 6.86e+00 - 9.11e-01 5.77e-0
1f 1
11 1.1890853e+04 6.27e-04 3.86e-01 -2.5 4.92e+00 - 8.19e-01 1.00e+0
0f 1
12 1.1864150e+04 9.91e-03 2.92e-01 -2.5 2.35e+00 - 1.00e+00 5.56e-0
1h 1
13 1.1855057e+04 1.36e-03 7.53e-03 -2.5 4.13e-01 - 1.00e+00 1.00e+0
0f 1
14 1.1838154e+04 1.47e-03 6.18e-02 -3.8 2.68e+00 - 7.57e-01 9.91e-0
1h 1
15 1.1834800e+04 2.41e-03 1.31e-03 -3.8 5.45e-02 - 1.00e+00 1.00e+0
0h 1
16 1.1834934e+04 4.31e-06 2.86e-04 -3.8 3.79e-03 - 1.00e+00 1.00e+0
0h 1
17 1.1833885e+04 4.19e-05 5.50e-03 -5.7 1.49e-01 - 9.71e-01 8.45e-0
1h 1
18 1.1833743e+04 6.69e-07 2.46e-06 -5.7 2.30e-02 - 1.00e+00 1.00e+0
0h 1
19 1.1833729e+04 6.67e-09 8.62e-07 -8.6 1.84e-03 - 1.00e+00 9.99e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.1833729e+04 6.88e-15 1.13e-13 -8.6 2.15e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.1833728833927914e+01 1.1833728833927913e+0
4
Dual infeasibility......: 1.1265681849314348e-13 1.1265681849314348e-1
0
Constraint violation....: 6.8833827526759706e-15 6.8833827526759706e-1
5
Complementarity.........: 2.5059154942869412e-09 2.5059154942869410e-0
6
Overall NLP error.......: 2.5059154942869412e-09 2.5059154942869410e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891839e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0614875e+02 9.19e+03 5.23e+01 -1.0 8.94e+03 - 8.31e-05 1.02e-0
4h 1
3 8.8589053e+02 9.18e+03 5.23e+01 -1.0 9.18e+03 - 4.99e-06 1.11e-0
3f 1
4 4.8290407e+02 8.97e+03 5.24e+01 -1.0 9.18e+03 - 1.26e-03 2.28e-0
2h 1
5 2.1194856e+04 6.67e-02 7.66e+01 -1.0 8.97e+03 - 8.32e-02 1.00e+0
0h 1
6 1.3110859e+04 6.01e-02 3.76e+01 -1.0 2.89e+01 - 4.83e-01 9.02e-0
2f 1
7 1.1611939e+04 1.94e-02 1.53e+01 -1.0 1.53e+01 - 6.18e-01 7.42e-0
1f 1
8 1.1669715e+04 5.64e-03 1.25e+00 -1.0 2.10e+00 - 9.91e-01 5.00e-0
1f 2
9 1.1851856e+04 3.17e-04 6.99e-02 -1.0 2.45e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1303065e+04 2.21e-03 9.19e-02 -2.5 2.21e+01 - 8.56e-01 8.21e-0
1f 1
11 1.1134535e+04 2.12e-03 4.58e-01 -2.5 3.77e+00 - 1.00e+00 7.49e-0
1f 1
12 1.1105283e+04 1.58e-04 4.78e-03 -2.5 9.43e-01 - 1.00e+00 1.00e+0
0h 1
13 1.1088904e+04 4.25e-05 1.63e-01 -3.8 2.68e+00 - 1.00e+00 7.50e-0
1h 1
14 1.1084573e+04 1.45e-07 3.58e-04 -3.8 6.70e-01 - 1.00e+00 1.00e+0
0f 1
15 1.1083348e+04 2.78e-08 9.22e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 1.1083335e+04 1.87e-12 1.33e-08 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
17 1.1083321e+04 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.1083320729402541e+01 1.1083320729402540e+0
4
Dual infeasibility......: 4.4776956318084407e-09 4.4776956318084407e-0
6
Constraint violation....: 2.6306734568493084e-12 2.6306734568493084e-1
2
Complementarity.........: 3.6085004332201196e-09 3.6085004332201193e-0
6
Overall NLP error.......: 4.4776956318084407e-09 4.4776956318084407e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0889707e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0591739e+02 6.71e+03 5.23e+01 -1.0 5.95e+03 - 4.04e-05 1.12e-0
4h 1
3 7.6488234e+02 6.66e+03 5.24e+01 -1.0 6.70e+03 - 1.70e-05 6.81e-0
3h 1
4 4.6074227e+02 6.52e+03 5.21e+01 -1.0 6.66e+03 - 8.31e-03 2.09e-0
2h 1
5 1.6247928e+04 7.43e-02 7.77e+01 -1.0 6.52e+03 - 8.93e-02 1.00e+0
0h 1
6 1.0403222e+04 6.60e-02 2.72e+01 -1.0 2.46e+01 - 6.25e-01 1.03e-0
1f 1
7 8.8840631e+03 1.77e-02 6.66e+00 -1.0 1.48e+01 - 7.64e-01 8.19e-0
1f 1
8 9.0908602e+03 9.00e-03 6.86e-01 -1.0 4.18e+00 - 9.88e-01 4.95e-0
1f 2
9 8.8136214e+03 1.08e-02 1.04e+00 -1.7 1.01e+01 - 1.93e-01 8.25e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.8095601e+03 5.48e-04 6.79e-01 -1.7 9.28e+00 - 7.26e-01 1.00e+0
0f 1
11 8.8030421e+03 1.44e-04 3.36e-02 -1.7 1.33e+01 - 9.46e-01 1.00e+0
0h 1
12 8.6328194e+03 6.10e-04 2.51e-02 -2.5 2.50e+01 - 9.60e-01 9.63e-0
1f 1
13 8.6044088e+03 1.58e-04 7.59e-02 -3.8 7.10e+00 - 9.79e-01 8.38e-0
1h 1
14 8.6017619e+03 2.07e-07 1.20e-01 -3.8 1.16e+00 - 9.07e-01 1.00e+0
0h 1
15 8.6016820e+03 4.92e-09 3.26e-05 -3.8 1.65e-04 - 1.00e+00 1.00e+0
0h 1
16 8.6003684e+03 1.92e-08 3.88e-03 -5.7 2.97e-01 - 1.00e+00 9.68e-0
1f 1
17 8.6003325e+03 5.75e-12 2.62e-08 -5.7 9.60e-03 - 1.00e+00 1.00e+0
0f 1
18 8.6003159e+03 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 8.6003159174740791e+00 8.6003159174740795e+0
3
Dual infeasibility......: 4.4780423037048169e-09 4.4780423037048169e-0
6
Constraint violation....: 2.6340318814987995e-12 2.6340318814987995e-1
2
Complementarity.........: 3.6085482179517637e-09 3.6085482179517636e-0
6
Overall NLP error.......: 4.4780423037048169e-09 4.4780423037048169e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8775283e+02 4.77e+03 5.24e+01 -1.0 4.82e+03 - 6.64e-04 9.80e-0
3f 1
2 8.8490545e+02 4.77e+03 5.24e+01 -1.0 4.54e+03 - 9.09e-05 1.04e-0
4h 1
3 8.3891577e+02 4.76e+03 5.24e+01 -1.0 4.77e+03 - 9.27e-06 2.02e-0
3f 1
4 3.6771363e+02 4.66e+03 5.24e+01 -1.0 4.76e+03 - 2.59e-03 2.19e-0
2h 1
5 1.5982222e+04 6.47e-02 7.88e+01 -1.0 4.66e+03 - 6.69e-02 1.00e+0
0h 1
6 8.2942245e+03 5.93e-02 4.78e+01 -1.0 5.43e+01 - 3.77e-01 7.64e-0
2f 1
7 6.9811109e+03 2.94e-02 2.07e+01 -1.0 2.67e+01 - 5.54e-01 4.62e-0
1f 1
8 6.4193393e+03 6.17e-03 1.02e+00 -1.0 9.91e+00 - 9.28e-01 7.77e-0
1f 1
9 6.6977348e+03 2.38e-04 6.93e-02 -1.0 3.42e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0467842e+03 2.17e-03 8.37e-02 -2.5 5.05e+00 - 8.70e-01 8.75e-0
1f 1
11 5.9396938e+03 1.10e-03 4.47e-01 -2.5 8.28e-01 - 1.00e+00 6.10e-0
1f 1
12 5.9395944e+03 2.61e-06 8.30e-03 -2.5 1.67e-01 - 1.00e+00 1.00e+0
0h 1
13 5.9215589e+03 6.87e-06 1.24e-02 -3.8 2.68e+00 - 9.05e-01 8.92e-0
1f 1
14 5.9183066e+03 4.65e-04 4.13e-04 -3.8 2.89e-01 - 1.00e+00 1.00e+0
0f 1
15 5.9173127e+03 6.28e-05 1.14e-02 -5.7 1.49e-01 - 8.14e-01 1.00e+0
0h 1
16 5.9171977e+03 3.58e-05 4.03e-05 -5.7 9.65e-03 - 1.00e+00 1.00e+0
0h 1
17 5.9171990e+03 1.44e-06 2.56e-05 -5.7 1.50e-03 - 1.00e+00 9.93e-0
1h 1
18 5.9172014e+03 3.51e-08 4.96e-07 -5.7 2.91e-04 - 1.00e+00 1.00e+0
0f 1
19 5.9171868e+03 3.95e-08 7.31e-06 -8.6 1.84e-03 - 9.97e-01 9.81e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 5.9171865e+03 5.37e-13 2.98e-11 -8.6 3.55e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 5.9171865381694486e+00 5.9171865381694488e+0
3
Dual infeasibility......: 2.9758892113149018e-11 2.9758892113149018e-0
8
Constraint violation....: 5.3701487701118822e-13 5.3701487701118822e-1
3
Complementarity.........: 2.5100799351769442e-09 2.5100799351769440e-0
6
Overall NLP error.......: 2.5100799351769442e-09 2.5100799351769440e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9473874e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3h 1
2 8.9143292e+02 3.24e+03 5.24e+01 -1.0 2.62e+03 - 4.85e-05 1.23e-0
4h 1
3 5.1813424e+02 3.19e+03 5.24e+01 -1.0 3.24e+03 - 3.31e-05 1.54e-0
2f 1
4 4.4980872e+02 3.11e+03 5.12e+01 -1.0 3.19e+03 - 2.40e-02 2.62e-0
2f 1
5 9.7252669e+03 8.18e-02 7.70e+01 -1.0 3.11e+03 - 1.16e-01 1.00e+0
0h 1
6 6.1329517e+03 7.03e-02 1.96e+01 -1.0 2.92e+01 - 7.30e-01 1.45e-0
1f 1
7 4.8587707e+03 1.43e-02 8.63e-01 -1.0 1.60e+01 - 9.43e-01 8.10e-0
1f 1
8 5.2613069e+03 6.24e-03 9.40e-01 -1.0 4.92e+00 - 1.36e-01 9.43e-0
1f 1
9 5.4826749e+03 2.84e-03 1.26e+00 -1.0 5.54e+00 - 6.43e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.4500745e+03 1.04e-03 1.65e-01 -1.0 1.44e+01 - 6.08e-01 1.00e+0
0f 1
11 4.8418380e+03 1.98e-03 8.02e-02 -1.7 2.99e+00 - 1.00e+00 1.00e+0
0f 1
12 4.6231254e+03 2.06e-03 8.59e-02 -2.5 2.20e+01 - 9.04e-01 8.40e-0
1f 1
13 4.6005230e+03 1.79e-04 5.66e-03 -2.5 3.40e+00 - 1.00e+00 1.00e+0
0h 1
14 4.5776675e+03 2.52e-05 3.93e-02 -3.8 5.36e+00 - 1.00e+00 8.83e-0
1h 1
15 4.5757766e+03 6.19e-08 6.00e-04 -3.8 6.26e-01 - 1.00e+00 1.00e+0
0f 1
16 4.5743257e+03 4.19e-08 5.35e-05 -5.7 2.97e-01 - 1.00e+00 9.98e-0
1f 1
17 4.5743268e+03 1.88e-12 1.30e-08 -5.7 6.00e-04 - 1.00e+00 1.00e+0
0f 1
18 4.5743102e+03 2.57e-12 3.30e-06 -8.6 3.68e-03 - 1.00e+00 9.99e-0
1f 1
19 4.5743102e+03 1.65e-15 4.86e-14 -8.6 1.55e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 4.5743101930435603e+00 4.5743101930435605e+0
3
Dual infeasibility......: 4.8623089406542678e-14 4.8623089406542678e-1
1
Constraint violation....: 1.6501827321679111e-15 1.6501827321679111e-1
5
Complementarity.........: 2.7354199232942825e-09 2.7354199232942826e-0
6
Overall NLP error.......: 2.7354199232942825e-09 2.7354199232942826e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8047271e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.82e-0
3h 1
2 8.7572175e+02 2.00e+03 5.24e+01 -1.0 1.12e+03 - 4.57e-05 1.77e-0
4h 1
3 8.5856299e+02 2.00e+03 5.24e+01 -1.0 1.99e+03 - 9.83e-05 6.70e-0
4h 1
4 2.9495283e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 7.60e-04 2.24e-0
2f 1
5 1.3917078e+04 6.17e-02 7.93e+01 -1.0 1.95e+03 - 5.68e-02 1.00e+0
0h 1
6 5.5167095e+03 5.73e-02 5.23e+01 -1.0 6.38e+01 - 3.28e-01 6.60e-0
2f 1
7 4.1582126e+03 3.11e-02 2.54e+01 -1.0 3.21e+01 - 5.03e-01 4.22e-0
1f 1
8 3.3871319e+03 1.13e-02 1.99e+00 -1.0 1.10e+01 - 9.20e-01 9.10e-0
1f 1
9 3.8059823e+03 3.36e-04 1.98e-01 -1.0 4.84e+00 - 9.33e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.1154262e+03 1.20e-03 9.57e-01 -1.7 1.95e+01 - 4.67e-01 9.97e-0
1f 1
11 3.1852480e+03 4.48e-05 2.37e-02 -1.7 6.86e+00 - 1.00e+00 1.00e+0
0f 1
12 3.0668122e+03 4.90e-05 1.82e-01 -2.5 2.56e+01 - 1.00e+00 8.60e-0
1f 1
13 3.0614615e+03 8.55e-05 2.75e-03 -2.5 2.84e-01 - 1.00e+00 1.00e+0
0f 1
14 3.0435480e+03 2.48e-04 6.72e-02 -3.8 6.99e+00 - 7.79e-01 9.53e-0
1h 1
15 3.0406304e+03 1.60e-03 1.54e-03 -3.8 3.26e-01 - 9.82e-01 1.00e+0
0f 1
16 3.0406230e+03 8.23e-05 6.19e-05 -3.8 2.30e-02 - 1.00e+00 1.00e+0
0h 1
17 3.0392663e+03 1.30e-04 1.10e-03 -5.7 3.04e-01 - 9.19e-01 1.00e+0
0h 1
18 3.0392284e+03 3.23e-05 6.59e-06 -5.7 8.38e-03 - 1.00e+00 1.00e+0
0h 1
19 3.0392341e+03 1.71e-07 3.29e-06 -5.7 5.94e-04 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 3.0392190e+03 2.64e-08 3.19e-05 -8.6 3.69e-03 - 1.00e+00 9.58e-0
1h 1
21 3.0392184e+03 4.26e-12 5.09e-11 -8.6 1.55e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 3.0392183875497274e+00 3.0392183875497271e+0
3
Dual infeasibility......: 5.0925623619028378e-11 5.0925623619028378e-0
8
Constraint violation....: 4.2575942771350128e-12 4.2575942771350128e-1
2
Complementarity.........: 4.5663151892106471e-09 4.5663151892106467e-0
6
Overall NLP error.......: 4.5663151892106471e-09 4.5663151892106467e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6577131e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 4.97e-04 9.85e-0
3h 1
2 8.5529111e+02 9.17e+02 5.24e+01 -1.0 6.82e+02 - 7.34e-05 3.86e-0
4h 1
3 2.6219590e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 3.43e-04 2.22e-0
2f 1
4 1.2935511e+04 5.94e-02 8.01e+01 -1.0 8.97e+02 - 4.97e-02 1.00e+0
0h 1
5 4.2970559e+03 5.55e-02 5.39e+01 -1.0 7.40e+01 - 3.17e-01 5.94e-0
2f 1
6 2.7073797e+03 3.01e-02 2.82e+01 -1.0 3.90e+01 - 4.71e-01 4.32e-0
1f 1
7 2.1347600e+03 1.48e-02 2.63e+00 -1.0 1.10e+01 - 9.18e-01 1.00e+0
0f 1
8 2.4862941e+03 4.51e-04 9.22e-02 -1.0 4.08e+00 - 9.96e-01 1.00e+0
0f 1
9 1.8832014e+03 7.45e-04 3.24e-01 -2.5 8.10e+00 - 8.79e-01 7.42e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8122119e+03 2.44e-04 3.40e-01 -2.5 3.76e+00 - 8.83e-01 1.00e+0
0h 1
11 1.8056619e+03 7.22e-04 4.32e-01 -2.5 1.37e+00 - 1.00e+00 1.89e-0
1h 2
12 1.7859099e+03 1.05e-03 1.21e-02 -2.5 9.15e-01 - 1.00e+00 1.00e+0
0h 1
13 1.7616666e+03 1.22e-03 3.34e-02 -3.8 1.08e+01 - 7.93e-01 1.00e+0
0h 1
14 1.7586347e+03 2.33e-03 9.24e-04 -3.8 3.94e-02 - 1.00e+00 1.00e+0
0h 1
15 1.7589630e+03 4.74e-05 1.26e-04 -3.8 1.52e-02 - 1.00e+00 1.00e+0
0h 1
16 1.7572116e+03 1.04e-04 3.69e-04 -5.7 5.95e-01 - 9.51e-01 9.78e-0
1h 1
17 1.7571923e+03 2.28e-05 3.67e-03 -5.7 1.32e-02 - 1.00e+00 7.82e-0
1h 1
18 1.7571934e+03 8.72e-09 1.22e-06 -5.7 2.88e-03 - 1.00e+00 1.00e+0
0f 1
19 1.7571732e+03 9.04e-09 1.92e-05 -8.6 7.37e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7571729e+03 1.37e-12 6.49e-11 -8.6 1.22e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.7571729180098956e+00 1.7571729180098955e+0
3
Dual infeasibility......: 6.4906241182480470e-11 6.4906241182480477e-0
8
Constraint violation....: 1.3682388555480429e-12 1.3682388555480429e-1
2
Complementarity.........: 2.8405189640191105e-09 2.8405189640191103e-0
6
Overall NLP error.......: 2.8405189640191105e-09 2.8405189640191103e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101521e-01 6.4890146112101525e+0
2
Dual infeasibility......: 4.9126605618489413e-09 4.9126605618489413e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984918224e-09 4.3646094984918221e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605618489413e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318724481455e-09 2.1031318724481455e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896894379e-09 2.8882108896894380e-0
6
Overall NLP error.......: 2.8882108896894379e-09 2.8882108896894380e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101521e-01 6.4890146112101525e+0
2
Dual infeasibility......: 4.9126605618489413e-09 4.9126605618489413e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984918224e-09 4.3646094984918221e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605618489413e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.04e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.57e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235660171e+00 1.6104063235660171e+0
3
Dual infeasibility......: 2.4574009793760635e-12 2.4574009793760635e-0
9
Constraint violation....: 7.5703172614159067e-16 7.5703172614159067e-1
6
Complementarity.........: 2.5062163919681798e-09 2.5062163919681799e-0
6
Overall NLP error.......: 2.5062163919681798e-09 2.5062163919681799e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2329662e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 3.31e-04 9.85e-0
3h 1
2 8.1338739e+02 9.17e+02 5.24e+01 -1.0 6.65e+02 - 7.53e-05 3.59e-0
4h 1
3 2.4215012e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 3.16e-04 2.12e-0
2f 1
4 1.2572829e+04 5.49e-02 8.23e+01 -1.0 8.98e+02 - 3.81e-02 1.00e+0
0h 1
5 3.9012337e+03 5.24e-02 5.73e+01 -1.0 8.21e+01 - 3.02e-01 4.95e-0
2f 1
6 1.9122630e+03 3.74e-02 3.08e+01 -1.0 3.92e+01 - 4.67e-01 5.07e-0
1f 1
7 4.6985285e+03 1.23e-02 2.74e+01 -1.0 2.08e+01 - 3.98e-01 1.00e+0
0h 1
8 1.8769618e+03 1.22e-02 1.07e+00 -1.0 2.57e+01 - 9.87e-01 8.88e-0
1f 1
9 1.9956227e+03 2.03e-04 4.84e-02 -1.0 2.76e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7291248e+03 2.21e-04 1.23e+00 -2.5 1.88e+01 - 9.37e-01 5.95e-0
1f 1
11 1.5409848e+03 3.77e-03 1.32e-01 -2.5 7.58e+00 - 7.96e-01 1.00e+0
0f 1
12 1.5181170e+03 5.06e-03 3.08e-01 -2.5 1.81e+00 - 1.00e+00 7.68e-0
1h 1
13 1.5303991e+03 2.38e-04 4.69e-03 -2.5 7.19e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5028095e+03 1.70e-04 2.15e-02 -3.8 1.08e+01 - 9.90e-01 9.29e-0
1h 1
15 1.5018205e+03 7.26e-07 6.85e-05 -3.8 7.35e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003124e+03 3.77e-07 1.78e-04 -5.7 5.94e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003117e+03 3.79e-11 2.92e-09 -5.7 4.21e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932746898947e+00 1.5002932746898946e+0
3
Dual infeasibility......: 2.1737238631674736e-09 2.1737238631674736e-0
6
Constraint violation....: 6.2995761385131743e-11 6.2995761385131743e-1
1
Complementarity.........: 2.8882174480599411e-09 2.8882174480599410e-0
6
Overall NLP error.......: 2.8882174480599411e-09 2.8882174480599410e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6577131e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 4.97e-04 9.85e-0
3h 1
2 8.5529111e+02 9.17e+02 5.24e+01 -1.0 6.82e+02 - 7.34e-05 3.86e-0
4h 1
3 2.6219590e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 3.43e-04 2.22e-0
2f 1
4 1.2935511e+04 5.94e-02 8.01e+01 -1.0 8.97e+02 - 4.97e-02 1.00e+0
0h 1
5 4.2970559e+03 5.55e-02 5.39e+01 -1.0 7.40e+01 - 3.17e-01 5.94e-0
2f 1
19 1.183955e+04 1.632511e+04 2.679585e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6794703e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.80e-0
3f 1
2 7.6502061e+02 1.57e+04 5.25e+01 -1.0 1.45e+04 - 3.26e-05 1.07e-0
4h 1
3 7.5970888e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 1.09e-05 4.21e-0
4h 1
4 7.4006040e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 4.28e-04 1.62e-0
3h 1
5 5.4616357e+02 1.54e+04 5.27e+01 -1.0 1.57e+04 - 2.19e-03 1.98e-0
2f 1
6 2.5834782e+04 6.20e-02 8.49e+01 -1.0 1.54e+04 - 3.11e-02 1.00e+0
0h 1
7 1.8221463e+04 5.94e-02 6.23e+01 -1.0 7.09e+01 - 2.71e-01 4.53e-0
2f 1
8 1.6686230e+04 4.57e-02 3.01e+01 -1.0 2.89e+01 - 5.11e-01 4.31e-0
1f 1
9 1.6972631e+04 3.13e-02 1.13e+01 -1.0 1.57e+01 - 4.78e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6784039e+04 5.33e-03 2.91e-01 -1.0 3.92e+00 - 9.82e-01 1.00e+0
0h 1
11 1.6496393e+04 1.04e-03 1.40e+00 -1.7 4.60e+00 - 2.89e-01 8.78e-0
1f 1
12 1.6486158e+04 1.54e-04 7.66e-01 -1.7 3.89e+00 - 6.21e-01 1.00e+0
0f 1
13 1.6473226e+04 1.12e-04 2.14e-01 -1.7 8.18e+00 - 6.71e-01 1.00e+0
0f 1
14 1.6483964e+04 1.62e-05 3.91e-02 -1.7 1.39e+01 - 8.08e-01 1.00e+0
0h 1
15 1.6366836e+04 9.61e-04 4.93e-02 -2.5 2.07e+01 - 9.23e-01 1.00e+0
0f 1
16 1.6345009e+04 1.12e-03 1.19e-02 -2.5 2.58e+00 - 1.00e+00 1.00e+0
0h 1
17 1.6327942e+04 1.89e-04 8.58e-02 -3.8 5.61e+00 - 1.00e+00 8.53e-0
1h 1
18 1.6326334e+04 5.70e-07 1.01e-04 -3.8 6.95e-01 - 1.00e+00 1.00e+0
0h 1
19 1.6325118e+04 4.00e-07 1.11e-04 -5.7 2.97e-01 - 1.00e+00 9.97e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325120e+04 3.81e-11 2.98e-09 -5.7 9.86e-03 - 1.00e+00 1.00e+0
0f 1
21 1.6325105e+04 6.20e-11 4.49e-06 -8.6 3.68e-03 - 1.00e+00 9.93e-0
1h 1
22 1.6325105e+04 3.83e-15 1.11e-13 -8.6 4.65e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.6325105199638781e+01 1.6325105199638780e+0
4
Dual infeasibility......: 1.1086775341329479e-13 1.1086775341329479e-1
0
Constraint violation....: 3.8302694349567901e-15 3.8302694349567901e-1
5
Complementarity.........: 4.8553875792021480e-09 4.8553875792021479e-0
6
Overall NLP error.......: 4.8553875792021480e-09 4.8553875792021479e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.1742627e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 3.14e-04 9.80e-0
3h 1
2 8.1450130e+02 1.50e+04 5.24e+01 -1.0 1.37e+04 - 3.16e-05 1.08e-0
4h 1
3 8.1193409e+02 1.50e+04 5.24e+01 -1.0 1.49e+04 - 1.19e-05 1.93e-0
4h 1
4 8.0369066e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 2.02e-04 6.31e-0
4h 1
5 5.4537950e+02 1.47e+04 5.26e+01 -1.0 1.50e+04 - 8.55e-04 2.09e-0
2f 1
6 2.6210194e+04 5.52e-02 8.27e+01 -1.0 1.47e+04 - 3.74e-02 1.00e+0
0h 1
7 1.7873102e+04 5.26e-02 5.67e+01 -1.0 7.93e+01 - 3.13e-01 4.94e-0
2f 1
8 1.5963222e+04 3.89e-02 2.99e+01 -1.0 3.79e+01 - 4.75e-01 4.93e-0
1f 1
9 1.6299986e+04 2.36e-02 1.36e+01 -1.0 1.97e+01 - 4.09e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6040816e+04 6.18e-03 2.88e-01 -1.0 5.22e+00 - 9.84e-01 1.00e+0
0h 1
11 1.5744500e+04 1.37e-03 3.58e-01 -1.7 5.09e+00 - 1.00e+00 8.40e-0
1f 1
12 1.5733904e+04 8.44e-04 1.73e-02 -1.7 4.05e+01 - 9.40e-01 1.00e+0
0f 1
13 1.5593614e+04 1.18e-03 4.92e-02 -2.5 3.95e+01 - 9.19e-01 1.00e+0
0f 1
14 1.5578911e+04 1.22e-03 1.45e-02 -2.5 1.98e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5562312e+04 2.11e-04 1.00e-01 -3.8 5.50e+00 - 1.00e+00 8.39e-0
1h 1
16 1.5560429e+04 5.41e-07 1.29e-04 -3.8 8.31e-01 - 1.00e+00 1.00e+0
0h 1
17 1.5559216e+04 4.01e-07 1.46e-04 -5.7 2.97e-01 - 1.00e+00 9.97e-0
1h 1
18 1.5559217e+04 3.87e-11 2.98e-09 -5.7 4.09e-02 - 1.00e+00 1.00e+0
0f 1
19 1.5559202e+04 6.30e-11 2.14e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.5559202124408815e+01 1.5559202124408814e+0
4
Dual infeasibility......: 2.1395193314383213e-09 2.1395193314383213e-0
6
Constraint violation....: 6.2995594851678050e-11 6.2995594851678050e-1
1
Complementarity.........: 2.9979548162031756e-09 2.9979548162031756e-0
6
Overall NLP error.......: 2.9979548162031756e-09 2.9979548162031756e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.5244627e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 4.26e-04 9.80e-0
3h 1
2 8.4952641e+02 1.39e+04 5.24e+01 -1.0 1.26e+04 - 3.05e-05 1.09e-0
4h 1
3 8.4739692e+02 1.39e+04 5.24e+01 -1.0 1.38e+04 - 1.33e-05 1.51e-0
4h 1
4 8.3992760e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 1.61e-04 5.36e-0
4h 1
5 5.4695613e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 7.12e-04 2.17e-0
2f 1
6 2.5535411e+04 5.83e-02 8.09e+01 -1.0 1.36e+04 - 4.73e-02 1.00e+0
0h 1
7 1.7098399e+04 5.46e-02 5.27e+01 -1.0 7.76e+01 - 3.39e-01 5.77e-0
2f 1
8 1.5158813e+04 3.01e-02 2.83e+01 -1.0 4.19e+01 - 4.67e-01 4.97e-0
1f 1
9 1.5469694e+04 6.87e-03 2.60e+00 -1.0 1.62e+01 - 9.21e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5055384e+04 1.58e-03 1.32e-01 -1.0 1.00e+01 - 9.96e-01 1.00e+0
0f 1
11 1.4766457e+04 8.38e-04 1.34e+00 -2.5 6.05e+00 - 9.28e-01 5.48e-0
1f 1
12 1.4604456e+04 1.00e-03 3.38e-01 -2.5 6.24e+00 - 7.74e-01 1.00e+0
0f 1
13 1.4563933e+04 1.81e-03 9.14e-02 -2.5 2.60e+00 - 1.00e+00 8.26e-0
1h 1
14 1.4568586e+04 3.95e-04 2.30e-03 -2.5 2.58e-01 - 1.00e+00 1.00e+0
0h 1
15 1.4549687e+04 4.44e-04 6.16e-02 -3.8 5.45e+00 - 7.95e-01 9.24e-0
1h 1
16 1.4546337e+04 1.28e-03 1.51e-03 -3.8 3.70e-01 - 1.00e+00 1.00e+0
0h 1
17 1.4546509e+04 6.64e-06 4.10e-05 -3.8 5.00e-03 - 1.00e+00 1.00e+0
0h 1
18 1.4545177e+04 3.66e-05 1.59e-04 -5.7 2.97e-01 - 9.71e-01 1.00e+0
0h 1
19 1.4545174e+04 7.15e-08 1.53e-07 -5.7 4.98e-04 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.4545158e+04 6.19e-09 4.98e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.4545157871967588e+01 1.4545157871967587e+0
4
Dual infeasibility......: 4.9756478731620287e-09 4.9756478731620287e-0
6
Constraint violation....: 6.1932919903640027e-09 6.1932919903640027e-0
9
Complementarity.........: 4.3455250013976081e-09 4.3455250013976080e-0
6
Overall NLP error.......: 6.1932919903640027e-09 4.9756478731620287e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4546668e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.98e-04 9.81e-0
3h 1
2 8.4238440e+02 1.26e+04 5.24e+01 -1.0 1.06e+04 - 2.40e-05 1.19e-0
4h 1
3 8.3888607e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 2.35e-05 2.27e-0
4h 1
4 8.3319704e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 2.47e-04 3.75e-0
4h 1
5 5.1379027e+02 1.24e+04 5.26e+01 -1.0 1.26e+04 - 6.46e-04 2.17e-0
2f 1
6 2.4210351e+04 5.75e-02 8.12e+01 -1.0 1.24e+04 - 4.61e-02 1.00e+0
0h 1
7 1.5779293e+04 5.39e-02 5.22e+01 -1.0 7.92e+01 - 3.48e-01 5.67e-0
2f 1
8 1.3665613e+04 3.43e-02 2.83e+01 -1.0 4.22e+01 - 4.67e-01 5.35e-0
1f 1
9 1.4114459e+04 1.83e-02 6.33e+00 -1.0 2.14e+01 - 6.39e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3812010e+04 5.36e-03 4.92e-01 -1.0 6.60e+00 - 9.50e-01 1.00e+0
0h 1
11 1.3461591e+04 1.46e-03 4.69e-01 -1.7 6.25e+00 - 9.84e-01 7.88e-0
1f 1
12 1.3437127e+04 5.69e-04 4.67e-01 -1.7 4.57e+01 - 8.42e-02 1.00e+0
0f 1
13 1.3439662e+04 1.81e-05 1.59e-03 -1.7 7.09e+00 - 1.00e+00 1.00e+0
0h 1
14 1.3272973e+04 1.08e-03 7.89e-02 -3.8 6.21e+01 - 7.77e-01 8.75e-0
1f 1
15 1.3232680e+04 2.57e-03 5.47e-01 -3.8 2.56e+00 - 1.51e-01 8.39e-0
1h 1
16 1.3233535e+04 8.19e-04 3.37e-01 -3.8 2.84e-02 - 1.00e+00 7.52e-0
1h 1
17 1.3234269e+04 8.24e-07 1.34e-04 -3.8 2.96e-02 - 1.00e+00 1.00e+0
0f 1
18 1.3233077e+04 4.31e-07 2.31e-03 -5.7 3.01e-01 - 1.00e+00 9.77e-0
1h 1
19 1.3233066e+04 4.77e-11 2.27e-08 -5.7 5.21e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.3233051e+04 6.30e-11 4.40e-09 -8.6 3.69e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.3233050904136100e+01 1.3233050904136100e+0
4
Dual infeasibility......: 4.3998543777068270e-09 4.3998543777068270e-0
6
Constraint violation....: 6.2989558013981650e-11 6.2989558013981650e-1
1
Complementarity.........: 3.3090021644864388e-09 3.3090021644864385e-0
6
Overall NLP error.......: 4.3998543777068270e-09 4.3998543777068270e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6594474e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 4.93e-04 9.80e-0
3h 1
2 8.6315174e+02 1.11e+04 5.24e+01 -1.0 1.09e+04 - 9.14e-05 1.01e-0
4h 1
3 8.4948932e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 3.90e-06 8.20e-0
4f 1
4 4.9486190e+02 1.09e+04 5.25e+01 -1.0 1.11e+04 - 9.00e-04 2.20e-0
2h 1
5 2.2854216e+04 5.99e-02 8.02e+01 -1.0 1.09e+04 - 5.07e-02 1.00e+0
0h 1
6 1.4466346e+04 5.59e-02 5.30e+01 -1.0 7.27e+01 - 3.29e-01 6.07e-0
2f 1
7 1.2864409e+04 3.01e-02 2.74e+01 -1.0 3.90e+01 - 4.76e-01 4.36e-0
1f 1
8 1.2339785e+04 1.42e-02 2.53e+00 -1.0 1.09e+01 - 9.19e-01 1.00e+0
0f 1
9 1.2647759e+04 4.25e-04 9.26e-02 -1.0 4.26e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2081649e+04 6.44e-04 4.19e-01 -2.5 7.83e+00 - 8.85e-01 7.10e-0
1f 1
11 1.2001686e+04 2.66e-04 3.54e-01 -2.5 2.72e+00 - 8.81e-01 1.00e+0
0h 1
12 1.1995423e+04 6.97e-04 4.68e-01 -2.5 1.50e+00 - 1.00e+00 1.64e-0
1h 2
13 1.1973214e+04 1.23e-03 1.29e-02 -2.5 1.03e+00 - 1.00e+00 1.00e+0
0h 1
14 1.1956860e+04 1.27e-03 3.45e-02 -3.8 2.68e+00 - 7.93e-01 1.00e+0
0h 1
15 1.1953786e+04 2.37e-03 9.10e-04 -3.8 4.08e-02 - 1.00e+00 1.00e+0
0h 1
16 1.1954143e+04 4.21e-05 1.58e-04 -3.8 1.53e-02 - 1.00e+00 1.00e+0
0h 1
17 1.1952816e+04 1.04e-04 3.43e-04 -5.7 1.49e-01 - 9.51e-01 9.75e-0
1h 1
18 1.1952804e+04 2.27e-05 4.04e-03 -5.7 3.65e-03 - 1.00e+00 7.83e-0
1h 1
19 1.1952807e+04 8.07e-09 1.19e-06 -5.7 7.91e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.1952792e+04 8.86e-09 2.07e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
21 1.1952792e+04 1.47e-12 7.02e-11 -8.6 3.09e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.1952792222382847e+01 1.1952792222382846e+0
4
Dual infeasibility......: 7.0179427949307183e-11 7.0179427949307183e-0
8
Constraint violation....: 1.4709344853258699e-12 1.4709344853258699e-1
2
Complementarity.........: 2.5093482959273507e-09 2.5093482959273505e-0
6
Overall NLP error.......: 2.5093482959273507e-09 2.5093482959273505e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891839e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0614875e+02 9.19e+03 5.23e+01 -1.0 8.94e+03 - 8.31e-05 1.02e-0
4h 1
3 8.8589053e+02 9.18e+03 5.23e+01 -1.0 9.18e+03 - 4.99e-06 1.11e-0
3f 1
4 4.8290407e+02 8.97e+03 5.24e+01 -1.0 9.18e+03 - 1.26e-03 2.28e-0
2h 1
5 2.1194856e+04 6.67e-02 7.66e+01 -1.0 8.97e+03 - 8.32e-02 1.00e+0
0h 1
6 1.3110859e+04 6.01e-02 3.76e+01 -1.0 2.89e+01 - 4.83e-01 9.02e-0
2f 1
7 1.1611939e+04 1.94e-02 1.53e+01 -1.0 1.53e+01 - 6.18e-01 7.42e-0
1f 1
8 1.1669715e+04 5.64e-03 1.25e+00 -1.0 2.10e+00 - 9.91e-01 5.00e-0
1f 2
9 1.1851856e+04 3.17e-04 6.99e-02 -1.0 2.45e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1303065e+04 2.21e-03 9.19e-02 -2.5 2.21e+01 - 8.56e-01 8.21e-0
1f 1
11 1.1134535e+04 2.12e-03 4.58e-01 -2.5 3.77e+00 - 1.00e+00 7.49e-0
1f 1
12 1.1105283e+04 1.58e-04 4.78e-03 -2.5 9.43e-01 - 1.00e+00 1.00e+0
0h 1
13 1.1088904e+04 4.25e-05 1.63e-01 -3.8 2.68e+00 - 1.00e+00 7.50e-0
1h 1
14 1.1084573e+04 1.45e-07 3.58e-04 -3.8 6.70e-01 - 1.00e+00 1.00e+0
0f 1
15 1.1083348e+04 2.78e-08 9.22e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 1.1083335e+04 1.87e-12 1.33e-08 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
17 1.1083321e+04 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.1083320731110767e+01 1.1083320731110767e+0
4
Dual infeasibility......: 4.4776953091837555e-09 4.4776953091837555e-0
6
Constraint violation....: 2.6306248845919811e-12 2.6306248845919811e-1
2
Complementarity.........: 3.6085004295343711e-09 3.6085004295343711e-0
6
Overall NLP error.......: 4.4776953091837555e-09 4.4776953091837555e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0889707e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0591739e+02 6.71e+03 5.23e+01 -1.0 5.95e+03 - 4.04e-05 1.12e-0
4h 1
3 7.6488222e+02 6.66e+03 5.24e+01 -1.0 6.70e+03 - 1.70e-05 6.81e-0
3h 1
4 4.6074232e+02 6.52e+03 5.21e+01 -1.0 6.66e+03 - 8.31e-03 2.09e-0
2h 1
5 1.6247926e+04 7.43e-02 7.77e+01 -1.0 6.52e+03 - 8.93e-02 1.00e+0
0h 1
6 1.0403222e+04 6.60e-02 2.72e+01 -1.0 2.46e+01 - 6.25e-01 1.03e-0
1f 1
7 8.8840628e+03 1.77e-02 6.66e+00 -1.0 1.48e+01 - 7.64e-01 8.19e-0
1f 1
8 9.0908601e+03 9.00e-03 6.87e-01 -1.0 4.18e+00 - 9.94e-01 4.95e-0
1f 2
9 8.8190584e+03 1.08e-02 2.65e-01 -1.7 1.63e+01 - 9.95e-01 8.25e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.8018398e+03 2.88e-03 8.76e-01 -1.7 2.58e+01 - 1.00e+00 5.00e-0
1h 2
11 8.8088934e+03 2.09e-04 1.57e-02 -1.7 1.31e+01 - 1.00e+00 1.00e+0
0h 1
12 8.6330339e+03 5.34e-04 2.64e-02 -3.8 3.99e+01 - 8.43e-01 8.25e-0
1f 1
13 8.6045117e+03 1.40e-04 7.76e-02 -3.8 6.88e+00 - 9.81e-01 8.40e-0
1h 1
14 8.6017603e+03 1.88e-07 9.17e-02 -3.8 1.10e+00 - 9.27e-01 1.00e+0
0h 1
15 8.6016820e+03 4.69e-09 2.83e-05 -3.8 1.63e-04 - 1.00e+00 1.00e+0
0h 1
16 8.6003684e+03 1.92e-08 3.89e-03 -5.7 2.97e-01 - 1.00e+00 9.68e-0
1f 1
17 8.6003325e+03 5.76e-12 2.63e-08 -5.7 9.61e-03 - 1.00e+00 1.00e+0
0f 1
18 8.6003159e+03 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 8.6003159183178255e+00 8.6003159183178250e+0
3
Dual infeasibility......: 4.4780427858698518e-09 4.4780427858698518e-0
6
Constraint violation....: 2.6338653480451057e-12 2.6338653480451057e-1
2
Complementarity.........: 3.6085482997549715e-09 3.6085482997549713e-0
6
Overall NLP error.......: 4.4780427858698518e-09 4.4780427858698518e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8772454e+02 4.77e+03 5.24e+01 -1.0 4.82e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8463069e+02 4.77e+03 5.24e+01 -1.0 4.12e+03 - 4.65e-05 1.15e-0
4h 1
3 6.9026556e+02 4.73e+03 5.24e+01 -1.0 4.77e+03 - 2.20e-05 8.53e-0
3f 1
4 4.0829903e+02 4.63e+03 5.20e+01 -1.0 4.73e+03 - 1.12e-02 2.07e-0
2h 1
5 1.3286163e+04 7.24e-02 7.77e+01 -1.0 4.63e+03 - 9.89e-02 1.00e+0
0h 1
6 7.8843057e+03 6.35e-02 2.09e+01 -1.0 4.48e+01 - 7.03e-01 1.14e-0
1f 1
7 6.3730705e+03 2.46e-02 2.05e+00 -1.0 2.21e+01 - 9.31e-01 6.56e-0
1f 1
8 6.5551438e+03 3.66e-03 1.08e+00 -1.0 3.60e+00 - 5.38e-01 1.00e+0
0f 1
9 6.7365471e+03 4.53e-04 1.06e+00 -1.0 7.50e+00 - 5.09e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.7267327e+03 7.92e-05 1.41e-01 -1.0 1.41e+01 - 6.29e-01 1.00e+0
0f 1
11 6.1062210e+03 1.84e-03 7.54e-02 -1.7 3.35e+00 - 1.00e+00 1.00e+0
0f 1
12 5.9477483e+03 1.19e-03 2.42e-01 -2.5 2.25e+01 - 9.57e-01 6.69e-0
1f 1
13 5.9424953e+03 1.70e-06 7.41e-03 -2.5 7.38e+00 - 1.00e+00 1.00e+0
0h 1
14 5.9217936e+03 3.92e-06 5.52e-02 -3.8 5.36e+00 - 9.43e-01 8.86e-0
1f 1
15 5.9184144e+03 5.27e-04 6.07e-04 -3.8 6.06e-01 - 1.00e+00 1.00e+0
0f 1
16 5.9173075e+03 5.36e-05 1.05e-02 -5.7 2.97e-01 - 8.29e-01 1.00e+0
0h 1
17 5.9171985e+03 3.23e-05 3.59e-05 -5.7 9.15e-03 - 1.00e+00 1.00e+0
0h 1
18 5.9172014e+03 5.70e-07 6.03e-06 -5.7 1.14e-03 - 1.00e+00 1.00e+0
0h 1
19 5.9171874e+03 3.97e-08 8.05e-05 -8.6 3.68e-03 - 1.00e+00 9.42e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 5.9171865e+03 7.74e-12 6.99e-11 -8.6 2.12e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 5.9171865396605314e+00 5.9171865396605317e+0
3
Dual infeasibility......: 6.9873222948423834e-11 6.9873222948423841e-0
8
Constraint violation....: 7.7382544816373411e-12 7.7382544816373411e-1
2
Complementarity.........: 3.0006719014863967e-09 3.0006719014863968e-0
6
Overall NLP error.......: 3.0006719014863967e-09 3.0006719014863968e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9469463e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3h 1
2 8.9070845e+02 3.24e+03 5.24e+01 -1.0 2.13e+03 - 3.61e-05 1.51e-0
4h 1
3 3.3042115e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 6.40e-05 2.31e-0
2f 1
4 1.5680539e+04 6.28e-02 8.02e+01 -1.0 3.17e+03 - 3.82e-02 1.00e+0
0h 1
5 7.1096017e+03 5.94e-02 5.80e+01 -1.0 5.03e+01 - 2.72e-01 4.93e-0
2f 1
6 5.7281758e+03 2.48e-02 2.85e+01 -1.0 2.32e+01 - 5.13e-01 5.39e-0
1f 1
7 5.1166765e+03 1.01e-02 1.45e+00 -1.0 8.86e+00 - 9.34e-01 7.73e-0
1f 1
8 5.4253178e+03 3.01e-04 8.56e-02 -1.0 3.30e+00 - 9.98e-01 1.00e+0
0f 1
9 4.7994735e+03 2.08e-03 7.85e-02 -2.5 4.57e+00 - 8.62e-01 8.55e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.6288739e+03 2.21e-03 3.37e-01 -2.5 1.13e+00 - 1.00e+00 7.83e-0
1f 1
11 4.6027982e+03 1.46e-04 4.55e-03 -2.5 2.65e-01 - 1.00e+00 1.00e+0
0h 1
12 4.5779306e+03 2.16e-05 4.20e-02 -3.8 8.05e+00 - 1.00e+00 8.86e-0
1h 1
13 4.5759311e+03 5.62e-08 5.97e-04 -3.8 9.13e-01 - 1.00e+00 1.00e+0
0f 1
14 4.5743283e+03 4.27e-08 6.34e-05 -5.7 4.46e-01 - 1.00e+00 9.98e-0
1f 1
15 4.5743286e+03 1.89e-12 1.38e-08 -5.7 1.04e-03 - 1.00e+00 1.00e+0
0f 1
16 4.5743102e+03 2.57e-12 3.30e-06 -8.6 5.53e-03 - 1.00e+00 9.99e-0
1f 1
17 4.5743102e+03 7.11e-15 4.85e-14 -8.6 2.72e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 4.5743101944852746e+00 4.5743101944852742e+0
3
Dual infeasibility......: 4.8511480104457451e-14 4.8511480104457451e-1
1
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.6835257420108816e-09 2.6835257420108816e-0
6
Overall NLP error.......: 2.6835257420108816e-09 2.6835257420108816e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4528265e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 3.98e-04 9.81e-0
3f 1
2 8.4160251e+02 2.00e+03 5.24e+01 -1.0 1.48e+03 - 5.90e-05 1.34e-0
4h 1
3 2.7509537e+02 1.95e+03 5.26e+01 -1.0 2.00e+03 - 4.97e-05 2.18e-0
2f 1
4 1.3978763e+04 5.67e-02 8.10e+01 -1.0 1.95e+03 - 4.46e-02 1.00e+0
0h 1
5 5.1663756e+03 5.32e-02 5.38e+01 -1.0 8.22e+01 - 3.29e-01 5.48e-0
2f 1
6 3.0169279e+03 3.33e-02 2.97e+01 -1.0 4.25e+01 - 4.59e-01 5.39e-0
1f 1
7 5.0512416e+03 9.15e-03 1.65e+01 -1.0 2.43e+01 - 5.91e-01 1.00e+0
0h 1
8 3.0927580e+03 7.42e-03 4.15e-01 -1.0 2.10e+01 - 9.67e-01 1.00e+0
0f 1
9 2.7847845e+03 1.00e-03 1.63e-01 -1.7 5.24e+00 - 1.00e+00 9.12e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.6486959e+03 1.59e-03 2.72e-01 -2.5 6.05e+00 - 7.52e-01 1.00e+0
0f 1
11 2.5962169e+03 4.61e-03 3.97e-02 -2.5 2.93e+00 - 1.00e+00 1.00e+0
0h 1
12 2.6062895e+03 2.11e-04 6.40e-03 -2.5 4.76e-01 - 1.00e+00 1.00e+0
0h 1
13 2.5818658e+03 2.58e-04 4.25e-02 -3.8 5.37e+00 - 9.87e-01 8.87e-0
1h 1
14 2.5806677e+03 1.91e-06 1.63e-04 -3.8 6.01e-01 - 1.00e+00 1.00e+0
0h 1
15 2.5794704e+03 3.21e-07 2.10e-03 -5.7 2.97e-01 - 1.00e+00 9.78e-0
1h 1
16 2.5794585e+03 3.73e-11 2.11e-08 -5.7 6.59e-03 - 1.00e+00 1.00e+0
0f 1
17 2.5794438e+03 6.30e-11 4.40e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 2.5794437810769981e+00 2.5794437810769982e+0
3
Dual infeasibility......: 4.3996205524452753e-09 4.3996205524452753e-0
6
Constraint violation....: 6.3009444883910248e-11 6.3009444883910248e-1
1
Complementarity.........: 4.6276431304258947e-09 4.6276431304258949e-0
6
Overall NLP error.......: 4.6276431304258947e-09 4.6276431304258949e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6507751e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 4.93e-04 9.85e-0
3h 1
2 8.5461309e+02 9.17e+02 5.24e+01 -1.0 6.82e+02 - 7.35e-05 3.85e-0
4h 1
3 2.6184915e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 3.42e-04 2.22e-0
2f 1
4 1.2929369e+04 5.93e-02 8.01e+01 -1.0 8.97e+02 - 4.95e-02 1.00e+0
0h 1
5 4.2893364e+03 5.55e-02 5.39e+01 -1.0 7.44e+01 - 3.17e-01 5.92e-0
2f 1
6 2.6850903e+03 3.00e-02 2.83e+01 -1.0 3.92e+01 - 4.70e-01 4.34e-0
1f 1
7 2.1372838e+03 1.46e-02 2.63e+00 -1.0 1.10e+01 - 9.18e-01 1.00e+0
0f 1
8 2.4660549e+03 4.52e-04 8.88e-02 -1.0 4.19e+00 - 9.96e-01 1.00e+0
0f 1
9 1.8781096e+03 7.12e-04 3.51e-01 -2.5 8.07e+00 - 8.81e-01 7.32e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8031967e+03 2.68e-04 3.45e-01 -2.5 3.83e+00 - 8.80e-01 1.00e+0
0h 1
11 1.7979355e+03 6.77e-04 4.86e-01 -2.5 1.44e+00 - 1.00e+00 1.39e-0
1h 2
12 1.7762417e+03 1.45e-03 1.42e-02 -2.5 9.96e-01 - 1.00e+00 1.00e+0
0h 1
13 1.7516971e+03 1.27e-03 3.44e-02 -3.8 1.08e+01 - 7.93e-01 1.00e+0
0h 1
14 1.7487858e+03 2.19e-03 8.80e-04 -3.8 3.88e-02 - 1.00e+00 1.00e+0
0h 1
15 1.7491529e+03 4.42e-05 1.64e-04 -3.8 1.62e-02 - 1.00e+00 1.00e+0
0h 1
16 1.7473774e+03 1.07e-04 3.92e-04 -5.7 5.95e-01 - 9.51e-01 9.79e-0
1h 1
17 1.7473617e+03 2.25e-05 3.95e-03 -5.7 1.26e-02 - 1.00e+00 7.90e-0
1h 1
18 1.7473630e+03 8.04e-09 1.14e-06 -5.7 2.65e-03 - 1.00e+00 1.00e+0
0f 1
19 1.7473428e+03 8.83e-09 2.07e-05 -8.6 7.37e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7473425e+03 1.48e-12 7.01e-11 -8.6 1.24e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.7473425184375706e+00 1.7473425184375706e+0
3
Dual infeasibility......: 7.0143231493778630e-11 7.0143231493778636e-0
8
Constraint violation....: 1.4758194666342206e-12 1.4758194666342206e-1
2
Complementarity.........: 2.8403611527939575e-09 2.8403611527939575e-0
6
Overall NLP error.......: 2.8403611527939575e-09 2.8403611527939575e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146111909430e-01 6.4890146111909428e+0
2
Dual infeasibility......: 4.9126605652944596e-09 4.9126605652944596e-0
6
Constraint violation....: 6.2123813870940126e-09 6.2123813870940126e-0
9
Complementarity.........: 4.3646094984486179e-09 4.3646094984486175e-0
6
Overall NLP error.......: 6.2123813870940126e-09 4.9126605652944596e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933520e-01 5.8277753147933515e+0
2
Dual infeasibility......: 2.1031320945198554e-09 2.1031320945198554e-0
6
Constraint violation....: 6.2994401361926577e-11 6.2994401361926577e-1
1
Complementarity.........: 2.8882108897061754e-09 2.8882108897061753e-0
6
Overall NLP error.......: 2.8882108897061754e-09 2.8882108897061753e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146111909430e-01 6.4890146111909428e+0
2
Dual infeasibility......: 4.9126605652944596e-09 4.9126605652944596e-0
6
Constraint violation....: 6.2123813870940126e-09 6.2123813870940126e-0
9
Complementarity.........: 4.3646094984486179e-09 4.3646094984486175e-0
6
Overall NLP error.......: 6.2123813870940126e-09 4.9126605652944596e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.04e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.11e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235598023e+00 1.6104063235598023e+0
3
Dual infeasibility......: 2.4576716418374743e-12 2.4576716418374743e-0
9
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5062163919694814e-09 2.5062163919694814e-0
6
Overall NLP error.......: 2.5062163919694814e-09 2.5062163919694814e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2234417e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 3.29e-04 9.86e-0
3h 1
2 8.0850707e+02 9.17e+02 5.24e+01 -1.0 7.37e+02 - 8.13e-05 5.03e-0
4h 1
3 2.4208585e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 4.72e-04 2.11e-0
2f 1
4 1.2483871e+04 5.50e-02 8.24e+01 -1.0 8.98e+02 - 3.81e-02 1.00e+0
0h 1
5 3.8885008e+03 5.25e-02 5.69e+01 -1.0 8.15e+01 - 3.07e-01 4.97e-0
2f 1
6 1.9109576e+03 3.75e-02 3.05e+01 -1.0 3.91e+01 - 4.68e-01 5.05e-0
1f 1
7 4.6824120e+03 1.22e-02 2.71e+01 -1.0 2.06e+01 - 4.00e-01 1.00e+0
0h 1
8 1.8756802e+03 1.20e-02 1.03e+00 -1.0 2.55e+01 - 9.88e-01 8.91e-0
1f 1
9 1.9982545e+03 1.92e-04 4.73e-02 -1.0 3.03e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7319192e+03 2.18e-04 1.23e+00 -2.5 1.85e+01 - 9.37e-01 5.95e-0
1f 1
11 1.5438680e+03 3.77e-03 1.33e-01 -2.5 7.58e+00 - 7.97e-01 1.00e+0
0f 1
12 1.5209377e+03 5.20e-03 3.06e-01 -2.5 1.81e+00 - 1.00e+00 7.69e-0
1h 1
13 1.5332266e+03 2.42e-04 4.66e-03 -2.5 7.13e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5031328e+03 1.70e-04 2.13e-02 -3.8 1.35e+01 - 9.90e-01 9.30e-0
1h 1
15 1.5019710e+03 7.23e-07 6.84e-05 -3.8 9.12e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003147e+03 3.77e-07 1.76e-04 -5.7 7.43e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.79e-11 2.93e-09 -5.7 3.98e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932769026069e+00 1.5002932769026070e+0
3
Dual infeasibility......: 2.1693879755174415e-09 2.1693879755174415e-0
6
Constraint violation....: 6.2995622607253665e-11 6.2995622607253665e-1
1
Complementarity.........: 2.8882170440969754e-09 2.8882170440969752e-0
6
Overall NLP error.......: 2.8882170440969754e-09 2.8882170440969752e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6486496e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 4.93e-04 9.86e-0
3h 1
2 8.4983215e+02 9.17e+02 5.24e+01 -1.0 7.54e+02 - 7.95e-05 5.55e-0
4h 1
3 2.6208357e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 5.24e-04 2.21e-0
2h 1
4 1.2837707e+04 5.95e-02 8.02e+01 -1.0 8.97e+02 - 4.99e-02 1.00e+0
0h 1
5 4.2800818e+03 5.56e-02 5.36e+01 -1.0 7.38e+01 - 3.21e-01 5.97e-0
2f 1
20 1.155411e+04 1.632511e+04 2.736232e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1154264e+02 1.57e+04 5.50e+01 -1.0 1.59e+04 - 1.75e-04 9.80e-0
3h 1
2 7.0856659e+02 1.57e+04 5.50e+01 -1.0 1.38e+04 - 2.58e-05 1.13e-0
4h 1
3 7.0483057e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 1.70e-05 3.01e-0
4h 1
4 6.9974871e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 3.16e-04 4.25e-0
4h 1
5 4.9153568e+02 1.54e+04 5.39e+01 -1.0 1.57e+04 - 7.97e-04 1.90e-0
2f 1
6 2.6170359e+04 7.61e-02 8.68e+01 -1.0 1.54e+04 - 2.55e-02 1.00e+0
0h 1
7 1.7886949e+04 7.32e-02 7.29e+01 -1.0 7.22e+01 - 1.70e-01 4.01e-0
2f 1
8 1.6629551e+04 4.64e-02 3.37e+01 -1.0 1.97e+01 - 5.31e-01 3.77e-0
1f 1
9 1.7129719e+04 3.52e-02 1.13e+01 -1.0 1.34e+01 - 5.66e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6801153e+04 7.47e-03 2.18e-01 -1.0 1.36e+00 - 9.85e-01 1.00e+0
0h 1
11 1.6497505e+04 7.14e-04 1.26e+00 -1.7 5.77e+00 - 3.04e-01 9.16e-0
1f 1
12 1.6485707e+04 1.64e-04 6.52e-01 -1.7 4.59e+00 - 6.17e-01 1.00e+0
0f 1
13 1.6474958e+04 1.14e-04 1.77e-01 -1.7 9.62e+00 - 6.70e-01 1.00e+0
0h 1
14 1.6373894e+04 8.59e-04 7.01e-02 -2.5 6.57e+00 - 9.10e-01 1.00e+0
0f 1
15 1.6344679e+04 1.57e-03 1.61e-02 -2.5 4.93e+00 - 1.00e+00 1.00e+0
0h 1
16 1.6328077e+04 2.77e-04 1.06e-01 -3.8 6.22e+00 - 1.00e+00 8.34e-0
1h 1
17 1.6326334e+04 5.81e-07 1.25e-04 -3.8 1.12e+00 - 1.00e+00 1.00e+0
0h 1
18 1.6325117e+04 4.02e-07 1.02e-04 -5.7 2.97e-01 - 1.00e+00 9.98e-0
1h 1
19 1.6325120e+04 3.82e-11 3.01e-09 -5.7 7.75e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325105e+04 6.20e-11 4.48e-06 -8.6 3.68e-03 - 1.00e+00 9.93e-0
1h 1
21 1.6325105e+04 3.82e-15 1.11e-13 -8.6 1.78e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.6325105199651276e+01 1.6325105199651276e+0
4
Dual infeasibility......: 1.1092655094648227e-13 1.1092655094648227e-1
0
Constraint violation....: 3.8163916471489756e-15 3.8163916471489756e-1
5
Complementarity.........: 4.8687866613296541e-09 4.8687866613296539e-0
6
Overall NLP error.......: 4.8687866613296541e-09 4.8687866613296539e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9875302e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.75e-04 9.80e-0
3h 1
2 7.9573348e+02 1.50e+04 5.25e+01 -1.0 1.30e+04 - 2.48e-05 1.14e-0
4h 1
3 7.9391821e+02 1.50e+04 5.25e+01 -1.0 1.49e+04 - 1.88e-05 1.35e-0
4h 1
4 7.9100982e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 1.52e-04 2.21e-0
4h 1
5 5.2633209e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 3.84e-04 2.06e-0
2f 1
6 2.6323621e+04 5.39e-02 8.35e+01 -1.0 1.47e+04 - 3.32e-02 1.00e+0
0h 1
7 1.7745809e+04 5.17e-02 6.29e+01 -1.0 8.14e+01 - 2.49e-01 4.56e-0
2f 1
8 1.5954053e+04 4.21e-02 3.25e+01 -1.0 3.42e+01 - 4.82e-01 4.73e-0
1f 1
9 1.6277837e+04 2.58e-02 1.46e+01 -1.0 1.84e+01 - 4.25e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6017868e+04 6.14e-03 1.90e-01 -1.0 5.22e+00 - 9.90e-01 1.00e+0
0h 1
11 1.5734263e+04 1.24e-03 2.90e-01 -1.7 4.59e+00 - 1.00e+00 8.64e-0
1f 1
12 1.5736235e+04 7.83e-04 1.13e-02 -1.7 4.36e+01 - 1.00e+00 1.00e+0
0f 1
13 1.5591685e+04 1.13e-03 4.18e-02 -2.5 4.56e+01 - 9.28e-01 1.00e+0
0f 1
14 1.5579136e+04 1.12e-03 2.79e-01 -2.5 4.47e+00 - 5.74e-01 1.00e+0
0h 1
15 1.5583924e+04 6.67e-05 1.13e-03 -2.5 2.67e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5560894e+04 1.60e-04 1.61e-02 -3.8 5.60e+00 - 9.88e-01 9.39e-0
1h 1
17 1.5560426e+04 9.47e-07 6.72e-05 -3.8 2.28e-01 - 1.00e+00 1.00e+0
0h 1
18 1.5559216e+04 3.74e-07 1.44e-04 -5.7 2.98e-01 - 1.00e+00 9.97e-0
1h 1
19 1.5559217e+04 3.80e-11 3.07e-09 -5.7 8.54e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5559202e+04 6.30e-11 2.10e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.5559202124449063e+01 1.5559202124449062e+0
4
Dual infeasibility......: 2.0962040029944136e-09 2.0962040029944136e-0
6
Constraint violation....: 6.2994442995290001e-11 6.2994442995290001e-1
1
Complementarity.........: 2.8882101226178240e-09 2.8882101226178239e-0
6
Overall NLP error.......: 2.8882101226178240e-09 2.8882101226178239e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4409564e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.92e-04 9.80e-0
3h 1
2 8.4116874e+02 1.39e+04 5.24e+01 -1.0 1.26e+04 - 3.09e-05 1.09e-0
4h 1
3 7.5484404e+02 1.38e+04 5.25e+01 -1.0 1.39e+04 - 1.31e-05 6.12e-0
3h 1
4 6.0458280e+02 1.35e+04 5.23e+01 -1.0 1.38e+04 - 6.61e-03 2.01e-0
2h 1
5 2.3130917e+04 6.23e-02 8.14e+01 -1.0 1.35e+04 - 5.85e-02 1.00e+0
0h 1
6 1.6749254e+04 5.74e-02 3.71e+01 -1.0 6.47e+01 - 5.27e-01 7.24e-0
2f 1
7 1.4893121e+04 3.67e-02 1.57e+01 -1.0 4.02e+01 - 5.70e-01 5.09e-0
1f 1
8 1.5646169e+04 4.02e-03 8.22e-01 -1.0 9.39e+00 - 9.63e-01 1.00e+0
0f 1
9 1.4693484e+04 2.14e-03 1.11e-01 -1.7 1.25e+01 - 9.59e-01 9.42e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4553430e+04 1.28e-03 3.65e-01 -2.5 6.05e+00 - 7.75e-01 1.00e+0
0h 1
11 1.4494486e+04 1.55e-02 6.45e-02 -2.5 3.77e+00 - 9.59e-01 9.00e-0
1h 1
12 1.4507850e+04 4.89e-04 1.41e-02 -2.5 9.00e-01 - 1.00e+00 1.00e+0
0h 1
13 1.4482847e+04 2.75e-04 4.56e-02 -3.8 8.03e+00 - 9.95e-01 8.91e-0
1h 1
14 1.4481429e+04 8.34e-07 9.08e-05 -3.8 8.72e-01 - 1.00e+00 1.00e+0
0h 1
15 1.4480076e+04 3.53e-07 8.63e-04 -5.7 4.46e-01 - 1.00e+00 9.88e-0
1h 1
16 1.4480068e+04 3.89e-11 4.81e-09 -5.7 2.29e-02 - 1.00e+00 1.00e+0
0f 1
17 1.4480052e+04 6.30e-11 3.21e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.4480051756651656e+01 1.4480051756651656e+0
4
Dual infeasibility......: 3.2139209731984179e-09 3.2139209731984179e-0
6
Constraint violation....: 6.3009639172939558e-11 6.3009639172939558e-1
1
Complementarity.........: 2.9969428442770826e-09 2.9969428442770823e-0
6
Overall NLP error.......: 3.2139209731984179e-09 3.2139209731984179e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4414128e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.93e-04 9.80e-0
3h 1
2 8.4118604e+02 1.27e+04 5.24e+01 -1.0 1.14e+04 - 3.11e-05 1.10e-0
4h 1
3 8.2031293e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 1.44e-05 1.36e-0
3h 1
4 5.1701654e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 1.37e-03 2.12e-0
2h 1
5 2.3975025e+04 5.78e-02 8.24e+01 -1.0 1.24e+04 - 3.37e-02 1.00e+0
0h 1
6 1.5826837e+04 5.49e-02 5.90e+01 -1.0 7.50e+01 - 2.83e-01 4.62e-0
2f 1
7 1.3706023e+04 3.77e-02 3.21e+01 -1.0 3.81e+01 - 4.67e-01 5.70e-0
1f 1
8 1.4047304e+04 2.00e-02 1.72e+01 -1.0 1.89e+01 - 3.55e-01 1.25e-0
1f 4
9 1.3845499e+04 4.85e-03 9.62e-01 -1.0 5.51e+00 - 9.54e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3780738e+04 3.46e-04 1.38e-01 -1.0 4.92e+00 - 9.33e-01 1.00e+0
0f 1
11 1.3469084e+04 3.20e-04 1.12e+00 -2.5 6.31e+00 - 9.26e-01 5.97e-0
1f 1
12 1.3296928e+04 2.24e-03 3.08e-01 -2.5 7.02e+00 - 7.29e-01 1.00e+0
0f 1
13 1.3249043e+04 5.91e-03 2.17e-01 -2.5 3.38e+00 - 1.00e+00 7.93e-0
1h 1
14 1.3258707e+04 2.75e-04 1.06e-02 -2.5 4.58e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3235316e+04 2.59e-04 5.58e-02 -3.8 6.44e+00 - 9.93e-01 8.75e-0
1h 1
16 1.3234270e+04 1.15e-06 9.71e-05 -3.8 3.48e-01 - 1.00e+00 1.00e+0
0h 1
17 1.3233069e+04 3.47e-07 8.97e-04 -5.7 2.94e-01 - 1.00e+00 9.87e-0
1h 1
18 1.3233066e+04 3.86e-11 4.89e-09 -5.7 5.19e-03 - 1.00e+00 1.00e+0
0f 1
19 1.3233051e+04 6.30e-11 3.24e-09 -8.6 3.69e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.3233050904861864e+01 1.3233050904861864e+0
4
Dual infeasibility......: 3.2359123271381682e-09 3.2359123271381682e-0
6
Constraint violation....: 6.3010180406664063e-11 6.3010180406664063e-1
1
Complementarity.........: 2.9308289812567586e-09 2.9308289812567585e-0
6
Overall NLP error.......: 3.2359123271381682e-09 3.2359123271381682e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.036
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2167500e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.44e-03 9.80e-0
3h 1
2 9.1890208e+02 1.11e+04 5.23e+01 -1.0 1.09e+04 - 7.57e-05 1.01e-0
4h 1
3 9.0224607e+02 1.11e+04 5.23e+01 -1.0 1.11e+04 - 4.33e-06 1.01e-0
3f 1
4 5.3633442e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 1.13e-03 2.30e-0
2h 1
5 2.3290321e+04 6.93e-02 7.66e+01 -1.0 1.09e+04 - 8.01e-02 1.00e+0
0h 1
6 1.5334072e+04 6.26e-02 2.41e+01 -1.0 1.49e+01 - 6.50e-01 8.78e-0
2f 1
7 1.3998052e+04 1.84e-02 1.01e+01 -1.0 1.05e+01 - 6.49e-01 8.74e-0
1f 1
8 1.4098567e+04 9.67e-03 6.81e-01 -1.0 2.91e+00 - 9.94e-01 4.83e-0
1f 2
9 1.3761378e+04 9.02e-03 2.68e-01 -1.7 8.67e+00 - 1.00e+00 8.35e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3730603e+04 2.14e-03 9.35e-01 -1.7 1.24e+01 - 1.00e+00 4.90e-0
1h 2
11 1.3724424e+04 2.11e-04 1.67e-02 -1.7 6.32e+00 - 1.00e+00 1.00e+0
0h 1
12 1.3568485e+04 4.89e-04 2.45e-02 -3.8 1.99e+01 - 8.45e-01 8.30e-0
1f 1
13 1.3549877e+04 1.57e-04 2.07e-01 -3.8 3.36e+00 - 9.88e-01 7.14e-0
1h 1
14 1.3545163e+04 4.19e-07 3.68e-04 -3.8 9.60e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3543973e+04 2.02e-08 4.56e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
16 1.3543960e+04 7.43e-13 5.08e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.3543959762169539e+01 1.3543959762169539e+0
4
Dual infeasibility......: 5.0789952645575033e-10 5.0789952645575033e-0
7
Constraint violation....: 7.4272532568642191e-13 7.4272532568642191e-1
3
Complementarity.........: 2.6201895613279333e-09 2.6201895613279331e-0
6
Overall NLP error.......: 2.6201895613279333e-09 2.6201895613279331e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8776327e+02 9.19e+03 5.24e+01 -1.0 9.28e+03 - 6.64e-04 9.80e-0
3h 1
2 8.8487848e+02 9.19e+03 5.24e+01 -1.0 8.49e+03 - 4.35e-05 1.07e-0
4h 1
3 8.1017698e+02 9.15e+03 5.24e+01 -1.0 9.19e+03 - 1.14e-05 4.07e-0
3h 1
4 4.8829988e+02 8.96e+03 5.23e+01 -1.0 9.15e+03 - 4.62e-03 2.12e-0
2h 1
5 1.9624071e+04 6.67e-02 7.88e+01 -1.0 8.96e+03 - 7.36e-02 1.00e+0
0h 1
6 1.2613352e+04 6.06e-02 4.34e+01 -1.0 5.13e+01 - 4.30e-01 8.42e-0
2f 1
7 1.1287964e+04 2.91e-02 1.67e+01 -1.0 2.55e+01 - 6.00e-01 4.84e-0
1f 1
8 1.0844638e+04 5.12e-03 9.75e-01 -1.0 9.16e+00 - 9.34e-01 7.59e-0
1f 1
9 1.1096445e+04 1.87e-04 6.07e-02 -1.0 4.66e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.0465431e+04 2.23e-03 8.01e-02 -2.5 4.76e+00 - 8.70e-01 8.69e-0
1f 1
11 1.0359674e+04 1.08e-03 4.55e-01 -2.5 7.61e-01 - 1.00e+00 6.04e-0
1f 1
12 1.0359707e+04 2.49e-06 8.14e-03 -2.5 1.53e-01 - 1.00e+00 1.00e+0
0h 1
13 1.0339422e+04 6.17e-06 2.39e-02 -3.8 5.36e+00 - 9.14e-01 8.89e-0
1f 1
14 1.0335906e+04 4.60e-04 4.72e-04 -3.8 5.91e-01 - 1.00e+00 1.00e+0
0f 1
15 1.0334764e+04 6.26e-05 1.12e-02 -5.7 2.97e-01 - 8.14e-01 1.00e+0
0h 1
16 1.0334651e+04 3.51e-05 3.92e-05 -5.7 9.55e-03 - 1.00e+00 1.00e+0
0h 1
17 1.0334652e+04 1.18e-06 1.11e-05 -5.7 1.44e-03 - 1.00e+00 9.97e-0
1h 1
18 1.0334638e+04 2.43e-09 9.98e-08 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
19 1.0334638e+04 3.43e-15 3.66e-14 -8.6 5.37e-08 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.0334637947446714e+01 1.0334637947446714e+0
4
Dual infeasibility......: 3.6600120001659505e-14 3.6600120001659505e-1
1
Constraint violation....: 3.4251459112023526e-15 3.4251459112023526e-1
5
Complementarity.........: 2.5086677992703443e-09 2.5086677992703441e-0
6
Overall NLP error.......: 2.5086677992703443e-09 2.5086677992703441e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2300862e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.80e-0
3h 1
2 9.2018520e+02 6.71e+03 5.23e+01 -1.0 6.43e+03 - 7.59e-05 1.03e-0
4h 1
3 8.8417722e+02 6.69e+03 5.23e+01 -1.0 6.70e+03 - 7.25e-06 1.73e-0
3f 1
4 4.3415243e+02 6.54e+03 5.24e+01 -1.0 6.69e+03 - 2.08e-03 2.26e-0
2h 1
5 1.8486104e+04 7.08e-02 7.69e+01 -1.0 6.54e+03 - 8.04e-02 1.00e+0
0h 1
6 1.0916142e+04 6.40e-02 2.32e+01 -1.0 1.36e+01 - 6.65e-01 8.89e-0
2f 1
7 9.6154376e+03 1.98e-02 9.31e+00 -1.0 9.91e+00 - 6.64e-01 8.81e-0
1f 1
8 9.7199903e+03 1.05e-02 6.35e-01 -1.0 2.75e+00 - 9.95e-01 4.77e-0
1f 2
9 9.3967776e+03 9.36e-03 2.78e-01 -1.7 9.45e+00 - 1.00e+00 8.30e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.3672965e+03 2.18e-03 9.40e-01 -1.7 1.18e+01 - 1.00e+00 4.90e-0
1h 2
11 9.3624199e+03 2.10e-04 1.67e-02 -1.7 6.01e+00 - 1.00e+00 1.00e+0
0h 1
12 9.2069203e+03 4.79e-04 2.44e-02 -3.8 2.00e+01 - 8.46e-01 8.30e-0
1f 1
13 9.1886242e+03 1.49e-04 2.05e-01 -3.8 3.34e+00 - 9.89e-01 7.21e-0
1h 1
14 9.1840024e+03 3.89e-07 3.07e-04 -3.8 9.33e-01 - 1.00e+00 1.00e+0
0h 1
15 9.1828139e+03 1.95e-08 4.40e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
16 9.1828008e+03 7.97e-13 4.82e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 9.1828007648319083e+00 9.1828007648319090e+0
3
Dual infeasibility......: 4.8230731090399175e-10 4.8230731090399175e-0
7
Constraint violation....: 7.9666828689539670e-13 7.9666828689539670e-1
3
Complementarity.........: 2.6134528002226873e-09 2.6134528002226874e-0
6
Overall NLP error.......: 2.6134528002226873e-09 2.6134528002226874e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3000909e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 2.02e-03 9.81e-0
3h 1
2 9.2540939e+02 4.77e+03 5.23e+01 -1.0 2.66e+03 - 1.91e-05 1.78e-0
4h 1
3 3.8379504e+02 4.66e+03 5.24e+01 -1.0 4.77e+03 - 8.68e-05 2.34e-0
2f 1
4 1.7424477e+04 7.01e-02 7.87e+01 -1.0 4.66e+03 - 5.08e-02 1.00e+0
0h 1
5 9.2441130e+03 6.55e-02 5.13e+01 -1.0 1.16e+01 - 3.39e-01 6.13e-0
2f 1
6 7.9204820e+03 2.27e-02 2.21e+01 -1.0 7.02e+00 - 6.27e-01 9.88e-0
1f 1
7 8.2927286e+03 2.17e-03 1.90e-01 -1.0 2.55e+00 - 9.91e-01 1.00e+0
0f 1
8 7.7707441e+03 1.76e-03 6.99e-02 -1.7 6.35e+00 - 1.00e+00 9.92e-0
1f 1
9 7.5980722e+03 1.95e-03 3.69e-01 -2.5 1.67e+00 - 1.00e+00 7.91e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.5727496e+03 1.82e-04 4.79e-02 -2.5 3.44e-01 - 1.00e+00 9.36e-0
1h 1
11 7.5754876e+03 7.05e-06 1.34e-03 -2.5 2.21e-02 - 1.00e+00 1.00e+0
0f 1
12 7.5482488e+03 7.66e-06 4.23e-03 -3.8 8.04e+00 - 1.00e+00 9.79e-0
1f 1
13 7.5480543e+03 1.37e-08 6.27e-06 -3.8 1.66e-01 - 1.00e+00 1.00e+0
0f 1
14 7.5465649e+03 1.73e-08 3.04e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0f 1
15 7.5465477e+03 1.28e-12 4.22e-10 -8.6 5.52e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 7.5465477271530945e+00 7.5465477271530945e+0
3
Dual infeasibility......: 4.2179927613021379e-10 4.2179927613021379e-0
7
Constraint violation....: 1.2797540804854179e-12 1.2797540804854179e-1
2
Complementarity.........: 3.0573665124278753e-09 3.0573665124278751e-0
6
Overall NLP error.......: 3.0573665124278753e-09 3.0573665124278751e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2294726e+02 3.24e+03 5.23e+01 -1.0 3.27e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1945201e+02 3.24e+03 5.23e+01 -1.0 2.47e+03 - 3.93e-05 1.30e-0
4h 1
3 3.4573144e+02 3.17e+03 5.24e+01 -1.0 3.24e+03 - 4.04e-05 2.36e-0
2f 1
4 1.5906615e+04 6.81e-02 7.93e+01 -1.0 3.17e+03 - 4.21e-02 1.00e+0
0h 1
5 7.5933644e+03 6.41e-02 5.66e+01 -1.0 2.00e+01 - 2.81e-01 5.33e-0
2f 1
6 6.3092956e+03 1.54e-02 2.51e+01 -1.0 1.01e+01 - 5.90e-01 8.06e-0
1f 1
7 6.3346293e+03 6.22e-03 2.30e-01 -1.0 1.94e+00 - 9.91e-01 1.00e+0
0f 1
8 5.9359287e+03 1.57e-03 8.93e-02 -1.7 4.60e+00 - 9.17e-01 9.66e-0
1f 1
9 5.7846796e+03 1.47e-03 7.44e-02 -2.5 1.11e+00 - 7.90e-01 7.55e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.7445381e+03 4.07e-04 9.91e-02 -2.5 3.92e-01 - 1.00e+00 9.02e-0
1f 1
11 5.7479825e+03 1.42e-05 5.41e-03 -2.5 8.97e-02 - 1.00e+00 1.00e+0
0f 1
12 5.7226343e+03 1.15e-05 5.94e-03 -3.8 5.36e+00 - 1.00e+00 9.71e-0
1f 1
13 5.7223578e+03 1.61e-08 1.19e-05 -3.8 1.50e-01 - 1.00e+00 1.00e+0
0f 1
14 5.7210148e+03 1.79e-08 5.06e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0f 1
15 5.7210000e+03 6.41e-13 4.12e-10 -8.6 3.67e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.7210000326849206e+00 5.7210000326849204e+0
3
Dual infeasibility......: 4.1161480984398558e-10 4.1161480984398558e-0
7
Constraint violation....: 6.4076521866240910e-13 6.4076521866240910e-1
3
Complementarity.........: 3.5169888013165526e-09 3.5169888013165526e-0
6
Overall NLP error.......: 3.5169888013165526e-09 3.5169888013165526e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4518010e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 3.98e-04 9.82e-0
3f 1
2 8.4053778e+02 2.00e+03 5.24e+01 -1.0 1.16e+03 - 4.81e-05 1.70e-0
4h 1
3 8.2353961e+02 2.00e+03 5.24e+01 -1.0 1.99e+03 - 9.16e-05 6.55e-0
4h 1
4 2.7656016e+02 1.95e+03 5.26e+01 -1.0 2.00e+03 - 7.38e-04 2.15e-0
2f 1
5 1.3590771e+04 5.75e-02 8.12e+01 -1.0 1.95e+03 - 4.60e-02 1.00e+0
0h 1
6 5.1287561e+03 5.39e-02 5.24e+01 -1.0 7.94e+01 - 3.46e-01 5.65e-0
2f 1
7 3.0120352e+03 3.43e-02 2.84e+01 -1.0 4.22e+01 - 4.66e-01 5.35e-0
1f 1
8 4.8304166e+03 7.84e-03 1.41e+01 -1.0 2.16e+01 - 6.33e-01 1.00e+0
0h 1
9 3.1436336e+03 5.61e-03 3.45e-01 -1.0 1.83e+01 - 9.68e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.7927316e+03 1.05e-03 4.74e-02 -1.7 5.61e+00 - 8.78e-01 8.81e-0
1f 1
11 2.6624340e+03 1.03e-03 3.41e-01 -2.5 5.47e+00 - 7.76e-01 1.00e+0
0h 1
12 2.5963515e+03 8.58e-03 4.86e-02 -2.5 3.67e+00 - 1.00e+00 1.00e+0
0h 1
13 2.6068715e+03 3.19e-04 6.33e-03 -2.5 5.01e-01 - 1.00e+00 1.00e+0
0h 1
14 2.5817387e+03 2.17e-04 5.21e-02 -3.8 6.99e+00 - 9.85e-01 8.71e-0
1h 1
15 2.5806495e+03 2.20e-06 1.53e-04 -3.8 2.80e-01 - 1.00e+00 1.00e+0
0h 1
16 2.5794666e+03 3.11e-07 2.15e-03 -5.7 2.90e-01 - 1.00e+00 9.77e-0
1h 1
17 2.5794585e+03 3.61e-11 2.15e-08 -5.7 2.88e-03 - 1.00e+00 1.00e+0
0f 1
18 2.5794438e+03 6.30e-11 4.40e-09 -8.6 3.69e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 2.5794437805286514e+00 2.5794437805286516e+0
3
Dual infeasibility......: 4.3996310464694430e-09 4.3996310464694430e-0
6
Constraint violation....: 6.3011623696596075e-11 6.3011623696596075e-1
1
Complementarity.........: 4.3528739178526087e-09 4.3528739178526085e-0
6
Overall NLP error.......: 4.3996310464694430e-09 4.3996310464694430e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0738996e+02 9.17e+02 5.23e+01 -1.0 9.22e+02 - 9.83e-04 9.86e-0
3h 1
2 8.8581642e+02 9.17e+02 5.23e+01 -1.0 8.05e+02 - 7.44e-05 8.09e-0
4h 1
3 2.8446427e+02 8.96e+02 5.24e+01 -1.0 9.17e+02 - 7.85e-04 2.30e-0
2h 1
4 1.3130395e+04 6.60e-02 7.64e+01 -1.0 8.96e+02 - 8.31e-02 1.00e+0
0h 1
5 4.8398771e+03 5.94e-02 3.89e+01 -1.0 3.03e+01 - 4.65e-01 8.97e-0
2f 1
6 3.3515803e+03 2.00e-02 1.60e+01 -1.0 1.56e+01 - 6.10e-01 7.24e-0
1f 1
7 3.4080736e+03 5.23e-03 2.24e-01 -1.0 2.15e+00 - 9.87e-01 1.00e+0
0f 1
8 2.9928456e+03 1.46e-03 1.25e-01 -1.7 6.37e+00 - 1.00e+00 1.00e+0
0f 1
9 2.8424657e+03 1.99e-03 4.33e-01 -2.5 7.29e+00 - 1.00e+00 7.79e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8175519e+03 1.70e-04 5.24e-03 -2.5 1.48e+00 - 1.00e+00 1.00e+0
0h 1
11 2.7930452e+03 4.34e-05 1.52e-01 -3.8 1.35e+01 - 1.00e+00 7.57e-0
1h 1
12 2.7863160e+03 1.44e-07 4.07e-04 -3.8 3.24e+00 - 1.00e+00 1.00e+0
0f 1
13 2.7844966e+03 2.93e-08 8.43e-04 -5.7 7.43e-01 - 1.00e+00 9.86e-0
1f 1
14 2.7844770e+03 1.88e-12 1.47e-08 -5.7 1.00e-02 - 1.00e+00 1.00e+0
0f 1
15 2.7844549e+03 2.63e-12 5.21e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 2.7844548987838040e+00 2.7844548987838039e+0
3
Dual infeasibility......: 5.2053911248138400e-09 5.2053911248138400e-0
6
Constraint violation....: 2.6307497846822514e-12 2.6307497846822514e-1
2
Complementarity.........: 3.7921340139685426e-09 3.7921340139685425e-0
6
Overall NLP error.......: 5.2053911248138400e-09 5.2053911248138400e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031320943161440e-09 2.1031320943161440e-0
6
Constraint violation....: 6.2994193195109460e-11 6.2994193195109460e-1
1
Complementarity.........: 2.8882108896910881e-09 2.8882108896910880e-0
6
Overall NLP error.......: 2.8882108896910881e-09 2.8882108896910880e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031320943161440e-09 2.1031320943161440e-0
6
Constraint violation....: 6.2994193195109460e-11 6.2994193195109460e-1
1
Complementarity.........: 2.8882108896910881e-09 2.8882108896910880e-0
6
Overall NLP error.......: 2.8882108896910881e-09 2.8882108896910880e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254150050e-01 6.4890146254150045e+0
2
Dual infeasibility......: 4.9126604771005421e-09 4.9126604771005421e-0
6
Constraint violation....: 6.2123814981163150e-09 6.2123814981163150e-0
9
Complementarity.........: 4.3646095252240184e-09 4.3646095252240184e-0
6
Overall NLP error.......: 6.2123814981163150e-09 4.9126604771005421e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.06e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.11e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281623866e+00 1.6104063281623867e+0
3
Dual infeasibility......: 2.4577141957304968e-12 2.4577141957304968e-0
9
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5062163910051625e-09 2.5062163910051623e-0
6
Overall NLP error.......: 2.5062163910051625e-09 2.5062163910051623e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2260702e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 3.29e-04 9.85e-0
3h 1
2 8.1270324e+02 9.17e+02 5.24e+01 -1.0 6.65e+02 - 7.54e-05 3.59e-0
4h 1
3 2.4184354e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 3.16e-04 2.12e-0
2f 1
4 1.2567218e+04 5.49e-02 8.23e+01 -1.0 8.98e+02 - 3.79e-02 1.00e+0
0h 1
5 3.8956154e+03 5.24e-02 5.75e+01 -1.0 8.21e+01 - 3.00e-01 4.94e-0
2f 1
6 1.9119413e+03 3.76e-02 3.09e+01 -1.0 3.91e+01 - 4.67e-01 5.06e-0
1f 1
7 4.6932501e+03 1.23e-02 2.74e+01 -1.0 2.07e+01 - 3.99e-01 1.00e+0
0h 1
8 1.8763416e+03 1.21e-02 1.06e+00 -1.0 2.57e+01 - 9.88e-01 8.88e-0
1f 1
9 1.9957106e+03 2.00e-04 4.81e-02 -1.0 2.81e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7289259e+03 2.20e-04 1.23e+00 -2.5 1.92e+01 - 9.37e-01 5.95e-0
1f 1
11 1.5409157e+03 3.77e-03 1.32e-01 -2.5 7.57e+00 - 7.97e-01 1.00e+0
0f 1
12 1.5181339e+03 5.10e-03 3.05e-01 -2.5 1.80e+00 - 1.00e+00 7.70e-0
1h 1
13 1.5303935e+03 2.39e-04 4.64e-03 -2.5 7.17e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5027999e+03 1.70e-04 2.13e-02 -3.8 1.08e+01 - 9.90e-01 9.30e-0
1h 1
15 1.5018205e+03 7.25e-07 6.85e-05 -3.8 7.29e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003123e+03 3.77e-07 1.76e-04 -5.7 5.94e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003117e+03 3.79e-11 2.93e-09 -5.7 3.99e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932751793634e+00 1.5002932751793633e+0
3
Dual infeasibility......: 2.1694137063649817e-09 2.1694137063649817e-0
6
Constraint violation....: 6.2995927918585437e-11 6.2995927918585437e-1
1
Complementarity.........: 2.8882170500531828e-09 2.8882170500531826e-0
6
Overall NLP error.......: 2.8882170500531828e-09 2.8882170500531826e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6508171e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 4.93e-04 9.85e-0
3h 1
2 8.5461720e+02 9.17e+02 5.24e+01 -1.0 6.82e+02 - 7.35e-05 3.85e-0
4h 1
3 2.6185125e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 3.42e-04 2.22e-0
2f 1
4 1.2929406e+04 5.93e-02 8.01e+01 -1.0 8.97e+02 - 4.95e-02 1.00e+0
0h 1
5 4.2893831e+03 5.55e-02 5.39e+01 -1.0 7.44e+01 - 3.17e-01 5.92e-0
2f 1
21 1.666101e+04 1.632511e+04 2.795526e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2432714e+02 1.57e+04 5.24e+01 -1.0 1.59e+04 - 3.31e-04 9.81e-0
3h 1
2 8.2123449e+02 1.57e+04 5.24e+01 -1.0 1.27e+04 - 1.98e-05 1.23e-0
4h 1
3 8.1852670e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 2.73e-05 2.17e-0
4h 1
4 8.1584697e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 2.42e-04 2.19e-0
4h 1
5 5.6393305e+02 1.54e+04 5.26e+01 -1.0 1.57e+04 - 4.83e-04 2.12e-0
2f 1
6 2.7198318e+04 5.52e-02 8.24e+01 -1.0 1.54e+04 - 3.86e-02 1.00e+0
0h 1
7 1.8708756e+04 5.27e-02 5.58e+01 -1.0 8.05e+01 - 3.20e-01 5.02e-0
2f 1
8 1.6734455e+04 3.73e-02 2.98e+01 -1.0 3.93e+01 - 4.70e-01 5.04e-0
1f 1
9 1.7079730e+04 2.27e-02 1.38e+01 -1.0 2.05e+01 - 4.01e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6823853e+04 6.02e-03 3.94e-01 -1.0 4.93e+00 - 9.79e-01 1.00e+0
0h 1
11 1.6517788e+04 1.43e-03 3.65e-01 -1.7 5.54e+00 - 9.82e-01 8.25e-0
1f 1
12 1.6499251e+04 8.61e-04 3.07e-01 -1.7 3.93e+01 - 8.58e-02 1.00e+0
0f 1
13 1.6512875e+04 9.81e-06 1.13e-03 -1.7 1.29e+01 - 1.00e+00 1.00e+0
0h 1
14 1.6367182e+04 8.89e-04 1.91e-02 -3.8 6.88e+01 - 7.93e-01 7.82e-0
1f 1
15 1.6327041e+04 1.81e-03 5.83e-01 -3.8 2.40e+00 - 7.41e-02 8.11e-0
1h 1
16 1.6326081e+04 2.53e-04 1.23e-01 -3.8 3.10e-02 - 1.00e+00 8.59e-0
1h 1
17 1.6326315e+04 2.20e-07 3.34e-05 -3.8 9.42e-02 - 1.00e+00 1.00e+0
0f 1
18 1.6325119e+04 4.08e-07 2.39e-04 -5.7 2.99e-01 - 1.00e+00 9.95e-0
1h 1
19 1.6325120e+04 4.21e-11 3.36e-09 -5.7 4.82e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325105e+04 6.20e-11 4.81e-06 -8.6 3.68e-03 - 1.00e+00 9.93e-0
1h 1
21 1.6325105e+04 3.89e-15 1.21e-13 -8.6 8.02e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.6325105199700417e+01 1.6325105199700416e+0
4
Dual infeasibility......: 1.2082275612126604e-13 1.2082275612126604e-1
0
Constraint violation....: 3.8857805861880479e-15 3.8857805861880479e-1
5
Complementarity.........: 4.9215266872864398e-09 4.9215266872864396e-0
6
Overall NLP error.......: 4.9215266872864398e-09 4.9215266872864396e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9222219e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.64e-04 9.81e-0
3h 1
2 7.8909009e+02 1.50e+04 5.25e+01 -1.0 1.21e+04 - 2.08e-05 1.23e-0
4h 1
3 7.8765286e+02 1.50e+04 5.25e+01 -1.0 1.48e+04 - 2.76e-05 1.07e-0
4h 1
4 7.8577558e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 1.32e-04 1.42e-0
4h 1
5 5.2040419e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 2.81e-04 2.05e-0
2f 1
6 2.6335125e+04 5.38e-02 8.38e+01 -1.0 1.47e+04 - 3.21e-02 1.00e+0
0h 1
7 1.7698959e+04 5.17e-02 6.44e+01 -1.0 8.18e+01 - 2.35e-01 4.47e-0
2f 1
8 1.5949064e+04 4.28e-02 3.31e+01 -1.0 3.30e+01 - 4.85e-01 4.66e-0
1f 1
9 1.6267763e+04 2.67e-02 1.46e+01 -1.0 1.79e+01 - 4.32e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6014911e+04 6.01e-03 1.95e-01 -1.0 4.98e+00 - 9.90e-01 1.00e+0
0h 1
11 1.5732058e+04 1.19e-03 2.76e-01 -1.7 4.54e+00 - 1.00e+00 8.69e-0
1f 1
12 1.5739329e+04 7.74e-04 1.09e-02 -1.7 4.76e+01 - 1.00e+00 1.00e+0
0f 1
13 1.5592483e+04 1.09e-03 2.89e-02 -2.5 5.14e+01 - 9.29e-01 9.80e-0
1f 1
14 1.5579178e+04 1.14e-03 6.05e-01 -2.5 5.90e+00 - 5.25e-02 1.00e+0
0f 1
15 1.5584431e+04 8.15e-05 1.51e-03 -2.5 3.00e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5560663e+04 1.85e-04 1.01e-02 -3.8 5.69e+00 - 9.85e-01 9.51e-0
1h 1
17 1.5560425e+04 9.07e-07 6.83e-05 -3.8 1.16e-01 - 1.00e+00 1.00e+0
0h 1
18 1.5559216e+04 3.73e-07 1.44e-04 -5.7 2.98e-01 - 1.00e+00 9.97e-0
1h 1
19 1.5559217e+04 3.81e-11 3.11e-09 -5.7 9.03e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5559202e+04 6.30e-11 2.09e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.5559202124434231e+01 1.5559202124434230e+0
4
Dual infeasibility......: 2.0880401524851721e-09 2.0880401524851721e-0
6
Constraint violation....: 6.2994012783867959e-11 6.2994012783867959e-1
1
Complementarity.........: 2.8882086263837560e-09 2.8882086263837558e-0
6
Overall NLP error.......: 2.8882086263837560e-09 2.8882086263837558e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9899823e+02 1.39e+04 5.25e+01 -1.0 1.40e+04 - 2.76e-04 9.80e-0
3h 1
2 7.9594435e+02 1.39e+04 5.25e+01 -1.0 1.19e+04 - 2.50e-05 1.16e-0
4h 1
3 7.6792202e+02 1.39e+04 5.25e+01 -1.0 1.39e+04 - 2.01e-05 1.95e-0
3h 1
4 5.1949754e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 1.95e-03 2.00e-0
2h 1
5 2.4543363e+04 5.50e-02 8.38e+01 -1.0 1.36e+04 - 3.28e-02 1.00e+0
0h 1
6 1.6626656e+04 5.27e-02 6.03e+01 -1.0 7.56e+01 - 2.82e-01 4.62e-0
2f 1
7 1.4874467e+04 4.29e-02 3.07e+01 -1.0 3.41e+01 - 4.90e-01 4.70e-0
1f 1
8 1.5190267e+04 2.63e-02 1.33e+01 -1.0 1.79e+01 - 4.31e-01 1.25e-0
1f 4
9 1.4939899e+04 6.19e-03 2.32e-01 -1.0 5.19e+00 - 9.87e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4657055e+04 1.24e-03 1.88e-01 -1.7 5.94e+00 - 9.51e-01 8.63e-0
1f 1
11 1.4537329e+04 1.67e-03 2.14e-01 -2.5 5.03e+00 - 8.09e-01 1.00e+0
0h 1
12 1.4498390e+04 3.07e-03 5.09e-02 -2.5 2.42e+00 - 1.00e+00 9.52e-0
1h 1
13 1.4508275e+04 1.46e-04 5.01e-03 -2.5 7.43e-01 - 1.00e+00 1.00e+0
0f 1
14 1.4481362e+04 1.73e-04 1.22e-02 -3.8 9.35e+00 - 9.96e-01 9.54e-0
1h 1
15 1.4481431e+04 5.80e-07 6.62e-05 -3.8 9.98e-02 - 1.00e+00 1.00e+0
0f 1
16 1.4480066e+04 3.81e-07 1.52e-04 -5.7 4.53e-01 - 1.00e+00 9.97e-0
1h 1
17 1.4480068e+04 3.85e-11 3.12e-09 -5.7 2.12e-02 - 1.00e+00 1.00e+0
0f 1
18 1.4480052e+04 6.30e-11 2.10e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.4480051756974561e+01 1.4480051756974561e+0
4
Dual infeasibility......: 2.0965593858707930e-09 2.0965593858707930e-0
6
Constraint violation....: 6.2994109928382613e-11 6.2994109928382613e-1
1
Complementarity.........: 2.9254789889489652e-09 2.9254789889489651e-0
6
Overall NLP error.......: 2.9254789889489652e-09 2.9254789889489651e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.5828975e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 4.53e-04 9.81e-0
3h 1
2 8.5521293e+02 1.26e+04 5.24e+01 -1.0 1.05e+04 - 2.33e-05 1.19e-0
4h 1
3 8.4382967e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 2.41e-05 7.47e-0
4h 1
4 8.1929926e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 7.68e-04 1.67e-0
3h 1
5 5.4311634e+02 1.23e+04 5.24e+01 -1.0 1.26e+04 - 2.98e-03 2.15e-0
2f 1
6 2.3079364e+04 6.18e-02 8.09e+01 -1.0 1.23e+04 - 5.48e-02 1.00e+0
0h 1
7 1.5773784e+04 5.73e-02 4.72e+01 -1.0 6.84e+01 - 4.03e-01 6.65e-0
2f 1
8 1.4009261e+04 3.22e-02 2.31e+01 -1.0 4.01e+01 - 5.06e-01 4.76e-0
1f 1
9 1.3983691e+04 8.80e-03 2.03e+00 -1.0 1.11e+01 - 9.26e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3913014e+04 6.26e-04 3.52e-01 -1.0 5.62e+00 - 8.57e-01 1.00e+0
0f 1
11 1.3563280e+04 3.61e-04 4.47e-01 -1.7 5.70e+00 - 5.49e-01 6.62e-0
1f 1
12 1.3529872e+04 1.33e-04 1.27e+00 -1.7 7.99e+00 - 5.75e-01 1.00e+0
0f 1
13 1.3505872e+04 4.13e-05 2.61e-01 -1.7 1.40e+01 - 7.08e-01 1.00e+0
0f 1
14 1.3525406e+04 1.11e-06 2.61e-02 -1.7 2.19e+01 - 8.83e-01 1.00e+0
0h 1
15 1.3397770e+04 1.09e-04 2.73e-02 -2.5 4.30e+01 - 1.00e+00 1.00e+0
0f 1
16 1.3382213e+04 1.39e-03 6.60e-02 -3.8 7.45e+00 - 6.66e-01 7.90e-0
1h 1
17 1.3375415e+04 6.95e-03 1.43e-01 -3.8 3.55e-01 - 5.73e-03 1.00e+0
0f 1
18 1.3374942e+04 8.70e-05 2.36e-04 -3.8 6.01e-02 - 1.00e+00 1.00e+0
0h 1
19 1.3373299e+04 1.83e-04 3.24e-03 -5.7 2.95e-01 - 9.36e-01 8.44e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.3373149e+04 1.55e-05 3.91e-03 -5.7 4.29e-02 - 1.00e+00 9.16e-0
1h 1
21 1.3373139e+04 3.31e-09 2.17e-07 -5.7 3.55e-03 - 1.00e+00 1.00e+0
0f 1
22 1.3373123e+04 7.42e-09 3.89e-06 -8.6 3.69e-03 - 1.00e+00 9.97e-0
1h 1
23 1.3373123e+04 3.89e-14 3.53e-13 -8.6 1.09e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 23
(scaled) (unscaled)
Objective...............: 1.3373122857863786e+01 1.3373122857863786e+0
4
Dual infeasibility......: 3.5330714051640841e-13 3.5330714051640841e-1
0
Constraint violation....: 3.8857805861880479e-14 3.8857805861880479e-1
4
Complementarity.........: 2.8937193601489407e-09 2.8937193601489409e-0
6
Overall NLP error.......: 2.8937193601489407e-09 2.8937193601489409e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 24
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 24
Number of inequality constraint Jacobian evaluations = 24
Number of Lagrangian Hessian evaluations = 23
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9482527e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 7.48e-04 9.80e-0
3h 1
2 8.9206259e+02 1.11e+04 5.24e+01 -1.0 1.09e+04 - 8.69e-05 1.01e-0
4h 1
3 8.7788074e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 4.01e-06 8.67e-0
4f 1
4 5.1726064e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 9.54e-04 2.26e-0
2h 1
5 2.3121559e+04 6.40e-02 7.79e+01 -1.0 1.09e+04 - 6.98e-02 1.00e+0
0h 1
6 1.4812165e+04 5.85e-02 4.83e+01 -1.0 4.95e+01 - 3.63e-01 7.77e-0
2f 1
7 1.3505031e+04 2.67e-02 2.10e+01 -1.0 2.28e+01 - 5.57e-01 5.00e-0
1f 1
8 1.3018007e+04 6.85e-03 1.23e+00 -1.0 8.59e+00 - 9.37e-01 7.36e-0
1f 1
9 1.3268789e+04 3.20e-04 7.93e-02 -1.0 2.91e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2683148e+04 2.08e-03 9.07e-02 -2.5 4.28e+00 - 8.62e-01 8.28e-0
1f 1
11 1.2505092e+04 2.17e-03 3.62e-01 -2.5 1.06e+00 - 1.00e+00 7.74e-0
1f 1
12 1.2476207e+04 1.68e-04 5.11e-03 -2.5 2.15e-01 - 1.00e+00 1.00e+0
0h 1
13 1.2456345e+04 2.44e-05 4.31e-02 -3.8 2.68e+00 - 1.00e+00 8.82e-0
1h 1
14 1.2454881e+04 5.88e-08 6.10e-04 -3.8 3.16e-01 - 1.00e+00 1.00e+0
0f 1
15 1.2453574e+04 4.24e-08 1.39e-05 -5.7 1.49e-01 - 1.00e+00 9.99e-0
1f 1
16 1.2453562e+04 6.85e-13 3.99e-09 -8.6 1.93e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.2453562291320704e+01 1.2453562291320704e+0
4
Dual infeasibility......: 3.9883527964011049e-09 3.9883527964011049e-0
6
Constraint violation....: 6.8459127255948715e-13 6.8459127255948715e-1
3
Complementarity.........: 2.7863203205274113e-09 2.7863203205274113e-0
6
Overall NLP error.......: 3.9883527964011049e-09 3.9883527964011049e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0890313e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0580412e+02 9.19e+03 5.23e+01 -1.0 7.60e+03 - 2.53e-05 1.20e-0
4h 1
3 6.0977260e+02 9.04e+03 5.24e+01 -1.0 9.19e+03 - 2.50e-05 1.62e-0
2h 1
4 7.3775547e+02 8.79e+03 5.16e+01 -1.0 9.04e+03 - 1.91e-02 2.80e-0
2h 1
5 1.6473466e+04 8.05e-02 7.71e+01 -1.0 8.79e+03 - 1.08e-01 1.00e+0
0h 1
6 1.2523402e+04 6.93e-02 1.94e+01 -1.0 2.11e+01 - 7.28e-01 1.32e-0
1f 1
7 1.1378990e+04 1.42e-02 9.47e-01 -1.0 1.26e+01 - 9.48e-01 8.00e-0
1f 1
8 1.1688198e+04 1.32e-02 6.86e-01 -1.0 5.96e+00 - 2.72e-01 9.06e-0
1f 1
9 1.1277241e+04 2.88e-03 2.87e-01 -1.7 2.78e+00 - 8.71e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1255193e+04 8.06e-04 4.13e-01 -1.7 9.37e+00 - 7.18e-01 1.00e+0
0h 1
11 1.1289806e+04 9.87e-06 1.01e-01 -1.7 1.88e+01 - 8.22e-01 1.00e+0
0f 1
12 1.1125635e+04 4.76e-04 2.69e-02 -2.5 2.19e+01 - 9.73e-01 9.40e-0
1f 1
13 1.1088982e+04 1.35e-04 7.90e-02 -3.8 1.43e+01 - 9.82e-01 8.44e-0
1h 1
14 1.1084918e+04 1.80e-07 9.14e-02 -3.8 2.32e+00 - 9.28e-01 1.00e+0
0h 1
15 1.1084837e+04 4.92e-09 2.90e-05 -3.8 2.47e-04 - 1.00e+00 1.00e+0
0h 1
16 1.1083380e+04 1.93e-08 3.88e-03 -5.7 4.46e-01 - 1.00e+00 9.68e-0
1f 1
17 1.1083339e+04 5.75e-12 2.62e-08 -5.7 1.44e-02 - 1.00e+00 1.00e+0
0f 1
18 1.1083321e+04 2.63e-12 4.48e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1083320738952210e+01 1.1083320738952210e+0
4
Dual infeasibility......: 4.4780421383639856e-09 4.4780421383639856e-0
6
Constraint violation....: 2.6338931036207214e-12 2.6338931036207214e-1
2
Complementarity.........: 3.6085481561837406e-09 3.6085481561837405e-0
6
Overall NLP error.......: 4.4780421383639856e-09 4.4780421383639856e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2299660e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1994562e+02 6.71e+03 5.23e+01 -1.0 5.82e+03 - 3.44e-05 1.14e-0
4h 1
3 7.2851002e+02 6.64e+03 5.23e+01 -1.0 6.70e+03 - 1.95e-05 9.17e-0
3f 1
4 4.9339541e+02 6.50e+03 5.19e+01 -1.0 6.64e+03 - 1.16e-02 2.10e-0
2h 1
5 1.5628523e+04 8.10e-02 7.81e+01 -1.0 6.50e+03 - 8.90e-02 1.00e+0
0h 1
6 1.0636045e+04 7.19e-02 2.13e+01 -1.0 1.24e+01 - 7.05e-01 1.06e-0
1f 1
7 9.4596867e+03 2.23e-02 3.10e+00 -1.0 9.08e+00 - 8.57e-01 8.74e-0
1f 1
8 9.7561577e+03 1.77e-02 3.82e-01 -1.0 2.44e+00 - 8.79e-01 9.15e-0
1f 1
9 9.3841996e+03 3.10e-03 7.09e-01 -1.7 2.59e+00 - 6.11e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.3502300e+03 4.17e-04 6.12e-01 -1.7 5.60e+00 - 6.47e-01 1.00e+0
0h 1
11 9.3670866e+03 5.06e-05 2.01e-01 -1.7 1.04e+01 - 7.46e-01 1.00e+0
0h 1
12 9.3775188e+03 3.53e-07 4.41e-05 -1.7 1.33e+01 - 1.00e+00 1.00e+0
0h 1
13 9.2100765e+03 4.48e-04 2.17e-02 -2.5 2.81e+01 - 9.76e-01 9.62e-0
1f 1
14 9.1894511e+03 1.38e-04 1.98e-01 -3.8 6.36e+00 - 9.91e-01 7.27e-0
1h 1
15 9.1841539e+03 3.45e-07 2.86e-04 -3.8 1.74e+00 - 1.00e+00 1.00e+0
0h 1
16 9.1828157e+03 1.95e-08 4.45e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
17 9.1828008e+03 7.80e-13 4.76e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 9.1828007712844464e+00 9.1828007712844465e+0
3
Dual infeasibility......: 4.7640707206757929e-10 4.7640707206757929e-0
7
Constraint violation....: 7.8043127516025379e-13 7.8043127516025379e-1
3
Complementarity.........: 3.5963901590735516e-09 3.5963901590735517e-0
6
Overall NLP error.......: 3.5963901590735516e-09 3.5963901590735517e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8775283e+02 4.77e+03 5.24e+01 -1.0 4.82e+03 - 6.64e-04 9.80e-0
3f 1
2 8.8490545e+02 4.77e+03 5.24e+01 -1.0 4.54e+03 - 9.09e-05 1.04e-0
4h 1
3 8.3891577e+02 4.76e+03 5.24e+01 -1.0 4.77e+03 - 9.27e-06 2.02e-0
3f 1
4 3.6771363e+02 4.66e+03 5.24e+01 -1.0 4.76e+03 - 2.59e-03 2.19e-0
2h 1
5 1.5982222e+04 6.47e-02 7.88e+01 -1.0 4.66e+03 - 6.69e-02 1.00e+0
0h 1
6 8.2942245e+03 5.93e-02 4.78e+01 -1.0 5.43e+01 - 3.77e-01 7.64e-0
2f 1
7 6.9811109e+03 2.94e-02 2.07e+01 -1.0 2.67e+01 - 5.54e-01 4.62e-0
1f 1
8 6.4193393e+03 6.17e-03 1.02e+00 -1.0 9.91e+00 - 9.28e-01 7.77e-0
1f 1
9 6.6977348e+03 2.38e-04 6.93e-02 -1.0 3.42e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0467842e+03 2.17e-03 8.37e-02 -2.5 5.05e+00 - 8.70e-01 8.75e-0
1f 1
11 5.9396938e+03 1.10e-03 4.47e-01 -2.5 8.28e-01 - 1.00e+00 6.10e-0
1f 1
12 5.9395944e+03 2.61e-06 8.30e-03 -2.5 1.67e-01 - 1.00e+00 1.00e+0
0h 1
13 5.9215589e+03 6.87e-06 1.24e-02 -3.8 2.68e+00 - 9.05e-01 8.92e-0
1f 1
14 5.9183066e+03 4.65e-04 4.13e-04 -3.8 2.89e-01 - 1.00e+00 1.00e+0
0f 1
15 5.9173127e+03 6.28e-05 1.14e-02 -5.7 1.49e-01 - 8.14e-01 1.00e+0
0h 1
16 5.9171977e+03 3.58e-05 4.03e-05 -5.7 9.65e-03 - 1.00e+00 1.00e+0
0h 1
17 5.9171990e+03 1.44e-06 2.56e-05 -5.7 1.50e-03 - 1.00e+00 9.93e-0
1h 1
18 5.9172014e+03 3.51e-08 4.96e-07 -5.7 2.91e-04 - 1.00e+00 1.00e+0
0f 1
19 5.9171868e+03 3.95e-08 7.31e-06 -8.6 1.84e-03 - 9.97e-01 9.81e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 5.9171865e+03 5.37e-13 2.98e-11 -8.6 3.55e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 5.9171865383026407e+00 5.9171865383026407e+0
3
Dual infeasibility......: 2.9758894856194080e-11 2.9758894856194080e-0
8
Constraint violation....: 5.3701487701118822e-13 5.3701487701118822e-1
3
Complementarity.........: 2.5100799351793397e-09 2.5100799351793398e-0
6
Overall NLP error.......: 2.5100799351793397e-09 2.5100799351793398e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6653022e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 4.97e-04 9.81e-0
3f 1
2 8.6323248e+02 3.24e+03 5.24e+01 -1.0 2.66e+03 - 5.18e-05 1.21e-0
4h 1
3 5.3831982e+02 3.20e+03 5.25e+01 -1.0 3.24e+03 - 3.12e-05 1.32e-0
2f 1
4 3.9903740e+02 3.13e+03 5.15e+01 -1.0 3.20e+03 - 2.00e-02 2.32e-0
2f 1
5 9.8503385e+03 7.36e-02 7.80e+01 -1.0 3.13e+03 - 1.07e-01 1.00e+0
0h 1
6 5.7440269e+03 6.32e-02 2.21e+01 -1.0 4.61e+01 - 6.97e-01 1.31e-0
1f 1
7 4.3233476e+03 3.42e-02 1.97e+00 -1.0 2.67e+01 - 8.81e-01 6.15e-0
1f 1
8 4.6962650e+03 3.54e-03 3.07e+00 -1.0 4.17e+00 - 4.37e-01 1.00e+0
0f 1
9 4.5914106e+03 3.22e-04 6.16e-01 -1.0 3.63e+00 - 5.60e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2080396e+03 3.59e-04 4.91e-01 -1.7 4.87e+00 - 9.05e-01 7.14e-0
1f 1
11 4.2043266e+03 3.87e-05 7.22e-01 -1.7 1.03e+01 - 6.54e-01 1.00e+0
0f 1
12 4.2036180e+03 6.04e-06 4.41e-02 -1.7 1.30e+01 - 9.14e-01 1.00e+0
0h 1
13 4.1123655e+03 6.00e-05 2.29e-02 -2.5 2.31e+01 - 1.00e+00 9.79e-0
1f 1
14 4.0890733e+03 2.91e-03 7.59e-02 -3.8 7.27e+00 - 6.50e-01 9.92e-0
1h 1
15 4.0843174e+03 5.67e-03 1.14e-02 -3.8 6.66e-02 - 8.49e-01 1.00e+0
0h 1
16 4.0848602e+03 7.02e-05 5.29e-04 -3.8 1.69e-02 - 1.00e+00 1.00e+0
0h 1
17 4.0833269e+03 1.40e-04 8.98e-04 -5.7 2.97e-01 - 9.38e-01 1.00e+0
0h 1
18 4.0833300e+03 4.17e-05 5.50e-03 -5.7 1.49e-03 - 1.00e+00 7.03e-0
1h 1
19 4.0833413e+03 1.36e-08 1.74e-06 -5.7 1.06e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 4.0833247e+03 9.52e-09 2.21e-05 -8.6 3.68e-03 - 1.00e+00 9.82e-0
1h 1
21 4.0833244e+03 1.61e-12 8.09e-11 -8.6 6.56e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 4.0833243867732572e+00 4.0833243867732572e+0
3
Dual infeasibility......: 8.0863130899561142e-11 8.0863130899561136e-0
8
Constraint violation....: 1.6060486274227515e-12 1.6060486274227515e-1
2
Complementarity.........: 3.4268372034167205e-09 3.4268372034167202e-0
6
Overall NLP error.......: 3.4268372034167205e-09 3.4268372034167202e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8047271e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.82e-0
3h 1
2 8.7572172e+02 2.00e+03 5.24e+01 -1.0 1.12e+03 - 4.57e-05 1.77e-0
4h 1
3 8.5848649e+02 2.00e+03 5.24e+01 -1.0 1.99e+03 - 9.83e-05 6.73e-0
4h 1
4 2.9495823e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 7.63e-04 2.24e-0
2f 1
5 1.3915687e+04 6.17e-02 7.93e+01 -1.0 1.95e+03 - 5.68e-02 1.00e+0
0h 1
6 5.5165622e+03 5.73e-02 5.23e+01 -1.0 6.38e+01 - 3.28e-01 6.60e-0
2f 1
7 4.1580659e+03 3.11e-02 2.54e+01 -1.0 3.21e+01 - 5.03e-01 4.22e-0
1f 1
8 3.3871743e+03 1.13e-02 1.99e+00 -1.0 1.10e+01 - 9.20e-01 9.10e-0
1f 1
9 3.8058980e+03 3.36e-04 1.99e-01 -1.0 4.84e+00 - 9.33e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.1153158e+03 1.20e-03 9.57e-01 -1.7 1.94e+01 - 4.68e-01 9.97e-0
1f 1
11 3.1851442e+03 4.48e-05 2.37e-02 -1.7 6.86e+00 - 1.00e+00 1.00e+0
0f 1
12 3.0667992e+03 4.90e-05 1.82e-01 -2.5 2.55e+01 - 1.00e+00 8.60e-0
1f 1
13 3.0614700e+03 8.55e-05 2.75e-03 -2.5 2.84e-01 - 1.00e+00 1.00e+0
0f 1
14 3.0435470e+03 2.48e-04 6.72e-02 -3.8 7.00e+00 - 7.79e-01 9.53e-0
1h 1
15 3.0406305e+03 1.60e-03 1.55e-03 -3.8 3.27e-01 - 9.82e-01 1.00e+0
0f 1
16 3.0406230e+03 8.23e-05 6.20e-05 -3.8 2.31e-02 - 1.00e+00 1.00e+0
0h 1
17 3.0392663e+03 1.30e-04 1.10e-03 -5.7 3.04e-01 - 9.19e-01 1.00e+0
0h 1
18 3.0392284e+03 3.23e-05 6.59e-06 -5.7 8.38e-03 - 1.00e+00 1.00e+0
0h 1
19 3.0392341e+03 1.71e-07 3.29e-06 -5.7 5.94e-04 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 3.0392190e+03 2.64e-08 3.19e-05 -8.6 3.69e-03 - 1.00e+00 9.58e-0
1h 1
21 3.0392184e+03 4.26e-12 5.09e-11 -8.6 1.55e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 3.0392183859250310e+00 3.0392183859250308e+0
3
Dual infeasibility......: 5.0926491056941429e-11 5.0926491056941429e-0
8
Constraint violation....: 4.2577052994374753e-12 4.2577052994374753e-1
2
Complementarity.........: 4.5598658388203035e-09 4.5598658388203033e-0
6
Overall NLP error.......: 4.5598658388203035e-09 4.5598658388203033e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6577131e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 4.97e-04 9.85e-0
3h 1
2 8.5529111e+02 9.17e+02 5.24e+01 -1.0 6.82e+02 - 7.34e-05 3.86e-0
4h 1
3 2.6219590e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 3.43e-04 2.22e-0
2f 1
4 1.2935511e+04 5.94e-02 8.01e+01 -1.0 8.97e+02 - 4.97e-02 1.00e+0
0h 1
5 4.2970559e+03 5.55e-02 5.39e+01 -1.0 7.40e+01 - 3.17e-01 5.94e-0
2f 1
6 2.7073797e+03 3.01e-02 2.82e+01 -1.0 3.90e+01 - 4.71e-01 4.32e-0
1f 1
7 2.1347600e+03 1.48e-02 2.63e+00 -1.0 1.10e+01 - 9.18e-01 1.00e+0
0f 1
8 2.4862941e+03 4.51e-04 9.25e-02 -1.0 4.08e+00 - 9.96e-01 1.00e+0
0f 1
9 1.8832651e+03 7.45e-04 3.24e-01 -2.5 8.10e+00 - 8.79e-01 7.42e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8122233e+03 2.44e-04 3.40e-01 -2.5 3.71e+00 - 8.83e-01 1.00e+0
0h 1
11 1.8056720e+03 7.22e-04 4.32e-01 -2.5 1.37e+00 - 1.00e+00 1.89e-0
1h 2
12 1.7859099e+03 1.05e-03 1.21e-02 -2.5 9.14e-01 - 1.00e+00 1.00e+0
0h 1
13 1.7616665e+03 1.22e-03 3.34e-02 -3.8 1.08e+01 - 7.93e-01 1.00e+0
0h 1
14 1.7586347e+03 2.33e-03 9.24e-04 -3.8 3.94e-02 - 1.00e+00 1.00e+0
0h 1
15 1.7589630e+03 4.74e-05 1.26e-04 -3.8 1.52e-02 - 1.00e+00 1.00e+0
0h 1
16 1.7572116e+03 1.04e-04 3.70e-04 -5.7 5.95e-01 - 9.51e-01 9.78e-0
1h 1
17 1.7571923e+03 2.28e-05 3.67e-03 -5.7 1.32e-02 - 1.00e+00 7.82e-0
1h 1
18 1.7571934e+03 8.72e-09 1.22e-06 -5.7 2.88e-03 - 1.00e+00 1.00e+0
0f 1
19 1.7571732e+03 9.04e-09 1.92e-05 -8.6 7.37e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7571729e+03 1.37e-12 6.49e-11 -8.6 1.22e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.7571729184918143e+00 1.7571729184918142e+0
3
Dual infeasibility......: 6.4906234020874804e-11 6.4906234020874797e-0
8
Constraint violation....: 1.3683498778505054e-12 1.3683498778505054e-1
2
Complementarity.........: 2.5092399781212013e-09 2.5092399781212011e-0
6
Overall NLP error.......: 2.5092399781212013e-09 2.5092399781212011e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101521e-01 6.4890146112101525e+0
2
Dual infeasibility......: 4.9126605618489413e-09 4.9126605618489413e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984918224e-09 4.3646094984918221e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605618489413e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318724481455e-09 2.1031318724481455e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896894379e-09 2.8882108896894380e-0
6
Overall NLP error.......: 2.8882108896894379e-09 2.8882108896894380e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101521e-01 6.4890146112101525e+0
2
Dual infeasibility......: 4.9126605618489413e-09 4.9126605618489413e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984918224e-09 4.3646094984918221e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605618489413e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.04e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.57e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235660171e+00 1.6104063235660171e+0
3
Dual infeasibility......: 2.4574009793760635e-12 2.4574009793760635e-0
9
Constraint violation....: 7.5703172614159067e-16 7.5703172614159067e-1
6
Complementarity.........: 2.5062163919681798e-09 2.5062163919681799e-0
6
Overall NLP error.......: 2.5062163919681798e-09 2.5062163919681799e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2303872e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 3.31e-04 9.86e-0
3h 1
2 8.0919006e+02 9.17e+02 5.24e+01 -1.0 7.37e+02 - 8.12e-05 5.04e-0
4h 1
3 2.4239398e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 4.72e-04 2.11e-0
2f 1
4 1.2489447e+04 5.50e-02 8.23e+01 -1.0 8.98e+02 - 3.83e-02 1.00e+0
0h 1
5 3.8941148e+03 5.25e-02 5.67e+01 -1.0 8.14e+01 - 3.09e-01 4.98e-0
2f 1
6 1.9112633e+03 3.73e-02 3.04e+01 -1.0 3.92e+01 - 4.68e-01 5.06e-0
1f 1
7 4.6876227e+03 1.23e-02 2.71e+01 -1.0 2.07e+01 - 3.99e-01 1.00e+0
0h 1
8 1.8763004e+03 1.20e-02 1.04e+00 -1.0 2.56e+01 - 9.88e-01 8.91e-0
1f 1
9 1.9981274e+03 1.95e-04 4.76e-02 -1.0 2.98e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7321093e+03 2.19e-04 1.23e+00 -2.5 1.80e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5439398e+03 3.77e-03 1.33e-01 -2.5 7.59e+00 - 7.95e-01 1.00e+0
0f 1
12 1.5209204e+03 5.17e-03 3.09e-01 -2.5 1.82e+00 - 1.00e+00 7.67e-0
1h 1
13 1.5332321e+03 2.41e-04 4.72e-03 -2.5 7.16e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5031438e+03 1.70e-04 2.15e-02 -3.8 1.35e+01 - 9.90e-01 9.29e-0
1h 1
15 1.5019709e+03 7.24e-07 6.84e-05 -3.8 9.19e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003148e+03 3.77e-07 1.78e-04 -5.7 7.43e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.79e-11 2.92e-09 -5.7 4.20e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
1 8.6555952e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 4.97e-04 9.86e-0
3h 1
2 8.5049278e+02 9.17e+02 5.24e+01 -1.0 7.54e+02 - 7.94e-05 5.56e-0
4h 1
3 2.6243053e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 5.25e-04 2.21e-0
2h 1
4 1.2843590e+04 5.96e-02 8.01e+01 -1.0 8.97e+02 - 5.01e-02 1.00e+0
0h 1
5 4.2877637e+03 5.57e-02 5.36e+01 -1.0 7.35e+01 - 3.21e-01 5.99e-0
2f 1
22 1.269095e+04 1.632511e+04 2.851270e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6794703e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.80e-0
3f 1
2 7.6502059e+02 1.57e+04 5.25e+01 -1.0 1.45e+04 - 3.26e-05 1.07e-0
4h 1
3 7.0467498e+02 1.57e+04 5.26e+01 -1.0 1.57e+04 - 1.09e-05 4.79e-0
3h 1
4 5.8464796e+02 1.54e+04 5.26e+01 -1.0 1.57e+04 - 5.10e-03 1.93e-0
2h 1
5 2.4826987e+04 6.31e-02 8.49e+01 -1.0 1.54e+04 - 3.35e-02 1.00e+0
0h 1
6 1.8159626e+04 6.02e-02 5.15e+01 -1.0 6.21e+01 - 3.96e-01 4.92e-0
2f 1
7 1.6670030e+04 4.56e-02 2.38e+01 -1.0 2.93e+01 - 5.32e-01 4.29e-0
1f 1
8 1.7215651e+04 2.76e-02 8.96e+00 -1.0 1.50e+01 - 4.96e-01 2.50e-0
1f 3
9 1.6795894e+04 5.68e-03 1.03e-01 -1.0 5.87e+00 - 9.92e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6503905e+04 9.81e-04 2.00e-01 -1.7 1.08e+01 - 1.00e+00 8.95e-0
1f 1
11 1.6378473e+04 1.88e-03 1.85e-01 -2.5 5.23e+00 - 8.03e-01 1.00e+0
0f 1
12 1.6343210e+04 2.59e-03 3.62e-02 -2.5 2.59e+00 - 1.00e+00 9.69e-0
1h 1
13 1.6352463e+04 1.37e-04 4.05e-03 -2.5 2.09e+00 - 1.00e+00 1.00e+0
0f 1
14 1.6326922e+04 1.64e-04 1.20e-02 -3.8 8.04e+00 - 9.95e-01 9.53e-0
1h 1
15 1.6326479e+04 5.97e-07 6.41e-05 -3.8 3.78e-01 - 1.00e+00 1.00e+0
0h 1
16 1.6325121e+04 3.81e-07 1.39e-04 -5.7 4.46e-01 - 1.00e+00 9.97e-0
1h 1
17 1.6325122e+04 3.85e-11 3.15e-09 -5.7 2.69e-02 - 1.00e+00 1.00e+0
0f 1
18 1.6325105e+04 6.19e-11 5.00e-06 -8.6 5.53e-03 - 1.00e+00 9.92e-0
1h 1
19 1.6325105e+04 7.11e-15 1.37e-13 -8.6 1.26e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.6325105202162757e+01 1.6325105202162757e+0
4
Dual infeasibility......: 1.3686712140927273e-13 1.3686712140927273e-1
0
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 7.3782610041621839e-09 7.3782610041621837e-0
6
Overall NLP error.......: 7.3782610041621839e-09 7.3782610041621837e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6805242e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.29e-04 9.81e-0
3h 1
2 7.6478827e+02 1.50e+04 5.25e+01 -1.0 1.12e+04 - 1.86e-05 1.32e-0
4h 1
3 7.6351702e+02 1.50e+04 5.25e+01 -1.0 1.48e+04 - 3.78e-05 9.42e-0
5h 1
4 7.6194792e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 1.30e-04 1.19e-0
4h 1
5 5.0321357e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 2.55e-04 2.00e-0
2f 1
6 2.6167140e+04 6.06e-02 8.48e+01 -1.0 1.47e+04 - 2.93e-02 1.00e+0
0h 1
7 1.7515823e+04 5.83e-02 6.81e+01 -1.0 8.09e+01 - 2.02e-01 4.24e-0
2f 1
8 1.5926113e+04 4.47e-02 3.39e+01 -1.0 2.87e+01 - 4.99e-01 4.37e-0
1f 1
9 1.6223742e+04 3.05e-02 1.38e+01 -1.0 1.63e+01 - 4.65e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6014192e+04 5.30e-03 1.90e-01 -1.0 3.72e+00 - 9.90e-01 1.00e+0
0h 1
11 1.5729752e+04 1.03e-03 2.42e-01 -1.7 4.60e+00 - 1.00e+00 8.81e-0
1f 1
12 1.5742015e+04 7.61e-04 1.12e-01 -1.7 5.17e+01 - 5.64e-01 1.00e+0
0f 1
13 1.5598600e+04 9.65e-04 1.73e-02 -2.5 5.90e+01 - 9.20e-01 9.19e-0
1f 1
14 1.5561570e+04 1.64e-03 2.69e-02 -3.8 2.24e+00 - 8.45e-01 8.08e-0
1h 1
15 1.5560165e+04 2.45e-05 9.23e-04 -3.8 5.24e-02 - 1.00e+00 9.99e-0
1h 1
16 1.5559225e+04 2.63e-07 8.59e-04 -5.7 2.99e-01 - 1.00e+00 9.86e-0
1h 1
17 1.5559217e+04 2.40e-11 6.91e-09 -5.7 1.32e-01 - 1.00e+00 1.00e+0
0f 1
18 1.5559202e+04 6.30e-11 2.07e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5559202124440967e+01 1.5559202124440966e+0
4
Dual infeasibility......: 2.0693526936464474e-09 2.0693526936464474e-0
6
Constraint violation....: 6.2997232430639372e-11 6.2997232430639372e-1
1
Complementarity.........: 2.8880882305485848e-09 2.8880882305485849e-0
6
Overall NLP error.......: 2.8880882305485848e-09 2.8880882305485849e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.3156458e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.51e-04 9.81e-0
3h 1
2 8.2838529e+02 1.39e+04 5.24e+01 -1.0 1.09e+04 - 2.01e-05 1.26e-0
4h 1
3 8.2472666e+02 1.39e+04 5.24e+01 -1.0 1.38e+04 - 3.12e-05 2.57e-0
4h 1
4 8.1254398e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 2.84e-04 8.70e-0
4h 1
5 5.3614886e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 1.19e-03 2.11e-0
2f 1
6 2.5049214e+04 5.66e-02 8.21e+01 -1.0 1.36e+04 - 4.19e-02 1.00e+0
0h 1
7 1.6888066e+04 5.33e-02 5.06e+01 -1.0 7.76e+01 - 3.77e-01 5.35e-0
2f 1
8 1.4888246e+04 3.52e-02 2.69e+01 -1.0 4.07e+01 - 4.74e-01 5.10e-0
1f 1
9 1.5491001e+04 1.97e-02 1.22e+01 -1.0 1.82e+01 - 4.48e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5008417e+04 6.09e-03 4.07e-01 -1.0 5.97e+00 - 9.73e-01 1.00e+0
0f 1
11 1.4682896e+04 1.39e-03 3.74e-01 -1.7 6.05e+00 - 1.00e+00 8.32e-0
1f 1
12 1.4718890e+04 9.11e-04 3.41e-01 -1.7 1.03e+02 - 9.72e-02 1.00e+0
0f 1
13 1.4694425e+04 6.82e-06 1.18e-03 -1.7 2.73e+01 - 1.00e+00 1.00e+0
0h 1
14 1.4506008e+04 1.26e-03 9.98e-02 -3.8 8.47e+01 - 7.88e-01 9.20e-0
1f 1
15 1.4480692e+04 1.64e-03 5.84e-01 -3.8 1.88e+00 - 1.60e-01 7.66e-0
1h 1
16 1.4481121e+04 9.17e-05 4.91e-02 -3.8 2.42e-02 - 1.00e+00 9.43e-0
1h 1
17 1.4481414e+04 3.06e-07 1.41e-05 -3.8 5.99e-02 - 1.00e+00 1.00e+0
0f 1
18 1.4480067e+04 4.12e-07 2.78e-04 -5.7 4.52e-01 - 1.00e+00 9.95e-0
1h 1
19 1.4480068e+04 4.23e-11 3.21e-09 -5.7 4.27e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.4480052e+04 6.30e-11 2.24e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.4480051756851935e+01 1.4480051756851935e+0
4
Dual infeasibility......: 2.2427847124562860e-09 2.2427847124562860e-0
6
Constraint violation....: 6.2996149963190362e-11 6.2996149963190362e-1
1
Complementarity.........: 2.9254937362763936e-09 2.9254937362763935e-0
6
Overall NLP error.......: 2.9254937362763936e-09 2.9254937362763935e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.7323301e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.40e-04 9.80e-0
3h 1
2 8.7045507e+02 1.27e+04 5.24e+01 -1.0 1.24e+04 - 9.04e-05 1.01e-0
4h 1
3 8.5949645e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 3.45e-06 7.28e-0
4f 1
4 5.3480587e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 7.89e-04 2.22e-0
2h 1
5 2.4506598e+04 6.07e-02 7.98e+01 -1.0 1.24e+04 - 5.31e-02 1.00e+0
0h 1
6 1.6082447e+04 5.65e-02 5.30e+01 -1.0 6.91e+01 - 3.25e-01 6.27e-0
2f 1
7 1.4618921e+04 3.11e-02 2.68e+01 -1.0 3.61e+01 - 4.86e-01 4.20e-0
1f 1
8 1.4248617e+04 1.48e-02 2.62e+00 -1.0 1.11e+01 - 9.19e-01 5.00e-0
1f 2
9 1.4100298e+04 7.58e-03 1.66e+00 -1.0 6.72e+00 - 1.00e+00 4.81e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4218541e+04 5.07e-04 5.81e-02 -1.0 9.95e+01 - 1.00e+00 1.00e+0
0f 1
11 1.3713070e+04 6.10e-04 7.01e-01 -2.5 9.83e+01 - 9.03e-01 6.44e-0
1f 1
12 1.3623449e+04 6.92e-05 1.43e-01 -2.5 3.45e+01 - 9.66e-01 1.00e+0
0f 1
13 1.3601568e+04 1.84e-03 8.49e-03 -2.5 9.51e-01 - 1.00e+00 1.00e+0
0h 1
14 1.3588031e+04 4.44e-04 3.31e-02 -3.8 2.68e+00 - 8.52e-01 1.00e+0
0h 1
15 1.3585415e+04 1.63e-03 8.85e-04 -3.8 3.55e-02 - 1.00e+00 1.00e+0
0h 1
16 1.3585609e+04 4.95e-05 5.12e-05 -3.8 1.17e-02 - 1.00e+00 1.00e+0
0h 1
17 1.3584340e+04 1.21e-04 5.63e-04 -5.7 1.49e-01 - 9.39e-01 1.00e+0
0h 1
18 1.3584312e+04 1.33e-05 5.61e-05 -5.7 5.06e-03 - 1.00e+00 9.85e-0
1h 1
19 1.3584319e+04 3.79e-08 4.65e-06 -5.7 2.82e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.3584304e+04 3.27e-08 3.32e-05 -8.6 1.84e-03 - 1.00e+00 9.71e-0
1h 1
21 1.3584303e+04 2.61e-12 3.61e-10 -8.6 5.38e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.3584303165652571e+01 1.3584303165652571e+0
4
Dual infeasibility......: 3.6122863937379547e-10 3.6122863937379548e-0
7
Constraint violation....: 2.6119106877331433e-12 2.6119106877331433e-1
2
Complementarity.........: 2.5400634285046061e-09 2.5400634285046063e-0
6
Overall NLP error.......: 2.5400634285046061e-09 2.5400634285046063e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2301496e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.51e-03 9.80e-0
3h 1
2 9.2012933e+02 1.11e+04 5.23e+01 -1.0 1.02e+04 - 3.26e-05 1.08e-0
4h 1
3 8.3424142e+02 1.11e+04 5.23e+01 -1.0 1.11e+04 - 1.17e-05 5.22e-0
3h 1
4 5.7283735e+02 1.08e+04 5.22e+01 -1.0 1.11e+04 - 5.95e-03 2.13e-0
2h 1
5 2.1532475e+04 7.53e-02 7.76e+01 -1.0 1.08e+04 - 8.36e-02 1.00e+0
0h 1
6 1.5215064e+04 6.76e-02 2.23e+01 -1.0 1.30e+01 - 6.84e-01 9.54e-0
2f 1
7 1.3955436e+04 2.05e-02 7.03e+00 -1.0 9.59e+00 - 7.22e-01 8.73e-0
1f 1
8 1.4214931e+04 1.09e-02 1.48e-01 -1.0 2.63e+00 - 9.90e-01 9.34e-0
1f 1
9 1.3824502e+04 2.88e-03 1.29e+00 -1.7 1.16e+01 - 3.11e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3790149e+04 2.40e-04 3.69e-01 -1.7 1.04e+01 - 8.14e-01 1.00e+0
0h 1
11 1.3800239e+04 1.32e-04 2.81e-03 -1.7 1.30e+01 - 1.00e+00 1.00e+0
0h 1
12 1.3625735e+04 5.12e-04 2.06e-02 -3.8 3.59e+01 - 8.39e-01 8.41e-0
1f 1
13 1.3606765e+04 1.63e-04 2.23e-01 -3.8 5.66e+00 - 9.93e-01 7.10e-0
1h 1
14 1.3601605e+04 3.45e-07 3.56e-04 -3.8 1.64e+00 - 1.00e+00 1.00e+0
0h 1
15 1.3600267e+04 1.96e-08 4.28e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
16 1.3600252e+04 8.33e-13 4.95e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.3600252128079479e+01 1.3600252128079479e+0
4
Dual infeasibility......: 4.9527156106163669e-10 4.9527156106163669e-0
7
Constraint violation....: 8.3273665740790648e-13 8.3273665740790648e-1
3
Complementarity.........: 4.3838522819143153e-09 4.3838522819143150e-0
6
Overall NLP error.......: 4.3838522819143153e-09 4.3838522819143150e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3006359e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 2.02e-03 9.80e-0
3h 1
2 9.2722762e+02 9.19e+03 5.23e+01 -1.0 8.88e+03 - 6.77e-05 1.02e-0
4h 1
3 9.0058749e+02 9.18e+03 5.23e+01 -1.0 9.18e+03 - 5.63e-06 1.42e-0
3f 1
4 4.9463665e+02 8.97e+03 5.24e+01 -1.0 9.18e+03 - 1.64e-03 2.27e-0
2h 1
5 2.1164030e+04 7.23e-02 7.69e+01 -1.0 8.97e+03 - 7.85e-02 1.00e+0
0h 1
6 1.3562973e+04 6.54e-02 2.35e+01 -1.0 8.38e+00 - 6.64e-01 8.73e-0
2f 1
7 1.2324131e+04 3.29e-02 9.64e+00 -1.0 7.01e+00 - 6.84e-01 1.00e+0
0f 1
8 1.2476105e+04 1.68e-02 6.52e-01 -1.0 2.39e+00 - 9.95e-01 4.91e-0
1f 2
9 1.2182671e+04 6.71e-03 2.78e-01 -1.7 9.98e+00 - 1.00e+00 8.44e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2122153e+04 1.23e-03 8.86e-02 -1.7 1.11e+01 - 1.00e+00 1.00e+0
0f 1
11 1.1995228e+04 3.35e-04 9.60e-02 -2.5 1.72e+01 - 9.85e-01 8.95e-0
1f 1
12 1.1986791e+04 4.66e-06 1.02e-03 -2.5 1.79e+00 - 1.00e+00 1.00e+0
0f 1
13 1.1965361e+04 5.87e-06 5.32e-03 -3.8 2.68e+00 - 1.00e+00 9.75e-0
1f 1
14 1.1965205e+04 1.30e-08 6.21e-06 -3.8 6.52e-02 - 1.00e+00 1.00e+0
0f 1
15 1.1964013e+04 1.73e-08 3.04e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0f 1
16 1.1963999e+04 1.28e-12 4.22e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.1963999131764856e+01 1.1963999131764856e+0
4
Dual infeasibility......: 4.2180144352277791e-10 4.2180144352277791e-0
7
Constraint violation....: 1.2798928583634961e-12 1.2798928583634961e-1
2
Complementarity.........: 2.5909993213630300e-09 2.5909993213630301e-0
6
Overall NLP error.......: 2.5909993213630300e-09 2.5909993213630301e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2299660e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1994562e+02 6.71e+03 5.23e+01 -1.0 5.82e+03 - 3.44e-05 1.14e-0
4h 1
3 7.2850981e+02 6.64e+03 5.23e+01 -1.0 6.70e+03 - 1.95e-05 9.17e-0
3f 1
4 4.9339552e+02 6.50e+03 5.19e+01 -1.0 6.64e+03 - 1.16e-02 2.10e-0
2h 1
5 1.5628520e+04 8.10e-02 7.81e+01 -1.0 6.50e+03 - 8.90e-02 1.00e+0
0h 1
6 1.0636045e+04 7.19e-02 2.13e+01 -1.0 1.24e+01 - 7.05e-01 1.06e-0
1f 1
7 9.4596866e+03 2.23e-02 3.10e+00 -1.0 9.08e+00 - 8.57e-01 8.74e-0
1f 1
8 9.7561577e+03 1.77e-02 1.92e-01 -1.0 2.44e+00 - 9.37e-01 9.15e-0
1f 1
9 9.3887446e+03 3.06e-03 9.73e-01 -1.7 4.67e+00 - 4.77e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.3572396e+03 3.20e-04 5.73e-01 -1.7 7.06e+00 - 6.96e-01 1.00e+0
0h 1
11 9.3734113e+03 8.52e-05 1.41e-01 -1.7 1.24e+01 - 8.21e-01 1.00e+0
0h 1
12 9.2169992e+03 4.51e-04 1.81e-02 -2.5 1.69e+01 - 9.63e-01 9.40e-0
1f 1
13 9.1911948e+03 1.51e-04 2.00e-01 -3.8 9.71e+00 - 9.89e-01 7.19e-0
1h 1
14 9.1841524e+03 4.10e-07 3.56e-04 -3.8 2.80e+00 - 1.00e+00 1.00e+0
0h 1
15 9.1828158e+03 2.01e-08 4.16e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
16 9.1828008e+03 8.65e-13 5.06e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 9.1828007707528361e+00 9.1828007707528359e+0
3
Dual infeasibility......: 5.0625996991517132e-10 5.0625996991517132e-0
7
Constraint violation....: 8.6453066927560940e-13 8.6453066927560940e-1
3
Complementarity.........: 4.3632490207426837e-09 4.3632490207426839e-0
6
Overall NLP error.......: 4.3632490207426837e-09 4.3632490207426839e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0887653e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0575715e+02 4.77e+03 5.23e+01 -1.0 4.05e+03 - 4.23e-05 1.17e-0
4h 1
3 6.7332406e+02 4.72e+03 5.24e+01 -1.0 4.77e+03 - 2.39e-05 1.03e-0
2f 1
4 4.3700848e+02 4.62e+03 5.18e+01 -1.0 4.72e+03 - 1.38e-02 2.11e-0
2h 1
5 1.3037787e+04 7.91e-02 7.80e+01 -1.0 4.62e+03 - 9.53e-02 1.00e+0
0h 1
6 8.3073577e+03 6.95e-02 2.11e+01 -1.0 2.25e+01 - 7.07e-01 1.14e-0
1f 1
7 6.9813417e+03 1.49e-02 1.23e+00 -1.0 1.41e+01 - 9.43e-01 7.79e-0
1f 1
8 7.2864193e+03 1.03e-02 7.11e-01 -1.0 4.36e+00 - 4.03e-01 9.21e-0
1f 1
9 6.8614886e+03 2.71e-03 2.60e-01 -1.7 2.89e+00 - 8.76e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.8361904e+03 8.52e-04 5.14e-01 -1.7 7.97e+00 - 6.42e-01 1.00e+0
0h 1
11 6.8626313e+03 6.86e-06 1.15e-01 -1.7 1.21e+01 - 8.21e-01 1.00e+0
0h 1
12 6.7036194e+03 4.75e-04 2.78e-02 -2.5 1.65e+01 - 9.73e-01 9.38e-0
1f 1
13 6.6706681e+03 1.36e-04 7.97e-02 -3.8 9.81e+00 - 9.82e-01 8.44e-0
1h 1
14 6.6673155e+03 1.82e-07 9.16e-02 -3.8 1.59e+00 - 9.28e-01 1.00e+0
0h 1
15 6.6672355e+03 4.92e-09 2.90e-05 -3.8 1.72e-04 - 1.00e+00 1.00e+0
0h 1
16 6.6659218e+03 1.93e-08 3.88e-03 -5.7 2.97e-01 - 1.00e+00 9.68e-0
1f 1
17 6.6658859e+03 5.75e-12 2.62e-08 -5.7 9.60e-03 - 1.00e+00 1.00e+0
0f 1
18 6.6658693e+03 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 6.6658693300895218e+00 6.6658693300895220e+0
3
Dual infeasibility......: 4.4780424339645082e-09 4.4780424339645082e-0
6
Constraint violation....: 2.6337404479548354e-12 2.6337404479548354e-1
2
Complementarity.........: 3.6085481597187565e-09 3.6085481597187563e-0
6
Overall NLP error.......: 4.4780424339645082e-09 4.4780424339645082e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9469463e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3h 1
2 8.9070845e+02 3.24e+03 5.24e+01 -1.0 2.13e+03 - 3.61e-05 1.51e-0
4h 1
3 3.3042115e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 6.40e-05 2.31e-0
2f 1
4 1.5680539e+04 6.28e-02 8.02e+01 -1.0 3.17e+03 - 3.82e-02 1.00e+0
0h 1
5 7.1096017e+03 5.94e-02 5.80e+01 -1.0 5.03e+01 - 2.72e-01 4.93e-0
2f 1
6 5.7281758e+03 2.48e-02 2.85e+01 -1.0 2.32e+01 - 5.13e-01 5.39e-0
1f 1
7 5.1166765e+03 1.01e-02 1.45e+00 -1.0 8.86e+00 - 9.34e-01 7.73e-0
1f 1
8 5.4253179e+03 3.01e-04 8.56e-02 -1.0 3.30e+00 - 9.98e-01 1.00e+0
0f 1
9 4.7994231e+03 2.08e-03 7.85e-02 -2.5 4.57e+00 - 8.62e-01 8.55e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.6288645e+03 2.21e-03 3.37e-01 -2.5 1.18e+00 - 1.00e+00 7.83e-0
1f 1
11 4.6027977e+03 1.46e-04 4.56e-03 -2.5 2.79e-01 - 1.00e+00 1.00e+0
0h 1
12 4.5779309e+03 2.16e-05 4.20e-02 -3.8 8.05e+00 - 1.00e+00 8.86e-0
1h 1
13 4.5759311e+03 5.62e-08 5.97e-04 -3.8 9.13e-01 - 1.00e+00 1.00e+0
0f 1
14 4.5743283e+03 4.27e-08 6.32e-05 -5.7 4.46e-01 - 1.00e+00 9.98e-0
1f 1
15 4.5743286e+03 1.89e-12 1.37e-08 -5.7 1.04e-03 - 1.00e+00 1.00e+0
0f 1
16 4.5743102e+03 2.57e-12 3.30e-06 -8.6 5.53e-03 - 1.00e+00 9.99e-0
1f 1
17 4.5743102e+03 1.64e-15 4.87e-14 -8.6 2.61e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 4.5743101985982406e+00 4.5743101985982403e+0
3
Dual infeasibility......: 4.8651066496163265e-14 4.8651066496163265e-1
1
Constraint violation....: 1.6377205746429750e-15 1.6377205746429750e-1
5
Complementarity.........: 2.7121238917317945e-09 2.7121238917317943e-0
6
Overall NLP error.......: 2.7121238917317945e-09 2.7121238917317943e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4528265e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 3.98e-04 9.81e-0
3f 1
2 8.4160251e+02 2.00e+03 5.24e+01 -1.0 1.48e+03 - 5.90e-05 1.34e-0
4h 1
3 2.7509537e+02 1.95e+03 5.26e+01 -1.0 2.00e+03 - 4.97e-05 2.18e-0
2f 1
4 1.3978763e+04 5.67e-02 8.10e+01 -1.0 1.95e+03 - 4.46e-02 1.00e+0
0h 1
5 5.1663756e+03 5.32e-02 5.38e+01 -1.0 8.22e+01 - 3.29e-01 5.48e-0
2f 1
6 3.0169279e+03 3.33e-02 2.97e+01 -1.0 4.25e+01 - 4.59e-01 5.39e-0
1f 1
7 5.0512416e+03 9.15e-03 1.65e+01 -1.0 2.43e+01 - 5.91e-01 1.00e+0
0h 1
8 3.0927580e+03 7.42e-03 4.15e-01 -1.0 2.10e+01 - 9.67e-01 1.00e+0
0f 1
9 2.7847845e+03 1.00e-03 1.63e-01 -1.7 5.24e+00 - 1.00e+00 9.12e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.6486959e+03 1.59e-03 2.72e-01 -2.5 6.05e+00 - 7.52e-01 1.00e+0
0f 1
11 2.5962169e+03 4.61e-03 3.97e-02 -2.5 2.93e+00 - 1.00e+00 1.00e+0
0h 1
12 2.6062895e+03 2.11e-04 6.40e-03 -2.5 4.76e-01 - 1.00e+00 1.00e+0
0h 1
13 2.5818658e+03 2.58e-04 4.25e-02 -3.8 5.37e+00 - 9.87e-01 8.87e-0
1h 1
14 2.5806677e+03 1.91e-06 1.63e-04 -3.8 6.01e-01 - 1.00e+00 1.00e+0
0h 1
15 2.5794704e+03 3.21e-07 2.10e-03 -5.7 2.97e-01 - 1.00e+00 9.78e-0
1h 1
16 2.5794585e+03 3.73e-11 2.11e-08 -5.7 6.59e-03 - 1.00e+00 1.00e+0
0f 1
17 2.5794438e+03 6.30e-11 4.40e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 2.5794437823737306e+00 2.5794437823737308e+0
3
Dual infeasibility......: 4.3996205524723803e-09 4.3996205524723803e-0
6
Constraint violation....: 6.3009500395061480e-11 6.3009500395061480e-1
1
Complementarity.........: 3.9787498575508513e-09 3.9787498575508514e-0
6
Overall NLP error.......: 4.3996205524723803e-09 4.3996205524723803e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6486496e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 4.93e-04 9.86e-0
3h 1
2 8.4983215e+02 9.17e+02 5.24e+01 -1.0 7.54e+02 - 7.95e-05 5.55e-0
4h 1
3 2.6208357e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 5.24e-04 2.21e-0
2h 1
4 1.2837707e+04 5.95e-02 8.02e+01 -1.0 8.97e+02 - 4.99e-02 1.00e+0
0h 1
5 4.2800818e+03 5.56e-02 5.36e+01 -1.0 7.38e+01 - 3.21e-01 5.97e-0
2f 1
6 2.6764980e+03 3.00e-02 2.80e+01 -1.0 3.91e+01 - 4.72e-01 4.34e-0
1f 1
7 2.1363415e+03 1.45e-02 2.60e+00 -1.0 1.10e+01 - 9.18e-01 1.00e+0
0f 1
8 2.4585748e+03 4.43e-04 8.55e-02 -1.0 4.21e+00 - 9.95e-01 1.00e+0
0f 1
9 1.8797650e+03 6.89e-04 3.75e-01 -2.5 8.00e+00 - 8.82e-01 7.24e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8062465e+03 2.67e-04 3.48e-01 -2.5 5.75e+00 - 8.80e-01 1.00e+0
0h 1
11 1.8006933e+03 6.84e-04 4.79e-01 -2.5 1.46e+00 - 1.00e+00 1.48e-0
1h 2
12 1.7790936e+03 1.37e-03 1.37e-02 -2.5 1.01e+00 - 1.00e+00 1.00e+0
0h 1
13 1.7518941e+03 1.27e-03 3.44e-02 -3.8 1.35e+01 - 7.93e-01 1.00e+0
0h 1
14 1.7489375e+03 2.26e-03 8.91e-04 -3.8 3.96e-02 - 1.00e+00 1.00e+0
0h 1
15 1.7492999e+03 4.34e-05 1.62e-04 -3.8 1.59e-02 - 1.00e+00 1.00e+0
0h 1
16 1.7473847e+03 1.06e-04 3.72e-04 -5.7 7.43e-01 - 9.51e-01 9.77e-0
1h 1
17 1.7473646e+03 2.26e-05 3.99e-03 -5.7 1.68e-02 - 1.00e+00 7.87e-0
1h 1
18 1.7473648e+03 8.06e-09 1.16e-06 -5.7 3.57e-03 - 1.00e+00 1.00e+0
0f 1
19 1.7473429e+03 8.84e-09 2.07e-05 -8.6 9.21e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7473425e+03 1.47e-12 7.02e-11 -8.6 1.54e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.7473425210389968e+00 1.7473425210389967e+0
3
Dual infeasibility......: 7.0182951542466404e-11 7.0182951542466404e-0
8
Constraint violation....: 1.4743761767022079e-12 1.4743761767022079e-1
2
Complementarity.........: 2.7913652476264687e-09 2.7913652476264689e-0
6
Overall NLP error.......: 2.7913652476264687e-09 2.7913652476264689e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146111909430e-01 6.4890146111909428e+0
2
Dual infeasibility......: 4.9126605652944596e-09 4.9126605652944596e-0
6
Constraint violation....: 6.2123813870940126e-09 6.2123813870940126e-0
9
Complementarity.........: 4.3646094984486179e-09 4.3646094984486175e-0
6
Overall NLP error.......: 6.2123813870940126e-09 4.9126605652944596e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933520e-01 5.8277753147933515e+0
2
Dual infeasibility......: 2.1031320945198554e-09 2.1031320945198554e-0
6
Constraint violation....: 6.2994401361926577e-11 6.2994401361926577e-1
1
Complementarity.........: 2.8882108897061754e-09 2.8882108897061753e-0
6
Overall NLP error.......: 2.8882108897061754e-09 2.8882108897061753e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146111909430e-01 6.4890146111909428e+0
2
Dual infeasibility......: 4.9126605652944596e-09 4.9126605652944596e-0
6
Constraint violation....: 6.2123813870940126e-09 6.2123813870940126e-0
9
Complementarity.........: 4.3646094984486179e-09 4.3646094984486175e-0
6
Overall NLP error.......: 6.2123813870940126e-09 4.9126605652944596e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.06e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.11e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235598023e+00 1.6104063235598023e+0
3
Dual infeasibility......: 2.4573593916134529e-12 2.4573593916134529e-0
9
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5062163919694822e-09 2.5062163919694822e-0
6
Overall NLP error.......: 2.5062163919694822e-09 2.5062163919694822e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2208552e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 3.29e-04 9.87e-0
3h 1
2 8.0324081e+02 9.17e+02 5.24e+01 -1.0 7.85e+02 - 8.88e-05 6.87e-0
4h 1
3 2.4240476e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 6.67e-04 2.10e-0
2h 1
4 1.2380470e+04 5.52e-02 8.24e+01 -1.0 8.98e+02 - 3.84e-02 1.00e+0
0h 1
5 3.8796340e+03 5.26e-02 5.61e+01 -1.0 8.06e+01 - 3.16e-01 5.00e-0
2f 1
6 1.9096184e+03 3.75e-02 3.00e+01 -1.0 3.91e+01 - 4.70e-01 5.04e-0
1f 1
7 4.6686527e+03 1.22e-02 2.67e+01 -1.0 2.05e+01 - 4.02e-01 1.00e+0
0h 1
8 1.8748444e+03 1.18e-02 1.00e+00 -1.0 2.53e+01 - 9.88e-01 8.94e-0
1f 1
9 2.0007636e+03 1.82e-04 4.63e-02 -1.0 3.23e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7349595e+03 2.15e-04 1.23e+00 -2.5 1.77e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5468547e+03 3.76e-03 1.33e-01 -2.5 7.59e+00 - 7.96e-01 1.00e+0
0f 1
12 1.5237336e+03 5.33e-03 3.08e-01 -2.5 1.83e+00 - 1.00e+00 7.68e-0
1h 1
13 1.5360585e+03 2.45e-04 4.69e-03 -2.5 7.08e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5034659e+03 1.70e-04 2.13e-02 -3.8 1.62e+01 - 9.91e-01 9.30e-0
1h 1
15 1.5021214e+03 7.20e-07 6.83e-05 -3.8 1.09e+00 - 1.00e+00 1.00e+0
0h 1
16 1.5003171e+03 3.77e-07 1.76e-04 -5.7 8.92e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003154e+03 3.79e-11 2.93e-09 -5.7 3.96e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.11e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932795349908e+00 1.5002932795349907e+0
3
Dual infeasibility......: 2.1693882517763902e-09 2.1693882517763902e-0
6
Constraint violation....: 6.2995719751768320e-11 6.2995719751768320e-1
1
Complementarity.........: 2.8882170397648014e-09 2.8882170397648011e-0
6
Overall NLP error.......: 2.8882170397648014e-09 2.8882170397648011e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
1 8.6465241e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 4.93e-04 9.87e-0
3h 1
2 8.4355052e+02 9.17e+02 5.24e+01 -1.0 8.01e+02 - 8.70e-05 7.80e-0
4h 1
3 2.6241304e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 7.62e-04 2.20e-0
2h 1
4 1.2719102e+04 5.98e-02 8.02e+01 -1.0 8.97e+02 - 5.04e-02 1.00e+0
0h 1
5 4.2679694e+03 5.58e-02 5.32e+01 -1.0 7.31e+01 - 3.26e-01 6.03e-0
2f 1
23 1.569956e+04 1.632511e+04 2.907038e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6793774e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.80e-0
3h 1
2 7.6493622e+02 1.57e+04 5.25e+01 -1.0 1.38e+04 - 2.51e-05 1.13e-0
4h 1
3 7.5737222e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 1.74e-05 6.00e-0
4h 1
4 5.2138457e+02 1.54e+04 5.27e+01 -1.0 1.57e+04 - 6.11e-04 1.98e-0
2h 1
5 2.6821102e+04 6.08e-02 8.54e+01 -1.0 1.54e+04 - 2.20e-02 1.00e+0
0h 1
6 1.8309183e+04 5.88e-02 7.26e+01 -1.0 8.49e+01 - 1.57e-01 3.59e-0
2f 1
7 1.6714218e+04 4.60e-02 3.63e+01 -1.0 2.76e+01 - 4.97e-01 4.48e-0
1f 1
8 1.7012031e+04 3.02e-02 1.55e+01 -1.0 1.63e+01 - 4.58e-01 1.25e-0
1f 4
9 1.6771845e+04 5.50e-03 2.08e-01 -1.0 4.35e+00 - 9.90e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6495833e+04 1.06e-03 2.80e-01 -1.7 5.12e+00 - 7.68e-01 8.82e-0
1f 1
11 1.6486059e+04 4.02e-04 5.27e-01 -1.7 1.66e+01 - 3.55e-01 1.00e+0
0f 1
12 1.6493802e+04 5.02e-05 5.48e-02 -1.7 1.66e+01 - 8.82e-01 1.00e+0
0h 1
13 1.6370683e+04 9.95e-04 5.38e-02 -2.5 2.62e+01 - 9.18e-01 1.00e+0
0f 1
14 1.6347816e+04 1.18e-03 1.26e-02 -2.5 3.22e+00 - 1.00e+00 1.00e+0
0h 1
15 1.6328522e+04 2.01e-04 8.97e-02 -3.8 8.41e+00 - 1.00e+00 8.49e-0
1h 1
16 1.6326483e+04 6.50e-07 1.07e-04 -3.8 1.08e+00 - 1.00e+00 1.00e+0
0h 1
17 1.6325120e+04 3.99e-07 1.11e-04 -5.7 4.45e-01 - 1.00e+00 9.97e-0
1h 1
18 1.6325122e+04 3.82e-11 3.00e-09 -5.7 7.76e-03 - 1.00e+00 1.00e+0
0f 1
19 1.6325105e+04 6.19e-11 4.96e-06 -8.6 5.53e-03 - 1.00e+00 9.92e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325105e+04 3.89e-15 1.35e-13 -8.6 3.65e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.6325105202049386e+01 1.6325105202049386e+0
4
Dual infeasibility......: 1.3477831095041020e-13 1.3477831095041020e-1
0
Constraint violation....: 3.8857805861880479e-15 3.8857805861880479e-1
5
Complementarity.........: 7.2546282718881247e-09 7.2546282718881248e-0
6
Overall NLP error.......: 7.2546282718881247e-09 7.2546282718881248e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6675466e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 4.98e-04 9.81e-0
3h 1
2 8.6322901e+02 1.50e+04 5.24e+01 -1.0 9.35e+03 - 1.41e-05 1.59e-0
4h 1
3 8.6202786e+02 1.50e+04 5.24e+01 -1.0 1.48e+04 - 6.51e-05 9.28e-0
5h 1
4 8.6007052e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 1.55e-04 1.54e-0
4h 1
5 5.8039565e+02 1.46e+04 5.25e+01 -1.0 1.50e+04 - 3.18e-04 2.23e-0
2f 1
6 2.6925979e+04 5.96e-02 8.01e+01 -1.0 1.46e+04 - 5.01e-02 1.00e+0
0h 1
7 1.8350296e+04 5.56e-02 5.37e+01 -1.0 7.35e+01 - 3.20e-01 5.98e-0
2f 1
8 1.6764182e+04 3.02e-02 2.80e+01 -1.0 3.89e+01 - 4.73e-01 4.32e-0
1f 1
9 1.6192123e+04 1.48e-02 2.60e+00 -1.0 1.10e+01 - 9.18e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6541177e+04 4.41e-04 7.48e-02 -1.0 4.08e+00 - 9.84e-01 1.00e+0
0f 1
11 1.5939164e+04 7.32e-04 3.42e-01 -2.5 8.07e+00 - 8.80e-01 7.35e-0
1f 1
12 1.5867522e+04 2.39e-04 3.44e-01 -2.5 2.97e+00 - 8.85e-01 1.00e+0
0h 1
13 1.5860493e+04 7.41e-04 4.20e-01 -2.5 1.39e+00 - 1.00e+00 2.07e-0
1h 2
14 1.5841375e+04 9.45e-04 1.13e-02 -2.5 9.10e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5822083e+04 1.21e-03 3.32e-02 -3.8 5.88e+00 - 7.93e-01 1.00e+0
0h 1
16 1.5819228e+04 2.39e-03 9.41e-04 -3.8 2.53e-01 - 1.00e+00 1.00e+0
0h 1
17 1.5819550e+04 4.76e-05 1.22e-04 -3.8 1.49e-02 - 1.00e+00 1.00e+0
0h 1
18 1.5818092e+04 1.03e-04 3.69e-04 -5.7 2.99e-01 - 9.51e-01 9.78e-0
1h 1
19 1.5818078e+04 2.27e-05 3.61e-03 -5.7 5.92e-03 - 1.00e+00 7.81e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5818080e+04 8.87e-09 1.24e-06 -5.7 1.30e-03 - 1.00e+00 1.00e+0
0f 1
21 1.5818064e+04 9.08e-09 1.91e-05 -8.6 3.69e-03 - 1.00e+00 9.83e-0
1h 1
22 1.5818064e+04 1.36e-12 6.44e-11 -8.6 6.11e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.5818063704669129e+01 1.5818063704669128e+0
4
Dual infeasibility......: 6.4428070084673763e-11 6.4428070084673770e-0
8
Constraint violation....: 1.3556933353697787e-12 1.3556933353697787e-1
2
Complementarity.........: 2.8531119420915004e-09 2.8531119420915005e-0
6
Overall NLP error.......: 2.8531119420915004e-09 2.8531119420915005e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891822e+02 1.39e+04 5.23e+01 -1.0 1.40e+04 - 1.00e-03 9.81e-0
3h 1
2 9.0554937e+02 1.39e+04 5.23e+01 -1.0 9.37e+03 - 1.32e-05 1.47e-0
4h 1
3 8.9803929e+02 1.39e+04 5.23e+01 -1.0 1.39e+04 - 5.19e-05 5.55e-0
4h 1
4 8.5581896e+02 1.38e+04 5.23e+01 -1.0 1.39e+04 - 6.01e-04 3.19e-0
3h 1
5 6.2437524e+02 1.35e+04 5.23e+01 -1.0 1.38e+04 - 4.10e-03 2.19e-0
2f 1
6 2.4564207e+04 7.06e-02 7.73e+01 -1.0 1.35e+04 - 8.60e-02 1.00e+0
0h 1
7 1.7706008e+04 6.32e-02 3.25e+01 -1.0 2.64e+01 - 5.54e-01 9.60e-0
2f 1
8 1.6191146e+04 1.99e-02 1.12e+01 -1.0 1.50e+01 - 6.75e-01 7.81e-0
1f 1
9 1.6481688e+04 2.56e-03 2.90e-01 -1.0 3.14e+00 - 9.76e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6019368e+04 1.58e-03 1.10e+00 -1.7 3.92e+00 - 3.56e-01 1.00e+0
0f 1
11 1.5988680e+04 2.81e-04 9.11e-01 -1.7 5.66e+00 - 5.76e-01 1.00e+0
0h 1
12 1.5987353e+04 9.82e-05 2.51e-01 -1.7 1.13e+01 - 7.34e-01 1.00e+0
0f 1
13 1.6009012e+04 6.04e-06 8.43e-02 -1.7 2.54e+01 - 6.51e-01 1.00e+0
0f 1
14 1.5840338e+04 4.77e-04 2.26e-02 -2.5 2.76e+01 - 9.64e-01 9.45e-0
1f 1
15 1.5796759e+04 1.39e-04 7.74e-02 -3.8 2.24e+01 - 9.81e-01 8.45e-0
1h 1
16 1.5793610e+04 1.81e-07 9.47e-02 -3.8 1.48e+00 - 9.25e-01 1.00e+0
0h 1
17 1.5793643e+04 4.91e-09 2.93e-05 -3.8 1.13e-01 - 1.00e+00 1.00e+0
0h 1
18 1.5792178e+04 1.93e-08 3.88e-03 -5.7 4.53e-01 - 1.00e+00 9.68e-0
1f 1
19 1.5792141e+04 5.75e-12 2.62e-08 -5.7 1.15e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5792122e+04 2.63e-12 4.48e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.5792122189328968e+01 1.5792122189328968e+0
4
Dual infeasibility......: 4.4780423150944455e-09 4.4780423150944455e-0
6
Constraint violation....: 2.6336571812279885e-12 2.6336571812279885e-1
2
Complementarity.........: 3.6085482008092702e-09 3.6085482008092703e-0
6
Overall NLP error.......: 4.4780423150944455e-09 4.4780423150944455e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8073105e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.97e-04 9.80e-0
3h 1
2 8.7796146e+02 1.27e+04 5.24e+01 -1.0 1.24e+04 - 8.93e-05 1.01e-0
4h 1
3 8.6692458e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 3.47e-06 7.37e-0
4f 1
4 5.4092019e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 7.99e-04 2.24e-0
2h 1
5 2.4576710e+04 6.17e-02 7.93e+01 -1.0 1.24e+04 - 5.67e-02 1.00e+0
0h 1
6 1.6171478e+04 5.73e-02 5.23e+01 -1.0 6.39e+01 - 3.28e-01 6.59e-0
2f 1
7 1.4812866e+04 3.11e-02 2.54e+01 -1.0 3.21e+01 - 5.03e-01 4.22e-0
1f 1
8 1.4040427e+04 1.14e-02 2.00e+00 -1.0 1.10e+01 - 9.20e-01 9.11e-0
1f 1
9 1.4460004e+04 3.38e-04 9.28e-02 -1.0 4.85e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3750291e+04 1.39e-03 7.06e-02 -2.5 6.50e+00 - 8.71e-01 8.55e-0
1f 1
11 1.3727058e+04 1.41e-05 1.70e-02 -2.5 6.60e-01 - 1.00e+00 1.00e+0
0h 1
12 1.3695913e+04 1.35e-03 3.69e-02 -3.8 2.68e+00 - 7.12e-01 1.00e+0
0f 1
13 1.3693938e+04 9.56e-04 1.56e-03 -3.8 3.41e-02 - 9.61e-01 1.00e+0
0h 1
14 1.3694087e+04 1.22e-04 1.32e-04 -3.8 1.60e-02 - 1.00e+00 1.00e+0
0h 1
15 1.3692879e+04 1.38e-04 1.17e-03 -5.7 1.49e-01 - 9.16e-01 1.00e+0
0h 1
16 1.3692835e+04 3.55e-05 7.55e-06 -5.7 8.77e-03 - 1.00e+00 1.00e+0
0h 1
17 1.3692839e+04 4.36e-07 4.70e-06 -5.7 9.55e-04 - 1.00e+00 1.00e+0
0h 1
18 1.3692826e+04 3.62e-08 4.80e-05 -8.6 1.84e-03 - 1.00e+00 9.49e-0
1h 1
19 1.3692826e+04 6.54e-12 6.63e-11 -8.6 9.47e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.3692825515980269e+01 1.3692825515980268e+0
4
Dual infeasibility......: 6.6307835860771098e-11 6.6307835860771105e-0
8
Constraint violation....: 6.5408789495791098e-12 6.5408789495791098e-1
2
Complementarity.........: 2.5095397411953253e-09 2.5095397411953253e-0
6
Overall NLP error.......: 2.5095397411953253e-09 2.5095397411953253e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6662389e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 4.97e-04 9.80e-0
3h 1
2 8.6375901e+02 1.11e+04 5.24e+01 -1.0 1.04e+04 - 4.51e-05 1.05e-0
4h 1
3 8.1247865e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 9.09e-06 3.08e-0
3h 1
4 5.1271377e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 3.39e-03 2.10e-0
2h 1
5 2.1781269e+04 6.25e-02 8.04e+01 -1.0 1.09e+04 - 5.65e-02 1.00e+0
0h 1
6 1.4355473e+04 5.79e-02 4.85e+01 -1.0 6.64e+01 - 3.84e-01 6.77e-0
2f 1
7 1.2780687e+04 3.04e-02 2.34e+01 -1.0 3.79e+01 - 5.09e-01 4.42e-0
1f 1
8 1.2333284e+04 1.27e-02 2.11e+00 -1.0 1.05e+01 - 9.22e-01 1.00e+0
0f 1
9 1.2590751e+04 3.91e-04 7.29e-02 -1.0 4.30e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2099307e+04 5.08e-04 6.40e-01 -2.5 7.12e+00 - 8.93e-01 6.41e-0
1f 1
11 1.2017941e+04 2.37e-04 3.82e-01 -2.5 2.45e+00 - 8.88e-01 1.00e+0
0h 1
12 1.1994709e+04 6.02e-03 2.19e-01 -2.5 1.69e+00 - 1.00e+00 6.03e-0
1h 1
13 1.1985170e+04 7.03e-04 5.56e-03 -2.5 4.75e-01 - 1.00e+00 1.00e+0
0f 1
14 1.1966692e+04 1.15e-03 2.92e-02 -3.8 5.36e+00 - 8.09e-01 1.00e+0
0h 1
15 1.1963688e+04 2.25e-03 1.06e-03 -3.8 4.73e-02 - 1.00e+00 1.00e+0
0h 1
16 1.1964070e+04 4.49e-05 1.48e-04 -3.8 1.50e-02 - 1.00e+00 1.00e+0
0h 1
17 1.1962598e+04 1.05e-04 4.27e-04 -5.7 2.97e-01 - 9.51e-01 9.82e-0
1h 1
18 1.1962590e+04 2.18e-05 3.56e-03 -5.7 5.37e-03 - 1.00e+00 7.94e-0
1h 1
19 1.1962593e+04 8.54e-09 1.12e-06 -5.7 1.11e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.1962577e+04 8.97e-09 1.93e-05 -8.6 3.68e-03 - 1.00e+00 9.83e-0
1h 1
21 1.1962576e+04 1.38e-12 6.48e-11 -8.6 6.13e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.1962576489000643e+01 1.1962576489000643e+0
4
Dual infeasibility......: 6.4763639593469033e-11 6.4763639593469026e-0
8
Constraint violation....: 1.3765655282327316e-12 1.3765655282327316e-1
2
Complementarity.........: 2.5576647514061437e-09 2.5576647514061436e-0
6
Overall NLP error.......: 2.5576647514061437e-09 2.5576647514061436e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891839e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0614875e+02 9.19e+03 5.23e+01 -1.0 8.94e+03 - 8.31e-05 1.02e-0
4h 1
3 8.8589053e+02 9.18e+03 5.23e+01 -1.0 9.18e+03 - 4.99e-06 1.11e-0
3f 1
4 4.8290407e+02 8.97e+03 5.24e+01 -1.0 9.18e+03 - 1.26e-03 2.28e-0
2h 1
5 2.1194856e+04 6.67e-02 7.66e+01 -1.0 8.97e+03 - 8.32e-02 1.00e+0
0h 1
6 1.3110859e+04 6.01e-02 3.76e+01 -1.0 2.89e+01 - 4.83e-01 9.02e-0
2f 1
7 1.1611939e+04 1.94e-02 1.53e+01 -1.0 1.53e+01 - 6.18e-01 7.42e-0
1f 1
8 1.1669715e+04 5.64e-03 1.25e+00 -1.0 2.10e+00 - 9.91e-01 5.00e-0
1f 2
9 1.1851856e+04 3.17e-04 6.99e-02 -1.0 2.45e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1303065e+04 2.21e-03 9.19e-02 -2.5 2.21e+01 - 8.56e-01 8.21e-0
1f 1
11 1.1134535e+04 2.12e-03 4.58e-01 -2.5 3.77e+00 - 1.00e+00 7.49e-0
1f 1
12 1.1105283e+04 1.58e-04 4.78e-03 -2.5 9.43e-01 - 1.00e+00 1.00e+0
0h 1
13 1.1088904e+04 4.25e-05 1.63e-01 -3.8 2.68e+00 - 1.00e+00 7.50e-0
1h 1
14 1.1084573e+04 1.45e-07 3.58e-04 -3.8 6.70e-01 - 1.00e+00 1.00e+0
0f 1
15 1.1083348e+04 2.78e-08 9.22e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 1.1083335e+04 1.87e-12 1.33e-08 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
17 1.1083321e+04 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.1083320734163408e+01 1.1083320734163408e+0
4
Dual infeasibility......: 4.4776954432982937e-09 4.4776954432982937e-0
6
Constraint violation....: 2.6308191736212905e-12 2.6308191736212905e-1
2
Complementarity.........: 3.6085004294617256e-09 3.6085004294617257e-0
6
Overall NLP error.......: 4.4776954432982937e-09 4.4776954432982937e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2298458e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1944863e+02 6.71e+03 5.23e+01 -1.0 4.84e+03 - 2.16e-05 1.37e-0
4h 1
3 4.2746489e+02 6.55e+03 5.24e+01 -1.0 6.71e+03 - 4.40e-05 2.36e-0
2f 1
4 1.9375137e+04 6.81e-02 8.01e+01 -1.0 6.55e+03 - 3.23e-02 1.00e+0
0h 1
5 1.1073105e+04 6.48e-02 6.20e+01 -1.0 2.30e+01 - 2.26e-01 4.46e-0
2f 1
6 9.8597986e+03 1.54e-02 2.76e+01 -1.0 1.04e+01 - 5.80e-01 7.55e-0
1f 1
7 9.7407089e+03 8.27e-03 3.90e-01 -1.0 2.06e+00 - 9.86e-01 1.00e+0
0f 1
8 9.3846978e+03 1.66e-03 1.00e-01 -1.7 3.27e+00 - 1.00e+00 9.75e-0
1f 1
9 9.2396015e+03 1.75e-03 5.24e-01 -2.5 4.91e+00 - 1.00e+00 7.49e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.2091546e+03 3.14e-04 9.62e-02 -2.5 1.22e+00 - 1.00e+00 8.96e-0
1h 1
11 9.2123965e+03 1.16e-05 4.01e-03 -2.5 1.27e-01 - 1.00e+00 1.00e+0
0f 1
12 9.1849124e+03 1.05e-05 7.99e-03 -3.8 8.04e+00 - 1.00e+00 9.61e-0
1f 1
13 9.1843091e+03 1.57e-08 1.36e-05 -3.8 3.09e-01 - 1.00e+00 1.00e+0
0f 1
14 9.1828174e+03 1.79e-08 5.06e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0f 1
15 9.1828008e+03 6.40e-13 4.11e-10 -8.6 5.52e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 9.1828007734084718e+00 9.1828007734084713e+0
3
Dual infeasibility......: 4.1141860185221681e-10 4.1141860185221681e-0
7
Constraint violation....: 6.4048766290625281e-13 6.4048766290625281e-1
3
Complementarity.........: 2.6724224347821251e-09 2.6724224347821251e-0
6
Overall NLP error.......: 2.6724224347821251e-09 2.6724224347821251e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3004795e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 2.02e-03 9.80e-0
3h 1
2 9.2712367e+02 4.77e+03 5.23e+01 -1.0 4.47e+03 - 6.97e-05 1.06e-0
4h 1
3 8.6230721e+02 4.76e+03 5.23e+01 -1.0 4.77e+03 - 1.09e-05 2.80e-0
3f 1
4 3.9458856e+02 4.65e+03 5.23e+01 -1.0 4.76e+03 - 3.78e-03 2.20e-0
2h 1
5 1.5936731e+04 7.51e-02 7.75e+01 -1.0 4.65e+03 - 7.99e-02 1.00e+0
0h 1
6 9.0816127e+03 6.78e-02 2.29e+01 -1.0 8.31e+00 - 6.77e-01 9.05e-0
2f 1
7 7.8525062e+03 3.47e-02 8.39e+00 -1.0 6.89e+00 - 7.10e-01 1.00e+0
0f 1
8 8.1952987e+03 2.05e-02 2.98e-01 -1.0 2.41e+00 - 9.96e-01 9.69e-0
1f 1
9 7.7640020e+03 3.95e-03 3.54e-01 -1.7 1.12e+01 - 8.33e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.7107177e+03 7.81e-04 3.48e-02 -1.7 7.24e+00 - 1.00e+00 1.00e+0
0h 1
11 7.5664017e+03 4.99e-04 2.40e-02 -2.5 1.64e+01 - 9.77e-01 9.84e-0
1f 1
12 7.5511474e+03 1.19e-04 1.70e-01 -3.8 2.89e+00 - 9.96e-01 7.71e-0
1h 1
13 7.5477479e+03 2.23e-07 1.25e-04 -3.8 6.61e-01 - 1.00e+00 1.00e+0
0f 1
14 7.5465612e+03 1.74e-08 3.02e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
15 7.5465477e+03 1.28e-12 4.23e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 7.5465477256362341e+00 7.5465477256362337e+0
3
Dual infeasibility......: 4.2290145445434020e-10 4.2290145445434020e-0
7
Constraint violation....: 1.2840561947058404e-12 1.2840561947058404e-1
2
Complementarity.........: 2.5905430566379769e-09 2.5905430566379771e-0
6
Overall NLP error.......: 2.5905430566379769e-09 2.5905430566379771e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9469463e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3h 1
2 8.9070845e+02 3.24e+03 5.24e+01 -1.0 2.13e+03 - 3.61e-05 1.51e-0
4h 1
3 3.3042115e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 6.40e-05 2.31e-0
2f 1
4 1.5680539e+04 6.28e-02 8.02e+01 -1.0 3.17e+03 - 3.82e-02 1.00e+0
0h 1
5 7.1096017e+03 5.94e-02 5.80e+01 -1.0 5.03e+01 - 2.72e-01 4.93e-0
2f 1
6 5.7281758e+03 2.48e-02 2.85e+01 -1.0 2.32e+01 - 5.13e-01 5.39e-0
1f 1
7 5.1166765e+03 1.01e-02 1.45e+00 -1.0 8.86e+00 - 9.34e-01 7.73e-0
1f 1
8 5.4253179e+03 3.01e-04 8.56e-02 -1.0 3.30e+00 - 9.99e-01 1.00e+0
0f 1
9 4.7995196e+03 2.08e-03 7.85e-02 -2.5 4.57e+00 - 8.62e-01 8.55e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.6288824e+03 2.21e-03 3.37e-01 -2.5 1.09e+00 - 1.00e+00 7.83e-0
1f 1
11 4.6027987e+03 1.46e-04 4.55e-03 -2.5 2.52e-01 - 1.00e+00 1.00e+0
0h 1
12 4.5779304e+03 2.16e-05 4.20e-02 -3.8 8.05e+00 - 1.00e+00 8.86e-0
1h 1
13 4.5759311e+03 5.62e-08 5.97e-04 -3.8 9.12e-01 - 1.00e+00 1.00e+0
0f 1
14 4.5743283e+03 4.27e-08 6.36e-05 -5.7 4.46e-01 - 1.00e+00 9.98e-0
1f 1
15 4.5743286e+03 1.89e-12 1.38e-08 -5.7 1.05e-03 - 1.00e+00 1.00e+0
0f 1
16 4.5743102e+03 2.57e-12 3.30e-06 -8.6 5.53e-03 - 1.00e+00 9.99e-0
1f 1
17 4.5743102e+03 7.11e-15 4.87e-14 -8.6 2.79e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 4.5743101989404513e+00 4.5743101989404513e+0
3
Dual infeasibility......: 4.8660071588802837e-14 4.8660071588802837e-1
1
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.6637106072641685e-09 2.6637106072641685e-0
6
Overall NLP error.......: 2.6637106072641685e-09 2.6637106072641685e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4518010e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 3.98e-04 9.82e-0
3f 1
2 8.4053778e+02 2.00e+03 5.24e+01 -1.0 1.16e+03 - 4.81e-05 1.70e-0
4h 1
3 8.2353960e+02 2.00e+03 5.24e+01 -1.0 1.99e+03 - 9.16e-05 6.55e-0
4h 1
4 2.7656016e+02 1.95e+03 5.26e+01 -1.0 2.00e+03 - 7.38e-04 2.15e-0
2f 1
5 1.3590771e+04 5.75e-02 8.12e+01 -1.0 1.95e+03 - 4.60e-02 1.00e+0
0h 1
6 5.1287561e+03 5.39e-02 5.24e+01 -1.0 7.94e+01 - 3.46e-01 5.65e-0
2f 1
7 3.0120352e+03 3.43e-02 2.84e+01 -1.0 4.22e+01 - 4.66e-01 5.35e-0
1f 1
8 4.8304165e+03 7.84e-03 1.41e+01 -1.0 2.16e+01 - 6.33e-01 1.00e+0
0h 1
9 3.1436336e+03 5.61e-03 3.45e-01 -1.0 1.83e+01 - 9.68e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.7927316e+03 1.05e-03 4.74e-02 -1.7 5.61e+00 - 8.78e-01 8.81e-0
1f 1
11 2.6624340e+03 1.03e-03 3.41e-01 -2.5 5.47e+00 - 7.76e-01 1.00e+0
0h 1
12 2.5963515e+03 8.58e-03 4.86e-02 -2.5 3.67e+00 - 1.00e+00 1.00e+0
0h 1
13 2.6068715e+03 3.19e-04 6.33e-03 -2.5 5.01e-01 - 1.00e+00 1.00e+0
0h 1
14 2.5817387e+03 2.17e-04 5.21e-02 -3.8 6.99e+00 - 9.85e-01 8.71e-0
1h 1
15 2.5806495e+03 2.20e-06 1.53e-04 -3.8 2.80e-01 - 1.00e+00 1.00e+0
0h 1
16 2.5794666e+03 3.11e-07 2.15e-03 -5.7 2.90e-01 - 1.00e+00 9.77e-0
1h 1
17 2.5794585e+03 3.61e-11 2.15e-08 -5.7 2.88e-03 - 1.00e+00 1.00e+0
0f 1
18 2.5794438e+03 6.30e-11 4.40e-09 -8.6 3.69e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 2.5794437818248630e+00 2.5794437818248630e+0
3
Dual infeasibility......: 4.3996310467138120e-09 4.3996310467138120e-0
6
Constraint violation....: 6.3011262874113072e-11 6.3011262874113072e-1
1
Complementarity.........: 3.7040101176974613e-09 3.7040101176974611e-0
6
Overall NLP error.......: 4.3996310467138120e-09 4.3996310467138120e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0722351e+02 9.17e+02 5.23e+01 -1.0 9.21e+02 - 9.83e-04 9.87e-0
3h 1
2 8.7181015e+02 9.16e+02 5.23e+01 -1.0 8.49e+02 - 8.21e-05 1.33e-0
3h 1
3 2.8525933e+02 8.96e+02 5.24e+01 -1.0 9.16e+02 - 1.33e-03 2.27e-0
2h 1
4 1.2888305e+04 6.67e-02 7.66e+01 -1.0 8.96e+02 - 8.35e-02 1.00e+0
0h 1
5 4.8213129e+03 6.00e-02 3.81e+01 -1.0 2.98e+01 - 4.77e-01 9.05e-0
2f 1
6 3.3290085e+03 2.03e-02 1.54e+01 -1.0 1.56e+01 - 6.18e-01 7.30e-0
1f 1
7 3.4190135e+03 4.87e-03 1.78e-01 -1.0 2.13e+00 - 9.89e-01 1.00e+0
0f 1
8 2.9973978e+03 1.46e-03 1.26e-01 -1.7 8.20e+00 - 1.00e+00 1.00e+0
0f 1
9 2.8444942e+03 2.01e-03 4.21e-01 -2.5 8.26e+00 - 1.00e+00 7.84e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8204528e+03 1.63e-04 5.17e-03 -2.5 1.65e+00 - 1.00e+00 1.00e+0
0h 1
11 2.7937997e+03 4.18e-05 1.50e-01 -3.8 1.62e+01 - 1.00e+00 7.59e-0
1h 1
12 2.7864668e+03 1.42e-07 4.01e-04 -3.8 3.86e+00 - 1.00e+00 1.00e+0
0f 1
13 2.7845010e+03 2.94e-08 8.77e-04 -5.7 8.92e-01 - 1.00e+00 9.86e-0
1f 1
14 2.7844789e+03 1.88e-12 1.50e-08 -5.7 1.23e-02 - 1.00e+00 1.00e+0
0f 1
15 2.7844549e+03 2.63e-12 5.21e-09 -8.6 1.11e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 2.7844549014482092e+00 2.7844549014482091e+0
3
Dual infeasibility......: 5.2053920870602087e-09 5.2053920870602087e-0
6
Constraint violation....: 2.6308608069847139e-12 2.6308608069847139e-1
2
Complementarity.........: 3.7921329579210182e-09 3.7921329579210180e-0
6
Overall NLP error.......: 5.2053920870602087e-09 5.2053920870602087e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254150027e-01 6.4890146254150022e+0
2
Dual infeasibility......: 4.9126604771039302e-09 4.9126604771039302e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646095252368596e-09 4.3646095252368595e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126604771039302e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933498e-01 5.8277753147933493e+0
2
Dual infeasibility......: 2.1031318722715391e-09 2.1031318722715391e-0
6
Constraint violation....: 6.2994567895380271e-11 6.2994567895380271e-1
1
Complementarity.........: 2.8882108896910881e-09 2.8882108896910880e-0
6
Overall NLP error.......: 2.8882108896910881e-09 2.8882108896910880e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254150027e-01 6.4890146254150022e+0
2
Dual infeasibility......: 4.9126604771039302e-09 4.9126604771039302e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646095252368596e-09 4.3646095252368595e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126604771039302e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.05e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.11e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281623857e+00 1.6104063281623858e+0
3
Dual infeasibility......: 2.4575615400629565e-12 2.4575615400629565e-0
9
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5062163910051633e-09 2.5062163910051632e-0
6
Overall NLP error.......: 2.5062163910051633e-09 2.5062163910051632e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2234838e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 3.29e-04 9.86e-0
3h 1
2 8.0851121e+02 9.17e+02 5.24e+01 -1.0 7.37e+02 - 8.13e-05 5.03e-0
4h 1
3 2.4208772e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 4.72e-04 2.11e-0
2f 1
4 1.2483905e+04 5.50e-02 8.24e+01 -1.0 8.98e+02 - 3.81e-02 1.00e+0
0h 1
5 3.8885348e+03 5.25e-02 5.69e+01 -1.0 8.15e+01 - 3.07e-01 4.97e-0
2f 1
6 1.9109594e+03 3.75e-02 3.05e+01 -1.0 3.91e+01 - 4.68e-01 5.05e-0
1f 1
7 4.6824436e+03 1.22e-02 2.71e+01 -1.0 2.06e+01 - 4.00e-01 1.00e+0
0h 1
8 1.8756839e+03 1.20e-02 1.03e+00 -1.0 2.55e+01 - 9.88e-01 8.91e-0
1f 1
9 1.9982537e+03 1.92e-04 4.73e-02 -1.0 3.02e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7319203e+03 2.18e-04 1.23e+00 -2.5 1.85e+01 - 9.37e-01 5.95e-0
1f 1
11 1.5438684e+03 3.77e-03 1.33e-01 -2.5 7.58e+00 - 7.97e-01 1.00e+0
0f 1
12 1.5209376e+03 5.20e-03 3.06e-01 -2.5 1.81e+00 - 1.00e+00 7.69e-0
1h 1
13 1.5332266e+03 2.42e-04 4.66e-03 -2.5 7.13e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5031329e+03 1.70e-04 2.13e-02 -3.8 1.35e+01 - 9.90e-01 9.30e-0
1h 1
15 1.5019710e+03 7.23e-07 6.84e-05 -3.8 9.12e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003147e+03 3.77e-07 1.76e-04 -5.7 7.43e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.79e-11 2.93e-09 -5.7 3.98e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932776817834e+00 1.5002932776817834e+0
3
Dual infeasibility......: 2.1694135768477149e-09 2.1694135768477149e-0
6
Constraint violation....: 6.2995747507343935e-11 6.2995747507343935e-1
1
Complementarity.........: 2.8882170464371835e-09 2.8882170464371833e-0
6
Overall NLP error.......: 2.8882170464371835e-09 2.8882170464371833e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6486917e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 4.93e-04 9.86e-0
3h 1
2 8.4983616e+02 9.17e+02 5.24e+01 -1.0 7.54e+02 - 7.95e-05 5.55e-0
4h 1
3 2.6208567e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 5.24e-04 2.21e-0
2h 1
4 1.2837742e+04 5.95e-02 8.02e+01 -1.0 8.97e+02 - 4.99e-02 1.00e+0
0h 1
5 4.2801283e+03 5.56e-02 5.36e+01 -1.0 7.38e+01 - 3.21e-01 5.97e-0
2f 1
24 1.677845e+04 1.632511e+04 2.962279e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6792846e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.81e-0
3h 1
2 7.6482968e+02 1.57e+04 5.25e+01 -1.0 1.29e+04 - 2.09e-05 1.21e-0
4h 1
3 7.5982359e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 2.57e-05 3.97e-0
4h 1
4 7.4559884e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 4.19e-04 1.17e-0
3h 1
5 5.3961839e+02 1.54e+04 5.27e+01 -1.0 1.57e+04 - 1.73e-03 1.99e-0
2f 1
6 2.6049420e+04 6.18e-02 8.49e+01 -1.0 1.54e+04 - 3.06e-02 1.00e+0
0h 1
7 1.8233836e+04 5.92e-02 6.37e+01 -1.0 7.28e+01 - 2.54e-01 4.46e-0
2f 1
8 1.6688322e+04 4.55e-02 3.10e+01 -1.0 2.88e+01 - 5.08e-01 4.32e-0
1f 1
9 1.7265863e+04 2.71e-02 1.35e+01 -1.0 1.58e+01 - 4.75e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6777482e+04 6.14e-03 2.68e-01 -1.0 5.69e+00 - 9.84e-01 1.00e+0
0f 1
11 1.6494257e+04 9.33e-04 1.45e+00 -1.7 4.63e+00 - 2.57e-01 9.10e-0
1f 1
12 1.6487286e+04 1.50e-04 6.49e-01 -1.7 4.48e+00 - 6.63e-01 1.00e+0
0f 1
13 1.6477409e+04 1.23e-04 2.28e-01 -1.7 1.13e+01 - 5.73e-01 1.00e+0
0f 1
14 1.6492928e+04 1.43e-05 4.05e-02 -1.7 1.85e+01 - 8.14e-01 1.00e+0
0f 1
15 1.6372086e+04 9.55e-04 4.99e-02 -2.5 2.45e+01 - 9.23e-01 1.00e+0
0f 1
16 1.6348027e+04 1.13e-03 1.20e-02 -2.5 4.63e+00 - 1.00e+00 1.00e+0
0h 1
17 1.6328300e+04 1.92e-04 8.63e-02 -3.8 8.77e+00 - 1.00e+00 8.52e-0
1h 1
18 1.6326483e+04 5.65e-07 1.01e-04 -3.8 9.03e-01 - 1.00e+00 1.00e+0
0h 1
19 1.6325119e+04 4.00e-07 1.11e-04 -5.7 4.45e-01 - 1.00e+00 9.97e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325122e+04 3.81e-11 2.98e-09 -5.7 8.50e-03 - 1.00e+00 1.00e+0
0f 1
21 1.6325105e+04 6.19e-11 5.03e-06 -8.6 5.53e-03 - 1.00e+00 9.92e-0
1h 1
22 1.6325105e+04 1.42e-14 1.38e-13 -8.6 4.01e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.6325105202185107e+01 1.6325105202185106e+0
4
Dual infeasibility......: 1.3826908402145375e-13 1.3826908402145375e-1
0
Constraint violation....: 1.4210854715202004e-14 1.4210854715202004e-1
4
Complementarity.........: 7.4026791613297626e-09 7.4026791613297622e-0
6
Overall NLP error.......: 7.4026791613297626e-09 7.4026791613297622e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6677668e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 4.98e-04 9.80e-0
3h 1
2 8.6399933e+02 1.50e+04 5.24e+01 -1.0 1.48e+04 - 9.09e-05 1.01e-0
4h 1
3 8.5620146e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 2.90e-06 6.09e-0
4f 1
4 5.8161776e+02 1.46e+04 5.25e+01 -1.0 1.50e+04 - 6.50e-04 2.21e-0
2h 1
5 2.6836042e+04 5.98e-02 8.01e+01 -1.0 1.46e+04 - 5.04e-02 1.00e+0
0h 1
6 1.8341212e+04 5.58e-02 5.34e+01 -1.0 7.30e+01 - 3.23e-01 6.03e-0
2f 1
7 1.6755757e+04 3.02e-02 2.77e+01 -1.0 3.88e+01 - 4.75e-01 4.32e-0
1f 1
8 1.6473563e+04 1.45e-02 2.55e+00 -1.0 1.10e+01 - 9.18e-01 5.00e-0
1f 2
9 1.6312176e+04 7.14e-03 1.81e+00 -1.0 7.89e+00 - 1.00e+00 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6416137e+04 5.57e-04 4.25e-02 -1.0 9.94e+01 - 1.00e+00 1.00e+0
0f 1
11 1.5983221e+04 4.46e-04 9.59e-01 -2.5 9.81e+01 - 9.17e-01 5.85e-0
1f 1
12 1.5861354e+04 2.19e-04 2.20e-01 -2.5 4.03e+01 - 9.25e-01 1.00e+0
0f 1
13 1.5835419e+04 3.07e-03 1.94e-02 -2.5 1.15e+00 - 1.00e+00 1.00e+0
0h 1
14 1.5822105e+04 7.99e-04 3.59e-02 -3.8 2.68e+00 - 8.03e-01 1.00e+0
0h 1
15 1.5819178e+04 2.13e-03 1.02e-03 -3.8 4.84e-02 - 1.00e+00 1.00e+0
0h 1
16 1.5819391e+04 4.92e-05 1.31e-04 -3.8 1.22e-02 - 1.00e+00 1.00e+0
0h 1
17 1.5818089e+04 1.01e-04 3.42e-04 -5.7 1.49e-01 - 9.50e-01 9.75e-0
1h 1
18 1.5818076e+04 2.31e-05 3.77e-03 -5.7 3.67e-03 - 1.00e+00 7.73e-0
1h 1
19 1.5818079e+04 9.13e-09 1.28e-06 -5.7 8.34e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5818064e+04 9.12e-09 1.91e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
21 1.5818064e+04 1.36e-12 6.49e-11 -8.6 3.06e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.5818063716316610e+01 1.5818063716316610e+0
4
Dual infeasibility......: 6.4922684661365996e-11 6.4922684661365996e-0
8
Constraint violation....: 1.3581358260239540e-12 1.3581358260239540e-1
2
Complementarity.........: 2.5092897311067966e-09 2.5092897311067964e-0
6
Overall NLP error.......: 2.5092897311067966e-09 2.5092897311067964e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6663632e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 4.97e-04 9.80e-0
3h 1
2 8.6385551e+02 1.39e+04 5.24e+01 -1.0 1.37e+04 - 9.10e-05 1.01e-0
4h 1
3 8.5474456e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 3.12e-06 6.56e-0
4f 1
4 5.5736289e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 7.05e-04 2.21e-0
2h 1
5 2.5729005e+04 5.98e-02 8.02e+01 -1.0 1.36e+04 - 5.05e-02 1.00e+0
0h 1
6 1.7257833e+04 5.58e-02 5.33e+01 -1.0 7.29e+01 - 3.25e-01 6.04e-0
2f 1
7 1.5669674e+04 3.02e-02 2.77e+01 -1.0 3.88e+01 - 4.75e-01 4.33e-0
1f 1
8 1.5391032e+04 1.45e-02 2.54e+00 -1.0 1.10e+01 - 9.18e-01 5.00e-0
1f 2
9 1.5231410e+04 7.14e-03 1.81e+00 -1.0 7.85e+00 - 1.00e+00 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5334693e+04 5.59e-04 4.23e-02 -1.0 9.95e+01 - 1.00e+00 1.00e+0
0f 1
11 1.4902809e+04 4.46e-04 9.63e-01 -2.5 9.82e+01 - 9.17e-01 5.84e-0
1f 1
12 1.4780239e+04 2.23e-04 2.20e-01 -2.5 4.04e+01 - 9.25e-01 1.00e+0
0f 1
13 1.4754279e+04 3.09e-03 1.97e-02 -2.5 1.15e+00 - 1.00e+00 1.00e+0
0h 1
14 1.4740982e+04 8.07e-04 3.65e-02 -3.8 2.68e+00 - 8.02e-01 1.00e+0
0h 1
15 1.4738047e+04 2.15e-03 1.02e-03 -3.8 4.89e-02 - 1.00e+00 1.00e+0
0h 1
16 1.4738260e+04 4.87e-05 1.38e-04 -3.8 1.22e-02 - 1.00e+00 1.00e+0
0h 1
17 1.4736958e+04 1.01e-04 3.31e-04 -5.7 1.49e-01 - 9.50e-01 9.74e-0
1h 1
18 1.4736943e+04 2.31e-05 3.85e-03 -5.7 3.81e-03 - 1.00e+00 7.72e-0
1h 1
19 1.4736946e+04 9.00e-09 1.28e-06 -5.7 8.67e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.4736932e+04 9.08e-09 1.93e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
21 1.4736931e+04 1.37e-12 6.54e-11 -8.6 3.06e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.4736931404451656e+01 1.4736931404451656e+0
4
Dual infeasibility......: 6.5446542885335337e-11 6.5446542885335337e-0
8
Constraint violation....: 1.3695711231775931e-12 1.3695711231775931e-1
2
Complementarity.........: 2.5092871210367225e-09 2.5092871210367223e-0
6
Overall NLP error.......: 2.5092871210367225e-09 2.5092871210367223e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8073105e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.97e-04 9.80e-0
3h 1
2 8.7796146e+02 1.27e+04 5.24e+01 -1.0 1.24e+04 - 8.93e-05 1.01e-0
4h 1
3 8.6692458e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 3.47e-06 7.37e-0
4f 1
4 5.4092019e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 7.99e-04 2.24e-0
2h 1
5 2.4576710e+04 6.17e-02 7.93e+01 -1.0 1.24e+04 - 5.67e-02 1.00e+0
0h 1
6 1.6171478e+04 5.73e-02 5.23e+01 -1.0 6.39e+01 - 3.28e-01 6.59e-0
2f 1
7 1.4812866e+04 3.11e-02 2.54e+01 -1.0 3.21e+01 - 5.03e-01 4.22e-0
1f 1
8 1.4040427e+04 1.14e-02 2.00e+00 -1.0 1.10e+01 - 9.20e-01 9.11e-0
1f 1
9 1.4460004e+04 3.38e-04 9.28e-02 -1.0 4.85e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3750291e+04 1.39e-03 7.06e-02 -2.5 6.50e+00 - 8.71e-01 8.55e-0
1f 1
11 1.3727058e+04 1.41e-05 1.70e-02 -2.5 6.60e-01 - 1.00e+00 1.00e+0
0h 1
12 1.3695913e+04 1.35e-03 3.69e-02 -3.8 2.68e+00 - 7.12e-01 1.00e+0
0f 1
13 1.3693938e+04 9.56e-04 1.56e-03 -3.8 3.41e-02 - 9.61e-01 1.00e+0
0h 1
14 1.3694087e+04 1.22e-04 1.32e-04 -3.8 1.60e-02 - 1.00e+00 1.00e+0
0h 1
15 1.3692879e+04 1.38e-04 1.17e-03 -5.7 1.49e-01 - 9.16e-01 1.00e+0
0h 1
16 1.3692835e+04 3.55e-05 7.55e-06 -5.7 8.77e-03 - 1.00e+00 1.00e+0
0h 1
17 1.3692839e+04 4.36e-07 4.70e-06 -5.7 9.55e-04 - 1.00e+00 1.00e+0
0h 1
18 1.3692826e+04 3.62e-08 4.80e-05 -8.6 1.84e-03 - 1.00e+00 9.49e-0
1h 1
19 1.3692826e+04 6.54e-12 6.63e-11 -8.6 9.47e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.3692825515726447e+01 1.3692825515726447e+0
4
Dual infeasibility......: 6.6307839229321040e-11 6.6307839229321040e-0
8
Constraint violation....: 6.5409899718815723e-12 6.5409899718815723e-1
2
Complementarity.........: 2.5095397414773980e-09 2.5095397414773979e-0
6
Overall NLP error.......: 2.5095397414773980e-09 2.5095397414773979e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6661550e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 4.97e-04 9.80e-0
3h 1
2 8.6363291e+02 1.11e+04 5.24e+01 -1.0 9.79e+03 - 3.03e-05 1.12e-0
4h 1
3 7.2333563e+02 1.10e+04 5.24e+01 -1.0 1.11e+04 - 1.69e-05 8.42e-0
3h 1
4 5.7808677e+02 1.08e+04 5.22e+01 -1.0 1.10e+04 - 9.34e-03 2.05e-0
2h 1
5 1.9796510e+04 6.72e-02 7.99e+01 -1.0 1.08e+04 - 7.46e-02 1.00e+0
0h 1
6 1.4065448e+04 6.07e-02 2.67e+01 -1.0 5.76e+01 - 6.41e-01 8.95e-0
2f 1
7 1.2504239e+04 3.06e-02 3.42e+00 -1.0 3.47e+01 - 8.19e-01 4.95e-0
1f 1
8 1.2326032e+04 8.78e-03 4.28e-01 -1.0 9.08e+00 - 9.42e-01 1.00e+0
0f 1
9 1.2079566e+04 2.22e-03 1.70e-01 -1.7 3.96e+00 - 7.25e-01 7.47e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2003487e+04 1.26e-04 1.58e-01 -2.5 2.08e+00 - 9.47e-01 1.00e+0
0h 1
11 1.1986574e+04 2.73e-03 6.25e-03 -2.5 2.68e+00 - 1.00e+00 1.00e+0
0h 1
12 1.1967885e+04 1.31e-03 4.46e-02 -3.8 7.50e+00 - 7.55e-01 1.00e+0
0h 1
13 1.1963829e+04 3.98e-03 1.25e-03 -3.8 5.45e-02 - 1.00e+00 1.00e+0
0h 1
14 1.1964212e+04 5.42e-05 2.34e-04 -3.8 1.41e-02 - 1.00e+00 1.00e+0
0h 1
15 1.1962601e+04 1.07e-04 4.77e-04 -5.7 4.46e-01 - 9.49e-01 9.83e-0
1h 1
16 1.1962591e+04 2.45e-05 3.96e-03 -5.7 7.37e-03 - 1.00e+00 7.72e-0
1h 1
17 1.1962595e+04 9.50e-09 1.22e-06 -5.7 1.68e-03 - 1.00e+00 1.00e+0
0f 1
18 1.1962577e+04 9.07e-09 1.96e-05 -8.6 5.53e-03 - 1.00e+00 9.83e-0
1h 1
19 1.1962576e+04 1.39e-12 6.65e-11 -8.6 9.25e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.1962576490563572e+01 1.1962576490563571e+0
4
Dual infeasibility......: 6.6482006062147159e-11 6.6482006062147159e-0
8
Constraint violation....: 1.3916645613676337e-12 1.3916645613676337e-1
2
Complementarity.........: 3.0915950220754984e-09 3.0915950220754983e-0
6
Overall NLP error.......: 3.0915950220754984e-09 3.0915950220754983e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3005826e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 2.02e-03 9.80e-0
3h 1
2 9.2703232e+02 9.19e+03 5.23e+01 -1.0 8.09e+03 - 2.76e-05 1.12e-0
4h 1
3 7.5783100e+02 9.11e+03 5.23e+01 -1.0 9.19e+03 - 1.67e-05 9.02e-0
3f 1
4 5.7019951e+02 8.91e+03 5.19e+01 -1.0 9.11e+03 - 1.10e-02 2.10e-0
2h 1
5 1.8305220e+04 8.28e-02 7.82e+01 -1.0 8.91e+03 - 8.71e-02 1.00e+0
0h 1
6 1.3289624e+04 7.37e-02 2.12e+01 -1.0 7.99e+00 - 7.08e-01 1.04e-0
1f 1
7 1.2190257e+04 3.47e-02 3.50e+00 -1.0 6.47e+00 - 8.56e-01 9.70e-0
1f 1
8 1.2545395e+04 3.12e-02 3.81e-01 -1.0 2.06e+00 - 9.38e-01 9.51e-0
1f 1
9 1.2155470e+04 4.32e-03 1.09e+00 -1.7 4.72e+00 - 4.86e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2130727e+04 3.81e-04 6.06e-01 -1.7 7.20e+00 - 6.97e-01 1.00e+0
0h 1
11 1.2150697e+04 9.24e-05 1.23e-01 -1.7 1.25e+01 - 8.28e-01 1.00e+0
0f 1
12 1.1996401e+04 3.88e-04 1.90e-02 -2.5 1.74e+01 - 9.73e-01 9.45e-0
1f 1
13 1.1970962e+04 1.01e-04 1.51e-01 -3.8 9.53e+00 - 9.96e-01 7.76e-0
1h 1
14 1.1965350e+04 2.21e-07 1.26e-04 -3.8 2.18e+00 - 1.00e+00 1.00e+0
0f 1
15 1.1964014e+04 1.78e-08 2.99e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
16 1.1963999e+04 1.29e-12 4.23e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.1963999129771565e+01 1.1963999129771564e+0
4
Dual infeasibility......: 4.2345346234306635e-10 4.2345346234306635e-0
7
Constraint violation....: 1.2938955462615809e-12 1.2938955462615809e-1
2
Complementarity.........: 4.4764957667578908e-09 4.4764957667578907e-0
6
Overall NLP error.......: 4.4764957667578908e-09 4.4764957667578907e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2299660e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1994562e+02 6.71e+03 5.23e+01 -1.0 5.82e+03 - 3.44e-05 1.14e-0
4h 1
3 7.2850980e+02 6.64e+03 5.23e+01 -1.0 6.70e+03 - 1.95e-05 9.17e-0
3f 1
4 4.9339553e+02 6.50e+03 5.19e+01 -1.0 6.64e+03 - 1.16e-02 2.10e-0
2h 1
5 1.5628520e+04 8.10e-02 7.81e+01 -1.0 6.50e+03 - 8.90e-02 1.00e+0
0h 1
6 1.0636045e+04 7.19e-02 2.13e+01 -1.0 1.24e+01 - 7.05e-01 1.06e-0
1f 1
7 9.4596866e+03 2.23e-02 3.10e+00 -1.0 9.08e+00 - 8.57e-01 8.74e-0
1f 1
8 9.7561577e+03 1.77e-02 1.86e-01 -1.0 2.44e+00 - 9.39e-01 9.15e-0
1f 1
9 9.3889386e+03 3.06e-03 9.84e-01 -1.7 4.79e+00 - 4.72e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.3575504e+03 3.17e-04 5.70e-01 -1.7 7.13e+00 - 6.99e-01 1.00e+0
0h 1
11 9.3737111e+03 8.67e-05 1.37e-01 -1.7 1.25e+01 - 8.26e-01 1.00e+0
0h 1
12 9.2168298e+03 4.53e-04 1.82e-02 -2.5 1.73e+01 - 9.63e-01 9.41e-0
1f 1
13 9.1911578e+03 1.51e-04 2.00e-01 -3.8 9.62e+00 - 9.89e-01 7.19e-0
1h 1
14 9.1841524e+03 4.08e-07 3.56e-04 -3.8 2.77e+00 - 1.00e+00 1.00e+0
0h 1
15 9.1828158e+03 2.01e-08 4.16e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
16 9.1828008e+03 8.65e-13 5.06e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 9.1828007707890542e+00 9.1828007707890538e+0
3
Dual infeasibility......: 5.0621919048631959e-10 5.0621919048631959e-0
7
Constraint violation....: 8.6453066927560940e-13 8.6453066927560940e-1
3
Complementarity.........: 4.3591288853058462e-09 4.3591288853058458e-0
6
Overall NLP error.......: 4.3591288853058462e-09 4.3591288853058458e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0890039e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0606063e+02 4.77e+03 5.23e+01 -1.0 4.53e+03 - 8.51e-05 1.04e-0
4h 1
3 8.5674884e+02 4.76e+03 5.23e+01 -1.0 4.77e+03 - 9.62e-06 2.18e-0
3f 1
4 3.8122229e+02 4.65e+03 5.23e+01 -1.0 4.76e+03 - 2.82e-03 2.23e-0
2h 1
5 1.6129511e+04 6.86e-02 7.70e+01 -1.0 4.65e+03 - 8.42e-02 1.00e+0
0h 1
6 8.6428592e+03 6.17e-02 3.53e+01 -1.0 2.77e+01 - 5.15e-01 9.25e-0
2f 1
7 7.1353041e+03 1.99e-02 1.35e+01 -1.0 1.52e+01 - 6.41e-01 7.60e-0
1f 1
8 7.2345504e+03 6.03e-03 1.10e+00 -1.0 2.38e+00 - 9.93e-01 5.00e-0
1f 2
9 7.4467494e+03 2.48e-04 6.11e-02 -1.0 3.13e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.8841153e+03 2.26e-03 8.91e-02 -2.5 2.93e+01 - 8.55e-01 8.27e-0
1f 1
11 6.7163515e+03 2.12e-03 4.49e-01 -2.5 4.53e+00 - 1.00e+00 7.51e-0
1f 1
12 6.6879049e+03 1.53e-04 4.78e-03 -2.5 1.12e+00 - 1.00e+00 1.00e+0
0h 1
13 6.6714076e+03 4.08e-05 1.58e-01 -3.8 2.68e+00 - 1.00e+00 7.53e-0
1h 1
14 6.6671226e+03 1.41e-07 3.55e-04 -3.8 6.62e-01 - 1.00e+00 1.00e+0
0f 1
15 6.6658964e+03 2.80e-08 9.30e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 6.6658841e+03 1.87e-12 1.34e-08 -5.7 2.14e-03 - 1.00e+00 1.00e+0
0f 1
17 6.6658693e+03 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 6.6658693303610734e+00 6.6658693303610735e+0
3
Dual infeasibility......: 4.4776950742608616e-09 4.4776950742608616e-0
6
Constraint violation....: 2.6308399903030022e-12 2.6308399903030022e-1
2
Complementarity.........: 3.6084999010220847e-09 3.6084999010220845e-0
6
Overall NLP error.......: 4.4776950742608616e-09 4.4776950742608616e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2291184e+02 3.24e+03 5.23e+01 -1.0 3.27e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1824882e+02 3.24e+03 5.23e+01 -1.0 1.80e+03 - 2.80e-05 1.78e-0
4h 1
3 3.4580800e+02 3.17e+03 5.24e+01 -1.0 3.24e+03 - 9.12e-05 2.35e-0
2f 1
4 1.5889383e+04 6.81e-02 7.83e+01 -1.0 3.17e+03 - 5.42e-02 1.00e+0
0h 1
5 7.5694720e+03 6.34e-02 4.88e+01 -1.0 1.73e+01 - 3.65e-01 6.40e-0
2f 1
6 6.2120976e+03 1.27e-02 2.15e+01 -1.0 9.82e+00 - 6.05e-01 8.68e-0
1f 1
7 6.3908340e+03 3.81e-03 1.93e-01 -1.0 2.40e+00 - 9.91e-01 1.00e+0
0f 1
8 5.9353062e+03 1.50e-03 8.74e-02 -1.7 6.26e+00 - 1.00e+00 1.00e+0
0f 1
9 5.7758949e+03 1.91e-03 4.70e-01 -2.5 1.73e+00 - 1.00e+00 7.62e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.7472961e+03 2.95e-04 8.78e-02 -2.5 4.02e-01 - 1.00e+00 9.05e-0
1h 1
11 5.7505453e+03 1.10e-05 3.63e-03 -2.5 3.84e-02 - 1.00e+00 1.00e+0
0f 1
12 5.7231763e+03 1.03e-05 8.91e-03 -3.8 8.05e+00 - 1.00e+00 9.59e-0
1f 1
13 5.7225084e+03 1.56e-08 1.41e-05 -3.8 3.28e-01 - 1.00e+00 1.00e+0
0f 1
14 5.7210166e+03 1.79e-08 5.06e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0f 1
15 5.7210000e+03 6.40e-13 4.11e-10 -8.6 5.51e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.7210000342892071e+00 5.7210000342892072e+0
3
Dual infeasibility......: 4.1136453392781361e-10 4.1136453392781361e-0
7
Constraint violation....: 6.4037664060379029e-13 6.4037664060379029e-1
3
Complementarity.........: 3.0634244294135871e-09 3.0634244294135869e-0
6
Overall NLP error.......: 3.0634244294135871e-09 3.0634244294135869e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8047271e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.82e-0
3h 1
2 8.7572172e+02 2.00e+03 5.24e+01 -1.0 1.12e+03 - 4.57e-05 1.77e-0
4h 1
3 8.5848648e+02 2.00e+03 5.24e+01 -1.0 1.99e+03 - 9.83e-05 6.73e-0
4h 1
4 2.9495823e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 7.63e-04 2.24e-0
2f 1
5 1.3915686e+04 6.17e-02 7.93e+01 -1.0 1.95e+03 - 5.68e-02 1.00e+0
0h 1
6 5.5165622e+03 5.73e-02 5.23e+01 -1.0 6.38e+01 - 3.28e-01 6.60e-0
2f 1
7 4.1580659e+03 3.11e-02 2.54e+01 -1.0 3.21e+01 - 5.03e-01 4.22e-0
1f 1
8 3.3871743e+03 1.13e-02 1.99e+00 -1.0 1.10e+01 - 9.20e-01 9.10e-0
1f 1
9 3.8058980e+03 3.36e-04 1.98e-01 -1.0 4.84e+00 - 9.33e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.1155523e+03 1.20e-03 9.63e-01 -1.7 1.96e+01 - 4.64e-01 9.97e-0
1f 1
11 3.1853524e+03 4.48e-05 2.37e-02 -1.7 6.81e+00 - 1.00e+00 1.00e+0
0f 1
12 3.0668329e+03 4.90e-05 1.81e-01 -2.5 2.57e+01 - 1.00e+00 8.61e-0
1f 1
13 3.0614584e+03 8.55e-05 2.74e-03 -2.5 2.83e-01 - 1.00e+00 1.00e+0
0f 1
14 3.0435536e+03 2.48e-04 6.70e-02 -3.8 7.00e+00 - 7.79e-01 9.53e-0
1h 1
15 3.0406309e+03 1.60e-03 1.54e-03 -3.8 3.27e-01 - 9.82e-01 1.00e+0
0f 1
16 3.0406229e+03 8.24e-05 6.19e-05 -3.8 2.32e-02 - 1.00e+00 1.00e+0
0h 1
17 3.0392663e+03 1.30e-04 1.10e-03 -5.7 3.04e-01 - 9.19e-01 1.00e+0
0h 1
18 3.0392284e+03 3.23e-05 6.59e-06 -5.7 8.38e-03 - 1.00e+00 1.00e+0
0h 1
19 3.0392341e+03 1.71e-07 3.28e-06 -5.7 5.94e-04 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 3.0392190e+03 2.64e-08 3.19e-05 -8.6 3.69e-03 - 1.00e+00 9.58e-0
1h 1
21 3.0392184e+03 4.26e-12 5.09e-11 -8.6 1.55e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 3.0392183888601298e+00 3.0392183888601298e+0
3
Dual infeasibility......: 5.0917992518372474e-11 5.0917992518372474e-0
8
Constraint violation....: 4.2560399649005376e-12 4.2560399649005376e-1
2
Complementarity.........: 3.9325535861738840e-09 3.9325535861738842e-0
6
Overall NLP error.......: 3.9325535861738840e-09 3.9325535861738842e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2303872e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 3.31e-04 9.86e-0
3h 1
2 8.0919006e+02 9.17e+02 5.24e+01 -1.0 7.37e+02 - 8.12e-05 5.04e-0
4h 1
3 2.4239398e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 4.72e-04 2.11e-0
2f 1
4 1.2489447e+04 5.50e-02 8.23e+01 -1.0 8.98e+02 - 3.83e-02 1.00e+0
0h 1
5 3.8941148e+03 5.25e-02 5.67e+01 -1.0 8.14e+01 - 3.09e-01 4.98e-0
2f 1
6 1.9112633e+03 3.73e-02 3.04e+01 -1.0 3.92e+01 - 4.68e-01 5.06e-0
1f 1
7 4.6876227e+03 1.23e-02 2.71e+01 -1.0 2.07e+01 - 3.99e-01 1.00e+0
0h 1
8 1.8763004e+03 1.20e-02 1.04e+00 -1.0 2.56e+01 - 9.88e-01 8.91e-0
1f 1
9 1.9981274e+03 1.95e-04 4.76e-02 -1.0 2.98e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7321093e+03 2.19e-04 1.23e+00 -2.5 1.80e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5439398e+03 3.77e-03 1.33e-01 -2.5 7.59e+00 - 7.95e-01 1.00e+0
0f 1
12 1.5209204e+03 5.17e-03 3.09e-01 -2.5 1.82e+00 - 1.00e+00 7.67e-0
1h 1
13 1.5332321e+03 2.41e-04 4.72e-03 -2.5 7.16e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5031438e+03 1.70e-04 2.15e-02 -3.8 1.35e+01 - 9.90e-01 9.29e-0
1h 1
15 1.5019709e+03 7.24e-07 6.84e-05 -3.8 9.19e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003148e+03 3.77e-07 1.78e-04 -5.7 7.43e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.79e-11 2.92e-09 -5.7 4.20e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932776789193e+00 1.5002932776789194e+0
3
Dual infeasibility......: 2.1737237292536822e-09 2.1737237292536822e-0
6
Constraint violation....: 6.2995830774070782e-11 6.2995830774070782e-1
1
Complementarity.........: 2.8882174443527476e-09 2.8882174443527476e-0
6
Overall NLP error.......: 2.8882174443527476e-09 2.8882174443527476e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1584841e+02 1.09e+02 1.13e+02 -1.0 3.76e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1398692e+04 5.38e-02 8.36e+01 -1.0 4.53e+01 - 3.10e-02 1.00e+0
0h 1
3 2.7848916e+03 5.17e-02 6.48e+01 -1.0 8.43e+01 - 2.27e-01 4.32e-0
2f 1
4 9.8155785e+02 4.24e-02 3.38e+01 -1.0 3.41e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5909723e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.21e-01 1.00e+0
0h 1
6 9.4491032e+02 1.01e-02 8.73e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6264865e+02 4.59e-04 6.60e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536469e+02 1.94e-03 1.94e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379741e+02 3.25e-03 6.12e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140235e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388164e+02 1.57e-04 1.69e-02 -3.8 7.57e-01 - 9.93e-01 9.41e-0
1h 1
12 5.8370191e+02 7.28e-07 6.65e-05 -3.8 8.63e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278679e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.06e-09 -5.7 3.41e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148935385e-01 5.8277753148935381e+0
2
Dual infeasibility......: 2.0880540104020105e-09 2.0880540104020105e-0
6
Constraint violation....: 6.2994165439533845e-11 6.2994165439533845e-1
1
Complementarity.........: 2.8882094461488151e-09 2.8882094461488151e-0
6
Overall NLP error.......: 2.8882094461488151e-09 2.8882094461488151e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1584841e+02 1.09e+02 1.13e+02 -1.0 3.76e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1398692e+04 5.38e-02 8.36e+01 -1.0 4.53e+01 - 3.10e-02 1.00e+0
0h 1
3 2.7848916e+03 5.17e-02 6.48e+01 -1.0 8.43e+01 - 2.27e-01 4.32e-0
2f 1
4 9.8155785e+02 4.24e-02 3.38e+01 -1.0 3.41e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5909723e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.21e-01 1.00e+0
0h 1
6 9.4491032e+02 1.01e-02 8.73e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6264865e+02 4.59e-04 6.60e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536469e+02 1.94e-03 1.94e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379741e+02 3.25e-03 6.12e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140235e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388164e+02 1.57e-04 1.69e-02 -3.8 7.57e-01 - 9.93e-01 9.41e-0
1h 1
12 5.8370191e+02 7.28e-07 6.65e-05 -3.8 8.63e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278679e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.06e-09 -5.7 3.41e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148935385e-01 5.8277753148935381e+0
2
Dual infeasibility......: 2.0880540104020105e-09 2.0880540104020105e-0
6
Constraint violation....: 6.2994165439533845e-11 6.2994165439533845e-1
1
Complementarity.........: 2.8882094461488151e-09 2.8882094461488151e-0
6
Overall NLP error.......: 2.8882094461488151e-09 2.8882094461488151e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.77e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5003661e+02 7.50e+01 9.04e+01 -1.0 2.59e+01 - 3.83e-04 3.52e-0
2f 1
2 1.1818872e+04 5.63e-02 8.12e+01 -1.0 2.87e+01 - 4.64e-02 1.00e+0
0h 1
3 3.1585743e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.65e-0
2f 1
4 1.0154810e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8148897e+03 7.28e-03 1.55e+01 -1.0 1.93e+01 - 6.11e-01 1.00e+0
0h 1
6 1.1196673e+03 5.40e-03 4.04e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8244210e+02 9.99e-04 2.10e-01 -1.7 5.71e+00 - 1.00e+00 8.87e-0
1h 1
8 7.2817516e+02 8.46e-04 1.35e-02 -1.7 3.45e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0982259e+02 1.50e-03 1.13e-01 -3.8 4.49e+00 - 7.71e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8216110e+02 2.17e-03 7.23e-02 -3.8 2.11e+00 - 8.07e-01 7.40e-0
1h 1
11 5.8336684e+02 9.52e-05 4.78e-02 -3.8 3.17e-02 - 1.00e+00 9.56e-0
1h 1
12 5.8368716e+02 2.82e-07 1.33e-05 -3.8 3.28e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278928e+02 4.12e-07 5.39e-04 -5.7 3.47e-02 - 1.00e+00 9.91e-0
1h 1
14 5.8278859e+02 4.36e-11 3.52e-09 -5.7 2.10e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.65e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753111572739e-01 5.8277753111572736e+0
2
Dual infeasibility......: 2.6503252905510431e-09 2.6503252905510431e-0
6
Constraint violation....: 6.3002228434250185e-11 6.3002228434250185e-1
1
Complementarity.........: 2.8882681473557689e-09 2.8882681473557688e-0
6
Overall NLP error.......: 2.8882681473557689e-09 2.8882681473557688e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.27e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9796473e+02 4.09e+01 5.94e+01 -1.0 1.42e+01 - 6.99e-04 4.23e-0
2f 1
2 1.2226497e+04 6.07e-02 7.87e+01 -1.0 1.80e+01 - 7.07e-02 1.00e+0
0h 1
3 3.6201832e+03 5.54e-02 5.15e+01 -1.0 5.45e+01 - 3.33e-01 7.87e-0
2f 1
4 2.3523812e+03 2.93e-02 2.28e+01 -1.0 2.70e+01 - 5.45e-01 4.46e-0
1f 1
5 1.7571767e+03 8.49e-03 1.17e+00 -1.0 9.96e+00 - 9.27e-01 7.68e-0
1f 1
6 2.0298800e+03 3.42e-04 8.15e-02 -1.0 3.35e+00 - 1.00e+00 1.00e+0
0h 1
7 1.4033455e+03 2.08e-03 8.15e-02 -2.5 4.87e+00 - 8.66e-01 8.50e-0
1f 1
8 1.2236679e+03 2.16e-03 2.06e-01 -2.5 1.05e+00 - 1.00e+00 8.33e-0
1f 1
9 1.2066818e+03 8.65e-05 3.81e-03 -2.5 1.49e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1969333e+03 4.60e-05 1.08e+00 -3.8 9.70e-02 - 1.00e+00 4.99e-0
1h 1
11 1.1949894e+03 3.31e-07 1.13e-01 -3.8 3.83e-02 - 9.68e-01 1.00e+0
0f 1
12 1.1939528e+03 1.38e-08 1.76e-03 -3.8 3.31e-02 - 1.00e+00 1.00e+0
0H 1
13 1.1941496e+03 1.10e-05 2.71e-04 -3.8 3.66e-03 - 1.00e+00 1.00e+0
0f 1
14 1.1935294e+03 1.78e-06 6.37e-02 -5.7 1.23e-02 - 7.78e-01 9.68e-0
1h 1
15 1.1933614e+03 1.24e-05 2.14e-04 -5.7 5.02e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1933675e+03 2.91e-08 2.24e-06 -5.7 2.67e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1933542e+03 2.76e-08 9.71e-06 -8.6 2.46e-04 - 9.82e-01 9.89e-0
1h 1
18 1.1933541e+03 2.43e-13 3.27e-11 -8.6 1.97e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1933540952483828e+00 1.1933540952483827e+0
3
Dual infeasibility......: 3.2688520395937281e-11 3.2688520395937281e-0
8
Constraint violation....: 2.4302782009044677e-13 2.4302782009044677e-1
3
Complementarity.........: 2.5120652671228353e-09 2.5120652671228354e-0
6
Overall NLP error.......: 2.5120652671228353e-09 2.5120652671228354e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2278116e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 3.31e-04 9.87e-0
3h 1
2 8.0655676e+02 9.17e+02 5.24e+01 -1.0 7.64e+02 - 9.12e-05 5.91e-0
4h 1
3 6.8551274e+02 9.13e+02 5.24e+01 -1.0 9.17e+02 - 5.58e-04 4.52e-0
3h 1
4 2.5424767e+02 8.94e+02 5.24e+01 -1.0 9.13e+02 - 5.37e-03 2.03e-0
2f 1
5 1.0171545e+04 5.97e-02 8.27e+01 -1.0 8.94e+02 - 4.73e-02 1.00e+0
0h 1
6 3.6641626e+03 5.57e-02 4.00e+01 -1.0 6.42e+01 - 5.07e-01 6.19e-0
2f 1
7 1.8848289e+03 3.80e-02 1.82e+01 -1.0 3.83e+01 - 5.39e-01 4.87e-0
1f 1
8 2.8688311e+03 3.43e-03 5.12e+00 -1.0 6.15e+00 - 8.07e-01 1.00e+0
0f 1
9 2.1131669e+03 1.02e-03 8.36e-02 -1.0 6.46e+00 - 9.91e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6961669e+03 7.22e-04 4.22e-01 -2.5 7.50e+00 - 9.09e-01 7.34e-0
1f 1
11 1.5458644e+03 3.09e-03 2.28e-01 -2.5 7.71e+00 - 7.23e-01 1.00e+0
0f 1
12 1.5243442e+03 2.42e-03 2.16e-01 -2.5 1.67e+00 - 1.00e+00 8.40e-0
1h 1
13 1.5335197e+03 1.10e-04 3.95e-03 -2.5 4.58e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5029410e+03 1.62e-04 2.15e-02 -3.8 1.39e+01 - 9.92e-01 9.31e-0
1h 1
15 1.5019708e+03 7.72e-07 7.02e-05 -3.8 7.26e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003141e+03 3.77e-07 1.79e-04 -5.7 7.43e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.80e-11 2.93e-09 -5.7 1.63e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932775671221e+00 1.5002932775671220e+0
3
Dual infeasibility......: 2.1737171970584127e-09 2.1737171970584127e-0
6
Constraint violation....: 6.2995636485041473e-11 6.2995636485041473e-1
1
Complementarity.........: 2.8882173001269422e-09 2.8882173001269421e-0
6
Overall NLP error.......: 2.8882173001269422e-09 2.8882173001269421e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
1 8.6534799e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 4.97e-04 9.87e-0
3h 1
2 8.4756645e+02 9.17e+02 5.24e+01 -1.0 7.79e+02 - 8.94e-05 6.57e-0
4h 1
3 7.0654356e+02 9.12e+02 5.24e+01 -1.0 9.17e+02 - 6.24e-04 5.32e-0
3h 1
4 2.7668058e+02 8.93e+02 5.23e+01 -1.0 9.12e+02 - 6.28e-03 2.08e-0
2f 1
5 1.0297985e+04 6.55e-02 8.03e+01 -1.0 8.93e+02 - 6.71e-02 1.00e+0
0h 1
25 1.597944e+04 1.632511e+04 3.017785e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6792846e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.81e-0
3h 1
2 7.6482968e+02 1.57e+04 5.25e+01 -1.0 1.29e+04 - 2.09e-05 1.21e-0
4h 1
3 7.5982359e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 2.57e-05 3.97e-0
4h 1
4 7.4559884e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 4.19e-04 1.17e-0
3h 1
5 5.3961839e+02 1.54e+04 5.27e+01 -1.0 1.57e+04 - 1.73e-03 1.99e-0
2f 1
6 2.6049420e+04 6.18e-02 8.49e+01 -1.0 1.54e+04 - 3.06e-02 1.00e+0
0h 1
7 1.8233836e+04 5.92e-02 6.37e+01 -1.0 7.28e+01 - 2.54e-01 4.46e-0
2f 1
8 1.6688322e+04 4.55e-02 3.10e+01 -1.0 2.88e+01 - 5.08e-01 4.32e-0
1f 1
9 1.7265863e+04 2.71e-02 1.35e+01 -1.0 1.58e+01 - 4.75e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6777482e+04 6.14e-03 2.68e-01 -1.0 5.69e+00 - 9.84e-01 1.00e+0
0f 1
11 1.6494257e+04 9.33e-04 1.45e+00 -1.7 4.63e+00 - 2.57e-01 9.10e-0
1f 1
12 1.6487286e+04 1.50e-04 6.49e-01 -1.7 4.48e+00 - 6.63e-01 1.00e+0
0f 1
13 1.6477409e+04 1.23e-04 2.28e-01 -1.7 1.13e+01 - 5.73e-01 1.00e+0
0f 1
14 1.6492928e+04 1.43e-05 4.05e-02 -1.7 1.85e+01 - 8.14e-01 1.00e+0
0f 1
15 1.6372086e+04 9.55e-04 4.99e-02 -2.5 2.45e+01 - 9.23e-01 1.00e+0
0f 1
16 1.6348027e+04 1.13e-03 1.20e-02 -2.5 4.63e+00 - 1.00e+00 1.00e+0
0h 1
17 1.6328300e+04 1.92e-04 8.63e-02 -3.8 8.77e+00 - 1.00e+00 8.52e-0
1h 1
18 1.6326483e+04 5.65e-07 1.01e-04 -3.8 9.03e-01 - 1.00e+00 1.00e+0
0h 1
19 1.6325119e+04 4.00e-07 1.11e-04 -5.7 4.45e-01 - 1.00e+00 9.97e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325122e+04 3.81e-11 2.98e-09 -5.7 8.50e-03 - 1.00e+00 1.00e+0
0f 1
21 1.6325105e+04 6.19e-11 5.03e-06 -8.6 5.53e-03 - 1.00e+00 9.92e-0
1h 1
22 1.6325105e+04 1.42e-14 1.39e-13 -8.6 4.01e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.6325105202185107e+01 1.6325105202185106e+0
4
Dual infeasibility......: 1.3871317320483403e-13 1.3871317320483403e-1
0
Constraint violation....: 1.4210854715202004e-14 1.4210854715202004e-1
4
Complementarity.........: 7.4026791617913435e-09 7.4026791617913435e-0
6
Overall NLP error.......: 7.4026791617913435e-09 7.4026791617913435e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6810371e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.29e-04 9.80e-0
3f 1
2 7.6526505e+02 1.50e+04 5.25e+01 -1.0 1.48e+04 - 9.59e-05 1.00e-0
4h 1
3 7.5759663e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 2.82e-06 5.75e-0
4f 1
4 5.0604298e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 6.13e-04 1.98e-0
2h 1
5 2.6023895e+04 6.08e-02 8.48e+01 -1.0 1.47e+04 - 2.95e-02 1.00e+0
0h 1
6 1.7508496e+04 5.84e-02 6.75e+01 -1.0 7.96e+01 - 2.09e-01 4.27e-0
2f 1
7 1.5926080e+04 4.49e-02 3.35e+01 -1.0 2.87e+01 - 5.00e-01 4.36e-0
1f 1
8 1.6222339e+04 3.06e-02 1.35e+01 -1.0 1.62e+01 - 4.67e-01 1.25e-0
1f 4
9 1.6014623e+04 5.30e-03 1.49e-01 -1.0 3.74e+00 - 9.92e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5731798e+04 1.04e-03 2.43e-01 -1.7 4.80e+00 - 1.00e+00 8.81e-0
1f 1
11 1.5707740e+04 7.55e-04 9.99e-03 -1.7 1.55e+01 - 1.00e+00 1.00e+0
0f 1
12 1.5584174e+04 1.30e-03 8.63e-02 -3.8 1.99e+01 - 8.03e-01 9.33e-0
1f 1
13 1.5559945e+04 1.43e-03 6.28e-02 -3.8 1.69e+00 - 8.52e-01 7.76e-0
1h 1
14 1.5560171e+04 2.56e-06 7.17e-04 -3.8 2.95e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5559221e+04 3.24e-07 5.84e-04 -5.7 1.49e-01 - 1.00e+00 9.89e-0
1h 1
16 1.5559215e+04 3.99e-11 6.02e-09 -5.7 1.29e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5559202e+04 6.30e-11 2.07e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5559202134359667e+01 1.5559202134359666e+0
4
Dual infeasibility......: 2.0693781743473706e-09 2.0693781743473706e-0
6
Constraint violation....: 6.2994873206712043e-11 6.2994873206712043e-1
1
Complementarity.........: 2.8881113429957351e-09 2.8881113429957349e-0
6
Overall NLP error.......: 2.8881113429957351e-09 2.8881113429957349e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.3158824e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.51e-04 9.80e-0
3h 1
2 8.2872607e+02 1.39e+04 5.24e+01 -1.0 1.32e+04 - 4.66e-05 1.04e-0
4h 1
3 7.9615897e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 7.04e-06 2.29e-0
3h 1
4 5.4542640e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 2.47e-03 2.06e-0
2h 1
5 2.4593128e+04 5.76e-02 8.22e+01 -1.0 1.36e+04 - 4.35e-02 1.00e+0
0h 1
6 1.6845532e+04 5.41e-02 4.86e+01 -1.0 7.42e+01 - 4.01e-01 5.56e-0
2f 1
7 1.4886476e+04 3.60e-02 2.52e+01 -1.0 4.05e+01 - 4.85e-01 5.06e-0
1f 1
8 1.5334602e+04 1.99e-02 7.67e+00 -1.0 1.36e+01 - 5.58e-01 2.50e-0
1f 3
9 1.5021268e+04 5.33e-03 3.20e-01 -1.0 4.75e+00 - 9.71e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4686783e+04 1.33e-03 4.21e-01 -1.7 6.02e+00 - 1.00e+00 8.15e-0
1f 1
11 1.4655475e+04 8.11e-04 1.89e-02 -1.7 3.67e+01 - 1.00e+00 1.00e+0
0f 1
12 1.4505761e+04 1.50e-03 1.04e-01 -3.8 3.98e+01 - 7.79e-01 9.28e-0
1f 1
13 1.4480842e+04 1.76e-03 9.43e-02 -3.8 2.85e+00 - 8.35e-01 7.41e-0
1h 1
14 1.4481145e+04 3.12e-06 9.45e-04 -3.8 7.37e-01 - 1.00e+00 1.00e+0
0h 1
15 1.4480075e+04 2.58e-07 7.21e-04 -5.7 2.97e-01 - 1.00e+00 9.87e-0
1h 1
16 1.4480067e+04 3.41e-11 7.03e-09 -5.7 1.26e-01 - 1.00e+00 1.00e+0
0f 1
17 1.4480052e+04 6.30e-11 2.24e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.4480051763009184e+01 1.4480051763009184e+0
4
Dual infeasibility......: 2.2425270810627012e-09 2.2425270810627012e-0
6
Constraint violation....: 6.3000826777681596e-11 6.3000826777681596e-1
1
Complementarity.........: 2.8880966836614365e-09 2.8880966836614365e-0
6
Overall NLP error.......: 2.8880966836614365e-09 2.8880966836614365e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.3795629e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.71e-04 9.80e-0
3f 1
2 8.3514207e+02 1.27e+04 5.24e+01 -1.0 1.24e+04 - 9.35e-05 1.01e-0
4h 1
3 8.2433417e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 3.39e-06 7.02e-0
4f 1
4 5.0730978e+02 1.24e+04 5.26e+01 -1.0 1.26e+04 - 7.60e-04 2.13e-0
2h 1
5 2.4186862e+04 5.66e-02 8.16e+01 -1.0 1.24e+04 - 4.29e-02 1.00e+0
0h 1
6 1.5723310e+04 5.33e-02 5.22e+01 -1.0 7.99e+01 - 3.54e-01 5.39e-0
2f 1
7 1.3652006e+04 3.43e-02 2.82e+01 -1.0 4.16e+01 - 4.66e-01 5.24e-0
1f 1
8 1.3934384e+04 2.17e-02 1.03e+01 -1.0 1.86e+01 - 4.78e-01 1.25e-0
1f 4
9 1.3798018e+04 4.89e-03 6.33e-01 -1.0 5.16e+00 - 9.57e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3462050e+04 1.46e-03 6.00e-01 -1.7 6.95e+00 - 1.00e+00 7.70e-0
1f 1
11 1.3390111e+04 9.91e-04 2.51e-02 -1.7 1.87e+01 - 1.00e+00 1.00e+0
0f 1
12 1.3260772e+04 1.49e-03 8.79e-02 -3.8 1.99e+01 - 7.75e-01 8.99e-0
1f 1
13 1.3233485e+04 2.01e-03 1.20e-01 -3.8 1.98e+00 - 8.35e-01 7.28e-0
1h 1
14 1.3233937e+04 3.66e-06 1.21e-03 -3.8 5.39e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3233072e+04 2.34e-07 9.01e-04 -5.7 1.49e-01 - 1.00e+00 9.84e-0
1h 1
16 1.3233064e+04 2.81e-11 7.86e-09 -5.7 3.64e-02 - 1.00e+00 1.00e+0
0f 1
17 1.3233051e+04 6.30e-11 2.40e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.3233050913135509e+01 1.3233050913135508e+0
4
Dual infeasibility......: 2.3956854253842732e-09 2.3956854253842732e-0
6
Constraint violation....: 6.3005253791992288e-11 6.3005253791992288e-1
1
Complementarity.........: 2.8880828207344152e-09 2.8880828207344151e-0
6
Overall NLP error.......: 2.8880828207344152e-09 2.8880828207344151e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6218861e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 4.73e-04 9.80e-0
3h 1
2 8.5920297e+02 1.11e+04 5.24e+01 -1.0 9.81e+03 - 3.06e-05 1.12e-0
4h 1
3 7.2111768e+02 1.10e+04 5.24e+01 -1.0 1.11e+04 - 1.68e-05 8.26e-0
3h 1
4 5.7311659e+02 1.08e+04 5.22e+01 -1.0 1.10e+04 - 9.16e-03 2.04e-0
2h 1
5 1.9792903e+04 6.65e-02 8.02e+01 -1.0 1.08e+04 - 7.18e-02 1.00e+0
0h 1
6 1.4028371e+04 6.02e-02 2.73e+01 -1.0 5.88e+01 - 6.35e-01 8.68e-0
2f 1
7 1.2387393e+04 3.18e-02 5.17e+00 -1.0 3.65e+01 - 7.68e-01 5.01e-0
1f 1
8 1.2374256e+04 7.08e-03 5.54e-01 -1.0 8.51e+00 - 9.42e-01 1.00e+0
0f 1
9 1.2046793e+04 1.92e-03 4.57e-01 -1.7 5.26e+00 - 9.48e-01 7.39e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2036195e+04 4.68e-04 8.83e-01 -1.7 2.93e+01 - 1.74e-01 1.00e+0
0f 1
11 1.2043983e+04 2.31e-05 4.30e-04 -1.7 1.54e+01 - 1.00e+00 1.00e+0
0h 1
12 1.1924651e+04 9.00e-05 2.39e-02 -3.8 4.77e+01 - 8.97e-01 8.81e-0
1f 1
13 1.1905530e+04 5.66e-03 1.14e-01 -3.8 5.62e+00 - 5.67e-01 9.63e-0
1h 1
14 1.1901317e+04 4.14e-03 1.45e-02 -3.8 2.06e-01 - 8.72e-01 1.00e+0
0h 1
15 1.1901236e+04 2.15e-05 4.88e-04 -3.8 9.02e-03 - 1.00e+00 1.00e+0
0h 1
16 1.1899977e+04 3.90e-05 3.22e-04 -5.7 4.46e-01 - 8.49e-01 8.56e-0
1h 1
17 1.1899761e+04 1.12e-05 9.20e-04 -5.7 6.42e-02 - 1.00e+00 8.96e-0
1h 1
18 1.1899754e+04 1.12e-08 1.01e-05 -5.7 6.64e-03 - 1.00e+00 1.00e+0
0f 1
19 1.1899734e+04 1.44e-08 3.49e-05 -8.6 5.53e-03 - 1.00e+00 9.81e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.1899733e+04 2.15e-12 3.87e-10 -8.6 1.03e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.1899733469151887e+01 1.1899733469151886e+0
4
Dual infeasibility......: 3.8716033062515060e-10 3.8716033062515062e-0
7
Constraint violation....: 2.1456170173905775e-12 2.1456170173905775e-1
2
Complementarity.........: 2.7218320919747815e-09 2.7218320919747816e-0
6
Overall NLP error.......: 2.7218320919747815e-09 2.7218320919747816e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0890313e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0580412e+02 9.19e+03 5.23e+01 -1.0 7.60e+03 - 2.53e-05 1.20e-0
4h 1
3 6.0977272e+02 9.04e+03 5.24e+01 -1.0 9.19e+03 - 2.50e-05 1.62e-0
2h 1
4 7.3775507e+02 8.79e+03 5.16e+01 -1.0 9.04e+03 - 1.91e-02 2.80e-0
2h 1
5 1.6473468e+04 8.05e-02 7.71e+01 -1.0 8.79e+03 - 1.08e-01 1.00e+0
0h 1
6 1.2523403e+04 6.93e-02 1.94e+01 -1.0 2.11e+01 - 7.28e-01 1.32e-0
1f 1
7 1.1378990e+04 1.42e-02 9.47e-01 -1.0 1.26e+01 - 9.48e-01 8.00e-0
1f 1
8 1.1688198e+04 1.32e-02 5.95e-01 -1.0 5.96e+00 - 3.64e-01 9.06e-0
1f 1
9 1.1281001e+04 2.83e-03 3.02e-01 -1.7 2.73e+00 - 8.60e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1256670e+04 7.92e-04 4.34e-01 -1.7 9.75e+00 - 7.03e-01 1.00e+0
0h 1
11 1.1290225e+04 8.29e-06 1.76e-01 -1.7 1.86e+01 - 7.00e-01 1.00e+0
0h 1
12 1.1129390e+04 4.65e-04 3.31e-02 -2.5 1.96e+01 - 9.73e-01 9.30e-0
1f 1
13 1.1113105e+04 2.43e-05 2.11e-03 -2.5 8.95e+00 - 1.00e+00 1.00e+0
0f 1
14 1.1088320e+04 1.30e-05 6.17e-02 -3.8 8.13e+00 - 1.00e+00 8.43e-0
1f 1
15 1.1084886e+04 5.11e-08 2.76e-04 -3.8 1.27e+00 - 1.00e+00 1.00e+0
0f 1
16 1.1083359e+04 2.99e-08 1.19e-03 -5.7 4.46e-01 - 1.00e+00 9.83e-0
1f 1
17 1.1083339e+04 2.24e-12 1.57e-08 -5.7 7.55e-03 - 1.00e+00 1.00e+0
0f 1
18 1.1083321e+04 2.63e-12 4.48e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1083320736992897e+01 1.1083320736992897e+0
4
Dual infeasibility......: 4.4777010373626459e-09 4.4777010373626459e-0
6
Constraint violation....: 2.6315893908446242e-12 2.6315893908446242e-1
2
Complementarity.........: 3.6084923559592980e-09 3.6084923559592980e-0
6
Overall NLP error.......: 4.4777010373626459e-09 4.4777010373626459e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891119e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0611351e+02 6.71e+03 5.23e+01 -1.0 6.46e+03 - 8.39e-05 1.03e-0
4h 1
3 8.7440044e+02 6.70e+03 5.23e+01 -1.0 6.70e+03 - 6.84e-06 1.53e-0
3f 1
4 4.2534165e+02 6.54e+03 5.24e+01 -1.0 6.70e+03 - 1.83e-03 2.26e-0
2h 1
5 1.8469067e+04 6.74e-02 7.67e+01 -1.0 6.54e+03 - 8.35e-02 1.00e+0
0h 1
6 1.0609292e+04 6.07e-02 3.68e+01 -1.0 2.85e+01 - 4.94e-01 9.10e-0
2f 1
7 9.1070968e+03 1.97e-02 1.46e+01 -1.0 1.53e+01 - 6.26e-01 7.49e-0
1f 1
8 9.1804481e+03 5.62e-03 1.19e+00 -1.0 2.08e+00 - 9.93e-01 5.00e-0
1f 2
9 9.3751841e+03 2.91e-04 6.67e-02 -1.0 2.88e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.8198147e+03 2.22e-03 9.09e-02 -2.5 2.66e+01 - 8.56e-01 8.23e-0
1f 1
11 8.6513288e+03 2.12e-03 4.55e-01 -2.5 4.37e+00 - 1.00e+00 7.50e-0
1f 1
12 8.6223061e+03 1.56e-04 4.78e-03 -2.5 1.09e+00 - 1.00e+00 1.00e+0
0h 1
13 8.6058823e+03 4.18e-05 1.61e-01 -3.8 2.68e+00 - 1.00e+00 7.51e-0
1h 1
14 8.6015687e+03 1.44e-07 3.57e-04 -3.8 6.67e-01 - 1.00e+00 1.00e+0
0f 1
15 8.6003430e+03 2.79e-08 9.26e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 8.6003307e+03 1.87e-12 1.33e-08 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
17 8.6003159e+03 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 8.6003159177915656e+00 8.6003159177915659e+0
3
Dual infeasibility......: 4.4776952293411593e-09 4.4776952293411593e-0
6
Constraint violation....: 2.6307636624700592e-12 2.6307636624700592e-1
2
Complementarity.........: 3.6085002106224174e-09 3.6085002106224176e-0
6
Overall NLP error.......: 4.4776952293411593e-09 4.4776952293411593e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8772454e+02 4.77e+03 5.24e+01 -1.0 4.82e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8463069e+02 4.77e+03 5.24e+01 -1.0 4.12e+03 - 4.65e-05 1.15e-0
4h 1
3 6.9026546e+02 4.73e+03 5.24e+01 -1.0 4.77e+03 - 2.20e-05 8.53e-0
3f 1
4 4.0829906e+02 4.63e+03 5.20e+01 -1.0 4.73e+03 - 1.12e-02 2.07e-0
2h 1
5 1.3286162e+04 7.24e-02 7.77e+01 -1.0 4.63e+03 - 9.89e-02 1.00e+0
0h 1
6 7.8843055e+03 6.35e-02 2.09e+01 -1.0 4.48e+01 - 7.03e-01 1.14e-0
1f 1
7 6.3730704e+03 2.46e-02 2.05e+00 -1.0 2.21e+01 - 9.31e-01 6.56e-0
1f 1
8 6.5551438e+03 3.66e-03 9.20e-01 -1.0 3.60e+00 - 6.07e-01 1.00e+0
0f 1
9 6.0463033e+03 1.23e-03 2.65e-01 -1.7 3.65e+00 - 8.36e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0516924e+03 6.58e-04 3.87e-01 -1.7 7.65e+00 - 6.39e-01 1.00e+0
0h 1
11 6.0601662e+03 7.76e-06 5.65e-02 -1.7 1.19e+01 - 8.11e-01 1.00e+0
0h 1
12 5.9510653e+03 1.65e-04 3.95e-01 -2.5 1.56e+01 - 1.00e+00 6.77e-0
1f 1
13 5.9402760e+03 6.33e-06 9.40e-03 -2.5 8.75e+00 - 1.00e+00 1.00e+0
0f 1
14 5.9216846e+03 9.10e-06 3.91e-02 -3.8 5.36e+00 - 8.64e-01 9.09e-0
1f 1
15 5.9184407e+03 5.07e-04 9.83e-04 -3.8 4.87e-01 - 1.00e+00 1.00e+0
0f 1
16 5.9173040e+03 5.44e-05 1.03e-02 -5.7 2.97e-01 - 8.32e-01 1.00e+0
0h 1
17 5.9171980e+03 3.17e-05 3.48e-05 -5.7 9.03e-03 - 1.00e+00 1.00e+0
0h 1
18 5.9172014e+03 4.80e-07 6.10e-06 -5.7 1.05e-03 - 1.00e+00 1.00e+0
0h 1
19 5.9171874e+03 3.25e-08 7.71e-05 -8.6 3.68e-03 - 1.00e+00 9.44e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 5.9171865e+03 7.33e-12 6.33e-11 -8.6 2.05e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 5.9171865416417013e+00 5.9171865416417013e+0
3
Dual infeasibility......: 6.3278471278815665e-11 6.3278471278815672e-0
8
Constraint violation....: 7.3298034308777460e-12 7.3298034308777460e-1
2
Complementarity.........: 2.8745716551155505e-09 2.8745716551155503e-0
6
Overall NLP error.......: 2.8745716551155505e-09 2.8745716551155503e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2294726e+02 3.24e+03 5.23e+01 -1.0 3.27e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1945201e+02 3.24e+03 5.23e+01 -1.0 2.47e+03 - 3.93e-05 1.30e-0
4h 1
3 3.4573144e+02 3.17e+03 5.24e+01 -1.0 3.24e+03 - 4.04e-05 2.36e-0
2f 1
4 1.5906615e+04 6.81e-02 7.93e+01 -1.0 3.17e+03 - 4.21e-02 1.00e+0
0h 1
5 7.5933644e+03 6.41e-02 5.66e+01 -1.0 2.00e+01 - 2.81e-01 5.33e-0
2f 1
6 6.3092956e+03 1.54e-02 2.51e+01 -1.0 1.01e+01 - 5.90e-01 8.06e-0
1f 1
7 6.3346293e+03 6.22e-03 2.30e-01 -1.0 1.94e+00 - 9.91e-01 1.00e+0
0f 1
8 5.9359384e+03 1.57e-03 8.46e-02 -1.7 4.61e+00 - 9.39e-01 9.66e-0
1f 1
9 5.7829245e+03 1.55e-03 1.11e-01 -2.5 1.12e+00 - 8.11e-01 7.53e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.7446745e+03 3.87e-04 1.03e-01 -2.5 3.64e-01 - 1.00e+00 8.98e-0
1h 1
11 5.7479374e+03 1.36e-05 5.11e-03 -2.5 6.87e-02 - 1.00e+00 1.00e+0
0f 1
12 5.7226838e+03 1.13e-05 6.39e-03 -3.8 5.36e+00 - 1.00e+00 9.69e-0
1f 1
13 5.7223578e+03 1.60e-08 1.23e-05 -3.8 1.62e-01 - 1.00e+00 1.00e+0
0f 1
14 5.7210148e+03 1.79e-08 5.06e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0f 1
15 5.7210000e+03 6.40e-13 4.12e-10 -8.6 3.67e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.7210000283348252e+00 5.7210000283348254e+0
3
Dual infeasibility......: 4.1157568213149857e-10 4.1157568213149857e-0
7
Constraint violation....: 6.4048766290625281e-13 6.4048766290625281e-1
3
Complementarity.........: 3.3841028586496701e-09 3.3841028586496699e-0
6
Overall NLP error.......: 3.3841028586496701e-09 3.3841028586496699e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4528265e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 3.98e-04 9.81e-0
3f 1
2 8.4160251e+02 2.00e+03 5.24e+01 -1.0 1.48e+03 - 5.90e-05 1.34e-0
4h 1
3 2.7509537e+02 1.95e+03 5.26e+01 -1.0 2.00e+03 - 4.97e-05 2.18e-0
2f 1
4 1.3978763e+04 5.67e-02 8.10e+01 -1.0 1.95e+03 - 4.46e-02 1.00e+0
0h 1
5 5.1663756e+03 5.32e-02 5.38e+01 -1.0 8.22e+01 - 3.29e-01 5.48e-0
2f 1
6 3.0169279e+03 3.33e-02 2.97e+01 -1.0 4.25e+01 - 4.59e-01 5.39e-0
1f 1
7 5.0512416e+03 9.15e-03 1.65e+01 -1.0 2.43e+01 - 5.91e-01 1.00e+0
0h 1
8 3.0927580e+03 7.42e-03 4.15e-01 -1.0 2.10e+01 - 9.67e-01 1.00e+0
0f 1
9 2.7847845e+03 1.00e-03 1.63e-01 -1.7 5.24e+00 - 1.00e+00 9.12e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.6486959e+03 1.59e-03 2.72e-01 -2.5 6.05e+00 - 7.52e-01 1.00e+0
0f 1
11 2.5962169e+03 4.61e-03 3.97e-02 -2.5 2.93e+00 - 1.00e+00 1.00e+0
0h 1
12 2.6062895e+03 2.11e-04 6.40e-03 -2.5 4.76e-01 - 1.00e+00 1.00e+0
0h 1
13 2.5818658e+03 2.58e-04 4.25e-02 -3.8 5.37e+00 - 9.87e-01 8.87e-0
1h 1
14 2.5806677e+03 1.91e-06 1.63e-04 -3.8 6.01e-01 - 1.00e+00 1.00e+0
0h 1
15 2.5794704e+03 3.21e-07 2.10e-03 -5.7 2.97e-01 - 1.00e+00 9.78e-0
1h 1
16 2.5794585e+03 3.73e-11 2.11e-08 -5.7 6.59e-03 - 1.00e+00 1.00e+0
0f 1
17 2.5794438e+03 6.30e-11 4.40e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 2.5794437825339465e+00 2.5794437825339464e+0
3
Dual infeasibility......: 4.3996205529877999e-09 4.3996205529877999e-0
6
Constraint violation....: 6.3009347739395594e-11 6.3009347739395594e-1
1
Complementarity.........: 3.8986199086261392e-09 3.8986199086261395e-0
6
Overall NLP error.......: 4.3996205529877999e-09 4.3996205529877999e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0721951e+02 9.17e+02 5.23e+01 -1.0 9.21e+02 - 9.83e-04 9.87e-0
3h 1
2 8.8098174e+02 9.17e+02 5.23e+01 -1.0 8.25e+02 - 8.44e-05 9.85e-0
4h 1
3 5.9534419e+02 9.07e+02 5.23e+01 -1.0 9.17e+02 - 9.48e-04 1.10e-0
2h 1
4 3.2867395e+02 8.86e+02 5.19e+01 -1.0 9.07e+02 - 1.26e-02 2.23e-0
2f 1
5 9.1817401e+03 7.80e-02 7.77e+01 -1.0 8.86e+02 - 9.74e-02 1.00e+0
0h 1
6 4.4247436e+03 6.83e-02 2.08e+01 -1.0 2.32e+01 - 7.09e-01 1.16e-0
1f 1
7 3.1033117e+03 1.39e-02 1.26e+00 -1.0 1.43e+01 - 9.42e-01 7.76e-0
1f 1
8 3.4115862e+03 9.39e-03 1.36e-01 -1.0 4.77e+00 - 9.89e-01 9.25e-0
1f 1
9 2.9059757e+03 6.32e-03 3.42e-01 -2.5 6.73e+00 - 7.91e-01 9.54e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8332974e+03 1.70e-03 2.15e-01 -2.5 2.94e+00 - 8.35e-01 7.25e-0
1h 1
11 2.8169824e+03 2.97e-04 8.95e-03 -2.5 1.13e+00 - 1.00e+00 1.00e+0
0h 1
12 2.7928920e+03 7.61e-05 1.64e-01 -3.8 1.39e+01 - 1.00e+00 7.48e-0
1h 1
13 2.7861373e+03 1.77e-07 5.09e-04 -3.8 3.27e+00 - 1.00e+00 1.00e+0
0f 1
14 2.7843158e+03 2.84e-08 3.44e-04 -5.7 7.40e-01 - 1.00e+00 9.92e-0
1f 1
15 2.7843069e+03 1.86e-12 9.57e-09 -5.7 4.74e-03 - 1.00e+00 1.00e+0
0f 1
16 2.7842848e+03 2.63e-12 5.21e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 2.7842848269756333e+00 2.7842848269756332e+0
3
Dual infeasibility......: 5.2103712406878009e-09 5.2103712406878009e-0
6
Constraint violation....: 2.6287721999196378e-12 2.6287721999196378e-1
2
Complementarity.........: 3.7934117712502006e-09 3.7934117712502004e-0
6
Overall NLP error.......: 5.2103712406878009e-09 5.2103712406878009e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318725023556e-09 2.1031318725023556e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896910881e-09 2.8882108896910880e-0
6
Overall NLP error.......: 2.8882108896910881e-09 2.8882108896910880e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318725023556e-09 2.1031318725023556e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896910881e-09 2.8882108896910880e-0
6
Overall NLP error.......: 2.8882108896910881e-09 2.8882108896910880e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254150061e-01 6.4890146254150056e+0
2
Dual infeasibility......: 4.9126604771111300e-09 4.9126604771111300e-0
6
Constraint violation....: 6.2123814981163150e-09 6.2123814981163150e-0
9
Complementarity.........: 4.3646095252337097e-09 4.3646095252337093e-0
6
Overall NLP error.......: 6.2123814981163150e-09 4.9126604771111300e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.06e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.11e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281623859e+00 1.6104063281623860e+0
3
Dual infeasibility......: 2.4576239901114004e-12 2.4576239901114004e-0
9
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5062163910051629e-09 2.5062163910051628e-0
6
Overall NLP error.......: 2.5062163910051629e-09 2.5062163910051628e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2234417e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 3.29e-04 9.86e-0
3h 1
2 8.0850707e+02 9.17e+02 5.24e+01 -1.0 7.37e+02 - 8.13e-05 5.03e-0
4h 1
3 2.4208585e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 4.72e-04 2.11e-0
2f 1
4 1.2483871e+04 5.50e-02 8.24e+01 -1.0 8.98e+02 - 3.81e-02 1.00e+0
0h 1
5 3.8885008e+03 5.25e-02 5.69e+01 -1.0 8.15e+01 - 3.07e-01 4.97e-0
2f 1
6 1.9109576e+03 3.75e-02 3.05e+01 -1.0 3.91e+01 - 4.68e-01 5.05e-0
1f 1
7 4.6824120e+03 1.22e-02 2.71e+01 -1.0 2.06e+01 - 4.00e-01 1.00e+0
0h 1
8 1.8756802e+03 1.20e-02 1.03e+00 -1.0 2.55e+01 - 9.88e-01 8.91e-0
1f 1
9 1.9982545e+03 1.92e-04 4.73e-02 -1.0 3.03e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7319192e+03 2.18e-04 1.23e+00 -2.5 1.85e+01 - 9.37e-01 5.95e-0
1f 1
11 1.5438680e+03 3.77e-03 1.33e-01 -2.5 7.58e+00 - 7.97e-01 1.00e+0
0f 1
12 1.5209377e+03 5.20e-03 3.06e-01 -2.5 1.81e+00 - 1.00e+00 7.69e-0
1h 1
13 1.5332266e+03 2.42e-04 4.66e-03 -2.5 7.13e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5031328e+03 1.70e-04 2.13e-02 -3.8 1.35e+01 - 9.90e-01 9.30e-0
1h 1
15 1.5019710e+03 7.23e-07 6.84e-05 -3.8 9.12e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003147e+03 3.77e-07 1.76e-04 -5.7 7.43e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.79e-11 2.93e-09 -5.7 3.98e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932776818003e+00 1.5002932776818002e+0
3
Dual infeasibility......: 2.1693881980368083e-09 2.1693881980368083e-0
6
Constraint violation....: 6.2995636485041473e-11 6.2995636485041473e-1
1
Complementarity.........: 2.8882170440983898e-09 2.8882170440983898e-0
6
Overall NLP error.......: 2.8882170440983898e-09 2.8882170440983898e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6486496e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 4.93e-04 9.86e-0
3h 1
2 8.4983215e+02 9.17e+02 5.24e+01 -1.0 7.54e+02 - 7.95e-05 5.55e-0
4h 1
3 2.6208357e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 5.24e-04 2.21e-0
2h 1
4 1.2837707e+04 5.95e-02 8.02e+01 -1.0 8.97e+02 - 4.99e-02 1.00e+0
0h 1
5 4.2800818e+03 5.56e-02 5.36e+01 -1.0 7.38e+01 - 3.21e-01 5.97e-0
2f 1
26 1.355346e+04 1.632511e+04 3.074002e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1151691e+02 1.57e+04 5.50e+01 -1.0 1.59e+04 - 1.75e-04 9.81e-0
3h 1
2 7.0833689e+02 1.57e+04 5.50e+01 -1.0 1.21e+04 - 1.89e-05 1.29e-0
4h 1
3 7.0431044e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 3.45e-05 3.25e-0
4h 1
4 6.9762058e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 3.57e-04 5.63e-0
4h 1
5 4.9499980e+02 1.54e+04 5.39e+01 -1.0 1.57e+04 - 1.00e-03 1.90e-0
2f 1
6 2.6039189e+04 7.61e-02 8.68e+01 -1.0 1.54e+04 - 2.56e-02 1.00e+0
0h 1
7 1.7885875e+04 7.32e-02 7.23e+01 -1.0 7.09e+01 - 1.75e-01 4.04e-0
2f 1
8 1.6630424e+04 4.64e-02 3.34e+01 -1.0 1.98e+01 - 5.32e-01 3.77e-0
1f 1
9 1.7129694e+04 3.52e-02 1.12e+01 -1.0 1.34e+01 - 5.66e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6801153e+04 7.43e-03 2.61e-01 -1.0 1.46e+00 - 9.82e-01 1.00e+0
0f 1
11 1.6497126e+04 7.17e-04 1.41e+00 -1.7 5.82e+00 - 2.44e-01 9.15e-0
1f 1
12 1.6486358e+04 1.49e-04 6.35e-01 -1.7 4.05e+00 - 6.59e-01 1.00e+0
0f 1
13 1.6475153e+04 1.26e-04 2.26e-01 -1.7 1.06e+01 - 5.59e-01 1.00e+0
0f 1
14 1.6490587e+04 1.51e-05 5.01e-02 -1.7 1.86e+01 - 7.67e-01 1.00e+0
0f 1
15 1.6374165e+04 9.15e-04 4.84e-02 -2.5 2.14e+01 - 9.25e-01 1.00e+0
0f 1
16 1.6348157e+04 1.14e-03 1.19e-02 -2.5 6.13e+00 - 1.00e+00 1.00e+0
0h 1
17 1.6328103e+04 1.90e-04 8.48e-02 -3.8 9.15e+00 - 1.00e+00 8.54e-0
1h 1
18 1.6326483e+04 5.74e-07 9.99e-05 -3.8 7.16e-01 - 1.00e+00 1.00e+0
0h 1
19 1.6325119e+04 4.00e-07 1.03e-04 -5.7 4.45e-01 - 1.00e+00 9.98e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325122e+04 3.80e-11 2.99e-09 -5.7 2.82e-02 - 1.00e+00 1.00e+0
0f 1
21 1.6325105e+04 6.19e-11 5.10e-06 -8.6 5.53e-03 - 1.00e+00 9.92e-0
1h 1
22 1.6325105e+04 7.11e-15 1.77e-06 -8.6 6.49e-04 - 9.97e-01 1.00e+0
0f 1
23 1.6325105e+04 7.11e-15 2.51e-14 -8.6 4.69e-06 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 23
(scaled) (unscaled)
Objective...............: 1.6325105197731414e+01 1.6325105197731415e+0
4
Dual infeasibility......: 2.5091040356528538e-14 2.5091040356528538e-1
1
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.7836098745465988e-09 2.7836098745465988e-0
6
Overall NLP error.......: 2.7836098745465988e-09 2.7836098745465988e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 24
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 24
Number of inequality constraint Jacobian evaluations = 24
Number of Lagrangian Hessian evaluations = 23
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4810922e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 4.08e-04 9.80e-0
3h 1
2 8.4527143e+02 1.50e+04 5.24e+01 -1.0 1.43e+04 - 4.57e-05 1.04e-0
4h 1
3 8.4423954e+02 1.50e+04 5.24e+01 -1.0 1.48e+04 - 6.69e-06 7.83e-0
5h 1
4 8.4291813e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 8.32e-05 1.02e-0
4h 1
5 5.6277608e+02 1.46e+04 5.26e+01 -1.0 1.50e+04 - 1.87e-04 2.19e-0
2f 1
6 2.6870642e+04 5.72e-02 8.10e+01 -1.0 1.46e+04 - 4.54e-02 1.00e+0
0h 1
7 1.8162011e+04 5.37e-02 5.35e+01 -1.0 8.08e+01 - 3.31e-01 5.56e-0
2f 1
8 1.6093682e+04 3.18e-02 2.93e+01 -1.0 4.23e+01 - 4.61e-01 5.22e-0
1f 1
9 1.6572019e+04 1.25e-02 2.81e+00 -1.0 2.06e+01 - 8.62e-01 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6057940e+04 5.17e-03 1.93e-01 -1.0 1.07e+01 - 9.56e-01 1.00e+0
0f 1
11 1.5779753e+04 1.30e-03 5.17e-01 -1.7 3.96e+00 - 1.00e+00 7.88e-0
1f 1
12 1.5748380e+04 3.76e-04 2.59e-02 -1.7 1.81e+01 - 1.00e+00 1.00e+0
0f 1
13 1.5603856e+04 1.15e-03 1.16e-01 -3.8 2.19e+01 - 7.67e-01 9.20e-0
1f 1
14 1.5574288e+04 1.47e-03 3.30e-02 -3.8 2.13e+00 - 8.19e-01 7.40e-0
1h 1
15 1.5574867e+04 3.45e-06 3.30e-02 -3.8 1.81e-01 - 9.81e-01 1.00e+0
0h 1
16 1.5573967e+04 8.71e-05 3.47e-04 -3.8 1.21e-02 - 1.00e+00 1.00e+0
0h 1
17 1.5572894e+04 1.51e-05 7.65e-03 -5.7 1.49e-01 - 9.11e-01 9.84e-0
1h 1
18 1.5572844e+04 4.81e-07 1.69e-06 -5.7 2.38e-03 - 1.00e+00 1.00e+0
0h 1
19 1.5572829e+04 4.63e-09 3.82e-07 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5572829e+04 1.42e-14 3.68e-14 -8.6 1.46e-07 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.5572828752065410e+01 1.5572828752065410e+0
4
Dual infeasibility......: 3.6753310544863417e-14 3.6753310544863417e-1
1
Constraint violation....: 1.4210854715202004e-14 1.4210854715202004e-1
4
Complementarity.........: 2.5059091825818476e-09 2.5059091825818473e-0
6
Overall NLP error.......: 2.5059091825818476e-09 2.5059091825818473e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2433210e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.31e-04 9.80e-0
3h 1
2 8.2139101e+02 1.39e+04 5.24e+01 -1.0 1.26e+04 - 3.16e-05 1.09e-0
4h 1
3 8.1699072e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 1.28e-05 3.08e-0
4h 1
4 8.0094589e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 3.17e-04 1.14e-0
3h 1
5 5.3424706e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 1.54e-03 2.09e-0
2f 1
6 2.4805113e+04 5.63e-02 8.25e+01 -1.0 1.36e+04 - 4.02e-02 1.00e+0
0h 1
7 1.6814705e+04 5.33e-02 5.06e+01 -1.0 7.62e+01 - 3.82e-01 5.24e-0
2f 1
8 1.4879807e+04 3.66e-02 2.65e+01 -1.0 3.95e+01 - 4.79e-01 4.98e-0
1f 1
9 1.5216068e+04 2.32e-02 1.15e+01 -1.0 1.99e+01 - 4.11e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4981716e+04 5.95e-03 3.27e-01 -1.0 4.57e+00 - 9.79e-01 1.00e+0
0h 1
11 1.4674014e+04 1.40e-03 3.98e-01 -1.7 5.50e+00 - 1.00e+00 8.26e-0
1f 1
12 1.4658392e+04 8.64e-04 2.08e-01 -1.7 4.35e+01 - 3.01e-01 1.00e+0
0f 1
13 1.4659027e+04 6.01e-06 8.53e-04 -1.7 1.07e+00 - 1.00e+00 1.00e+0
0h 1
14 1.4505459e+04 1.23e-03 9.62e-02 -3.8 4.87e+01 - 7.93e-01 9.23e-0
1f 1
15 1.4480586e+04 1.55e-03 5.50e-02 -3.8 1.81e+00 - 8.37e-01 7.75e-0
1h 1
16 1.4481144e+04 2.43e-06 7.65e-04 -3.8 5.57e-02 - 1.00e+00 1.00e+0
0h 1
17 1.4480075e+04 3.06e-07 7.38e-04 -5.7 2.98e-01 - 1.00e+00 9.87e-0
1h 1
18 1.4480067e+04 3.92e-11 6.12e-09 -5.7 5.22e-02 - 1.00e+00 1.00e+0
0f 1
19 1.4480052e+04 6.30e-11 2.17e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.4480051763078203e+01 1.4480051763078203e+0
4
Dual infeasibility......: 2.1734998207315809e-09 2.1734998207315809e-0
6
Constraint violation....: 6.2997773664363876e-11 6.2997773664363876e-1
1
Complementarity.........: 2.8881114863183065e-09 2.8881114863183064e-0
6
Overall NLP error.......: 2.8881114863183065e-09 2.8881114863183064e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6976636e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.17e-04 9.80e-0
3h 1
2 8.6692624e+02 1.27e+04 5.24e+01 -1.0 1.20e+04 - 4.46e-05 1.05e-0
4h 1
3 8.6416670e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 8.06e-06 1.82e-0
4h 1
4 8.6074509e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 1.88e-04 2.28e-0
4h 1
5 5.3090133e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 4.35e-04 2.23e-0
2f 1
6 2.4568801e+04 6.01e-02 8.00e+01 -1.0 1.24e+04 - 5.13e-02 1.00e+0
0h 1
7 1.6052125e+04 5.60e-02 5.34e+01 -1.0 7.16e+01 - 3.21e-01 6.10e-0
2f 1
8 1.4526163e+04 3.07e-02 2.75e+01 -1.0 3.77e+01 - 4.78e-01 4.25e-0
1f 1
9 1.4195143e+04 1.47e-02 2.61e+00 -1.0 1.10e+01 - 9.18e-01 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4035237e+04 7.46e-03 1.77e+00 -1.0 7.57e+00 - 9.93e-01 4.84e-0
1f 2
11 1.4165221e+04 5.58e-04 5.03e-02 -1.0 1.20e+02 - 1.00e+00 1.00e+0
0f 1
12 1.3689648e+04 4.69e-04 8.59e-01 -2.5 1.22e+02 - 9.10e-01 6.05e-0
1f 1
13 1.3575805e+04 1.35e-04 2.02e-01 -2.5 4.51e+01 - 9.42e-01 1.00e+0
0f 1
14 1.3552187e+04 2.55e-03 1.37e-02 -2.5 1.09e+00 - 1.00e+00 1.00e+0
0h 1
15 1.3538516e+04 6.32e-04 2.90e-02 -3.8 2.80e+00 - 8.34e-01 1.00e+0
0h 1
16 1.3535786e+04 1.89e-03 9.59e-04 -3.8 5.46e-02 - 1.00e+00 1.00e+0
0h 1
17 1.3536006e+04 5.23e-05 7.61e-05 -3.8 1.27e-02 - 1.00e+00 1.00e+0
0h 1
18 1.3534719e+04 1.09e-04 4.94e-04 -5.7 1.49e-01 - 9.46e-01 9.90e-0
1h 1
19 1.3534703e+04 2.22e-05 1.93e-03 -5.7 2.60e-03 - 1.00e+00 8.06e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.3534710e+04 1.40e-08 1.91e-06 -5.7 2.66e-04 - 1.00e+00 1.00e+0
0f 1
21 1.3534695e+04 1.30e-08 2.15e-05 -8.6 1.84e-03 - 1.00e+00 9.80e-0
1h 1
22 1.3534695e+04 1.59e-12 9.27e-11 -8.6 3.69e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.3534694816035577e+01 1.3534694816035577e+0
4
Dual infeasibility......: 9.2722166041309646e-11 9.2722166041309646e-0
8
Constraint violation....: 1.5931700403370996e-12 1.5931700403370996e-1
2
Complementarity.........: 2.5119591311734501e-09 2.5119591311734502e-0
6
Overall NLP error.......: 2.5119591311734501e-09 2.5119591311734502e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9481357e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 7.48e-04 9.80e-0
3h 1
2 8.9183826e+02 1.11e+04 5.24e+01 -1.0 9.65e+03 - 2.73e-05 1.14e-0
4h 1
3 7.2358231e+02 1.10e+04 5.24e+01 -1.0 1.11e+04 - 1.86e-05 1.03e-0
2h 1
4 6.2607073e+02 1.08e+04 5.20e+01 -1.0 1.10e+04 - 1.15e-02 2.10e-0
2h 1
5 1.9624049e+04 7.36e-02 7.76e+01 -1.0 1.08e+04 - 9.80e-02 1.00e+0
0h 1
6 1.4380394e+04 6.46e-02 2.08e+01 -1.0 3.73e+01 - 7.04e-01 1.14e-0
1f 1
7 1.2837848e+04 2.05e-02 1.65e+00 -1.0 1.97e+01 - 9.31e-01 7.25e-0
1f 1
8 1.3179866e+04 1.96e-03 2.68e-01 -1.0 4.05e+00 - 8.63e-01 1.00e+0
0f 1
9 1.2694674e+04 1.59e-03 4.93e-01 -1.7 5.05e+00 - 7.01e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2657722e+04 6.14e-04 5.68e-01 -1.7 1.27e+01 - 5.95e-01 1.00e+0
0h 1
11 1.2673307e+04 3.51e-05 4.24e-02 -1.7 1.72e+01 - 9.44e-01 1.00e+0
0h 1
12 1.2494051e+04 5.24e-04 2.41e-02 -2.5 2.88e+01 - 9.70e-01 9.49e-0
1f 1
13 1.2457254e+04 1.45e-04 7.72e-02 -3.8 1.14e+01 - 9.73e-01 8.77e-0
1h 1
14 1.2455201e+04 2.37e-07 9.19e-01 -3.8 1.43e+00 - 6.05e-01 1.00e+0
0h 1
15 1.2455102e+04 6.47e-09 1.95e-04 -3.8 1.36e-04 - 1.00e+00 1.00e+0
0h 1
16 1.2453702e+04 2.26e-08 2.70e-02 -5.7 4.46e-01 - 1.00e+00 9.07e-0
1f 1
17 1.2453581e+04 4.40e-11 2.94e-07 -5.7 4.14e-02 - 1.00e+00 1.00e+0
0f 1
18 1.2453562e+04 2.64e-12 3.14e-06 -8.6 5.53e-03 - 1.00e+00 9.99e-0
1h 1
19 1.2453562e+04 1.63e-15 4.82e-14 -8.6 3.13e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.2453562296849553e+01 1.2453562296849552e+0
4
Dual infeasibility......: 4.8221536826455715e-14 4.8221536826455715e-1
1
Constraint violation....: 1.6318394925412904e-15 1.6318394925412904e-1
5
Complementarity.........: 2.5555343459246965e-09 2.5555343459246964e-0
6
Overall NLP error.......: 2.5555343459246965e-09 2.5555343459246964e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0890313e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0580412e+02 9.19e+03 5.23e+01 -1.0 7.60e+03 - 2.53e-05 1.20e-0
4h 1
3 6.0977257e+02 9.04e+03 5.24e+01 -1.0 9.19e+03 - 2.50e-05 1.62e-0
2h 1
4 7.3775555e+02 8.79e+03 5.16e+01 -1.0 9.04e+03 - 1.91e-02 2.80e-0
2h 1
5 1.6473466e+04 8.05e-02 7.71e+01 -1.0 8.79e+03 - 1.08e-01 1.00e+0
0h 1
6 1.2523402e+04 6.93e-02 1.94e+01 -1.0 2.11e+01 - 7.28e-01 1.32e-0
1f 1
7 1.1378990e+04 1.42e-02 9.47e-01 -1.0 1.26e+01 - 9.48e-01 8.00e-0
1f 1
8 1.1688198e+04 1.32e-02 4.86e-01 -1.0 5.96e+00 - 4.75e-01 9.06e-0
1f 1
9 1.1285574e+04 2.77e-03 3.79e-01 -1.7 2.68e+00 - 8.16e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1258392e+04 7.20e-04 3.22e-01 -1.7 9.08e+00 - 7.87e-01 1.00e+0
0h 1
11 1.1292527e+04 7.69e-06 1.87e-01 -1.7 2.15e+01 - 6.06e-01 1.00e+0
0f 1
12 1.1130554e+04 4.64e-04 3.39e-02 -2.5 2.13e+01 - 9.73e-01 9.28e-0
1f 1
13 1.1113106e+04 2.50e-05 2.15e-03 -2.5 9.91e+00 - 1.00e+00 1.00e+0
0f 1
14 1.1088339e+04 1.31e-05 6.22e-02 -3.8 8.14e+00 - 1.00e+00 8.43e-0
1f 1
15 1.1084886e+04 5.16e-08 2.76e-04 -3.8 1.28e+00 - 1.00e+00 1.00e+0
0f 1
16 1.1083359e+04 2.99e-08 1.19e-03 -5.7 4.46e-01 - 1.00e+00 9.83e-0
1f 1
17 1.1083339e+04 2.23e-12 1.57e-08 -5.7 7.54e-03 - 1.00e+00 1.00e+0
0f 1
18 1.1083321e+04 2.63e-12 4.48e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1083320741918797e+01 1.1083320741918797e+0
4
Dual infeasibility......: 4.4777004871135262e-09 4.4777004871135262e-0
6
Constraint violation....: 2.6316449019958554e-12 2.6316449019958554e-1
2
Complementarity.........: 3.6084923060742798e-09 3.6084923060742798e-0
6
Overall NLP error.......: 4.4777004871135262e-09 4.4777004871135262e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2300862e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.80e-0
3h 1
2 9.2018520e+02 6.71e+03 5.23e+01 -1.0 6.43e+03 - 7.59e-05 1.03e-0
4h 1
3 8.8417722e+02 6.69e+03 5.23e+01 -1.0 6.70e+03 - 7.25e-06 1.73e-0
3f 1
4 4.3415243e+02 6.54e+03 5.24e+01 -1.0 6.69e+03 - 2.08e-03 2.26e-0
2h 1
5 1.8486104e+04 7.08e-02 7.69e+01 -1.0 6.54e+03 - 8.04e-02 1.00e+0
0h 1
6 1.0916142e+04 6.40e-02 2.32e+01 -1.0 1.36e+01 - 6.65e-01 8.89e-0
2f 1
7 9.6154376e+03 1.98e-02 9.31e+00 -1.0 9.91e+00 - 6.64e-01 8.81e-0
1f 1
8 9.7199903e+03 1.05e-02 6.35e-01 -1.0 2.75e+00 - 9.95e-01 4.77e-0
1f 2
9 9.3967776e+03 9.36e-03 2.78e-01 -1.7 9.45e+00 - 1.00e+00 8.30e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.3672965e+03 2.18e-03 9.40e-01 -1.7 1.18e+01 - 1.00e+00 4.90e-0
1h 2
11 9.3624199e+03 2.10e-04 1.67e-02 -1.7 6.01e+00 - 1.00e+00 1.00e+0
0h 1
12 9.2069203e+03 4.79e-04 2.44e-02 -3.8 2.00e+01 - 8.46e-01 8.30e-0
1f 1
13 9.1886242e+03 1.49e-04 2.05e-01 -3.8 3.34e+00 - 9.89e-01 7.21e-0
1h 1
14 9.1840024e+03 3.89e-07 3.07e-04 -3.8 9.33e-01 - 1.00e+00 1.00e+0
0h 1
15 9.1828139e+03 1.95e-08 4.40e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
16 9.1828008e+03 7.96e-13 4.82e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 9.1828007708236523e+00 9.1828007708236528e+0
3
Dual infeasibility......: 4.8230711664376156e-10 4.8230711664376156e-0
7
Constraint violation....: 7.9648787565389512e-13 7.9648787565389512e-1
3
Complementarity.........: 2.6134527997838812e-09 2.6134527997838812e-0
6
Overall NLP error.......: 2.6134527997838812e-09 2.6134527997838812e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8769624e+02 4.77e+03 5.24e+01 -1.0 4.82e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8418913e+02 4.77e+03 5.24e+01 -1.0 3.56e+03 - 3.31e-05 1.33e-0
4h 1
3 3.6133643e+02 4.66e+03 5.25e+01 -1.0 4.77e+03 - 4.21e-05 2.30e-0
2f 1
4 1.7154392e+04 6.18e-02 8.10e+01 -1.0 4.66e+03 - 3.09e-02 1.00e+0
0h 1
5 8.5606749e+03 5.89e-02 6.28e+01 -1.0 5.79e+01 - 2.24e-01 4.28e-0
2f 1
6 7.0723371e+03 2.48e-02 3.20e+01 -1.0 2.57e+01 - 4.96e-01 5.40e-0
1f 1
7 6.3632320e+03 1.23e-02 2.18e+00 -1.0 9.60e+00 - 9.29e-01 8.90e-0
1f 1
8 6.7901981e+03 4.37e-04 9.68e-02 -1.0 4.08e+00 - 9.98e-01 1.00e+0
0f 1
9 6.0057920e+03 2.23e-03 2.20e-01 -2.5 5.68e+00 - 8.65e-01 9.64e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.9388190e+03 1.04e-03 6.18e-01 -2.5 1.14e+00 - 1.00e+00 5.72e-0
1h 1
11 5.9432429e+03 3.93e-06 8.27e-03 -2.5 5.23e-01 - 1.00e+00 1.00e+0
0h 1
12 5.9223334e+03 4.94e-06 4.05e-02 -3.8 8.04e+00 - 9.21e-01 8.83e-0
1f 1
13 5.9186052e+03 4.67e-04 5.93e-04 -3.8 9.38e-01 - 1.00e+00 1.00e+0
0f 1
14 5.9173166e+03 6.39e-05 1.15e-02 -5.7 4.46e-01 - 8.12e-01 1.00e+0
0h 1
15 5.9172009e+03 3.63e-05 4.14e-05 -5.7 9.71e-03 - 1.00e+00 1.00e+0
0h 1
16 5.9172026e+03 1.61e-06 4.52e-05 -5.7 1.47e-03 - 1.00e+00 9.88e-0
1h 1
17 5.9172051e+03 3.53e-08 5.15e-07 -5.7 2.92e-04 - 1.00e+00 1.00e+0
0f 1
18 5.9171868e+03 3.96e-08 7.27e-06 -8.6 5.53e-03 - 9.97e-01 9.81e-0
1h 1
19 5.9171865e+03 5.33e-13 2.97e-11 -8.6 1.06e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 5.9171865428648305e+00 5.9171865428648307e+0
3
Dual infeasibility......: 2.9739200547331035e-11 2.9739200547331035e-0
8
Constraint violation....: 5.3290705182007514e-13 5.3290705182007514e-1
3
Complementarity.........: 3.3308144364728207e-09 3.3308144364728208e-0
6
Overall NLP error.......: 3.3308144364728207e-09 3.3308144364728208e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9473874e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3h 1
2 8.9143292e+02 3.24e+03 5.24e+01 -1.0 2.62e+03 - 4.85e-05 1.23e-0
4h 1
3 5.1813323e+02 3.19e+03 5.24e+01 -1.0 3.24e+03 - 3.31e-05 1.54e-0
2f 1
4 4.4980973e+02 3.11e+03 5.12e+01 -1.0 3.19e+03 - 2.40e-02 2.62e-0
2f 1
5 9.7252585e+03 8.18e-02 7.70e+01 -1.0 3.11e+03 - 1.16e-01 1.00e+0
0h 1
6 6.1329492e+03 7.03e-02 1.96e+01 -1.0 2.92e+01 - 7.30e-01 1.45e-0
1f 1
7 4.8587705e+03 1.43e-02 8.63e-01 -1.0 1.60e+01 - 9.43e-01 8.10e-0
1f 1
8 5.2613067e+03 6.24e-03 9.11e-01 -1.0 4.92e+00 - 1.63e-01 9.43e-0
1f 1
9 5.4814158e+03 2.72e-03 1.26e+00 -1.0 5.72e+00 - 6.35e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.4497383e+03 9.88e-04 1.56e-01 -1.0 1.45e+01 - 6.10e-01 1.00e+0
0f 1
11 4.8419106e+03 1.98e-03 8.00e-02 -1.7 2.99e+00 - 1.00e+00 1.00e+0
0f 1
12 4.6234523e+03 2.06e-03 8.89e-02 -2.5 2.22e+01 - 9.05e-01 8.39e-0
1f 1
13 4.6004871e+03 1.82e-04 5.72e-03 -2.5 3.49e+00 - 1.00e+00 1.00e+0
0h 1
14 4.5776760e+03 2.55e-05 3.97e-02 -3.8 5.36e+00 - 1.00e+00 8.82e-0
1h 1
15 4.5757764e+03 6.24e-08 6.01e-04 -3.8 6.28e-01 - 1.00e+00 1.00e+0
0f 1
16 4.5743255e+03 4.18e-08 4.87e-05 -5.7 2.97e-01 - 1.00e+00 9.98e-0
1f 1
17 4.5743268e+03 1.88e-12 1.26e-08 -5.7 5.54e-04 - 1.00e+00 1.00e+0
0f 1
18 4.5743102e+03 2.57e-12 3.30e-06 -8.6 3.68e-03 - 1.00e+00 9.99e-0
1f 1
19 4.5743102e+03 1.65e-15 4.84e-14 -8.6 1.83e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 4.5743101933322565e+00 4.5743101933322569e+0
3
Dual infeasibility......: 4.8441133178599659e-14 4.8441133178599659e-1
1
Constraint violation....: 1.6502205111608476e-15 1.6502205111608476e-1
5
Complementarity.........: 2.7038008065728921e-09 2.7038008065728920e-0
6
Overall NLP error.......: 2.7038008065728921e-09 2.7038008065728920e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8047271e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.82e-0
3h 1
2 8.7572175e+02 2.00e+03 5.24e+01 -1.0 1.12e+03 - 4.57e-05 1.77e-0
4h 1
3 8.5856298e+02 2.00e+03 5.24e+01 -1.0 1.99e+03 - 9.83e-05 6.70e-0
4h 1
4 2.9495283e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 7.60e-04 2.24e-0
2f 1
5 1.3917078e+04 6.17e-02 7.93e+01 -1.0 1.95e+03 - 5.68e-02 1.00e+0
0h 1
6 5.5167095e+03 5.73e-02 5.23e+01 -1.0 6.38e+01 - 3.28e-01 6.60e-0
2f 1
7 4.1582125e+03 3.11e-02 2.54e+01 -1.0 3.21e+01 - 5.03e-01 4.22e-0
1f 1
8 3.3871319e+03 1.13e-02 1.99e+00 -1.0 1.10e+01 - 9.20e-01 9.10e-0
1f 1
9 3.8059823e+03 3.36e-04 1.97e-01 -1.0 4.84e+00 - 9.33e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.1156887e+03 1.20e-03 9.65e-01 -1.7 1.97e+01 - 4.63e-01 9.97e-0
1f 1
11 3.1854787e+03 4.48e-05 2.38e-02 -1.7 6.80e+00 - 1.00e+00 1.00e+0
0f 1
12 3.0668494e+03 4.90e-05 1.81e-01 -2.5 2.58e+01 - 1.00e+00 8.61e-0
1f 1
13 3.0614488e+03 8.55e-05 2.74e-03 -2.5 2.83e-01 - 1.00e+00 1.00e+0
0f 1
14 3.0435552e+03 2.48e-04 6.69e-02 -3.8 6.99e+00 - 7.79e-01 9.53e-0
1h 1
15 3.0406309e+03 1.60e-03 1.54e-03 -3.8 3.27e-01 - 9.82e-01 1.00e+0
0f 1
16 3.0406229e+03 8.24e-05 6.19e-05 -3.8 2.31e-02 - 1.00e+00 1.00e+0
0h 1
17 3.0392663e+03 1.30e-04 1.10e-03 -5.7 3.04e-01 - 9.19e-01 1.00e+0
0h 1
18 3.0392284e+03 3.23e-05 6.59e-06 -5.7 8.38e-03 - 1.00e+00 1.00e+0
0h 1
19 3.0392341e+03 1.71e-07 3.28e-06 -5.7 5.94e-04 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 3.0392190e+03 2.64e-08 3.19e-05 -8.6 3.69e-03 - 1.00e+00 9.58e-0
1h 1
21 3.0392184e+03 4.26e-12 5.09e-11 -8.6 1.55e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 3.0392183889545574e+00 3.0392183889545572e+0
3
Dual infeasibility......: 5.0916348473810970e-11 5.0916348473810970e-0
8
Constraint violation....: 4.2559289425980751e-12 4.2559289425980751e-1
2
Complementarity.........: 3.8548177973970101e-09 3.8548177973970103e-0
6
Overall NLP error.......: 3.8548177973970101e-09 3.8548177973970103e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0808031e+02 9.17e+02 5.23e+01 -1.0 9.22e+02 - 1.00e-03 9.86e-0
3h 1
2 8.8617108e+02 9.17e+02 5.23e+01 -1.0 8.07e+02 - 7.42e-05 8.22e-0
4h 1
3 2.8484271e+02 8.96e+02 5.24e+01 -1.0 9.17e+02 - 7.98e-04 2.30e-0
2h 1
4 1.3130925e+04 6.61e-02 7.64e+01 -1.0 8.96e+02 - 8.29e-02 1.00e+0
0h 1
5 4.8553004e+03 5.96e-02 3.83e+01 -1.0 2.93e+01 - 4.73e-01 8.96e-0
2f 1
6 3.3594619e+03 1.92e-02 1.58e+01 -1.0 1.54e+01 - 6.12e-01 7.37e-0
1f 1
7 3.4484569e+03 4.84e-03 1.76e-01 -1.0 2.12e+00 - 9.90e-01 1.00e+0
0f 1
8 3.0256349e+03 1.47e-03 1.26e-01 -1.7 7.99e+00 - 1.00e+00 1.00e+0
0f 1
9 2.8699577e+03 2.01e-03 4.20e-01 -2.5 5.63e+00 - 1.00e+00 7.84e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8453385e+03 1.62e-04 5.44e-03 -2.5 1.12e+00 - 1.00e+00 1.00e+0
0h 1
11 2.8215934e+03 4.47e-05 1.85e-01 -3.8 1.35e+01 - 1.00e+00 7.36e-0
1h 1
12 2.8142143e+03 1.62e-07 3.67e-04 -3.8 3.52e+00 - 1.00e+00 1.00e+0
0f 1
13 2.8124069e+03 2.71e-08 9.51e-04 -5.7 7.43e-01 - 1.00e+00 9.85e-0
1f 1
14 2.8123858e+03 1.86e-12 1.33e-08 -5.7 1.07e-02 - 1.00e+00 1.00e+0
0f 1
15 2.8123637e+03 2.63e-12 4.48e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 2.8123637103535803e+00 2.8123637103535802e+0
3
Dual infeasibility......: 4.4777030269820526e-09 4.4777030269820526e-0
6
Constraint violation....: 2.6307081513188280e-12 2.6307081513188280e-1
2
Complementarity.........: 3.6085022621580417e-09 3.6085022621580417e-0
6
Overall NLP error.......: 4.4777030269820526e-09 4.4777030269820526e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.03e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 6.36e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643335e+00 1.6104063281643334e+0
3
Dual infeasibility......: 2.4573533589687019e-12 2.4573533589687019e-0
9
Constraint violation....: 6.3603173554942194e-15 6.3603173554942194e-1
5
Complementarity.........: 2.5062163910047530e-09 2.5062163910047528e-0
6
Overall NLP error.......: 2.5062163910047530e-09 2.5062163910047528e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933498e-01 5.8277753147933493e+0
2
Dual infeasibility......: 2.1031320946147231e-09 2.1031320946147231e-0
6
Constraint violation....: 6.2994318095199731e-11 6.2994318095199731e-1
1
Complementarity.........: 2.8882108896903808e-09 2.8882108896903807e-0
6
Overall NLP error.......: 2.8882108896903808e-09 2.8882108896903807e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254210179e-01 6.4890146254210174e+0
2
Dual infeasibility......: 4.9126604805649068e-09 4.9126604805649068e-0
6
Constraint violation....: 6.2123811650494076e-09 6.2123811650494076e-0
9
Complementarity.........: 4.3646095252531724e-09 4.3646095252531725e-0
6
Overall NLP error.......: 6.2123811650494076e-09 4.9126604805649068e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.03e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 6.36e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643335e+00 1.6104063281643334e+0
3
Dual infeasibility......: 2.4573533589687019e-12 2.4573533589687019e-0
9
Constraint violation....: 6.3603173554942194e-15 6.3603173554942194e-1
5
Complementarity.........: 2.5062163910047530e-09 2.5062163910047528e-0
6
Overall NLP error.......: 2.5062163910047530e-09 2.5062163910047528e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2355451e+02 9.17e+02 5.24e+01 -1.0 9.24e+02 - 3.31e-04 9.84e-0
3f 1
2 8.1662500e+02 9.17e+02 5.24e+01 -1.0 5.55e+02 - 7.26e-05 2.50e-0
4h 1
3 2.4196991e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 1.96e-04 2.12e-0
2f 1
4 1.2636833e+04 5.48e-02 8.23e+01 -1.0 8.98e+02 - 3.79e-02 1.00e+0
0h 1
5 3.9066543e+03 5.23e-02 5.77e+01 -1.0 8.26e+01 - 2.96e-01 4.93e-0
2f 1
6 1.9129688e+03 3.74e-02 3.11e+01 -1.0 3.92e+01 - 4.66e-01 5.08e-0
1f 1
7 4.7067283e+03 1.23e-02 2.76e+01 -1.0 2.08e+01 - 3.97e-01 1.00e+0
0h 1
8 1.8774461e+03 1.23e-02 1.09e+00 -1.0 2.59e+01 - 9.87e-01 8.86e-0
1f 1
9 1.9927655e+03 2.09e-04 4.90e-02 -1.0 2.51e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7260747e+03 2.23e-04 1.23e+00 -2.5 1.90e+01 - 9.37e-01 5.95e-0
1f 1
11 1.5380610e+03 3.77e-03 1.32e-01 -2.5 7.57e+00 - 7.96e-01 1.00e+0
0f 1
12 1.5153061e+03 4.98e-03 3.07e-01 -2.5 1.80e+00 - 1.00e+00 7.69e-0
1h 1
13 1.5275650e+03 2.35e-04 4.67e-03 -2.5 7.22e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5024753e+03 1.70e-04 2.15e-02 -3.8 8.08e+00 - 9.90e-01 9.29e-0
1h 1
15 1.5016701e+03 7.28e-07 6.85e-05 -3.8 5.51e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003100e+03 3.77e-07 1.78e-04 -5.7 4.46e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003099e+03 3.79e-11 2.92e-09 -5.7 4.21e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0h 1
1 8.6598311e+02 9.17e+02 5.24e+01 -1.0 9.24e+02 - 4.97e-04 9.84e-0
3h 1
2 8.5884059e+02 9.17e+02 5.24e+01 -1.0 5.71e+02 - 7.06e-05 2.62e-0
4h 1
3 2.6203260e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 2.08e-04 2.23e-0
2f 1
4 1.3003571e+04 5.93e-02 8.01e+01 -1.0 8.97e+02 - 4.95e-02 1.00e+0
0h 1
5 4.3038712e+03 5.54e-02 5.41e+01 -1.0 7.44e+01 - 3.14e-01 5.91e-0
2f 1
27 1.537383e+04 1.632511e+04 3.135002e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1150404e+02 1.57e+04 5.50e+01 -1.0 1.59e+04 - 1.75e-04 9.81e-0
3h 1
2 7.0818911e+02 1.57e+04 5.50e+01 -1.0 1.11e+04 - 1.73e-05 1.40e-0
4h 1
3 7.0502129e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 4.58e-05 2.55e-0
4h 1
4 7.0075957e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 2.99e-04 3.57e-0
4h 1
5 4.9030927e+02 1.54e+04 5.40e+01 -1.0 1.57e+04 - 6.94e-04 1.90e-0
2f 1
6 2.6222952e+04 7.61e-02 8.69e+01 -1.0 1.54e+04 - 2.54e-02 1.00e+0
0h 1
7 1.7887406e+04 7.32e-02 7.31e+01 -1.0 7.27e+01 - 1.68e-01 4.00e-0
2f 1
8 1.6629160e+04 4.64e-02 3.38e+01 -1.0 1.96e+01 - 5.31e-01 3.77e-0
1f 1
9 1.7129694e+04 3.52e-02 1.14e+01 -1.0 1.34e+01 - 5.66e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6801150e+04 7.48e-03 2.27e-01 -1.0 1.32e+00 - 9.84e-01 1.00e+0
0f 1
11 1.6497315e+04 7.12e-04 1.36e+00 -1.7 5.74e+00 - 2.57e-01 9.16e-0
1f 1
12 1.6486382e+04 1.53e-04 6.36e-01 -1.7 4.29e+00 - 6.48e-01 1.00e+0
0f 1
13 1.6475952e+04 1.23e-04 2.28e-01 -1.7 1.11e+01 - 5.57e-01 1.00e+0
0f 1
14 1.6492591e+04 1.52e-05 5.34e-02 -1.7 1.98e+01 - 7.54e-01 1.00e+0
0f 1
15 1.6374351e+04 9.10e-04 4.89e-02 -2.5 2.33e+01 - 9.25e-01 1.00e+0
0f 1
16 1.6348196e+04 1.15e-03 1.20e-02 -2.5 6.17e+00 - 1.00e+00 1.00e+0
0h 1
17 1.6327992e+04 1.92e-04 8.52e-02 -3.8 9.35e+00 - 1.00e+00 8.53e-0
1h 1
18 1.6326484e+04 5.74e-07 1.00e-04 -3.8 6.03e-01 - 1.00e+00 1.00e+0
0h 1
19 1.6325118e+04 4.00e-07 1.03e-04 -5.7 4.46e-01 - 1.00e+00 9.98e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325122e+04 3.80e-11 2.99e-09 -5.7 2.51e-02 - 1.00e+00 1.00e+0
0f 1
21 1.6325105e+04 6.19e-11 5.15e-06 -8.6 5.53e-03 - 1.00e+00 9.92e-0
1h 1
22 1.6325105e+04 2.84e-14 3.43e-06 -8.6 5.77e-04 - 9.95e-01 1.00e+0
0f 1
23 1.6325105e+04 1.42e-14 2.53e-14 -8.6 4.82e-06 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 23
(scaled) (unscaled)
Objective...............: 1.6325105197738090e+01 1.6325105197738088e+0
4
Dual infeasibility......: 2.5313084961453569e-14 2.5313084961453569e-1
1
Constraint violation....: 1.4210854715202004e-14 1.4210854715202004e-1
4
Complementarity.........: 2.7901574543042250e-09 2.7901574543042250e-0
6
Overall NLP error.......: 2.7901574543042250e-09 2.7901574543042250e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 24
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 24
Number of inequality constraint Jacobian evaluations = 24
Number of Lagrangian Hessian evaluations = 23
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9876943e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.75e-04 9.80e-0
3f 1
2 7.9589769e+02 1.50e+04 5.25e+01 -1.0 1.43e+04 - 4.75e-05 1.03e-0
4h 1
3 7.6855771e+02 1.49e+04 5.25e+01 -1.0 1.50e+04 - 6.43e-06 2.05e-0
3h 1
4 5.4431266e+02 1.46e+04 5.26e+01 -1.0 1.49e+04 - 2.19e-03 2.00e-0
2h 1
5 2.5504371e+04 5.52e-02 8.37e+01 -1.0 1.46e+04 - 3.49e-02 1.00e+0
0h 1
6 1.7685869e+04 5.28e-02 5.75e+01 -1.0 7.44e+01 - 3.15e-01 4.82e-0
2f 1
7 1.5945344e+04 4.23e-02 2.90e+01 -1.0 3.45e+01 - 4.93e-01 4.66e-0
1f 1
8 1.6258514e+04 2.65e-02 1.21e+01 -1.0 1.78e+01 - 4.37e-01 1.25e-0
1f 4
9 1.6022809e+04 6.10e-03 1.38e-01 -1.0 4.87e+00 - 9.92e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5738177e+04 1.23e-03 2.92e-01 -1.7 6.98e+00 - 1.00e+00 8.62e-0
1f 1
11 1.5729527e+04 7.40e-04 1.21e-02 -1.7 3.35e+01 - 1.00e+00 1.00e+0
0f 1
12 1.5585586e+04 1.34e-03 9.10e-02 -3.8 3.98e+01 - 7.97e-01 9.32e-0
1f 1
13 1.5560342e+04 1.49e-03 6.43e-02 -3.8 2.69e+00 - 8.47e-01 7.71e-0
1h 1
14 1.5560316e+04 2.72e-06 7.50e-04 -3.8 6.15e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5559225e+04 3.13e-07 6.12e-04 -5.7 2.97e-01 - 1.00e+00 9.88e-0
1h 1
16 1.5559217e+04 3.91e-11 6.21e-09 -5.7 1.04e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5559202e+04 6.30e-11 2.10e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5559202136390761e+01 1.5559202136390761e+0
4
Dual infeasibility......: 2.0959924785785040e-09 2.0959924785785040e-0
6
Constraint violation....: 6.2996441396734326e-11 6.2996441396734326e-1
1
Complementarity.........: 2.8881084978959025e-09 2.8881084978959027e-0
6
Overall NLP error.......: 2.8881084978959025e-09 2.8881084978959027e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4408014e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.92e-04 9.80e-0
3h 1
2 8.4104643e+02 1.39e+04 5.24e+01 -1.0 1.18e+04 - 2.37e-05 1.17e-0
4h 1
3 8.3845365e+02 1.39e+04 5.24e+01 -1.0 1.38e+04 - 2.13e-05 1.83e-0
4h 1
4 8.3435851e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 2.02e-04 2.93e-0
4h 1
5 5.3902758e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 5.15e-04 2.17e-0
2f 1
6 2.5533439e+04 5.72e-02 8.12e+01 -1.0 1.36e+04 - 4.52e-02 1.00e+0
0h 1
7 1.7023068e+04 5.37e-02 5.25e+01 -1.0 8.00e+01 - 3.45e-01 5.58e-0
2f 1
8 1.4909703e+04 3.41e-02 2.86e+01 -1.0 4.22e+01 - 4.65e-01 5.33e-0
1f 1
9 1.5384353e+04 1.84e-02 8.03e+00 -1.0 2.06e+01 - 5.91e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5064178e+04 5.26e-03 5.48e-01 -1.0 6.12e+00 - 9.52e-01 1.00e+0
0h 1
11 1.4709714e+04 1.46e-03 5.12e-01 -1.7 6.61e+00 - 1.00e+00 7.86e-0
1f 1
12 1.4683017e+04 7.07e-04 3.66e-01 -1.7 5.10e+01 - 1.24e-01 1.00e+0
0f 1
13 1.4678034e+04 1.62e-05 1.73e-03 -1.7 3.16e+00 - 1.00e+00 1.00e+0
0h 1
14 1.4518954e+04 1.09e-03 6.72e-02 -3.8 5.71e+01 - 7.78e-01 8.61e-0
1f 1
15 1.4480302e+04 2.37e-03 3.38e-01 -3.8 2.56e+00 - 4.39e-01 7.97e-0
1h 1
16 1.4480679e+04 5.08e-04 2.51e-01 -3.8 4.07e-02 - 1.00e+00 7.93e-0
1h 1
17 1.4481265e+04 5.30e-07 9.74e-05 -3.8 2.65e-02 - 1.00e+00 1.00e+0
0f 1
18 1.4480072e+04 4.17e-07 1.00e-03 -5.7 2.98e-01 - 1.00e+00 9.87e-0
1h 1
19 1.4480067e+04 4.47e-11 4.94e-09 -5.7 3.44e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.4480052e+04 6.30e-11 3.21e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.4480051762297128e+01 1.4480051762297127e+0
4
Dual infeasibility......: 3.2098913461533698e-09 3.2098913461533698e-0
6
Constraint violation....: 6.3006364015016914e-11 6.3006364015016914e-1
1
Complementarity.........: 2.9004134811811458e-09 2.9004134811811459e-0
6
Overall NLP error.......: 3.2098913461533698e-09 3.2098913461533698e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4409913e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.92e-04 9.80e-0
3h 1
2 8.4123382e+02 1.27e+04 5.24e+01 -1.0 1.20e+04 - 4.62e-05 1.04e-0
4h 1
3 8.0176955e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 7.81e-06 2.57e-0
3h 1
4 5.2835838e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 2.79e-03 2.08e-0
2h 1
5 2.3324861e+04 5.92e-02 8.14e+01 -1.0 1.24e+04 - 4.95e-02 1.00e+0
0h 1
6 1.5677373e+04 5.53e-02 4.82e+01 -1.0 7.35e+01 - 3.97e-01 6.11e-0
2f 1
7 1.3659994e+04 3.60e-02 2.48e+01 -1.0 4.16e+01 - 4.90e-01 5.21e-0
1f 1
8 1.4301236e+04 1.32e-02 3.01e+00 -1.0 1.51e+01 - 7.81e-01 5.00e-0
1f 2
9 1.3825049e+04 4.15e-03 1.88e-01 -1.0 7.39e+00 - 9.59e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3453882e+04 1.10e-03 3.91e-01 -1.7 5.78e+00 - 1.00e+00 8.15e-0
1f 1
11 1.3427437e+04 5.41e-04 2.44e-02 -1.7 3.51e+01 - 1.00e+00 1.00e+0
0f 1
12 1.3266398e+04 1.46e-03 1.20e-01 -3.8 3.98e+01 - 7.60e-01 9.24e-0
1f 1
13 1.3232710e+04 2.52e-03 3.40e-02 -3.8 2.98e+00 - 8.07e-01 7.72e-0
1h 1
14 1.3233907e+04 2.03e-04 9.77e-02 -3.8 6.79e-01 - 1.00e+00 9.24e-0
1h 1
15 1.3234263e+04 3.98e-07 2.19e-05 -3.8 5.19e-02 - 1.00e+00 1.00e+0
0f 1
16 1.3233072e+04 4.15e-07 1.00e-03 -5.7 2.97e-01 - 1.00e+00 9.87e-0
1h 1
17 1.3233066e+04 4.53e-11 4.89e-09 -5.7 3.99e-03 - 1.00e+00 1.00e+0
0f 1
18 1.3233051e+04 6.30e-11 3.21e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.3233050913202176e+01 1.3233050913202176e+0
4
Dual infeasibility......: 3.2140044006463784e-09 3.2140044006463784e-0
6
Constraint violation....: 6.3005836659080217e-11 6.3005836659080217e-1
1
Complementarity.........: 3.4638890304008920e-09 3.4638890304008920e-0
6
Overall NLP error.......: 3.4638890304008920e-09 3.4638890304008920e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6525086e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 4.89e-04 9.80e-0
3h 1
2 8.6245710e+02 1.11e+04 5.24e+01 -1.0 1.09e+04 - 9.15e-05 1.01e-0
4h 1
3 8.4880047e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 3.90e-06 8.19e-0
4f 1
4 4.9433659e+02 1.09e+04 5.25e+01 -1.0 1.11e+04 - 8.99e-04 2.19e-0
2h 1
5 2.2847792e+04 5.99e-02 8.03e+01 -1.0 1.09e+04 - 5.05e-02 1.00e+0
0h 1
6 1.4458631e+04 5.59e-02 5.30e+01 -1.0 7.30e+01 - 3.29e-01 6.05e-0
2f 1
7 1.2841782e+04 3.00e-02 2.75e+01 -1.0 3.92e+01 - 4.75e-01 4.38e-0
1f 1
8 1.2343216e+04 1.40e-02 2.54e+00 -1.0 1.09e+01 - 9.19e-01 1.00e+0
0f 1
9 1.2627769e+04 4.56e-04 8.91e-02 -1.0 4.37e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2076537e+04 6.16e-04 4.47e-01 -2.5 7.81e+00 - 8.87e-01 7.00e-0
1f 1
11 1.1992567e+04 2.91e-04 3.56e-01 -2.5 2.88e+00 - 8.77e-01 1.00e+0
0h 1
12 1.1987838e+04 6.53e-04 4.83e-01 -2.5 1.58e+00 - 7.95e-01 1.12e-0
1h 2
13 1.1963266e+04 1.32e-03 1.39e-02 -2.5 1.14e+00 - 1.00e+00 1.00e+0
0h 1
14 1.1947093e+04 1.38e-03 3.83e-02 -3.8 2.68e+00 - 7.85e-01 1.00e+0
0h 1
15 1.1943900e+04 2.58e-03 9.30e-04 -3.8 4.24e-02 - 1.00e+00 1.00e+0
0h 1
16 1.1944293e+04 4.41e-05 2.19e-04 -3.8 1.57e-02 - 1.00e+00 1.00e+0
0h 1
17 1.1942950e+04 1.07e-04 3.42e-04 -5.7 1.49e-01 - 9.51e-01 9.75e-0
1h 1
18 1.1942939e+04 2.39e-05 4.61e-03 -5.7 3.78e-03 - 1.00e+00 7.77e-0
1h 1
19 1.1942941e+04 7.87e-09 1.23e-06 -5.7 8.44e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.1942927e+04 8.76e-09 2.35e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
21 1.1942926e+04 1.68e-12 8.30e-11 -8.6 3.21e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.1942926316571793e+01 1.1942926316571793e+0
4
Dual infeasibility......: 8.3007889101264144e-11 8.3007889101264144e-0
8
Constraint violation....: 1.6818768600046496e-12 1.6818768600046496e-1
2
Complementarity.........: 2.5098143994946073e-09 2.5098143994946074e-0
6
Overall NLP error.......: 2.5098143994946073e-09 2.5098143994946074e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891076e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0602418e+02 9.19e+03 5.23e+01 -1.0 8.41e+03 - 3.92e-05 1.08e-0
4h 1
3 8.1828317e+02 9.14e+03 5.24e+01 -1.0 9.19e+03 - 1.24e-05 4.81e-0
3h 1
4 5.0911016e+02 8.95e+03 5.22e+01 -1.0 9.14e+03 - 5.53e-03 2.13e-0
2h 1
5 1.9574028e+04 7.15e-02 7.74e+01 -1.0 8.95e+03 - 8.67e-02 1.00e+0
0h 1
6 1.2972291e+04 6.39e-02 3.14e+01 -1.0 2.60e+01 - 5.69e-01 9.74e-0
2f 1
7 1.1456842e+04 1.98e-02 1.02e+01 -1.0 1.50e+01 - 6.92e-01 7.89e-0
1f 1
8 1.1617387e+04 7.35e-03 8.73e-01 -1.0 3.38e+00 - 9.92e-01 5.00e-0
1f 2
9 1.1302402e+04 1.11e-02 4.90e-01 -1.7 1.03e+01 - 5.40e-01 8.28e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1279751e+04 7.73e-04 7.30e-01 -1.7 1.35e+01 - 6.51e-01 1.00e+0
0f 1
11 1.1288035e+04 7.44e-05 2.93e-03 -1.7 1.21e+01 - 1.00e+00 1.00e+0
0h 1
12 1.1114147e+04 5.71e-04 2.52e-02 -3.8 3.43e+01 - 8.35e-01 8.34e-0
1f 1
13 1.1087186e+04 1.49e-04 7.87e-02 -3.8 5.65e+00 - 9.90e-01 8.37e-0
1h 1
14 1.1084767e+04 1.92e-07 1.04e-01 -3.8 9.16e-01 - 9.17e-01 1.00e+0
0h 1
15 1.1084687e+04 4.70e-09 3.00e-05 -3.8 1.60e-04 - 1.00e+00 1.00e+0
0h 1
16 1.1083373e+04 1.92e-08 3.89e-03 -5.7 2.97e-01 - 1.00e+00 9.68e-0
1f 1
17 1.1083337e+04 5.76e-12 2.63e-08 -5.7 9.61e-03 - 1.00e+00 1.00e+0
0f 1
18 1.1083321e+04 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1083320735669686e+01 1.1083320735669686e+0
4
Dual infeasibility......: 4.4780431518871879e-09 4.4780431518871879e-0
6
Constraint violation....: 2.6336779979097003e-12 2.6336779979097003e-1
2
Complementarity.........: 3.6085483414066603e-09 3.6085483414066603e-0
6
Overall NLP error.......: 4.4780431518871879e-09 4.4780431518871879e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891119e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0611351e+02 6.71e+03 5.23e+01 -1.0 6.46e+03 - 8.39e-05 1.03e-0
4h 1
3 8.7440044e+02 6.70e+03 5.23e+01 -1.0 6.70e+03 - 6.84e-06 1.53e-0
3f 1
4 4.2534165e+02 6.54e+03 5.24e+01 -1.0 6.70e+03 - 1.83e-03 2.26e-0
2h 1
5 1.8469067e+04 6.74e-02 7.67e+01 -1.0 6.54e+03 - 8.35e-02 1.00e+0
0h 1
6 1.0609292e+04 6.07e-02 3.68e+01 -1.0 2.85e+01 - 4.94e-01 9.10e-0
2f 1
7 9.1070968e+03 1.97e-02 1.46e+01 -1.0 1.53e+01 - 6.26e-01 7.49e-0
1f 1
8 9.1804482e+03 5.62e-03 1.19e+00 -1.0 2.08e+00 - 9.93e-01 5.00e-0
1f 2
9 9.3751841e+03 2.91e-04 6.67e-02 -1.0 2.88e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.8198147e+03 2.22e-03 9.09e-02 -2.5 2.66e+01 - 8.56e-01 8.23e-0
1f 1
11 8.6513288e+03 2.12e-03 4.55e-01 -2.5 4.37e+00 - 1.00e+00 7.50e-0
1f 1
12 8.6223061e+03 1.56e-04 4.78e-03 -2.5 1.09e+00 - 1.00e+00 1.00e+0
0h 1
13 8.6058823e+03 4.18e-05 1.61e-01 -3.8 2.68e+00 - 1.00e+00 7.51e-0
1h 1
14 8.6015687e+03 1.44e-07 3.57e-04 -3.8 6.67e-01 - 1.00e+00 1.00e+0
0f 1
15 8.6003430e+03 2.79e-08 9.26e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 8.6003307e+03 1.87e-12 1.33e-08 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
17 8.6003159e+03 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 8.6003159193979641e+00 8.6003159193979645e+0
3
Dual infeasibility......: 4.4776952254380315e-09 4.4776952254380315e-0
6
Constraint violation....: 2.6308538680908100e-12 2.6308538680908100e-1
2
Complementarity.........: 3.6085002106135852e-09 3.6085002106135851e-0
6
Overall NLP error.......: 4.4776952254380315e-09 4.4776952254380315e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0885267e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0522538e+02 4.77e+03 5.23e+01 -1.0 3.40e+03 - 2.93e-05 1.39e-0
4h 1
3 3.7446895e+02 4.66e+03 5.24e+01 -1.0 4.77e+03 - 4.82e-05 2.34e-0
2f 1
4 1.7343624e+04 6.51e-02 8.03e+01 -1.0 4.66e+03 - 3.33e-02 1.00e+0
0h 1
5 8.8835455e+03 6.19e-02 6.15e+01 -1.0 3.76e+01 - 2.33e-01 4.52e-0
2f 1
6 7.5996542e+03 2.03e-02 2.88e+01 -1.0 1.63e+01 - 5.42e-01 6.20e-0
1f 1
7 7.1823993e+03 5.79e-03 8.85e-01 -1.0 5.30e+00 - 9.57e-01 7.82e-0
1f 1
8 7.4476292e+03 1.69e-04 6.59e-02 -1.0 5.07e+00 - 1.00e+00 1.00e+0
0f 1
9 6.8807542e+03 2.12e-03 8.08e-02 -2.5 3.15e+00 - 8.55e-01 8.48e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.7194703e+03 2.16e-03 4.17e-01 -2.5 9.54e-01 - 1.00e+00 7.62e-0
1f 1
11 6.6937548e+03 1.24e-04 4.69e-03 -2.5 2.10e-01 - 1.00e+00 1.00e+0
0h 1
12 6.6728221e+03 3.31e-05 1.45e-01 -3.8 8.04e+00 - 1.00e+00 7.62e-0
1h 1
13 6.6674261e+03 1.25e-07 3.38e-04 -3.8 1.91e+00 - 1.00e+00 1.00e+0
0f 1
14 6.6659052e+03 2.85e-08 9.91e-04 -5.7 4.46e-01 - 1.00e+00 9.85e-0
1h 1
15 6.6658878e+03 1.92e-12 1.39e-08 -5.7 6.69e-03 - 1.00e+00 1.00e+0
0f 1
16 6.6658693e+03 2.63e-12 4.48e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.6658693337939514e+00 6.6658693337939512e+0
3
Dual infeasibility......: 4.4776953860244669e-09 4.4776953860244669e-0
6
Constraint violation....: 2.6307150902127319e-12 2.6307150902127319e-1
2
Complementarity.........: 3.6084978105173287e-09 3.6084978105173285e-0
6
Overall NLP error.......: 4.4776953860244669e-09 4.4776953860244669e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6647742e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 4.97e-04 9.81e-0
3h 1
2 8.6258607e+02 3.24e+03 5.24e+01 -1.0 2.21e+03 - 3.91e-05 1.45e-0
4h 1
3 3.1400433e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 5.82e-05 2.24e-0
2f 1
4 1.5420372e+04 5.91e-02 8.12e+01 -1.0 3.17e+03 - 3.49e-02 1.00e+0
0h 1
5 6.7290069e+03 5.61e-02 6.00e+01 -1.0 7.11e+01 - 2.59e-01 4.63e-0
2f 1
6 4.9141782e+03 2.50e-02 3.24e+01 -1.0 3.47e+01 - 4.68e-01 5.32e-0
1f 1
7 4.4464852e+03 1.14e-02 2.56e+00 -1.0 9.40e+00 - 9.28e-01 1.00e+0
0f 1
8 4.7445322e+03 5.19e-04 7.18e-02 -1.0 2.72e+00 - 9.98e-01 1.00e+0
0f 1
9 4.1967220e+03 5.77e-04 4.25e-01 -2.5 7.14e+00 - 8.93e-01 7.24e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.1292490e+03 1.97e-04 2.34e-01 -2.5 2.25e+00 - 9.13e-01 1.00e+0
0h 1
11 4.1116424e+03 2.84e-04 9.33e-02 -2.5 9.70e-01 - 1.00e+00 7.64e-0
1H 1
12 4.1091626e+03 3.40e-04 1.77e-03 -2.5 1.24e-01 - 1.00e+00 1.00e+0
0f 1
13 4.0879671e+03 1.22e-03 3.19e-02 -3.8 8.05e+00 - 7.96e-01 1.00e+0
0h 1
14 4.0846007e+03 2.79e-03 1.11e-03 -3.8 4.90e-02 - 1.00e+00 1.00e+0
0h 1
15 4.0849547e+03 3.93e-05 1.31e-04 -3.8 1.35e-02 - 1.00e+00 1.00e+0
0h 1
16 4.0833586e+03 1.01e-04 3.52e-04 -5.7 4.46e-01 - 9.51e-01 9.77e-0
1h 1
17 4.0833414e+03 2.19e-05 3.67e-03 -5.7 1.03e-02 - 1.00e+00 7.83e-0
1h 1
18 4.0833430e+03 8.57e-09 1.21e-06 -5.7 2.23e-03 - 1.00e+00 1.00e+0
0f 1
19 4.0833247e+03 9.02e-09 1.92e-05 -8.6 5.53e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 4.0833244e+03 1.37e-12 6.48e-11 -8.6 9.17e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 4.0833243905706311e+00 4.0833243905706308e+0
3
Dual infeasibility......: 6.4812997654567456e-11 6.4812997654567449e-0
8
Constraint violation....: 1.3685719224554305e-12 1.3685719224554305e-1
2
Complementarity.........: 2.9552120893307796e-09 2.9552120893307797e-0
6
Overall NLP error.......: 2.9552120893307796e-09 2.9552120893307797e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8047271e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.82e-0
3h 1
2 8.7571780e+02 2.00e+03 5.24e+01 -1.0 1.11e+03 - 4.57e-05 1.77e-0
4h 1
3 2.9373644e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 9.83e-05 2.27e-0
2f 1
4 1.4280611e+04 6.09e-02 7.92e+01 -1.0 1.95e+03 - 5.49e-02 1.00e+0
0h 1
5 5.5544141e+03 5.66e-02 5.35e+01 -1.0 6.57e+01 - 3.12e-01 6.38e-0
2f 1
6 4.1958834e+03 3.11e-02 2.65e+01 -1.0 3.24e+01 - 4.93e-01 4.18e-0
1f 1
7 3.3759781e+03 1.36e-02 2.17e+00 -1.0 1.11e+01 - 9.19e-01 9.26e-0
1f 1
8 3.8304846e+03 4.15e-04 1.03e-01 -1.0 5.03e+00 - 9.96e-01 1.00e+0
0f 1
9 3.1523543e+03 1.16e-03 1.19e+00 -1.7 4.02e+01 - 3.49e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.1956619e+03 9.21e-06 1.32e-02 -1.7 1.34e+01 - 1.00e+00 1.00e+0
0h 1
11 3.0822777e+03 2.96e-05 3.99e-01 -2.5 4.87e+01 - 1.00e+00 7.88e-0
1f 1
12 3.0635222e+03 1.06e-04 4.88e-03 -2.5 9.95e+00 - 1.00e+00 1.00e+0
0f 1
13 3.0434835e+03 2.78e-04 8.69e-02 -3.8 8.05e+00 - 7.71e-01 1.00e+0
0h 1
14 3.0407335e+03 1.61e-03 2.08e-03 -3.8 3.64e-02 - 9.71e-01 1.00e+0
0h 1
15 3.0407737e+03 7.55e-05 6.61e-05 -3.8 1.18e-02 - 1.00e+00 1.00e+0
0h 1
16 3.0392720e+03 1.31e-04 1.11e-03 -5.7 4.46e-01 - 9.18e-01 1.00e+0
0h 1
17 3.0392303e+03 3.28e-05 6.74e-06 -5.7 8.43e-03 - 1.00e+00 1.00e+0
0h 1
18 3.0392359e+03 1.93e-07 3.46e-06 -5.7 6.33e-04 - 1.00e+00 1.00e+0
0h 1
19 3.0392191e+03 2.64e-08 3.36e-05 -8.6 5.53e-03 - 1.00e+00 9.57e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 3.0392184e+03 4.51e-12 5.22e-11 -8.6 2.39e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 3.0392183872735798e+00 3.0392183872735800e+0
3
Dual infeasibility......: 5.2214471785703058e-11 5.2214471785703058e-0
8
Constraint violation....: 4.5118353497741737e-12 4.5118353497741737e-1
2
Complementarity.........: 4.1558007206689202e-09 4.1558007206689199e-0
6
Overall NLP error.......: 4.1558007206689202e-09 4.1558007206689199e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6598311e+02 9.17e+02 5.24e+01 -1.0 9.24e+02 - 4.97e-04 9.84e-0
3h 1
2 8.5884059e+02 9.17e+02 5.24e+01 -1.0 5.71e+02 - 7.06e-05 2.62e-0
4h 1
3 2.6203260e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 2.08e-04 2.23e-0
2f 1
4 1.3003571e+04 5.93e-02 8.01e+01 -1.0 8.97e+02 - 4.95e-02 1.00e+0
0h 1
5 4.3038712e+03 5.54e-02 5.41e+01 -1.0 7.44e+01 - 3.14e-01 5.91e-0
2f 1
6 2.7137366e+03 3.01e-02 2.84e+01 -1.0 3.90e+01 - 4.69e-01 4.31e-0
1f 1
7 2.1355118e+03 1.49e-02 2.65e+00 -1.0 1.11e+01 - 9.18e-01 1.00e+0
0f 1
8 2.4920592e+03 4.63e-04 9.69e-02 -1.0 4.06e+00 - 9.98e-01 1.00e+0
0f 1
9 1.8815320e+03 7.64e-04 3.05e-01 -2.5 8.15e+00 - 8.78e-01 7.48e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8091295e+03 2.45e-04 3.37e-01 -2.5 2.62e+00 - 8.83e-01 1.00e+0
0h 1
11 1.8028163e+03 7.15e-04 4.35e-01 -2.5 1.35e+00 - 1.00e+00 1.82e-0
1h 2
12 1.7830589e+03 1.10e-03 1.24e-02 -2.5 9.05e-01 - 1.00e+00 1.00e+0
0h 1
13 1.7614974e+03 1.21e-03 3.33e-02 -3.8 8.08e+00 - 7.93e-01 1.00e+0
0h 1
14 1.7584853e+03 2.29e-03 9.17e-04 -3.8 3.89e-02 - 1.00e+00 1.00e+0
0h 1
15 1.7588136e+03 4.79e-05 1.28e-04 -3.8 1.53e-02 - 1.00e+00 1.00e+0
0h 1
16 1.7572061e+03 1.04e-04 3.74e-04 -5.7 4.46e-01 - 9.51e-01 9.78e-0
1h 1
17 1.7571896e+03 2.28e-05 3.67e-03 -5.7 9.78e-03 - 1.00e+00 7.82e-0
1h 1
18 1.7571915e+03 8.73e-09 1.22e-06 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
19 1.7571732e+03 9.03e-09 1.92e-05 -8.6 5.53e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7571729e+03 1.37e-12 6.49e-11 -8.6 9.17e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.7571729159861154e+00 1.7571729159861154e+0
3
Dual infeasibility......: 6.4906211579958612e-11 6.4906211579958612e-0
8
Constraint violation....: 1.3686829447578930e-12 1.3686829447578930e-1
2
Complementarity.........: 2.5092390019125830e-09 2.5092390019125831e-0
6
Overall NLP error.......: 2.5092390019125830e-09 2.5092390019125831e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318724481455e-09 2.1031318724481455e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896894379e-09 2.8882108896894380e-0
6
Overall NLP error.......: 2.8882108896894379e-09 2.8882108896894380e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318724481455e-09 2.1031318724481455e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896894379e-09 2.8882108896894380e-0
6
Overall NLP error.......: 2.8882108896894379e-09 2.8882108896894380e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101521e-01 6.4890146112101525e+0
2
Dual infeasibility......: 4.9126605618489413e-09 4.9126605618489413e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984918224e-09 4.3646094984918221e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605618489413e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.04e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.57e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235660171e+00 1.6104063235660171e+0
3
Dual infeasibility......: 2.4574009793760635e-12 2.4574009793760635e-0
9
Constraint violation....: 7.5703172614159067e-16 7.5703172614159067e-1
6
Complementarity.........: 2.5062163919681798e-09 2.5062163919681799e-0
6
Overall NLP error.......: 2.5062163919681798e-09 2.5062163919681799e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2329662e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 3.31e-04 9.85e-0
3h 1
2 8.1338739e+02 9.17e+02 5.24e+01 -1.0 6.65e+02 - 7.53e-05 3.59e-0
4h 1
3 2.4215012e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 3.16e-04 2.12e-0
2f 1
4 1.2572829e+04 5.49e-02 8.23e+01 -1.0 8.98e+02 - 3.81e-02 1.00e+0
0h 1
5 3.9012337e+03 5.24e-02 5.73e+01 -1.0 8.21e+01 - 3.02e-01 4.95e-0
2f 1
6 1.9122630e+03 3.74e-02 3.08e+01 -1.0 3.92e+01 - 4.67e-01 5.07e-0
1f 1
7 4.6985285e+03 1.23e-02 2.74e+01 -1.0 2.08e+01 - 3.98e-01 1.00e+0
0h 1
8 1.8769618e+03 1.22e-02 1.07e+00 -1.0 2.57e+01 - 9.87e-01 8.88e-0
1f 1
9 1.9956227e+03 2.03e-04 4.84e-02 -1.0 2.76e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7291248e+03 2.21e-04 1.23e+00 -2.5 1.88e+01 - 9.37e-01 5.95e-0
1f 1
11 1.5409848e+03 3.77e-03 1.32e-01 -2.5 7.58e+00 - 7.96e-01 1.00e+0
0f 1
12 1.5181170e+03 5.06e-03 3.08e-01 -2.5 1.81e+00 - 1.00e+00 7.68e-0
1h 1
13 1.5303991e+03 2.38e-04 4.69e-03 -2.5 7.19e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5028095e+03 1.70e-04 2.15e-02 -3.8 1.08e+01 - 9.90e-01 9.29e-0
1h 1
15 1.5018205e+03 7.26e-07 6.85e-05 -3.8 7.35e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003124e+03 3.77e-07 1.78e-04 -5.7 5.94e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003117e+03 3.79e-11 2.92e-09 -5.7 4.21e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0h 1
1 8.6577131e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 4.97e-04 9.85e-0
3h 1
2 8.5529111e+02 9.17e+02 5.24e+01 -1.0 6.82e+02 - 7.34e-05 3.86e-0
4h 1
3 2.6219590e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 3.43e-04 2.22e-0
2f 1
4 1.2935511e+04 5.94e-02 8.01e+01 -1.0 8.97e+02 - 4.97e-02 1.00e+0
0h 1
5 4.2970559e+03 5.55e-02 5.39e+01 -1.0 7.40e+01 - 3.17e-01 5.94e-0
2f 1
28 1.214032e+04 1.632511e+04 3.190906e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 40
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 20
inequality constraints with only lower bounds: 11
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1149117e+02 1.57e+04 5.50e+01 -1.0 1.59e+04 - 1.75e-04 9.81e-0
3h 1
2 7.0801772e+02 1.57e+04 5.50e+01 -1.0 1.02e+04 - 1.61e-05 1.53e-0
4h 1
3 7.0525549e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 5.90e-05 2.23e-0
4h 1
4 7.0185565e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 2.80e-04 2.84e-0
4h 1
5 4.8884593e+02 1.54e+04 5.40e+01 -1.0 1.57e+04 - 5.97e-04 1.90e-0
2f 1
6 2.6277183e+04 7.61e-02 8.69e+01 -1.0 1.54e+04 - 2.54e-02 1.00e+0
0h 1
7 1.7887872e+04 7.33e-02 7.33e+01 -1.0 7.32e+01 - 1.65e-01 3.99e-0
2f 1
8 1.6628732e+04 4.64e-02 3.40e+01 -1.0 1.96e+01 - 5.31e-01 3.77e-0
1f 1
9 1.7129656e+04 3.52e-02 1.14e+01 -1.0 1.34e+01 - 5.66e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6801138e+04 7.50e-03 2.18e-01 -1.0 1.28e+00 - 9.85e-01 1.00e+0
0f 1
11 1.6497160e+04 7.11e-04 1.32e+00 -1.7 5.72e+00 - 2.73e-01 9.16e-0
1f 1
12 1.6485711e+04 1.57e-04 6.40e-01 -1.7 4.19e+00 - 6.38e-01 1.00e+0
0f 1
13 1.6475337e+04 1.21e-04 2.33e-01 -1.7 1.08e+01 - 5.51e-01 1.00e+0
0f 1
14 1.6492129e+04 1.50e-05 5.98e-02 -1.7 1.99e+01 - 7.31e-01 1.00e+0
0f 1
15 1.6375264e+04 9.01e-04 4.97e-02 -2.5 2.20e+01 - 9.24e-01 1.00e+0
0f 1
16 1.6348268e+04 1.16e-03 1.22e-02 -2.5 6.84e+00 - 1.00e+00 1.00e+0
0h 1
17 1.6327881e+04 1.95e-04 8.59e-02 -3.8 9.61e+00 - 1.00e+00 8.53e-0
1h 1
18 1.6326484e+04 5.73e-07 1.01e-04 -3.8 4.88e-01 - 1.00e+00 1.00e+0
0h 1
19 1.6325118e+04 4.00e-07 1.03e-04 -5.7 4.47e-01 - 1.00e+00 9.98e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325122e+04 3.80e-11 2.99e-09 -5.7 2.45e-02 - 1.00e+00 1.00e+0
0f 1
21 1.6325105e+04 6.18e-11 5.22e-06 -8.6 5.53e-03 - 1.00e+00 9.91e-0
1h 1
22 1.6325105e+04 4.94e-15 5.40e-06 -8.6 5.64e-04 - 9.92e-01 1.00e+0
0f 1
23 1.6325105e+04 1.42e-14 2.58e-14 -8.6 4.96e-06 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 23
(scaled) (unscaled)
Objective...............: 1.6325105197745795e+01 1.6325105197745796e+0
4
Dual infeasibility......: 2.5757174171303632e-14 2.5757174171303632e-1
1
Constraint violation....: 1.4210854715202004e-14 1.4210854715202004e-1
4
Complementarity.........: 2.7977132747087704e-09 2.7977132747087705e-0
6
Overall NLP error.......: 2.7977132747087704e-09 2.7977132747087705e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 24
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 24
Number of inequality constraint Jacobian evaluations = 24
Number of Lagrangian Hessian evaluations = 23
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9876122e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.75e-04 9.80e-0
3h 1
2 7.9582762e+02 1.50e+04 5.25e+01 -1.0 1.37e+04 - 3.21e-05 1.08e-0
4h 1
3 7.9383281e+02 1.50e+04 5.25e+01 -1.0 1.49e+04 - 1.17e-05 1.49e-0
4h 1
4 7.8733415e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 1.58e-04 4.94e-0
4h 1
5 5.2936898e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 6.63e-04 2.05e-0
2f 1
6 2.6175861e+04 5.42e-02 8.36e+01 -1.0 1.47e+04 - 3.35e-02 1.00e+0
0h 1
7 1.7735076e+04 5.19e-02 6.21e+01 -1.0 8.01e+01 - 2.59e-01 4.61e-0
2f 1
8 1.5952986e+04 4.22e-02 3.20e+01 -1.0 3.43e+01 - 4.84e-01 4.71e-0
1f 1
9 1.6274925e+04 2.59e-02 1.42e+01 -1.0 1.83e+01 - 4.27e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6018590e+04 6.13e-03 1.73e-01 -1.0 5.17e+00 - 9.91e-01 1.00e+0
0h 1
11 1.5735305e+04 1.24e-03 2.90e-01 -1.7 4.68e+00 - 1.00e+00 8.63e-0
1f 1
12 1.5731655e+04 7.76e-04 1.14e-02 -1.7 3.80e+01 - 1.00e+00 1.00e+0
0f 1
13 1.5594426e+04 1.13e-03 4.19e-02 -2.5 3.82e+01 - 9.28e-01 1.00e+0
0f 1
14 1.5578953e+04 1.12e-03 1.30e-02 -2.5 1.55e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5562183e+04 1.89e-04 9.05e-02 -3.8 5.46e+00 - 1.00e+00 8.48e-0
1h 1
16 1.5560430e+04 4.98e-07 1.14e-04 -3.8 7.87e-01 - 1.00e+00 1.00e+0
0h 1
17 1.5559215e+04 4.01e-07 1.25e-04 -5.7 2.97e-01 - 1.00e+00 9.97e-0
1h 1
18 1.5559217e+04 3.85e-11 3.00e-09 -5.7 1.56e-02 - 1.00e+00 1.00e+0
0f 1
19 1.5559202e+04 6.30e-11 2.10e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.5559202136365144e+01 1.5559202136365144e+0
4
Dual infeasibility......: 2.0962154190351202e-09 2.0962154190351202e-0
6
Constraint violation....: 6.2994331972987538e-11 6.2994331972987538e-1
1
Complementarity.........: 2.8882134630371835e-09 2.8882134630371834e-0
6
Overall NLP error.......: 2.8882134630371835e-09 2.8882134630371834e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.0180008e+02 1.39e+04 5.25e+01 -1.0 1.40e+04 - 2.81e-04 9.80e-0
3h 1
2 7.9884753e+02 1.39e+04 5.25e+01 -1.0 1.26e+04 - 3.23e-05 1.09e-0
4h 1
3 7.8039307e+02 1.39e+04 5.25e+01 -1.0 1.39e+04 - 1.26e-05 1.28e-0
3h 1
4 5.1380497e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 1.29e-03 2.03e-0
2h 1
5 2.4887884e+04 5.46e-02 8.38e+01 -1.0 1.36e+04 - 3.05e-02 1.00e+0
0h 1
6 1.6683591e+04 5.25e-02 6.37e+01 -1.0 7.88e+01 - 2.43e-01 4.36e-0
2f 1
7 1.4887969e+04 4.31e-02 3.29e+01 -1.0 3.40e+01 - 4.83e-01 4.80e-0
1f 1
8 1.5210605e+04 2.54e-02 1.50e+01 -1.0 1.83e+01 - 4.20e-01 1.25e-0
1f 4
9 1.4936261e+04 6.34e-03 2.61e-01 -1.0 5.73e+00 - 9.87e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4655460e+04 1.28e-03 2.98e-01 -1.7 4.53e+00 - 1.00e+00 8.61e-0
1f 1
11 1.4656552e+04 7.82e-04 1.16e-02 -1.7 4.18e+01 - 1.00e+00 1.00e+0
0f 1
12 1.4515546e+04 1.08e-03 1.97e-02 -2.5 4.80e+01 - 9.27e-01 9.57e-0
1f 1
13 1.4481793e+04 1.66e-03 3.55e-02 -3.8 2.12e+00 - 8.45e-01 7.99e-0
1h 1
14 1.4481071e+04 4.01e-06 8.64e-04 -3.8 6.85e-02 - 1.00e+00 1.00e+0
0h 1
15 1.4480074e+04 2.16e-07 8.45e-04 -5.7 2.97e-01 - 1.00e+00 9.86e-0
1h 1
16 1.4480067e+04 3.33e-11 6.82e-09 -5.7 1.62e-01 - 1.00e+00 1.00e+0
0f 1
17 1.4480052e+04 6.30e-11 2.10e-09 -8.6 3.69e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.4480051762858213e+01 1.4480051762858213e+0
4
Dual infeasibility......: 2.1005906918977728e-09 2.1005906918977728e-0
6
Constraint violation....: 6.2998092853483456e-11 6.2998092853483456e-1
1
Complementarity.........: 2.8880918715873153e-09 2.8880918715873150e-0
6
Overall NLP error.......: 2.8880918715873153e-09 2.8880918715873150e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.5950247e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 4.59e-04 9.80e-0
3h 1
2 8.5655945e+02 1.27e+04 5.24e+01 -1.0 1.13e+04 - 3.03e-05 1.11e-0
4h 1
3 8.4488087e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 1.47e-05 7.67e-0
4h 1
4 5.2397363e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 7.76e-04 2.18e-0
2h 1
5 2.4404159e+04 5.90e-02 8.24e+01 -1.0 1.24e+04 - 2.70e-02 1.00e+0
0h 1
6 1.6059929e+04 5.64e-02 6.50e+01 -1.0 7.31e+01 - 2.13e-01 3.98e-0
2f 1
7 1.3945933e+04 3.70e-02 3.56e+01 -1.0 3.34e+01 - 4.71e-01 6.26e-0
1f 1
8 1.4328990e+04 2.92e-03 1.83e+00 -1.0 7.43e+00 - 9.55e-01 1.00e+0
0f 1
9 1.3874324e+04 1.23e-03 1.16e-01 -1.0 9.10e+00 - 9.60e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3516113e+04 6.33e-04 8.26e-01 -2.5 5.36e+00 - 9.35e-01 6.36e-0
1f 1
11 1.3422068e+04 2.70e-04 1.06e-01 -2.5 3.20e+00 - 9.31e-01 1.00e+0
0h 1
12 1.3414100e+04 1.19e-03 6.52e-03 -2.5 3.08e-01 - 1.00e+00 1.00e+0
0h 1
13 1.3395075e+04 1.43e-03 7.16e-02 -3.8 5.96e+00 - 7.47e-01 1.00e+0
0h 1
14 1.3391186e+04 4.03e-03 7.82e-04 -3.8 2.81e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3390747e+04 7.15e-05 5.40e-05 -3.8 1.27e-02 - 1.00e+00 1.00e+0
0h 1
16 1.3389190e+04 1.45e-04 1.77e-04 -5.7 2.99e-01 - 9.52e-01 9.09e-0
1h 1
17 1.3389133e+04 3.53e-05 1.77e-02 -5.7 2.63e-02 - 9.14e-01 7.57e-0
1h 1
18 1.3389115e+04 1.32e-08 2.07e-06 -5.7 6.37e-03 - 1.00e+00 1.00e+0
0f 1
19 1.3389100e+04 6.00e-09 1.07e-03 -8.6 3.69e-03 - 1.00e+00 9.28e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.3389099e+04 1.51e-11 1.09e-08 -8.6 2.66e-04 - 1.00e+00 1.00e+0
0f 1
21 1.3389099e+04 7.44e-15 3.97e-13 -9.0 2.49e-06 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.3389098858054135e+01 1.3389098858054134e+0
4
Dual infeasibility......: 3.9690823591554762e-13 3.9690823591554762e-1
0
Constraint violation....: 7.4384942649885488e-15 7.4384942649885488e-1
5
Complementarity.........: 1.3720062275978223e-09 1.3720062275978223e-0
6
Overall NLP error.......: 1.3720062275978223e-09 1.3720062275978223e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2301496e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.51e-03 9.80e-0
3h 1
2 9.2012933e+02 1.11e+04 5.23e+01 -1.0 1.02e+04 - 3.26e-05 1.08e-0
4h 1
3 8.3424142e+02 1.11e+04 5.23e+01 -1.0 1.11e+04 - 1.17e-05 5.22e-0
3h 1
4 5.7283735e+02 1.08e+04 5.22e+01 -1.0 1.11e+04 - 5.95e-03 2.13e-0
2h 1
5 2.1532475e+04 7.53e-02 7.76e+01 -1.0 1.08e+04 - 8.36e-02 1.00e+0
0h 1
6 1.5215064e+04 6.76e-02 2.23e+01 -1.0 1.30e+01 - 6.84e-01 9.54e-0
2f 1
7 1.3955436e+04 2.05e-02 7.03e+00 -1.0 9.59e+00 - 7.22e-01 8.73e-0
1f 1
8 1.4214931e+04 1.09e-02 1.48e-01 -1.0 2.63e+00 - 9.90e-01 9.34e-0
1f 1
9 1.3824611e+04 2.88e-03 1.29e+00 -1.7 1.17e+01 - 3.14e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3790288e+04 2.41e-04 3.64e-01 -1.7 1.05e+01 - 8.16e-01 1.00e+0
0h 1
11 1.3800297e+04 1.32e-04 2.81e-03 -1.7 1.30e+01 - 1.00e+00 1.00e+0
0h 1
12 1.3625759e+04 5.11e-04 2.07e-02 -3.8 3.60e+01 - 8.39e-01 8.41e-0
1f 1
13 1.3606771e+04 1.63e-04 2.23e-01 -3.8 5.68e+00 - 9.93e-01 7.10e-0
1h 1
14 1.3601605e+04 3.45e-07 3.55e-04 -3.8 1.65e+00 - 1.00e+00 1.00e+0
0h 1
15 1.3600267e+04 1.96e-08 4.28e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
16 1.3600252e+04 8.32e-13 4.95e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.3600252133786217e+01 1.3600252133786216e+0
4
Dual infeasibility......: 4.9490883017994555e-10 4.9490883017994555e-0
7
Constraint violation....: 8.3157092323205006e-13 8.3157092323205006e-1
3
Complementarity.........: 4.3530640568116743e-09 4.3530640568116743e-0
6
Overall NLP error.......: 4.3530640568116743e-09 4.3530640568116743e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891076e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0602418e+02 9.19e+03 5.23e+01 -1.0 8.41e+03 - 3.92e-05 1.08e-0
4h 1
3 8.1828313e+02 9.14e+03 5.24e+01 -1.0 9.19e+03 - 1.24e-05 4.81e-0
3h 1
4 5.0911018e+02 8.95e+03 5.22e+01 -1.0 9.14e+03 - 5.53e-03 2.13e-0
2h 1
5 1.9574027e+04 7.15e-02 7.74e+01 -1.0 8.95e+03 - 8.67e-02 1.00e+0
0h 1
6 1.2972291e+04 6.39e-02 3.14e+01 -1.0 2.60e+01 - 5.69e-01 9.74e-0
2f 1
7 1.1456842e+04 1.98e-02 1.02e+01 -1.0 1.50e+01 - 6.92e-01 7.89e-0
1f 1
8 1.1617387e+04 7.35e-03 8.73e-01 -1.0 3.38e+00 - 9.93e-01 5.00e-0
1f 2
9 1.1302842e+04 1.11e-02 2.44e-01 -1.7 1.08e+01 - 9.89e-01 8.28e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1283658e+04 3.23e-03 3.32e-01 -1.7 2.97e+01 - 6.15e-01 4.83e-0
1f 2
11 1.1288278e+04 2.48e-04 2.14e-02 -1.7 1.61e+01 - 1.00e+00 1.00e+0
0h 1
12 1.1117814e+04 4.79e-04 2.45e-02 -2.5 3.43e+01 - 9.72e-01 9.46e-0
1f 1
13 1.1087688e+04 1.32e-04 7.39e-02 -3.8 7.15e+00 - 9.83e-01 8.43e-0
1h 1
14 1.1084764e+04 1.83e-07 8.17e-02 -3.8 1.12e+00 - 9.34e-01 1.00e+0
0h 1
15 1.1084687e+04 4.63e-09 2.69e-05 -3.8 1.63e-04 - 1.00e+00 1.00e+0
0h 1
16 1.1083373e+04 1.92e-08 3.89e-03 -5.7 2.97e-01 - 1.00e+00 9.68e-0
1f 1
17 1.1083337e+04 5.76e-12 2.63e-08 -5.7 9.61e-03 - 1.00e+00 1.00e+0
0f 1
18 1.1083321e+04 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1083320741265945e+01 1.1083320741265945e+0
4
Dual infeasibility......: 4.4780430657485959e-09 4.4780430657485959e-0
6
Constraint violation....: 2.6337473868487393e-12 2.6337473868487393e-1
2
Complementarity.........: 3.6085483236187724e-09 3.6085483236187723e-0
6
Overall NLP error.......: 4.4780430657485959e-09 4.4780430657485959e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0889707e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0591739e+02 6.71e+03 5.23e+01 -1.0 5.95e+03 - 4.04e-05 1.12e-0
4h 1
3 7.6488231e+02 6.66e+03 5.24e+01 -1.0 6.70e+03 - 1.70e-05 6.81e-0
3h 1
4 4.6074228e+02 6.52e+03 5.21e+01 -1.0 6.66e+03 - 8.31e-03 2.09e-0
2h 1
5 1.6247927e+04 7.43e-02 7.77e+01 -1.0 6.52e+03 - 8.93e-02 1.00e+0
0h 1
6 1.0403222e+04 6.60e-02 2.72e+01 -1.0 2.46e+01 - 6.25e-01 1.03e-0
1f 1
7 8.8840630e+03 1.77e-02 6.66e+00 -1.0 1.48e+01 - 7.64e-01 8.19e-0
1f 1
8 9.0908602e+03 9.00e-03 6.86e-01 -1.0 4.18e+00 - 9.89e-01 4.95e-0
1f 2
9 8.8145545e+03 1.08e-02 1.03e+00 -1.7 1.11e+01 - 2.00e-01 8.25e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.8108974e+03 5.49e-04 6.41e-01 -1.7 9.96e+00 - 7.40e-01 1.00e+0
0f 1
11 8.8044694e+03 1.46e-04 3.99e-03 -1.7 1.33e+01 - 9.94e-01 1.00e+0
0h 1
12 8.6310657e+03 6.20e-04 2.55e-02 -2.5 2.74e+01 - 9.67e-01 9.67e-0
1f 1
13 8.6042856e+03 1.56e-04 7.77e-02 -3.8 6.29e+00 - 9.82e-01 8.34e-0
1h 1
14 8.6017612e+03 2.03e-07 1.16e-01 -3.8 1.04e+00 - 9.10e-01 1.00e+0
0h 1
15 8.6016820e+03 4.77e-09 3.16e-05 -3.8 1.63e-04 - 1.00e+00 1.00e+0
0h 1
16 8.6003684e+03 1.92e-08 3.89e-03 -5.7 2.97e-01 - 1.00e+00 9.68e-0
1f 1
17 8.6003325e+03 5.75e-12 2.63e-08 -5.7 9.60e-03 - 1.00e+00 1.00e+0
0f 1
18 8.6003159e+03 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 8.6003159212646114e+00 8.6003159212646115e+0
3
Dual infeasibility......: 4.4780428920073153e-09 4.4780428920073153e-0
6
Constraint violation....: 2.6336363645462768e-12 2.6336363645462768e-1
2
Complementarity.........: 3.6085482931549483e-09 3.6085482931549482e-0
6
Overall NLP error.......: 4.4780428920073153e-09 4.4780428920073153e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3004795e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 2.02e-03 9.80e-0
3h 1
2 9.2712367e+02 4.77e+03 5.23e+01 -1.0 4.47e+03 - 6.97e-05 1.06e-0
4h 1
3 8.6230721e+02 4.76e+03 5.23e+01 -1.0 4.77e+03 - 1.09e-05 2.80e-0
3f 1
4 3.9458856e+02 4.65e+03 5.23e+01 -1.0 4.76e+03 - 3.78e-03 2.20e-0
2h 1
5 1.5936731e+04 7.51e-02 7.75e+01 -1.0 4.65e+03 - 7.99e-02 1.00e+0
0h 1
6 9.0816127e+03 6.78e-02 2.29e+01 -1.0 8.31e+00 - 6.77e-01 9.05e-0
2f 1
7 7.8525062e+03 3.47e-02 8.39e+00 -1.0 6.89e+00 - 7.10e-01 1.00e+0
0f 1
8 8.1952987e+03 2.05e-02 2.98e-01 -1.0 2.41e+00 - 9.96e-01 9.69e-0
1f 1
9 7.7640020e+03 3.95e-03 3.54e-01 -1.7 1.12e+01 - 8.33e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.7107177e+03 7.81e-04 3.48e-02 -1.7 7.24e+00 - 1.00e+00 1.00e+0
0h 1
11 7.5664017e+03 4.99e-04 2.40e-02 -2.5 1.64e+01 - 9.77e-01 9.84e-0
1f 1
12 7.5511474e+03 1.19e-04 1.70e-01 -3.8 2.89e+00 - 9.96e-01 7.71e-0
1h 1
13 7.5477479e+03 2.23e-07 1.25e-04 -3.8 6.61e-01 - 1.00e+00 1.00e+0
0f 1
14 7.5465612e+03 1.74e-08 3.02e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
15 7.5465477e+03 1.28e-12 4.23e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 7.5465477279209194e+00 7.5465477279209190e+0
3
Dual infeasibility......: 4.2290123240973528e-10 4.2290123240973528e-0
7
Constraint violation....: 1.2840839502814561e-12 1.2840839502814561e-1
2
Complementarity.........: 2.5905430566455643e-09 2.5905430566455644e-0
6
Overall NLP error.......: 2.5905430566455643e-09 2.5905430566455644e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6642462e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 4.97e-04 9.81e-0
3h 1
2 8.6166973e+02 3.24e+03 5.24e+01 -1.0 1.78e+03 - 3.43e-05 1.80e-0
4h 1
3 3.1407266e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 9.62e-05 2.24e-0
2f 1
4 1.5404000e+04 5.91e-02 8.11e+01 -1.0 3.17e+03 - 3.62e-02 1.00e+0
0h 1
5 6.7204816e+03 5.60e-02 5.89e+01 -1.0 7.11e+01 - 2.71e-01 4.74e-0
2f 1
6 4.9268594e+03 2.53e-02 3.18e+01 -1.0 3.51e+01 - 4.68e-01 5.22e-0
1f 1
7 4.4315069e+03 1.19e-02 2.56e+00 -1.0 9.58e+00 - 9.27e-01 1.00e+0
0f 1
8 4.7750401e+03 6.02e-04 6.76e-02 -1.0 2.91e+00 - 9.97e-01 1.00e+0
0f 1
9 4.1957995e+03 6.59e-04 3.54e-01 -2.5 7.48e+00 - 8.90e-01 7.46e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.1311781e+03 2.03e-04 2.33e-01 -2.5 3.65e+00 - 9.11e-01 1.00e+0
0h 1
11 4.1149275e+03 1.80e-04 1.07e-01 -2.5 9.31e-01 - 1.00e+00 7.31e-0
1H 1
12 4.1119663e+03 3.45e-04 2.18e-03 -2.5 1.46e-01 - 1.00e+00 1.00e+0
0f 1
13 4.0880964e+03 1.22e-03 3.17e-02 -3.8 1.07e+01 - 7.97e-01 1.00e+0
0h 1
14 4.0847468e+03 2.76e-03 1.10e-03 -3.8 4.88e-02 - 1.00e+00 1.00e+0
0h 1
15 4.0851060e+03 3.91e-05 1.31e-04 -3.8 1.37e-02 - 1.00e+00 1.00e+0
0h 1
16 4.0833633e+03 1.01e-04 3.57e-04 -5.7 5.94e-01 - 9.51e-01 9.77e-0
1h 1
17 4.0833439e+03 2.19e-05 3.67e-03 -5.7 1.35e-02 - 1.00e+00 7.84e-0
1h 1
18 4.0833449e+03 8.57e-09 1.20e-06 -5.7 2.92e-03 - 1.00e+00 1.00e+0
0f 1
19 4.0833247e+03 9.02e-09 1.93e-05 -8.6 7.37e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 4.0833244e+03 1.37e-12 6.48e-11 -8.6 1.22e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 4.0833243923993923e+00 4.0833243923993923e+0
3
Dual infeasibility......: 6.4815377951765441e-11 6.4815377951765441e-0
8
Constraint violation....: 1.3693490785726681e-12 1.3693490785726681e-1
2
Complementarity.........: 2.9954682372802105e-09 2.9954682372802106e-0
6
Overall NLP error.......: 2.9954682372802105e-09 2.9954682372802106e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8047271e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.82e-0
3h 1
2 8.7571780e+02 2.00e+03 5.24e+01 -1.0 1.11e+03 - 4.57e-05 1.77e-0
4h 1
3 2.9373644e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 9.83e-05 2.27e-0
2f 1
4 1.4280611e+04 6.09e-02 7.92e+01 -1.0 1.95e+03 - 5.49e-02 1.00e+0
0h 1
5 5.5544141e+03 5.66e-02 5.35e+01 -1.0 6.57e+01 - 3.12e-01 6.38e-0
2f 1
6 4.1958834e+03 3.11e-02 2.65e+01 -1.0 3.24e+01 - 4.93e-01 4.18e-0
1f 1
7 3.3759781e+03 1.36e-02 2.17e+00 -1.0 1.11e+01 - 9.19e-01 9.26e-0
1f 1
8 3.8304846e+03 4.15e-04 1.04e-01 -1.0 5.03e+00 - 9.96e-01 1.00e+0
0f 1
9 3.1536728e+03 1.16e-03 1.06e+00 -1.7 4.15e+01 - 4.18e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.1962400e+03 9.40e-06 1.32e-02 -1.7 1.30e+01 - 1.00e+00 1.00e+0
0h 1
11 3.0825476e+03 2.93e-05 4.03e-01 -2.5 4.95e+01 - 1.00e+00 7.87e-0
1f 1
12 3.0635243e+03 1.06e-04 4.88e-03 -2.5 1.02e+01 - 1.00e+00 1.00e+0
0f 1
13 3.0434834e+03 2.78e-04 8.69e-02 -3.8 8.05e+00 - 7.71e-01 1.00e+0
0h 1
14 3.0407334e+03 1.61e-03 2.08e-03 -3.8 3.64e-02 - 9.71e-01 1.00e+0
0h 1
15 3.0407737e+03 7.54e-05 6.60e-05 -3.8 1.18e-02 - 1.00e+00 1.00e+0
0h 1
16 3.0392720e+03 1.31e-04 1.11e-03 -5.7 4.46e-01 - 9.18e-01 1.00e+0
0h 1
17 3.0392303e+03 3.28e-05 6.74e-06 -5.7 8.43e-03 - 1.00e+00 1.00e+0
0h 1
18 3.0392359e+03 1.93e-07 3.46e-06 -5.7 6.32e-04 - 1.00e+00 1.00e+0
0h 1
19 3.0392191e+03 2.64e-08 3.36e-05 -8.6 5.53e-03 - 1.00e+00 9.57e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 3.0392184e+03 4.51e-12 5.22e-11 -8.6 2.39e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 3.0392183879201271e+00 3.0392183879201270e+0
3
Dual infeasibility......: 5.2180291070536290e-11 5.2180291070536290e-0
8
Constraint violation....: 4.5051740116264227e-12 4.5051740116264227e-1
2
Complementarity.........: 3.7307781440008884e-09 3.7307781440008884e-0
6
Overall NLP error.......: 3.7307781440008884e-09 3.7307781440008884e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6577131e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 4.97e-04 9.85e-0
3h 1
2 8.5529111e+02 9.17e+02 5.24e+01 -1.0 6.82e+02 - 7.34e-05 3.86e-0
4h 1
3 2.6219590e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 3.43e-04 2.22e-0
2f 1
4 1.2935511e+04 5.94e-02 8.01e+01 -1.0 8.97e+02 - 4.97e-02 1.00e+0
0h 1
5 4.2970559e+03 5.55e-02 5.39e+01 -1.0 7.40e+01 - 3.17e-01 5.94e-0
2f 1
6 2.7073797e+03 3.01e-02 2.82e+01 -1.0 3.90e+01 - 4.71e-01 4.32e-0
1f 1
7 2.1347600e+03 1.48e-02 2.63e+00 -1.0 1.10e+01 - 9.18e-01 1.00e+0
0f 1
8 2.4862941e+03 4.51e-04 9.22e-02 -1.0 4.08e+00 - 9.96e-01 1.00e+0
0f 1
9 1.8832015e+03 7.45e-04 3.24e-01 -2.5 8.10e+00 - 8.79e-01 7.42e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8122119e+03 2.44e-04 3.40e-01 -2.5 3.76e+00 - 8.83e-01 1.00e+0
0h 1
11 1.8056619e+03 7.22e-04 4.32e-01 -2.5 1.37e+00 - 1.00e+00 1.89e-0
1h 2
12 1.7859099e+03 1.05e-03 1.21e-02 -2.5 9.15e-01 - 1.00e+00 1.00e+0
0h 1
13 1.7616666e+03 1.22e-03 3.34e-02 -3.8 1.08e+01 - 7.93e-01 1.00e+0
0h 1
14 1.7586347e+03 2.33e-03 9.24e-04 -3.8 3.94e-02 - 1.00e+00 1.00e+0
0h 1
15 1.7589630e+03 4.74e-05 1.26e-04 -3.8 1.52e-02 - 1.00e+00 1.00e+0
0h 1
16 1.7572116e+03 1.04e-04 3.69e-04 -5.7 5.95e-01 - 9.51e-01 9.78e-0
1h 1
17 1.7571923e+03 2.28e-05 3.67e-03 -5.7 1.32e-02 - 1.00e+00 7.82e-0
1h 1
18 1.7571934e+03 8.72e-09 1.22e-06 -5.7 2.88e-03 - 1.00e+00 1.00e+0
0f 1
19 1.7571732e+03 9.04e-09 1.92e-05 -8.6 7.37e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7571729e+03 1.37e-12 6.49e-11 -8.6 1.22e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.7571729180105395e+00 1.7571729180105394e+0
3
Dual infeasibility......: 6.4906241155284426e-11 6.4906241155284419e-0
8
Constraint violation....: 1.3685719224554305e-12 1.3685719224554305e-1
2
Complementarity.........: 2.8400707668524272e-09 2.8400707668524270e-0
6
Overall NLP error.......: 2.8400707668524272e-09 2.8400707668524270e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101521e-01 6.4890146112101525e+0
2
Dual infeasibility......: 4.9126605618489413e-09 4.9126605618489413e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984918224e-09 4.3646094984918221e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605618489413e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318724481455e-09 2.1031318724481455e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896894379e-09 2.8882108896894380e-0
6
Overall NLP error.......: 2.8882108896894379e-09 2.8882108896894380e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101521e-01 6.4890146112101525e+0
2
Dual infeasibility......: 4.9126605618489413e-09 4.9126605618489413e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984918224e-09 4.3646094984918221e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605618489413e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.04e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.57e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235660171e+00 1.6104063235660171e+0
3
Dual infeasibility......: 2.4574009793760635e-12 2.4574009793760635e-0
9
Constraint violation....: 7.5703172614159067e-16 7.5703172614159067e-1
6
Complementarity.........: 2.5062163919681798e-09 2.5062163919681799e-0
6
Overall NLP error.......: 2.5062163919681798e-09 2.5062163919681799e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2303872e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 3.31e-04 9.86e-0
3h 1
2 8.0919006e+02 9.17e+02 5.24e+01 -1.0 7.37e+02 - 8.12e-05 5.04e-0
4h 1
3 2.4239398e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 4.72e-04 2.11e-0
2f 1
4 1.2489447e+04 5.50e-02 8.23e+01 -1.0 8.98e+02 - 3.83e-02 1.00e+0
0h 1
5 3.8941148e+03 5.25e-02 5.67e+01 -1.0 8.14e+01 - 3.09e-01 4.98e-0
2f 1
6 1.9112633e+03 3.73e-02 3.04e+01 -1.0 3.92e+01 - 4.68e-01 5.06e-0
1f 1
7 4.6876227e+03 1.23e-02 2.71e+01 -1.0 2.07e+01 - 3.99e-01 1.00e+0
0h 1
8 1.8763004e+03 1.20e-02 1.04e+00 -1.0 2.56e+01 - 9.88e-01 8.91e-0
1f 1
9 1.9981274e+03 1.95e-04 4.76e-02 -1.0 2.98e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7321093e+03 2.19e-04 1.23e+00 -2.5 1.80e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5439398e+03 3.77e-03 1.33e-01 -2.5 7.59e+00 - 7.95e-01 1.00e+0
0f 1
12 1.5209204e+03 5.17e-03 3.09e-01 -2.5 1.82e+00 - 1.00e+00 7.67e-0
1h 1
13 1.5332321e+03 2.41e-04 4.72e-03 -2.5 7.16e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5031438e+03 1.70e-04 2.15e-02 -3.8 1.35e+01 - 9.90e-01 9.29e-0
1h 1
15 1.5019709e+03 7.24e-07 6.84e-05 -3.8 9.19e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003148e+03 3.77e-07 1.78e-04 -5.7 7.43e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.79e-11 2.92e-09 -5.7 4.20e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
1 8.6555952e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 4.97e-04 9.86e-0
3h 1
2 8.5049278e+02 9.17e+02 5.24e+01 -1.0 7.54e+02 - 7.94e-05 5.56e-0
4h 1
3 2.6243053e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 5.25e-04 2.21e-0
2h 1
4 1.2843590e+04 5.96e-02 8.01e+01 -1.0 8.97e+02 - 5.01e-02 1.00e+0
0h 1
5 4.2877637e+03 5.57e-02 5.36e+01 -1.0 7.35e+01 - 3.21e-01 5.99e-0
2f 1
29 1.490049e+04 1.632511e+04 3.247800e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 40
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 20
inequality constraints with only lower bounds: 11
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6790060e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.81e-0
3h 1
2 7.6435942e+02 1.57e+04 5.25e+01 -1.0 1.00e+04 - 1.56e-05 1.56e-0
4h 1
3 7.6152063e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 6.22e-05 2.25e-0
4h 1
4 7.5789808e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 2.85e-04 2.96e-0
4h 1
5 5.2489194e+02 1.54e+04 5.27e+01 -1.0 1.57e+04 - 6.15e-04 2.00e-0
2f 1
6 2.6644897e+04 6.10e-02 8.48e+01 -1.0 1.54e+04 - 2.97e-02 1.00e+0
0h 1
7 1.8265930e+04 5.86e-02 6.69e+01 -1.0 7.82e+01 - 2.17e-01 4.31e-0
2f 1
8 1.6691547e+04 4.50e-02 3.31e+01 -1.0 2.87e+01 - 5.01e-01 4.35e-0
1f 1
9 1.6986297e+04 3.07e-02 1.32e+01 -1.0 1.61e+01 - 4.68e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6780777e+04 5.31e-03 2.27e-01 -1.0 3.76e+00 - 9.87e-01 1.00e+0
0h 1
11 1.6495924e+04 1.04e-03 1.10e+00 -1.7 4.60e+00 - 4.05e-01 8.80e-0
1f 1
12 1.6484037e+04 1.93e-04 7.10e-01 -1.7 4.91e+00 - 5.80e-01 1.00e+0
0f 1
13 1.6476391e+04 1.04e-04 2.65e-01 -1.7 1.09e+01 - 5.64e-01 1.00e+0
0f 1
14 1.6494228e+04 1.24e-05 6.80e-02 -1.7 2.05e+01 - 7.34e-01 1.00e+0
0f 1
15 1.6374681e+04 9.26e-04 5.31e-02 -2.5 2.36e+01 - 9.21e-01 1.00e+0
0f 1
16 1.6348243e+04 1.17e-03 1.25e-02 -2.5 6.55e+00 - 1.00e+00 1.00e+0
0h 1
17 1.6327926e+04 1.99e-04 8.86e-02 -3.8 9.59e+00 - 1.00e+00 8.50e-0
1h 1
18 1.6326484e+04 5.79e-07 1.04e-04 -3.8 5.13e-01 - 1.00e+00 1.00e+0
0h 1
19 1.6325118e+04 4.00e-07 1.11e-04 -5.7 4.47e-01 - 1.00e+00 9.97e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325122e+04 3.81e-11 2.99e-09 -5.7 3.85e-03 - 1.00e+00 1.00e+0
0f 1
21 1.6325105e+04 6.18e-11 5.25e-06 -8.6 5.53e-03 - 1.00e+00 9.91e-0
1h 1
22 1.6325105e+04 1.42e-14 4.98e-06 -8.6 1.81e-04 - 9.93e-01 1.00e+0
0f 1
23 1.6325105e+04 2.13e-14 2.58e-14 -8.6 4.93e-06 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 23
(scaled) (unscaled)
Objective...............: 1.6325105197744183e+01 1.6325105197744182e+0
4
Dual infeasibility......: 2.5757174171303632e-14 2.5757174171303632e-1
1
Constraint violation....: 2.1316282072803006e-14 2.1316282072803006e-1
4
Complementarity.........: 2.7961323782609365e-09 2.7961323782609363e-0
6
Overall NLP error.......: 2.7961323782609365e-09 2.7961323782609363e-0
6
Number of objective function evaluations = 27
Number of objective gradient evaluations = 24
Number of equality constraint evaluations = 27
Number of inequality constraint evaluations = 27
Number of equality constraint Jacobian evaluations = 24
Number of inequality constraint Jacobian evaluations = 24
Number of Lagrangian Hessian evaluations = 23
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6676934e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 4.98e-04 9.80e-0
3h 1
2 8.6388326e+02 1.50e+04 5.24e+01 -1.0 1.36e+04 - 2.94e-05 1.09e-0
4h 1
3 8.6193217e+02 1.50e+04 5.24e+01 -1.0 1.49e+04 - 1.27e-05 1.51e-0
4h 1
4 8.5536505e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 1.61e-04 5.16e-0
4h 1
5 5.8296215e+02 1.46e+04 5.25e+01 -1.0 1.50e+04 - 6.90e-04 2.21e-0
2f 1
6 2.6762810e+04 5.99e-02 8.02e+01 -1.0 1.46e+04 - 5.08e-02 1.00e+0
0h 1
7 1.8333375e+04 5.59e-02 5.31e+01 -1.0 7.26e+01 - 3.27e-01 6.07e-0
2f 1
8 1.6748657e+04 3.02e-02 2.75e+01 -1.0 3.87e+01 - 4.76e-01 4.33e-0
1f 1
9 1.6190627e+04 1.45e-02 2.54e+00 -1.0 1.10e+01 - 9.19e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6528218e+04 4.13e-04 7.84e-02 -1.0 4.13e+00 - 9.91e-01 1.00e+0
0f 1
11 1.5942238e+04 6.89e-04 3.81e-01 -2.5 7.91e+00 - 8.83e-01 7.23e-0
1f 1
12 1.5868686e+04 2.37e-04 3.50e-01 -2.5 2.55e+00 - 8.85e-01 1.00e+0
0h 1
13 1.5860960e+04 7.56e-04 4.14e-01 -2.5 1.43e+00 - 1.00e+00 2.20e-0
1h 2
14 1.5841178e+04 8.77e-04 1.08e-02 -2.5 9.25e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5822330e+04 1.21e-03 3.32e-02 -3.8 5.45e+00 - 7.94e-01 1.00e+0
0h 1
16 1.5819222e+04 2.45e-03 9.53e-04 -3.8 4.27e-02 - 1.00e+00 1.00e+0
0h 1
17 1.5819548e+04 4.69e-05 1.20e-04 -3.8 1.48e-02 - 1.00e+00 1.00e+0
0h 1
18 1.5818093e+04 1.03e-04 3.64e-04 -5.7 2.97e-01 - 9.51e-01 9.77e-0
1h 1
19 1.5818078e+04 2.27e-05 3.61e-03 -5.7 6.58e-03 - 1.00e+00 7.81e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5818080e+04 8.86e-09 1.24e-06 -5.7 1.44e-03 - 1.00e+00 1.00e+0
0f 1
21 1.5818064e+04 9.09e-09 1.91e-05 -8.6 3.68e-03 - 1.00e+00 9.83e-0
1h 1
22 1.5818064e+04 1.36e-12 6.44e-11 -8.6 6.11e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.5818063679096504e+01 1.5818063679096504e+0
4
Dual infeasibility......: 6.4427123204374387e-11 6.4427123204374381e-0
8
Constraint violation....: 1.3553602684623911e-12 1.3553602684623911e-1
2
Complementarity.........: 2.7142318013833886e-09 2.7142318013833885e-0
6
Overall NLP error.......: 2.7142318013833886e-09 2.7142318013833885e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2432433e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.31e-04 9.80e-0
3h 1
2 8.2128007e+02 1.39e+04 5.24e+01 -1.0 1.18e+04 - 2.44e-05 1.16e-0
4h 1
3 8.1870226e+02 1.39e+04 5.24e+01 -1.0 1.38e+04 - 2.07e-05 1.80e-0
4h 1
4 8.1455704e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 1.98e-04 2.94e-0
4h 1
5 5.2382250e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 5.03e-04 2.12e-0
2f 1
6 2.5367801e+04 5.52e-02 8.23e+01 -1.0 1.36e+04 - 3.86e-02 1.00e+0
0h 1
7 1.6864801e+04 5.26e-02 5.59e+01 -1.0 8.06e+01 - 3.18e-01 5.02e-0
2f 1
8 1.4889591e+04 3.73e-02 2.99e+01 -1.0 3.93e+01 - 4.69e-01 5.04e-0
1f 1
9 1.5235063e+04 2.27e-02 1.39e+01 -1.0 2.06e+01 - 4.01e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4978799e+04 6.02e-03 3.96e-01 -1.0 4.93e+00 - 9.79e-01 1.00e+0
0h 1
11 1.4673196e+04 1.43e-03 4.07e-01 -1.7 5.54e+00 - 1.00e+00 8.25e-0
1f 1
12 1.4690369e+04 9.16e-04 1.75e-01 -1.7 7.64e+01 - 4.45e-01 1.00e+0
0f 1
13 1.4515521e+04 1.18e-03 7.40e-02 -2.5 7.30e+01 - 9.01e-01 1.00e+0
0f 1
14 1.4500384e+04 1.34e-03 1.80e-02 -2.5 1.09e+00 - 1.00e+00 1.00e+0
0h 1
15 1.4483228e+04 2.48e-04 1.18e-01 -3.8 6.41e+00 - 1.00e+00 8.23e-0
1h 1
16 1.4481263e+04 1.29e-06 1.63e-04 -3.8 6.56e-01 - 1.00e+00 1.00e+0
0h 1
17 1.4480064e+04 3.91e-07 1.67e-04 -5.7 2.90e-01 - 1.00e+00 9.96e-0
1h 1
18 1.4480067e+04 3.91e-11 3.01e-09 -5.7 4.87e-02 - 1.00e+00 1.00e+0
0f 1
19 1.4480052e+04 6.30e-11 2.17e-09 -8.6 3.69e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.4480051762789751e+01 1.4480051762789750e+0
4
Dual infeasibility......: 2.1737221247411930e-09 2.1737221247411930e-0
6
Constraint violation....: 6.2996219352129401e-11 6.2996219352129401e-1
1
Complementarity.........: 2.8882194890518101e-09 2.8882194890518101e-0
6
Overall NLP error.......: 2.8882194890518101e-09 2.8882194890518101e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6977080e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.17e-04 9.80e-0
3h 1
2 8.6698898e+02 1.27e+04 5.24e+01 -1.0 1.24e+04 - 9.08e-05 1.01e-0
4h 1
3 8.5605779e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 3.44e-06 7.24e-0
4f 1
4 5.3200806e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 7.85e-04 2.21e-0
2h 1
5 2.4474326e+04 6.03e-02 8.00e+01 -1.0 1.24e+04 - 5.17e-02 1.00e+0
0h 1
6 1.6042574e+04 5.62e-02 5.31e+01 -1.0 7.11e+01 - 3.25e-01 6.15e-0
2f 1
7 1.4517216e+04 3.07e-02 2.72e+01 -1.0 3.76e+01 - 4.80e-01 4.26e-0
1f 1
8 1.4190320e+04 1.47e-02 2.58e+00 -1.0 1.10e+01 - 9.18e-01 5.00e-0
1f 2
9 1.4033854e+04 7.36e-03 1.74e+00 -1.0 7.39e+00 - 1.00e+00 4.91e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4144892e+04 5.33e-04 4.96e-02 -1.0 9.95e+01 - 1.00e+00 1.00e+0
0f 1
11 1.3683810e+04 4.59e-04 8.60e-01 -2.5 9.83e+01 - 9.10e-01 6.05e-0
1f 1
12 1.3576763e+04 1.35e-04 2.04e-01 -2.5 3.83e+01 - 9.42e-01 1.00e+0
0f 1
13 1.3552094e+04 2.55e-03 1.38e-02 -2.5 1.09e+00 - 1.00e+00 1.00e+0
0h 1
14 1.3538549e+04 6.33e-04 2.90e-02 -3.8 2.68e+00 - 8.34e-01 1.00e+0
0h 1
15 1.3535766e+04 1.89e-03 9.60e-04 -3.8 3.93e-02 - 1.00e+00 1.00e+0
0h 1
16 1.3535985e+04 5.24e-05 7.62e-05 -3.8 1.27e-02 - 1.00e+00 1.00e+0
0h 1
17 1.3534698e+04 1.09e-04 4.94e-04 -5.7 1.49e-01 - 9.46e-01 9.90e-0
1h 1
18 1.3534682e+04 2.22e-05 1.93e-03 -5.7 2.60e-03 - 1.00e+00 8.06e-0
1h 1
19 1.3534689e+04 1.40e-08 1.91e-06 -5.7 2.98e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.3534674e+04 1.30e-08 2.15e-05 -8.6 1.84e-03 - 1.00e+00 9.80e-0
1h 1
21 1.3534674e+04 1.59e-12 9.27e-11 -8.6 3.70e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.3534673599022211e+01 1.3534673599022211e+0
4
Dual infeasibility......: 9.2684539637149877e-11 9.2684539637149877e-0
8
Constraint violation....: 1.5929479957321746e-12 1.5929479957321746e-1
2
Complementarity.........: 2.5119560846754155e-09 2.5119560846754154e-0
6
Overall NLP error.......: 2.5119560846754155e-09 2.5119560846754154e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9482527e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 7.48e-04 9.80e-0
3h 1
2 8.9206259e+02 1.11e+04 5.24e+01 -1.0 1.09e+04 - 8.69e-05 1.01e-0
4h 1
3 8.7788074e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 4.01e-06 8.67e-0
4f 1
4 5.1726064e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 9.54e-04 2.26e-0
2h 1
5 2.3121559e+04 6.40e-02 7.79e+01 -1.0 1.09e+04 - 6.98e-02 1.00e+0
0h 1
6 1.4812165e+04 5.85e-02 4.83e+01 -1.0 4.95e+01 - 3.63e-01 7.77e-0
2f 1
7 1.3505031e+04 2.67e-02 2.10e+01 -1.0 2.28e+01 - 5.57e-01 5.00e-0
1f 1
8 1.3018007e+04 6.85e-03 1.23e+00 -1.0 8.59e+00 - 9.37e-01 7.36e-0
1f 1
9 1.3268789e+04 3.20e-04 7.93e-02 -1.0 2.91e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2683148e+04 2.08e-03 9.07e-02 -2.5 4.28e+00 - 8.62e-01 8.28e-0
1f 1
11 1.2505092e+04 2.17e-03 3.62e-01 -2.5 1.06e+00 - 1.00e+00 7.74e-0
1f 1
12 1.2476207e+04 1.68e-04 5.11e-03 -2.5 2.15e-01 - 1.00e+00 1.00e+0
0h 1
13 1.2456345e+04 2.44e-05 4.31e-02 -3.8 2.68e+00 - 1.00e+00 8.82e-0
1h 1
14 1.2454881e+04 5.88e-08 6.10e-04 -3.8 3.16e-01 - 1.00e+00 1.00e+0
0f 1
15 1.2453574e+04 4.24e-08 1.39e-05 -5.7 1.49e-01 - 1.00e+00 9.99e-0
1f 1
16 1.2453562e+04 6.85e-13 3.99e-09 -8.6 1.93e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.2453562294136697e+01 1.2453562294136696e+0
4
Dual infeasibility......: 3.9883528611178102e-09 3.9883528611178102e-0
6
Constraint violation....: 6.8461902813510278e-13 6.8461902813510278e-1
3
Complementarity.........: 2.7863203161342166e-09 2.7863203161342165e-0
6
Overall NLP error.......: 3.9883528611178102e-09 3.9883528611178102e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3005826e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 2.02e-03 9.80e-0
3h 1
2 9.2703232e+02 9.19e+03 5.23e+01 -1.0 8.09e+03 - 2.76e-05 1.12e-0
4h 1
3 7.5783080e+02 9.11e+03 5.23e+01 -1.0 9.19e+03 - 1.67e-05 9.02e-0
3f 1
4 5.7019966e+02 8.91e+03 5.19e+01 -1.0 9.11e+03 - 1.10e-02 2.10e-0
2h 1
5 1.8305217e+04 8.28e-02 7.82e+01 -1.0 8.91e+03 - 8.71e-02 1.00e+0
0h 1
6 1.3289624e+04 7.37e-02 2.12e+01 -1.0 7.99e+00 - 7.08e-01 1.04e-0
1f 1
7 1.2190257e+04 3.47e-02 3.50e+00 -1.0 6.47e+00 - 8.56e-01 9.70e-0
1f 1
8 1.2545395e+04 3.12e-02 3.85e-01 -1.0 2.06e+00 - 9.95e-01 9.51e-0
1f 1
9 1.2178401e+04 4.33e-03 1.45e+00 -1.7 2.47e+01 - 3.29e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2156674e+04 3.02e-04 2.76e-02 -1.7 9.82e+00 - 1.00e+00 1.00e+0
0h 1
11 1.1992181e+04 1.05e-03 1.05e-01 -3.8 3.63e+01 - 7.39e-01 8.25e-0
1f 1
12 1.1970918e+04 3.21e-04 2.27e-01 -3.8 6.28e+00 - 9.88e-01 7.10e-0
1h 1
13 1.1965341e+04 4.49e-07 4.98e-04 -3.8 1.82e+00 - 1.00e+00 1.00e+0
0h 1
14 1.1964015e+04 1.82e-08 2.57e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
15 1.1963999e+04 1.44e-12 4.25e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.1963999136531402e+01 1.1963999136531402e+0
4
Dual infeasibility......: 4.2474595506470091e-10 4.2474595506470091e-0
7
Constraint violation....: 1.4404033521486781e-12 1.4404033521486781e-1
2
Complementarity.........: 3.4734478966762564e-09 3.4734478966762564e-0
6
Overall NLP error.......: 3.4734478966762564e-09 3.4734478966762564e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2299660e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1994562e+02 6.71e+03 5.23e+01 -1.0 5.82e+03 - 3.44e-05 1.14e-0
4h 1
3 7.2850976e+02 6.64e+03 5.23e+01 -1.0 6.70e+03 - 1.95e-05 9.17e-0
3f 1
4 4.9339555e+02 6.50e+03 5.19e+01 -1.0 6.64e+03 - 1.16e-02 2.10e-0
2h 1
5 1.5628519e+04 8.10e-02 7.81e+01 -1.0 6.50e+03 - 8.90e-02 1.00e+0
0h 1
6 1.0636045e+04 7.19e-02 2.13e+01 -1.0 1.24e+01 - 7.05e-01 1.06e-0
1f 1
7 9.4596865e+03 2.23e-02 3.10e+00 -1.0 9.08e+00 - 8.57e-01 8.74e-0
1f 1
8 9.7561576e+03 1.77e-02 1.81e-01 -1.0 2.44e+00 - 9.53e-01 9.15e-0
1f 1
9 9.3907900e+03 3.05e-03 1.08e+00 -1.7 6.03e+00 - 4.22e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.3604970e+03 2.89e-04 5.37e-01 -1.7 7.88e+00 - 7.25e-01 1.00e+0
0h 1
11 9.3765123e+03 1.00e-04 9.54e-02 -1.7 1.31e+01 - 8.76e-01 1.00e+0
0f 1
12 9.2148812e+03 4.68e-04 1.86e-02 -2.5 2.11e+01 - 9.65e-01 9.47e-0
1f 1
13 9.1907420e+03 1.54e-04 2.06e-01 -3.8 8.62e+00 - 9.91e-01 7.17e-0
1h 1
14 9.1841527e+03 3.91e-07 3.57e-04 -3.8 2.47e+00 - 1.00e+00 1.00e+0
0h 1
15 9.1828158e+03 2.00e-08 4.18e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
16 9.1828008e+03 8.59e-13 5.04e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 9.1828007731863330e+00 9.1828007731863327e+0
3
Dual infeasibility......: 5.0431196068603375e-10 5.0431196068603375e-0
7
Constraint violation....: 8.5866036503290388e-13 8.5866036503290388e-1
3
Complementarity.........: 4.3222214802351058e-09 4.3222214802351057e-0
6
Overall NLP error.......: 4.3222214802351058e-09 4.3222214802351057e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8775283e+02 4.77e+03 5.24e+01 -1.0 4.82e+03 - 6.64e-04 9.80e-0
3f 1
2 8.8490545e+02 4.77e+03 5.24e+01 -1.0 4.54e+03 - 9.09e-05 1.04e-0
4h 1
3 8.3891577e+02 4.76e+03 5.24e+01 -1.0 4.77e+03 - 9.27e-06 2.02e-0
3f 1
4 3.6771363e+02 4.66e+03 5.24e+01 -1.0 4.76e+03 - 2.59e-03 2.19e-0
2h 1
5 1.5982222e+04 6.47e-02 7.88e+01 -1.0 4.66e+03 - 6.69e-02 1.00e+0
0h 1
6 8.2942245e+03 5.93e-02 4.78e+01 -1.0 5.43e+01 - 3.77e-01 7.64e-0
2f 1
7 6.9811110e+03 2.94e-02 2.07e+01 -1.0 2.67e+01 - 5.54e-01 4.62e-0
1f 1
8 6.4193393e+03 6.17e-03 1.02e+00 -1.0 9.91e+00 - 9.28e-01 7.77e-0
1f 1
9 6.6977348e+03 2.38e-04 6.93e-02 -1.0 3.42e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0467842e+03 2.17e-03 8.37e-02 -2.5 5.05e+00 - 8.70e-01 8.75e-0
1f 1
11 5.9396938e+03 1.10e-03 4.47e-01 -2.5 8.28e-01 - 1.00e+00 6.10e-0
1f 1
12 5.9395944e+03 2.61e-06 8.30e-03 -2.5 1.67e-01 - 1.00e+00 1.00e+0
0h 1
13 5.9215589e+03 6.87e-06 1.24e-02 -3.8 2.68e+00 - 9.05e-01 8.92e-0
1f 1
14 5.9183066e+03 4.65e-04 4.13e-04 -3.8 2.89e-01 - 1.00e+00 1.00e+0
0f 1
15 5.9173127e+03 6.28e-05 1.14e-02 -5.7 1.49e-01 - 8.14e-01 1.00e+0
0h 1
16 5.9171977e+03 3.58e-05 4.03e-05 -5.7 9.65e-03 - 1.00e+00 1.00e+0
0h 1
17 5.9171990e+03 1.44e-06 2.56e-05 -5.7 1.50e-03 - 1.00e+00 9.93e-0
1h 1
18 5.9172014e+03 3.51e-08 4.96e-07 -5.7 2.91e-04 - 1.00e+00 1.00e+0
0f 1
19 5.9171868e+03 3.95e-08 7.31e-06 -8.6 1.84e-03 - 9.97e-01 9.81e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 5.9171865e+03 5.37e-13 2.98e-11 -8.6 3.55e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 5.9171865424308843e+00 5.9171865424308844e+0
3
Dual infeasibility......: 2.9758893799171408e-11 2.9758893799171408e-0
8
Constraint violation....: 5.3690385470872570e-13 5.3690385470872570e-1
3
Complementarity.........: 2.5100799351773764e-09 2.5100799351773764e-0
6
Overall NLP error.......: 2.5100799351773764e-09 2.5100799351773764e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6642462e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 4.97e-04 9.81e-0
3h 1
2 8.6166973e+02 3.24e+03 5.24e+01 -1.0 1.78e+03 - 3.43e-05 1.80e-0
4h 1
3 3.1407266e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 9.62e-05 2.24e-0
2f 1
4 1.5404000e+04 5.91e-02 8.11e+01 -1.0 3.17e+03 - 3.62e-02 1.00e+0
0h 1
5 6.7204816e+03 5.60e-02 5.89e+01 -1.0 7.11e+01 - 2.71e-01 4.74e-0
2f 1
6 4.9268594e+03 2.53e-02 3.18e+01 -1.0 3.51e+01 - 4.68e-01 5.22e-0
1f 1
7 4.4315069e+03 1.19e-02 2.56e+00 -1.0 9.58e+00 - 9.27e-01 1.00e+0
0f 1
8 4.7750401e+03 6.02e-04 6.76e-02 -1.0 2.91e+00 - 9.97e-01 1.00e+0
0f 1
9 4.1958076e+03 6.59e-04 3.54e-01 -2.5 7.48e+00 - 8.90e-01 7.46e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.1311793e+03 2.03e-04 2.33e-01 -2.5 3.64e+00 - 9.11e-01 1.00e+0
0h 1
11 4.1149279e+03 1.80e-04 1.07e-01 -2.5 9.31e-01 - 1.00e+00 7.31e-0
1H 1
12 4.1119663e+03 3.45e-04 2.18e-03 -2.5 1.46e-01 - 1.00e+00 1.00e+0
0f 1
13 4.0880964e+03 1.22e-03 3.17e-02 -3.8 1.07e+01 - 7.97e-01 1.00e+0
0h 1
14 4.0847468e+03 2.76e-03 1.10e-03 -3.8 4.88e-02 - 1.00e+00 1.00e+0
0h 1
15 4.0851060e+03 3.91e-05 1.31e-04 -3.8 1.37e-02 - 1.00e+00 1.00e+0
0h 1
16 4.0833633e+03 1.01e-04 3.57e-04 -5.7 5.94e-01 - 9.51e-01 9.77e-0
1h 1
17 4.0833439e+03 2.19e-05 3.67e-03 -5.7 1.35e-02 - 1.00e+00 7.84e-0
1h 1
18 4.0833449e+03 8.57e-09 1.20e-06 -5.7 2.92e-03 - 1.00e+00 1.00e+0
0f 1
19 4.0833247e+03 9.02e-09 1.93e-05 -8.6 7.37e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 4.0833244e+03 1.37e-12 6.48e-11 -8.6 1.22e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 4.0833243910103114e+00 4.0833243910103115e+0
3
Dual infeasibility......: 6.4815378352697402e-11 6.4815378352697409e-0
8
Constraint violation....: 1.3692380562702056e-12 1.3692380562702056e-1
2
Complementarity.........: 2.8720742396345022e-09 2.8720742396345020e-0
6
Overall NLP error.......: 2.8720742396345022e-09 2.8720742396345020e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8047271e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.82e-0
3h 1
2 8.7571780e+02 2.00e+03 5.24e+01 -1.0 1.11e+03 - 4.57e-05 1.77e-0
4h 1
3 2.9373644e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 9.83e-05 2.27e-0
2f 1
4 1.4280611e+04 6.09e-02 7.92e+01 -1.0 1.95e+03 - 5.49e-02 1.00e+0
0h 1
5 5.5544141e+03 5.66e-02 5.35e+01 -1.0 6.57e+01 - 3.12e-01 6.38e-0
2f 1
6 4.1958834e+03 3.11e-02 2.65e+01 -1.0 3.24e+01 - 4.93e-01 4.18e-0
1f 1
7 3.3759781e+03 1.36e-02 2.17e+00 -1.0 1.11e+01 - 9.19e-01 9.26e-0
1f 1
8 3.8304846e+03 4.15e-04 1.05e-01 -1.0 5.03e+00 - 9.97e-01 1.00e+0
0f 1
9 3.1552107e+03 1.16e-03 7.66e-01 -1.7 4.29e+01 - 5.81e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.1968378e+03 1.01e-05 1.33e-02 -1.7 1.27e+01 - 1.00e+00 1.00e+0
0h 1
11 3.0806312e+03 2.35e-05 5.90e-01 -3.8 5.88e+01 - 9.61e-01 7.01e-0
1f 1
12 3.0449129e+03 3.94e-04 1.54e-01 -3.8 1.71e+01 - 7.03e-01 1.00e+0
0f 1
13 3.0405747e+03 2.43e-03 5.11e-03 -3.8 6.22e-02 - 1.00e+00 1.00e+0
0h 1
14 3.0407905e+03 2.52e-05 9.62e-05 -3.8 7.35e-03 - 1.00e+00 1.00e+0
0h 1
15 3.0392726e+03 1.33e-04 1.15e-03 -5.7 4.46e-01 - 9.17e-01 1.00e+0
0h 1
16 3.0392312e+03 3.21e-05 6.98e-06 -5.7 8.36e-03 - 1.00e+00 1.00e+0
0h 1
17 3.0392359e+03 2.73e-07 3.62e-06 -5.7 7.53e-04 - 1.00e+00 1.00e+0
0h 1
18 3.0392191e+03 3.06e-08 3.55e-05 -8.6 5.53e-03 - 1.00e+00 9.56e-0
1h 1
19 3.0392184e+03 4.77e-12 5.54e-11 -8.6 2.46e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 3.0392183886361637e+00 3.0392183886361636e+0
3
Dual infeasibility......: 5.5447104244701876e-11 5.5447104244701876e-0
8
Constraint violation....: 4.7685189130675099e-12 4.7685189130675099e-1
2
Complementarity.........: 3.2627274749541841e-09 3.2627274749541839e-0
6
Overall NLP error.......: 3.2627274749541841e-09 3.2627274749541839e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0808031e+02 9.17e+02 5.23e+01 -1.0 9.22e+02 - 1.00e-03 9.86e-0
3h 1
2 8.8617108e+02 9.17e+02 5.23e+01 -1.0 8.07e+02 - 7.42e-05 8.22e-0
4h 1
3 2.8484271e+02 8.96e+02 5.24e+01 -1.0 9.17e+02 - 7.98e-04 2.30e-0
2h 1
4 1.3130925e+04 6.61e-02 7.64e+01 -1.0 8.96e+02 - 8.29e-02 1.00e+0
0h 1
5 4.8553004e+03 5.96e-02 3.83e+01 -1.0 2.93e+01 - 4.73e-01 8.96e-0
2f 1
6 3.3594619e+03 1.92e-02 1.58e+01 -1.0 1.54e+01 - 6.12e-01 7.37e-0
1f 1
7 3.4484569e+03 4.84e-03 1.76e-01 -1.0 2.12e+00 - 9.90e-01 1.00e+0
0f 1
8 3.0256349e+03 1.47e-03 1.26e-01 -1.7 7.99e+00 - 1.00e+00 1.00e+0
0f 1
9 2.8699577e+03 2.01e-03 4.20e-01 -2.5 5.63e+00 - 1.00e+00 7.84e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8453385e+03 1.62e-04 5.44e-03 -2.5 1.12e+00 - 1.00e+00 1.00e+0
0h 1
11 2.8215934e+03 4.47e-05 1.85e-01 -3.8 1.35e+01 - 1.00e+00 7.36e-0
1h 1
12 2.8142143e+03 1.62e-07 3.67e-04 -3.8 3.52e+00 - 1.00e+00 1.00e+0
0f 1
13 2.8124069e+03 2.71e-08 9.51e-04 -5.7 7.43e-01 - 1.00e+00 9.85e-0
1f 1
14 2.8123858e+03 1.86e-12 1.33e-08 -5.7 1.07e-02 - 1.00e+00 1.00e+0
0f 1
15 2.8123637e+03 2.63e-12 4.48e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 2.8123637095731833e+00 2.8123637095731833e+0
3
Dual infeasibility......: 4.4777030270908964e-09 4.4777030270908964e-0
6
Constraint violation....: 2.6307012124249241e-12 2.6307012124249241e-1
2
Complementarity.........: 3.6085022621583713e-09 3.6085022621583712e-0
6
Overall NLP error.......: 4.4777030270908964e-09 4.4777030270908964e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933498e-01 5.8277753147933493e+0
2
Dual infeasibility......: 2.1031320946147231e-09 2.1031320946147231e-0
6
Constraint violation....: 6.2994318095199731e-11 6.2994318095199731e-1
1
Complementarity.........: 2.8882108896903808e-09 2.8882108896903807e-0
6
Overall NLP error.......: 2.8882108896903808e-09 2.8882108896903807e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933498e-01 5.8277753147933493e+0
2
Dual infeasibility......: 2.1031320946147231e-09 2.1031320946147231e-0
6
Constraint violation....: 6.2994318095199731e-11 6.2994318095199731e-1
1
Complementarity.........: 2.8882108896903808e-09 2.8882108896903807e-0
6
Overall NLP error.......: 2.8882108896903808e-09 2.8882108896903807e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254210179e-01 6.4890146254210174e+0
2
Dual infeasibility......: 4.9126604805649068e-09 4.9126604805649068e-0
6
Constraint violation....: 6.2123811650494076e-09 6.2123811650494076e-0
9
Complementarity.........: 4.3646095252531724e-09 4.3646095252531725e-0
6
Overall NLP error.......: 6.2123811650494076e-09 4.9126604805649068e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.03e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 6.36e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643335e+00 1.6104063281643334e+0
3
Dual infeasibility......: 2.4573533589687019e-12 2.4573533589687019e-0
9
Constraint violation....: 6.3603173554942194e-15 6.3603173554942194e-1
5
Complementarity.........: 2.5062163910047530e-09 2.5062163910047528e-0
6
Overall NLP error.......: 2.5062163910047530e-09 2.5062163910047528e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2329662e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 3.31e-04 9.85e-0
3h 1
2 8.1338739e+02 9.17e+02 5.24e+01 -1.0 6.65e+02 - 7.53e-05 3.59e-0
4h 1
3 2.4215012e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 3.16e-04 2.12e-0
2f 1
4 1.2572829e+04 5.49e-02 8.23e+01 -1.0 8.98e+02 - 3.81e-02 1.00e+0
0h 1
5 3.9012337e+03 5.24e-02 5.73e+01 -1.0 8.21e+01 - 3.02e-01 4.95e-0
2f 1
6 1.9122630e+03 3.74e-02 3.08e+01 -1.0 3.92e+01 - 4.67e-01 5.07e-0
1f 1
7 4.6985285e+03 1.23e-02 2.74e+01 -1.0 2.08e+01 - 3.98e-01 1.00e+0
0h 1
8 1.8769618e+03 1.22e-02 1.07e+00 -1.0 2.57e+01 - 9.87e-01 8.88e-0
1f 1
9 1.9956227e+03 2.03e-04 4.84e-02 -1.0 2.76e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7291248e+03 2.21e-04 1.23e+00 -2.5 1.88e+01 - 9.37e-01 5.95e-0
1f 1
11 1.5409848e+03 3.77e-03 1.32e-01 -2.5 7.58e+00 - 7.96e-01 1.00e+0
0f 1
12 1.5181170e+03 5.06e-03 3.08e-01 -2.5 1.81e+00 - 1.00e+00 7.68e-0
1h 1
13 1.5303991e+03 2.38e-04 4.69e-03 -2.5 7.19e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5028095e+03 1.70e-04 2.15e-02 -3.8 1.08e+01 - 9.90e-01 9.29e-0
1h 1
15 1.5018205e+03 7.26e-07 6.85e-05 -3.8 7.35e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003124e+03 3.77e-07 1.78e-04 -5.7 5.94e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003117e+03 3.79e-11 2.92e-09 -5.7 4.21e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0h 1
1 8.6577131e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 4.97e-04 9.85e-0
3h 1
2 8.5529111e+02 9.17e+02 5.24e+01 -1.0 6.82e+02 - 7.34e-05 3.86e-0
4h 1
3 2.6219590e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 3.43e-04 2.22e-0
2f 1
4 1.2935511e+04 5.94e-02 8.01e+01 -1.0 8.97e+02 - 4.97e-02 1.00e+0
0h 1
5 4.2970559e+03 5.55e-02 5.39e+01 -1.0 7.40e+01 - 3.17e-01 5.94e-0
2f 1
30 1.498111e+04 1.632511e+04 3.303766e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2431573e+02 1.57e+04 5.24e+01 -1.0 1.59e+04 - 3.31e-04 9.81e-0
3h 1
2 8.2092256e+02 1.57e+04 5.24e+01 -1.0 1.06e+04 - 1.56e-05 1.47e-0
4h 1
3 8.1724719e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 5.24e-05 2.95e-0
4h 1
4 8.1213276e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 3.46e-04 4.22e-0
4h 1
5 5.6829511e+02 1.54e+04 5.26e+01 -1.0 1.57e+04 - 8.40e-04 2.12e-0
2f 1
6 2.6957432e+04 5.57e-02 8.24e+01 -1.0 1.54e+04 - 3.93e-02 1.00e+0
0h 1
7 1.8687908e+04 5.30e-02 5.38e+01 -1.0 7.86e+01 - 3.44e-01 5.11e-0
2f 1
8 1.6730778e+04 3.71e-02 2.85e+01 -1.0 3.94e+01 - 4.73e-01 5.02e-0
1f 1
9 1.7072323e+04 2.29e-02 1.29e+01 -1.0 2.03e+01 - 4.05e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6824872e+04 6.00e-03 3.66e-01 -1.0 4.78e+00 - 9.79e-01 1.00e+0
0h 1
11 1.6518197e+04 1.42e-03 1.30e-01 -1.7 5.52e+00 - 8.01e-01 8.25e-0
1f 1
12 1.6391451e+04 1.17e-03 3.17e-01 -2.5 5.14e+00 - 8.06e-01 1.00e+0
0h 1
13 1.6335785e+04 8.01e-03 1.55e-01 -2.5 3.33e+00 - 8.41e-01 9.80e-0
1h 1
14 1.6353671e+04 2.96e-04 7.55e-03 -2.5 2.97e+00 - 1.00e+00 1.00e+0
0f 1
15 1.6325970e+04 2.01e-04 7.61e-03 -3.8 9.18e+00 - 9.96e-01 9.64e-0
1h 1
16 1.6326478e+04 5.19e-07 1.84e-01 -3.8 4.51e-01 - 8.33e-03 1.00e+0
0f 1
17 1.6326466e+04 1.77e-09 9.02e-08 -3.8 1.03e-01 - 1.00e+00 1.00e+0
0h 1
18 1.6325121e+04 4.07e-07 2.42e-04 -5.7 4.51e-01 - 1.00e+00 9.95e-0
1f 1
19 1.6325122e+04 4.23e-11 3.35e-09 -5.7 7.27e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325105e+04 6.19e-11 5.28e-06 -8.6 5.53e-03 - 1.00e+00 9.92e-0
1h 1
21 1.6325105e+04 4.20e-15 1.45e-13 -8.6 1.22e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.6325105202146037e+01 1.6325105202146036e+0
4
Dual infeasibility......: 1.4537113537042479e-13 1.4537113537042479e-1
0
Constraint violation....: 4.2049697057677804e-15 4.2049697057677804e-1
5
Complementarity.........: 7.3600095626795703e-09 7.3600095626795699e-0
6
Overall NLP error.......: 7.3600095626795703e-09 7.3600095626795699e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9224782e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.64e-04 9.80e-0
3f 1
2 7.8937376e+02 1.50e+04 5.25e+01 -1.0 1.43e+04 - 4.77e-05 1.03e-0
4h 1
3 7.6212791e+02 1.49e+04 5.25e+01 -1.0 1.50e+04 - 6.41e-06 2.04e-0
3h 1
4 5.3984699e+02 1.46e+04 5.26e+01 -1.0 1.49e+04 - 2.18e-03 1.99e-0
2h 1
5 2.5455605e+04 5.52e-02 8.40e+01 -1.0 1.46e+04 - 3.38e-02 1.00e+0
0h 1
6 1.7638236e+04 5.28e-02 5.91e+01 -1.0 7.41e+01 - 2.99e-01 4.73e-0
2f 1
7 1.5941286e+04 4.32e-02 2.96e+01 -1.0 3.32e+01 - 4.96e-01 4.58e-0
1f 1
8 1.6249195e+04 2.75e-02 1.22e+01 -1.0 1.73e+01 - 4.44e-01 1.25e-0
1f 4
9 1.6019715e+04 5.99e-03 1.39e-01 -1.0 4.73e+00 - 9.92e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5736489e+04 1.19e-03 2.79e-01 -1.7 6.95e+00 - 1.00e+00 8.67e-0
1f 1
11 1.5729153e+04 7.31e-04 1.17e-02 -1.7 3.35e+01 - 1.00e+00 1.00e+0
0f 1
12 1.5585647e+04 1.33e-03 8.98e-02 -3.8 3.98e+01 - 7.98e-01 9.32e-0
1f 1
13 1.5560356e+04 1.48e-03 6.31e-02 -3.8 2.68e+00 - 8.48e-01 7.73e-0
1h 1
14 1.5560317e+04 2.66e-06 7.39e-04 -3.8 6.07e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5559224e+04 3.17e-07 6.04e-04 -5.7 2.97e-01 - 1.00e+00 9.89e-0
1h 1
16 1.5559217e+04 3.94e-11 6.15e-09 -5.7 2.31e-02 - 1.00e+00 1.00e+0
0f 1
17 1.5559202e+04 6.30e-11 2.09e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5559202136773784e+01 1.5559202136773783e+0
4
Dual infeasibility......: 2.0878358316126816e-09 2.0878358316126816e-0
6
Constraint violation....: 6.2996247107705017e-11 6.2996247107705017e-1
1
Complementarity.........: 2.8881092888405461e-09 2.8881092888405461e-0
6
Overall NLP error.......: 2.8881092888405461e-09 2.8881092888405461e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9899703e+02 1.39e+04 5.25e+01 -1.0 1.40e+04 - 2.76e-04 9.80e-0
3h 1
2 7.9594332e+02 1.39e+04 5.25e+01 -1.0 1.19e+04 - 2.50e-05 1.16e-0
4h 1
3 7.9190975e+02 1.39e+04 5.25e+01 -1.0 1.38e+04 - 2.02e-05 2.79e-0
4h 1
4 7.8587905e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 2.96e-04 4.27e-0
4h 1
5 5.0883991e+02 1.36e+04 5.27e+01 -1.0 1.39e+04 - 7.55e-04 2.06e-0
2f 1
6 2.4978841e+04 5.44e-02 8.36e+01 -1.0 1.36e+04 - 3.38e-02 1.00e+0
0h 1
7 1.6649304e+04 5.20e-02 6.14e+01 -1.0 7.91e+01 - 2.68e-01 4.64e-0
2f 1
8 1.4872992e+04 4.22e-02 3.15e+01 -1.0 3.43e+01 - 4.85e-01 4.71e-0
1f 1
9 1.5193670e+04 2.60e-02 1.39e+01 -1.0 1.82e+01 - 4.28e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4940092e+04 6.13e-03 2.46e-01 -1.0 5.13e+00 - 9.87e-01 1.00e+0
0h 1
11 1.4655451e+04 1.24e-03 2.91e-01 -1.7 4.60e+00 - 1.00e+00 8.63e-0
1f 1
12 1.4666754e+04 7.71e-04 2.00e-01 -1.7 5.30e+01 - 2.95e-01 1.00e+0
0f 1
13 1.4669286e+04 3.41e-06 5.10e-04 -1.7 2.00e+00 - 1.00e+00 1.00e+0
0h 1
14 1.4511319e+04 1.04e-03 5.18e-02 -3.8 6.70e+01 - 8.01e-01 8.74e-0
1f 1
15 1.4481337e+04 1.53e-03 3.29e-02 -3.8 1.97e+00 - 8.44e-01 8.02e-0
1h 1
16 1.4481121e+04 2.61e-06 7.34e-04 -3.8 1.22e-02 - 1.00e+00 1.00e+0
0h 1
17 1.4480073e+04 2.89e-07 7.44e-04 -5.7 3.01e-01 - 1.00e+00 9.87e-0
1h 1
18 1.4480067e+04 3.83e-11 6.04e-09 -5.7 2.72e-02 - 1.00e+00 1.00e+0
0f 1
19 1.4480052e+04 6.30e-11 2.10e-09 -8.6 3.69e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.4480051762826221e+01 1.4480051762826221e+0
4
Dual infeasibility......: 2.0963673710440553e-09 2.0963673710440553e-0
6
Constraint violation....: 6.2996538541248981e-11 6.2996538541248981e-1
1
Complementarity.........: 2.8881073241149658e-09 2.8881073241149659e-0
6
Overall NLP error.......: 2.8881073241149658e-09 2.8881073241149659e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.5830290e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 4.53e-04 9.80e-0
3h 1
2 8.5545111e+02 1.27e+04 5.24e+01 -1.0 1.20e+04 - 4.54e-05 1.05e-0
4h 1
3 8.1525958e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 7.91e-06 2.64e-0
3h 1
4 5.3908265e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 2.87e-03 2.10e-0
2h 1
5 2.3436255e+04 6.09e-02 8.08e+01 -1.0 1.24e+04 - 5.27e-02 1.00e+0
0h 1
6 1.5817447e+04 5.67e-02 4.92e+01 -1.0 7.04e+01 - 3.78e-01 6.39e-0
2f 1
7 1.4045339e+04 3.08e-02 2.48e+01 -1.0 4.04e+01 - 4.93e-01 4.73e-0
1f 1
8 1.3978221e+04 9.49e-03 2.21e+00 -1.0 1.15e+01 - 9.24e-01 1.00e+0
0f 1
9 1.3921325e+04 7.12e-04 6.94e-02 -1.0 5.75e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3561034e+04 4.60e-04 1.06e+00 -2.5 6.73e+00 - 9.13e-01 5.68e-0
1f 1
11 1.3431111e+04 5.43e-04 3.68e-01 -2.5 4.59e+00 - 8.34e-01 1.00e+0
0f 1
12 1.3405057e+04 8.64e-03 2.53e-01 -2.5 2.12e+00 - 1.00e+00 5.97e-0
1h 1
13 1.3397546e+04 1.39e-03 6.68e-03 -2.5 3.28e-01 - 1.00e+00 1.00e+0
0f 1
14 1.3378084e+04 1.50e-03 5.89e-02 -3.8 5.36e+00 - 7.62e-01 9.98e-0
1h 1
15 1.3374588e+04 2.82e-03 9.98e-04 -3.8 5.79e-02 - 1.00e+00 1.00e+0
0h 1
16 1.3374485e+04 1.57e-05 2.50e-04 -3.8 7.88e-03 - 1.00e+00 1.00e+0
0h 1
17 1.3373407e+04 4.33e-05 1.40e-02 -5.7 2.97e-01 - 9.68e-01 7.41e-0
1h 1
18 1.3373132e+04 1.36e-06 1.17e-05 -5.7 7.68e-02 - 1.00e+00 1.00e+0
0h 1
19 1.3373116e+04 8.22e-09 2.73e-06 -8.6 3.68e-03 - 1.00e+00 9.98e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.3373116e+04 7.77e-15 2.71e-13 -8.6 8.40e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.3373116082165595e+01 1.3373116082165594e+0
4
Dual infeasibility......: 2.7076536356494154e-13 2.7076536356494154e-1
0
Constraint violation....: 7.7715611723760958e-15 7.7715611723760958e-1
5
Complementarity.........: 2.6790160327938484e-09 2.6790160327938484e-0
6
Overall NLP error.......: 2.6790160327938484e-09 2.6790160327938484e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2301496e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.51e-03 9.80e-0
3h 1
2 9.2012933e+02 1.11e+04 5.23e+01 -1.0 1.02e+04 - 3.26e-05 1.08e-0
4h 1
3 8.3424137e+02 1.11e+04 5.23e+01 -1.0 1.11e+04 - 1.17e-05 5.22e-0
3h 1
4 5.7283738e+02 1.08e+04 5.22e+01 -1.0 1.11e+04 - 5.95e-03 2.13e-0
2h 1
5 2.1532474e+04 7.53e-02 7.76e+01 -1.0 1.08e+04 - 8.36e-02 1.00e+0
0h 1
6 1.5215064e+04 6.76e-02 2.23e+01 -1.0 1.30e+01 - 6.84e-01 9.54e-0
2f 1
7 1.3955436e+04 2.05e-02 7.03e+00 -1.0 9.59e+00 - 7.22e-01 8.73e-0
1f 1
8 1.4214931e+04 1.09e-02 1.48e-01 -1.0 2.63e+00 - 9.94e-01 9.34e-0
1f 1
9 1.3828591e+04 2.88e-03 3.16e-01 -1.7 1.55e+01 - 8.32e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3787762e+04 7.03e-04 1.91e-01 -1.7 1.87e+01 - 8.57e-01 1.00e+0
0h 1
11 1.3626483e+04 5.53e-04 2.43e-02 -2.5 2.86e+01 - 9.61e-01 9.71e-0
1f 1
12 1.3607417e+04 1.83e-04 2.33e-01 -3.8 7.20e+00 - 9.75e-01 6.94e-0
1h 1
13 1.3601600e+04 5.24e-07 3.98e-04 -3.8 2.21e+00 - 1.00e+00 1.00e+0
0h 1
14 1.3600267e+04 1.96e-08 4.17e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3600252e+04 8.64e-13 5.06e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.3600252131795539e+01 1.3600252131795540e+0
4
Dual infeasibility......: 5.0572784166991218e-10 5.0572784166991218e-0
7
Constraint violation....: 8.6362861306810146e-13 8.6362861306810146e-1
3
Complementarity.........: 4.1920147671106356e-09 4.1920147671106358e-0
6
Overall NLP error.......: 4.1920147671106356e-09 4.1920147671106358e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3006359e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 2.02e-03 9.80e-0
3h 1
2 9.2722762e+02 9.19e+03 5.23e+01 -1.0 8.88e+03 - 6.77e-05 1.02e-0
4h 1
3 9.0058749e+02 9.18e+03 5.23e+01 -1.0 9.18e+03 - 5.63e-06 1.42e-0
3f 1
4 4.9463665e+02 8.97e+03 5.24e+01 -1.0 9.18e+03 - 1.64e-03 2.27e-0
2h 1
5 2.1164030e+04 7.23e-02 7.69e+01 -1.0 8.97e+03 - 7.85e-02 1.00e+0
0h 1
6 1.3562973e+04 6.54e-02 2.35e+01 -1.0 8.38e+00 - 6.64e-01 8.73e-0
2f 1
7 1.2324131e+04 3.29e-02 9.64e+00 -1.0 7.01e+00 - 6.84e-01 1.00e+0
0f 1
8 1.2476105e+04 1.68e-02 6.52e-01 -1.0 2.39e+00 - 9.95e-01 4.91e-0
1f 2
9 1.2182671e+04 6.71e-03 2.78e-01 -1.7 9.98e+00 - 1.00e+00 8.44e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2122153e+04 1.23e-03 8.86e-02 -1.7 1.11e+01 - 1.00e+00 1.00e+0
0f 1
11 1.1995228e+04 3.35e-04 9.60e-02 -2.5 1.72e+01 - 9.85e-01 8.95e-0
1f 1
12 1.1986791e+04 4.66e-06 1.02e-03 -2.5 1.79e+00 - 1.00e+00 1.00e+0
0f 1
13 1.1965361e+04 5.87e-06 5.32e-03 -3.8 2.68e+00 - 1.00e+00 9.75e-0
1f 1
14 1.1965205e+04 1.30e-08 6.21e-06 -3.8 6.52e-02 - 1.00e+00 1.00e+0
0f 1
15 1.1964013e+04 1.73e-08 3.04e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0f 1
16 1.1963999e+04 1.28e-12 4.22e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.1963999136534124e+01 1.1963999136534123e+0
4
Dual infeasibility......: 4.2180188761579941e-10 4.2180188761579941e-0
7
Constraint violation....: 1.2795875470317242e-12 1.2795875470317242e-1
2
Complementarity.........: 2.5909993213602502e-09 2.5909993213602501e-0
6
Overall NLP error.......: 2.5909993213602502e-09 2.5909993213602501e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2298458e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1944863e+02 6.71e+03 5.23e+01 -1.0 4.84e+03 - 2.16e-05 1.37e-0
4h 1
3 4.2746489e+02 6.55e+03 5.24e+01 -1.0 6.71e+03 - 4.40e-05 2.36e-0
2f 1
4 1.9375137e+04 6.81e-02 8.01e+01 -1.0 6.55e+03 - 3.23e-02 1.00e+0
0h 1
5 1.1073105e+04 6.48e-02 6.20e+01 -1.0 2.30e+01 - 2.26e-01 4.46e-0
2f 1
6 9.8597986e+03 1.54e-02 2.76e+01 -1.0 1.04e+01 - 5.80e-01 7.55e-0
1f 1
7 9.7407089e+03 8.27e-03 3.90e-01 -1.0 2.06e+00 - 9.86e-01 1.00e+0
0f 1
8 9.3846978e+03 1.66e-03 1.00e-01 -1.7 3.27e+00 - 1.00e+00 9.75e-0
1f 1
9 9.2396015e+03 1.75e-03 5.24e-01 -2.5 4.91e+00 - 1.00e+00 7.49e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.2091546e+03 3.14e-04 9.62e-02 -2.5 1.22e+00 - 1.00e+00 8.96e-0
1h 1
11 9.2123965e+03 1.16e-05 4.01e-03 -2.5 1.27e-01 - 1.00e+00 1.00e+0
0f 1
12 9.1849124e+03 1.05e-05 7.99e-03 -3.8 8.04e+00 - 1.00e+00 9.61e-0
1f 1
13 9.1843091e+03 1.57e-08 1.36e-05 -3.8 3.09e-01 - 1.00e+00 1.00e+0
0f 1
14 9.1828174e+03 1.79e-08 5.06e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0f 1
15 9.1828008e+03 6.40e-13 4.11e-10 -8.6 5.52e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 9.1828007757735293e+00 9.1828007757735286e+0
3
Dual infeasibility......: 4.1141856531290953e-10 4.1141856531290953e-0
7
Constraint violation....: 6.4032112945255903e-13 6.4032112945255903e-1
3
Complementarity.........: 2.6984392747398358e-09 2.6984392747398357e-0
6
Overall NLP error.......: 2.6984392747398358e-09 2.6984392747398357e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3002852e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 2.02e-03 9.81e-0
3h 1
2 9.2665255e+02 4.77e+03 5.23e+01 -1.0 3.78e+03 - 3.07e-05 1.25e-0
4h 1
3 4.3498964e+02 4.67e+03 5.24e+01 -1.0 4.77e+03 - 3.22e-05 2.12e-0
2f 1
4 1.2081659e+04 8.33e-02 7.86e+01 -1.0 4.67e+03 - 3.26e-02 1.00e+0
0h 1
5 9.1244927e+03 7.96e-02 2.66e+01 -1.0 1.08e+01 - 6.13e-01 4.30e-0
2f 1
6 7.9979232e+03 1.30e-02 1.10e+01 -1.0 9.07e+00 - 6.51e-01 8.24e-0
1f 1
7 8.1340924e+03 8.57e-03 2.00e-01 -1.0 2.78e+00 - 9.79e-01 9.38e-0
1f 1
8 7.7544112e+03 2.59e-03 1.33e+00 -1.7 4.24e+00 - 3.13e-01 1.00e+0
0f 1
9 7.7190997e+03 2.26e-04 6.62e-01 -1.7 5.25e+00 - 6.82e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.7295521e+03 1.08e-04 2.49e-01 -1.7 1.06e+01 - 7.45e-01 1.00e+0
0f 1
11 7.7371004e+03 2.38e-06 2.61e-04 -1.7 1.32e+01 - 1.00e+00 1.00e+0
0h 1
12 7.5726492e+03 3.80e-04 2.10e-02 -2.5 2.85e+01 - 9.85e-01 9.64e-0
1f 1
13 7.5518929e+03 8.74e-05 1.31e-01 -3.8 6.30e+00 - 9.95e-01 7.95e-0
1h 1
14 7.5479000e+03 1.69e-07 9.36e-05 -3.8 1.29e+00 - 1.00e+00 1.00e+0
0f 1
15 7.5465631e+03 1.76e-08 3.01e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
16 7.5465477e+03 4.61e-12 4.61e-08 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
17 7.5465477e+03 3.33e-16 9.10e-04 -8.6 1.16e-05 - 4.63e-01 1.00e+0
0f 1
18 7.5465477e+03 2.78e-16 2.53e-14 -8.6 7.58e-06 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 7.5465477299421764e+00 7.5465477299421764e+0
3
Dual infeasibility......: 2.5313084961453569e-14 2.5313084961453569e-1
1
Constraint violation....: 2.7755575615628914e-16 2.7755575615628914e-1
6
Complementarity.........: 3.5109332498669672e-09 3.5109332498669670e-0
6
Overall NLP error.......: 3.5109332498669672e-09 3.5109332498669670e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6653022e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 4.97e-04 9.81e-0
3f 1
2 8.6323248e+02 3.24e+03 5.24e+01 -1.0 2.66e+03 - 5.18e-05 1.21e-0
4h 1
3 5.3831907e+02 3.20e+03 5.25e+01 -1.0 3.24e+03 - 3.12e-05 1.32e-0
2f 1
4 3.9903785e+02 3.13e+03 5.15e+01 -1.0 3.20e+03 - 2.00e-02 2.32e-0
2f 1
5 9.8503316e+03 7.36e-02 7.80e+01 -1.0 3.13e+03 - 1.07e-01 1.00e+0
0h 1
6 5.7440254e+03 6.32e-02 2.21e+01 -1.0 4.61e+01 - 6.97e-01 1.31e-0
1f 1
7 4.3233476e+03 3.42e-02 1.97e+00 -1.0 2.67e+01 - 8.81e-01 6.15e-0
1f 1
8 4.6962646e+03 3.54e-03 2.68e+00 -1.0 4.17e+00 - 5.09e-01 1.00e+0
0f 1
9 4.5947738e+03 3.09e-04 4.85e-01 -1.0 4.15e+00 - 5.28e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2070089e+03 3.46e-04 4.74e-01 -1.7 4.86e+00 - 9.10e-01 7.27e-0
1f 1
11 4.2047488e+03 3.96e-05 6.64e-01 -1.7 1.09e+01 - 6.67e-01 1.00e+0
0f 1
12 4.2049946e+03 5.81e-06 2.39e-02 -1.7 1.31e+01 - 9.48e-01 1.00e+0
0h 1
13 4.1115200e+03 6.08e-05 2.03e-02 -2.5 2.51e+01 - 1.00e+00 9.81e-0
1f 1
14 4.0890612e+03 2.91e-03 7.58e-02 -3.8 6.57e+00 - 6.50e-01 9.92e-0
1h 1
15 4.0843214e+03 5.66e-03 1.13e-02 -3.8 6.65e-02 - 8.50e-01 1.00e+0
0h 1
16 4.0848580e+03 7.03e-05 5.21e-04 -3.8 1.68e-02 - 1.00e+00 1.00e+0
0h 1
17 4.0833268e+03 1.39e-04 8.95e-04 -5.7 2.97e-01 - 9.38e-01 1.00e+0
0h 1
18 4.0833300e+03 4.13e-05 5.47e-03 -5.7 1.50e-03 - 1.00e+00 7.04e-0
1h 1
19 4.0833413e+03 1.36e-08 1.70e-06 -5.7 1.06e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 4.0833247e+03 9.51e-09 2.21e-05 -8.6 3.68e-03 - 1.00e+00 9.82e-0
1h 1
21 4.0833244e+03 1.60e-12 8.08e-11 -8.6 6.57e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 4.0833243888718211e+00 4.0833243888718212e+0
3
Dual infeasibility......: 8.0818480855162052e-11 8.0818480855162052e-0
8
Constraint violation....: 1.6033840921636511e-12 1.6033840921636511e-1
2
Complementarity.........: 3.1677789254828634e-09 3.1677789254828635e-0
6
Overall NLP error.......: 3.1677789254828634e-09 3.1677789254828635e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8038781e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.82e-0
3h 1
2 8.7404419e+02 2.00e+03 5.24e+01 -1.0 1.17e+03 - 4.28e-05 2.39e-0
4h 1
3 2.9382745e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 1.65e-04 2.27e-0
2f 1
4 1.4249786e+04 6.10e-02 7.92e+01 -1.0 1.95e+03 - 5.51e-02 1.00e+0
0h 1
5 5.5512989e+03 5.67e-02 5.34e+01 -1.0 6.55e+01 - 3.14e-01 6.40e-0
2f 1
6 4.1927553e+03 3.11e-02 2.64e+01 -1.0 3.24e+01 - 4.94e-01 4.18e-0
1f 1
7 3.3769719e+03 1.34e-02 2.16e+00 -1.0 1.11e+01 - 9.19e-01 9.25e-0
1f 1
8 3.8285990e+03 4.08e-04 9.98e-02 -1.0 5.01e+00 - 9.95e-01 1.00e+0
0f 1
9 3.1578627e+03 1.16e-03 8.88e-01 -1.7 4.63e+01 - 5.14e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.2123514e+03 1.11e-05 3.45e-02 -1.7 2.34e+01 - 9.89e-01 1.00e+0
0h 1
11 3.0882964e+03 2.96e-05 3.98e-01 -2.5 6.20e+01 - 1.00e+00 7.86e-0
1f 1
12 3.0663796e+03 1.03e-04 4.82e-03 -2.5 1.31e+01 - 1.00e+00 1.00e+0
0f 1
13 3.0436311e+03 2.79e-04 8.69e-02 -3.8 1.07e+01 - 7.71e-01 1.00e+0
0h 1
14 3.0408841e+03 1.61e-03 2.07e-03 -3.8 3.63e-02 - 9.71e-01 1.00e+0
0h 1
15 3.0409242e+03 7.55e-05 6.60e-05 -3.8 1.18e-02 - 1.00e+00 1.00e+0
0h 1
16 3.0392738e+03 1.31e-04 1.11e-03 -5.7 5.94e-01 - 9.18e-01 1.00e+0
0h 1
17 3.0392321e+03 3.28e-05 6.74e-06 -5.7 8.43e-03 - 1.00e+00 1.00e+0
0h 1
18 3.0392377e+03 1.93e-07 3.46e-06 -5.7 6.32e-04 - 1.00e+00 1.00e+0
0h 1
19 3.0392192e+03 2.64e-08 3.36e-05 -8.6 7.37e-03 - 1.00e+00 9.57e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 3.0392184e+03 4.51e-12 5.22e-11 -8.6 3.19e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 3.0392183901225183e+00 3.0392183901225180e+0
3
Dual infeasibility......: 5.2206749778148471e-11 5.2206749778148471e-0
8
Constraint violation....: 4.5110581936569361e-12 4.5110581936569361e-1
2
Complementarity.........: 3.2421519295970689e-09 3.2421519295970689e-0
6
Overall NLP error.......: 3.2421519295970689e-09 3.2421519295970689e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2329662e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 3.31e-04 9.85e-0
3h 1
2 8.1338739e+02 9.17e+02 5.24e+01 -1.0 6.65e+02 - 7.53e-05 3.59e-0
4h 1
3 2.4215012e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 3.16e-04 2.12e-0
2f 1
4 1.2572829e+04 5.49e-02 8.23e+01 -1.0 8.98e+02 - 3.81e-02 1.00e+0
0h 1
5 3.9012337e+03 5.24e-02 5.73e+01 -1.0 8.21e+01 - 3.02e-01 4.95e-0
2f 1
6 1.9122630e+03 3.74e-02 3.08e+01 -1.0 3.92e+01 - 4.67e-01 5.07e-0
1f 1
7 4.6985285e+03 1.23e-02 2.74e+01 -1.0 2.08e+01 - 3.98e-01 1.00e+0
0h 1
8 1.8769618e+03 1.22e-02 1.07e+00 -1.0 2.57e+01 - 9.87e-01 8.88e-0
1f 1
9 1.9956227e+03 2.03e-04 4.84e-02 -1.0 2.76e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7291248e+03 2.21e-04 1.23e+00 -2.5 1.88e+01 - 9.37e-01 5.95e-0
1f 1
11 1.5409848e+03 3.77e-03 1.32e-01 -2.5 7.58e+00 - 7.96e-01 1.00e+0
0f 1
12 1.5181170e+03 5.06e-03 3.08e-01 -2.5 1.81e+00 - 1.00e+00 7.68e-0
1h 1
13 1.5303991e+03 2.38e-04 4.69e-03 -2.5 7.19e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5028095e+03 1.70e-04 2.15e-02 -3.8 1.08e+01 - 9.90e-01 9.29e-0
1h 1
15 1.5018205e+03 7.26e-07 6.85e-05 -3.8 7.35e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003124e+03 3.77e-07 1.78e-04 -5.7 5.94e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003117e+03 3.79e-11 2.92e-09 -5.7 4.21e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932751767062e+00 1.5002932751767062e+0
3
Dual infeasibility......: 2.1737238631945786e-09 2.1737238631945786e-0
6
Constraint violation....: 6.2995733629556128e-11 6.2995733629556128e-1
1
Complementarity.........: 2.8882174480583091e-09 2.8882174480583092e-0
6
Overall NLP error.......: 2.8882174480583091e-09 2.8882174480583092e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1584843e+02 1.09e+02 1.13e+02 -1.0 3.76e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1398692e+04 5.38e-02 8.36e+01 -1.0 4.53e+01 - 3.10e-02 1.00e+0
0h 1
3 2.7848918e+03 5.17e-02 6.48e+01 -1.0 8.43e+01 - 2.27e-01 4.32e-0
2f 1
4 9.8155788e+02 4.24e-02 3.38e+01 -1.0 3.41e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5909726e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.21e-01 1.00e+0
0h 1
6 9.4491032e+02 1.01e-02 8.73e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6264865e+02 4.59e-04 6.60e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536469e+02 1.94e-03 1.94e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379741e+02 3.25e-03 6.12e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140235e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388164e+02 1.57e-04 1.69e-02 -3.8 7.57e-01 - 9.93e-01 9.41e-0
1h 1
12 5.8370191e+02 7.28e-07 6.65e-05 -3.8 8.63e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278679e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.06e-09 -5.7 3.41e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148935407e-01 5.8277753148935403e+0
2
Dual infeasibility......: 2.0880540100627738e-09 2.0880540100627738e-0
6
Constraint violation....: 6.2994123806170421e-11 6.2994123806170421e-1
1
Complementarity.........: 2.8882094461568119e-09 2.8882094461568120e-0
6
Overall NLP error.......: 2.8882094461568119e-09 2.8882094461568120e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1584843e+02 1.09e+02 1.13e+02 -1.0 3.76e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1398692e+04 5.38e-02 8.36e+01 -1.0 4.53e+01 - 3.10e-02 1.00e+0
0h 1
3 2.7848918e+03 5.17e-02 6.48e+01 -1.0 8.43e+01 - 2.27e-01 4.32e-0
2f 1
4 9.8155788e+02 4.24e-02 3.38e+01 -1.0 3.41e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5909726e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.21e-01 1.00e+0
0h 1
6 9.4491032e+02 1.01e-02 8.73e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6264865e+02 4.59e-04 6.60e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536469e+02 1.94e-03 1.94e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379741e+02 3.25e-03 6.12e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140235e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388164e+02 1.57e-04 1.69e-02 -3.8 7.57e-01 - 9.93e-01 9.41e-0
1h 1
12 5.8370191e+02 7.28e-07 6.65e-05 -3.8 8.63e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278679e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.06e-09 -5.7 3.41e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148935407e-01 5.8277753148935403e+0
2
Dual infeasibility......: 2.0880540100627738e-09 2.0880540100627738e-0
6
Constraint violation....: 6.2994123806170421e-11 6.2994123806170421e-1
1
Complementarity.........: 2.8882094461568119e-09 2.8882094461568120e-0
6
Overall NLP error.......: 2.8882094461568119e-09 2.8882094461568120e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.77e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5003663e+02 7.50e+01 9.04e+01 -1.0 2.59e+01 - 3.83e-04 3.52e-0
2f 1
2 1.1818872e+04 5.63e-02 8.12e+01 -1.0 2.87e+01 - 4.64e-02 1.00e+0
0h 1
3 3.1585745e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.65e-0
2f 1
4 1.0154811e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8148885e+03 7.28e-03 1.55e+01 -1.0 1.93e+01 - 6.11e-01 1.00e+0
0h 1
6 1.1196678e+03 5.40e-03 4.04e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8244219e+02 9.99e-04 2.10e-01 -1.7 5.71e+00 - 1.00e+00 8.87e-0
1h 1
8 7.2817524e+02 8.46e-04 1.35e-02 -1.7 3.45e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0982262e+02 1.50e-03 1.13e-01 -3.8 4.49e+00 - 7.71e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8216109e+02 2.17e-03 7.23e-02 -3.8 2.11e+00 - 8.07e-01 7.40e-0
1h 1
11 5.8336684e+02 9.52e-05 4.78e-02 -3.8 3.17e-02 - 1.00e+00 9.56e-0
1h 1
12 5.8368716e+02 2.82e-07 1.33e-05 -3.8 3.28e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278928e+02 4.12e-07 5.39e-04 -5.7 3.47e-02 - 1.00e+00 9.91e-0
1h 1
14 5.8278859e+02 4.36e-11 3.52e-09 -5.7 2.10e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.65e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753111572472e-01 5.8277753111572474e+0
2
Dual infeasibility......: 2.6503284114663836e-09 2.6503284114663836e-0
6
Constraint violation....: 6.3002256189825800e-11 6.3002256189825800e-1
1
Complementarity.........: 2.8882681478294200e-09 2.8882681478294199e-0
6
Overall NLP error.......: 2.8882681478294200e-09 2.8882681478294199e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.032
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.27e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9796476e+02 4.09e+01 5.94e+01 -1.0 1.42e+01 - 6.99e-04 4.23e-0
2f 1
2 1.2226497e+04 6.07e-02 7.87e+01 -1.0 1.80e+01 - 7.07e-02 1.00e+0
0h 1
3 3.6201835e+03 5.54e-02 5.15e+01 -1.0 5.45e+01 - 3.33e-01 7.87e-0
2f 1
4 2.3523816e+03 2.93e-02 2.28e+01 -1.0 2.70e+01 - 5.45e-01 4.46e-0
1f 1
5 1.7571777e+03 8.49e-03 1.17e+00 -1.0 9.96e+00 - 9.27e-01 7.68e-0
1f 1
6 2.0298807e+03 3.42e-04 8.15e-02 -1.0 3.35e+00 - 1.00e+00 1.00e+0
0h 1
7 1.4033467e+03 2.08e-03 8.15e-02 -2.5 4.87e+00 - 8.66e-01 8.50e-0
1f 1
8 1.2236690e+03 2.16e-03 2.06e-01 -2.5 1.05e+00 - 1.00e+00 8.33e-0
1f 1
9 1.2066826e+03 8.65e-05 3.81e-03 -2.5 1.49e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1969337e+03 4.61e-05 1.08e+00 -3.8 9.70e-02 - 1.00e+00 4.99e-0
1h 1
11 1.1949898e+03 3.31e-07 1.13e-01 -3.8 3.83e-02 - 9.68e-01 1.00e+0
0f 1
12 1.1939532e+03 1.38e-08 1.76e-03 -3.8 3.31e-02 - 1.00e+00 1.00e+0
0H 1
13 1.1941500e+03 1.10e-05 2.71e-04 -3.8 3.66e-03 - 1.00e+00 1.00e+0
0f 1
14 1.1935298e+03 1.78e-06 6.37e-02 -5.7 1.23e-02 - 7.78e-01 9.68e-0
1h 1
15 1.1933618e+03 1.24e-05 2.14e-04 -5.7 5.02e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1933679e+03 2.91e-08 2.24e-06 -5.7 2.67e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1933546e+03 2.76e-08 9.72e-06 -8.6 2.46e-04 - 9.82e-01 9.89e-0
1h 1
18 1.1933545e+03 2.43e-13 3.27e-11 -8.6 1.97e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1933545103949155e+00 1.1933545103949155e+0
3
Dual infeasibility......: 3.2687086667630814e-11 3.2687086667630814e-0
8
Constraint violation....: 2.4291679778798425e-13 2.4291679778798425e-1
3
Complementarity.........: 2.5120650510416463e-09 2.5120650510416461e-0
6
Overall NLP error.......: 2.5120650510416463e-09 2.5120650510416461e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2303900e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 3.31e-04 9.86e-0
3h 1
2 8.1078909e+02 9.17e+02 5.24e+01 -1.0 7.14e+02 - 8.39e-05 4.45e-0
4h 1
3 7.5268194e+02 9.15e+02 5.24e+01 -1.0 9.17e+02 - 4.04e-04 2.16e-0
3h 1
4 2.4713900e+02 8.96e+02 5.25e+01 -1.0 9.15e+02 - 2.70e-03 2.06e-0
2f 1
5 1.1254750e+04 5.74e-02 8.26e+01 -1.0 8.96e+02 - 4.22e-02 1.00e+0
0h 1
6 3.7806374e+03 5.41e-02 4.69e+01 -1.0 7.19e+01 - 4.26e-01 5.51e-0
2f 1
7 1.8945181e+03 3.70e-02 2.37e+01 -1.0 3.93e+01 - 4.94e-01 4.93e-0
1f 1
8 3.7725233e+03 8.28e-03 1.64e+01 -1.0 1.33e+01 - 5.36e-01 1.00e+0
0h 1
9 1.9501729e+03 4.86e-03 3.37e-01 -1.0 1.50e+01 - 9.88e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6784931e+03 4.24e-04 7.89e-02 -1.7 8.02e+00 - 1.00e+00 1.00e+0
0f 1
11 1.5546385e+03 2.14e-03 2.18e-01 -2.5 5.84e+00 - 7.49e-01 1.00e+0
0f 1
12 1.5216478e+03 3.05e-03 4.53e-02 -2.5 2.00e+00 - 1.00e+00 9.63e-0
1h 1
13 1.5308032e+03 1.53e-04 3.68e-03 -2.5 8.66e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5024599e+03 1.70e-04 1.82e-02 -3.8 1.11e+01 - 9.94e-01 9.39e-0
1h 1
15 1.5018189e+03 6.56e-07 6.92e-05 -3.8 4.85e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003120e+03 3.79e-07 1.86e-04 -5.7 5.95e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003117e+03 3.85e-11 3.01e-09 -5.7 7.20e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932750872706e+00 1.5002932750872706e+0
3
Dual infeasibility......: 2.1737080568215936e-09 2.1737080568215936e-0
6
Constraint violation....: 6.2995789140707359e-11 6.2995789140707359e-1
1
Complementarity.........: 2.8882161150192766e-09 2.8882161150192766e-0
6
Overall NLP error.......: 2.8882161150192766e-09 2.8882161150192766e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6555974e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 4.97e-04 9.86e-0
3h 1
2 8.5244446e+02 9.17e+02 5.24e+01 -1.0 7.30e+02 - 8.21e-05 4.84e-0
4h 1
3 7.8829237e+02 9.15e+02 5.24e+01 -1.0 9.17e+02 - 4.42e-04 2.41e-0
3h 1
4 2.6739293e+02 8.95e+02 5.24e+01 -1.0 9.15e+02 - 3.00e-03 2.14e-0
2f 1
5 1.1543503e+04 6.25e-02 8.04e+01 -1.0 8.95e+02 - 5.69e-02 1.00e+0
0h 1
31 1.602467e+04 1.632511e+04 3.359966e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6793774e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.80e-0
3h 1
2 7.6493617e+02 1.57e+04 5.25e+01 -1.0 1.38e+04 - 2.51e-05 1.13e-0
4h 1
3 6.3825293e+02 1.56e+04 5.26e+01 -1.0 1.57e+04 - 1.74e-05 1.01e-0
2h 1
4 7.0955218e+02 1.53e+04 5.23e+01 -1.0 1.56e+04 - 1.07e-02 2.11e-0
2h 1
5 2.3167295e+04 6.41e-02 8.43e+01 -1.0 1.53e+04 - 4.18e-02 1.00e+0
0h 1
6 1.8026569e+04 6.03e-02 2.93e+01 -1.0 4.92e+01 - 6.45e-01 6.17e-0
2f 1
7 1.6645499e+04 4.16e-02 1.07e+01 -1.0 2.85e+01 - 6.17e-01 4.57e-0
1f 1
8 1.7326234e+04 7.07e-03 4.09e+00 -1.0 3.69e+00 - 7.66e-01 1.00e+0
0f 1
9 1.6838707e+04 1.06e-03 1.12e+00 -1.0 7.53e+00 - 5.28e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6833717e+04 1.70e-04 7.91e-01 -1.0 5.49e+00 - 4.65e-01 1.00e+0
0f 1
11 1.6844050e+04 3.85e-06 1.84e-01 -1.0 1.00e+01 - 7.71e-01 1.00e+0
0f 1
12 1.6552595e+04 2.22e-04 1.71e-01 -1.7 6.29e+00 - 8.22e-01 7.72e-0
1f 1
13 1.6419411e+04 1.06e-03 3.65e-01 -2.5 4.90e+00 - 7.88e-01 1.00e+0
0f 1
14 1.6342433e+04 1.03e-02 5.56e-02 -2.5 5.71e+00 - 1.00e+00 1.00e+0
0h 1
15 1.6355106e+04 3.19e-04 5.98e-03 -2.5 1.87e+00 - 1.00e+00 1.00e+0
0h 1
16 1.6327027e+04 1.57e-04 1.03e-02 -3.8 1.07e+01 - 1.00e+00 9.61e-0
1h 1
17 1.6326631e+04 4.79e-07 6.21e-05 -3.8 4.21e-01 - 1.00e+00 1.00e+0
0h 1
18 1.6325123e+04 3.87e-07 1.37e-04 -5.7 5.94e-01 - 1.00e+00 9.97e-0
1h 1
19 1.6325123e+04 3.83e-11 3.09e-09 -5.7 2.78e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325106e+04 5.73e-11 2.66e-05 -8.6 7.33e-03 - 1.00e+00 9.57e-0
1h 1
21 1.6325105e+04 1.18e-13 3.86e-12 -8.6 1.39e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.6325105203954198e+01 1.6325105203954197e+0
4
Dual infeasibility......: 3.8641531617557245e-12 3.8641531617557245e-0
9
Constraint violation....: 1.1769751839807441e-13 1.1769751839807441e-1
3
Complementarity.........: 9.1653651761567425e-09 9.1653651761567420e-0
6
Overall NLP error.......: 9.1653651761567425e-09 9.1653651761567420e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6676934e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 4.98e-04 9.80e-0
3h 1
2 8.6388327e+02 1.50e+04 5.24e+01 -1.0 1.36e+04 - 2.94e-05 1.09e-0
4h 1
3 8.6199009e+02 1.50e+04 5.24e+01 -1.0 1.49e+04 - 1.27e-05 1.47e-0
4h 1
4 8.5558424e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 1.57e-04 5.03e-0
4h 1
5 5.8279219e+02 1.46e+04 5.25e+01 -1.0 1.50e+04 - 6.72e-04 2.21e-0
2f 1
6 2.6773685e+04 5.99e-02 8.02e+01 -1.0 1.46e+04 - 5.07e-02 1.00e+0
0h 1
7 1.8334498e+04 5.59e-02 5.32e+01 -1.0 7.26e+01 - 3.26e-01 6.06e-0
2f 1
8 1.6749687e+04 3.02e-02 2.75e+01 -1.0 3.87e+01 - 4.76e-01 4.33e-0
1f 1
9 1.6190725e+04 1.45e-02 2.55e+00 -1.0 1.10e+01 - 9.19e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6529124e+04 4.15e-04 8.83e-02 -1.0 4.12e+00 - 9.96e-01 1.00e+0
0f 1
11 1.5942630e+04 6.92e-04 3.76e-01 -2.5 7.91e+00 - 8.83e-01 7.25e-0
1f 1
12 1.5868711e+04 2.38e-04 3.49e-01 -2.5 2.55e+00 - 8.85e-01 1.00e+0
0h 1
13 1.5861034e+04 7.54e-04 4.15e-01 -2.5 1.43e+00 - 1.00e+00 2.19e-0
1h 2
14 1.5841173e+04 8.86e-04 1.08e-02 -2.5 9.24e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5822326e+04 1.21e-03 3.32e-02 -3.8 5.44e+00 - 7.94e-01 1.00e+0
0h 1
16 1.5819222e+04 2.44e-03 9.52e-04 -3.8 4.12e-02 - 1.00e+00 1.00e+0
0h 1
17 1.5819548e+04 4.69e-05 1.20e-04 -3.8 1.48e-02 - 1.00e+00 1.00e+0
0h 1
18 1.5818093e+04 1.03e-04 3.65e-04 -5.7 2.97e-01 - 9.51e-01 9.77e-0
1h 1
19 1.5818078e+04 2.27e-05 3.61e-03 -5.7 6.57e-03 - 1.00e+00 7.81e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5818080e+04 8.86e-09 1.24e-06 -5.7 1.44e-03 - 1.00e+00 1.00e+0
0f 1
21 1.5818064e+04 9.09e-09 1.91e-05 -8.6 3.68e-03 - 1.00e+00 9.83e-0
1h 1
22 1.5818064e+04 1.36e-12 6.44e-11 -8.6 6.12e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.5818063692766337e+01 1.5818063692766336e+0
4
Dual infeasibility......: 6.4427192806379436e-11 6.4427192806379436e-0
8
Constraint violation....: 1.3554712907648536e-12 1.3554712907648536e-1
2
Complementarity.........: 2.5424338529370428e-09 2.5424338529370429e-0
6
Overall NLP error.......: 2.5424338529370428e-09 2.5424338529370429e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6661738e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 4.97e-04 9.81e-0
3h 1
2 8.6343914e+02 1.39e+04 5.24e+01 -1.0 1.07e+04 - 1.85e-05 1.29e-0
4h 1
3 8.6126377e+02 1.39e+04 5.24e+01 -1.0 1.38e+04 - 3.44e-05 1.56e-0
4h 1
4 8.5849655e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 1.87e-04 2.01e-0
4h 1
5 5.5645465e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 3.99e-04 2.23e-0
2f 1
6 2.5803298e+04 5.97e-02 8.01e+01 -1.0 1.36e+04 - 5.02e-02 1.00e+0
0h 1
7 1.7265261e+04 5.57e-02 5.35e+01 -1.0 7.34e+01 - 3.21e-01 6.00e-0
2f 1
8 1.5676591e+04 3.02e-02 2.79e+01 -1.0 3.89e+01 - 4.73e-01 4.33e-0
1f 1
9 1.5112975e+04 1.47e-02 2.59e+00 -1.0 1.10e+01 - 9.18e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5454816e+04 4.32e-04 1.64e-01 -1.0 4.11e+00 - 9.65e-01 1.00e+0
0f 1
11 1.4860464e+04 7.14e-04 3.69e-01 -2.5 8.07e+00 - 8.80e-01 7.25e-0
1f 1
12 1.4787003e+04 2.42e-04 3.49e-01 -2.5 2.59e+00 - 8.85e-01 1.00e+0
0h 1
13 1.4779988e+04 7.38e-04 4.26e-01 -2.5 1.42e+00 - 1.00e+00 2.04e-0
1h 2
14 1.4760711e+04 9.65e-04 1.14e-02 -2.5 9.35e-01 - 1.00e+00 1.00e+0
0h 1
15 1.4741462e+04 1.16e-03 2.68e-02 -3.8 6.63e+00 - 7.93e-01 9.59e-0
1h 1
16 1.4738105e+04 2.55e-03 2.96e-02 -3.8 3.13e-01 - 1.84e-01 1.00e+0
0f 1
17 1.4738492e+04 3.77e-05 1.57e-04 -3.8 1.32e-02 - 1.00e+00 1.00e+0
0h 1
18 1.4736930e+04 1.38e-04 8.67e-04 -5.7 3.01e-01 - 9.40e-01 1.00e+0
0h 1
19 1.4736937e+04 3.99e-05 5.37e-03 -5.7 2.08e-03 - 1.00e+00 7.13e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.4736948e+04 1.37e-08 1.48e-06 -5.7 5.96e-04 - 1.00e+00 1.00e+0
0f 1
21 1.4736932e+04 9.37e-09 2.17e-05 -8.6 3.69e-03 - 1.00e+00 9.82e-0
1h 1
22 1.4736931e+04 1.56e-12 7.79e-11 -8.6 6.48e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.4736931406315964e+01 1.4736931406315964e+0
4
Dual infeasibility......: 7.7929921758547533e-11 7.7929921758547533e-0
8
Constraint violation....: 1.5624168625549828e-12 1.5624168625549828e-1
2
Complementarity.........: 2.8243429231299501e-09 2.8243429231299498e-0
6
Overall NLP error.......: 2.8243429231299501e-09 2.8243429231299498e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4547453e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.98e-04 9.80e-0
3h 1
2 8.4252030e+02 1.27e+04 5.24e+01 -1.0 1.14e+04 - 3.11e-05 1.10e-0
4h 1
3 7.3828786e+02 1.26e+04 5.25e+01 -1.0 1.26e+04 - 1.44e-05 6.79e-0
3h 1
4 5.8291354e+02 1.23e+04 5.23e+01 -1.0 1.26e+04 - 7.40e-03 2.02e-0
2h 1
5 2.1644339e+04 6.31e-02 8.13e+01 -1.0 1.23e+04 - 6.10e-02 1.00e+0
0h 1
6 1.5478391e+04 5.79e-02 3.40e+01 -1.0 6.33e+01 - 5.63e-01 7.54e-0
2f 1
7 1.3645356e+04 3.62e-02 1.31e+01 -1.0 3.98e+01 - 6.02e-01 5.11e-0
1f 1
8 1.4328738e+04 4.32e-03 7.49e-01 -1.0 9.09e+00 - 9.62e-01 1.00e+0
0f 1
9 1.3456165e+04 1.83e-03 1.05e-01 -1.7 1.17e+01 - 9.73e-01 9.22e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3313507e+04 1.22e-03 3.77e-01 -2.5 6.15e+00 - 7.74e-01 1.00e+0
0h 1
11 1.3249532e+04 1.72e-02 6.43e-02 -2.5 3.90e+00 - 9.63e-01 9.24e-0
1h 1
12 1.3261121e+04 5.77e-04 1.30e-02 -2.5 4.80e-01 - 1.00e+00 1.00e+0
0h 1
13 1.3236152e+04 2.83e-04 5.44e-02 -3.8 8.03e+00 - 9.92e-01 8.75e-0
1h 1
14 1.3234423e+04 1.22e-06 1.22e-04 -3.8 1.00e+00 - 1.00e+00 1.00e+0
0h 1
15 1.3233083e+04 3.41e-07 2.11e-03 -5.7 4.46e-01 - 1.00e+00 9.78e-0
1h 1
16 1.3233068e+04 3.85e-11 2.13e-08 -5.7 9.86e-03 - 1.00e+00 1.00e+0
0f 1
17 1.3233051e+04 6.30e-11 4.40e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.3233050916221144e+01 1.3233050916221144e+0
4
Dual infeasibility......: 4.3997096802005071e-09 4.3997096802005071e-0
6
Constraint violation....: 6.3005725636777754e-11 6.3005725636777754e-1
1
Complementarity.........: 3.3480055127341934e-09 3.3480055127341934e-0
6
Overall NLP error.......: 4.3997096802005071e-09 4.3997096802005071e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2233895e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.47e-03 9.80e-0
3h 1
2 9.1956391e+02 1.11e+04 5.23e+01 -1.0 1.08e+04 - 7.52e-05 1.01e-0
4h 1
3 9.0275620e+02 1.11e+04 5.23e+01 -1.0 1.11e+04 - 4.35e-06 1.02e-0
3f 1
4 5.3668148e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 1.14e-03 2.30e-0
2h 1
5 2.3289983e+04 6.94e-02 7.66e+01 -1.0 1.09e+04 - 8.00e-02 1.00e+0
0h 1
6 1.5348186e+04 6.28e-02 2.43e+01 -1.0 1.43e+01 - 6.48e-01 8.77e-0
2f 1
7 1.4015302e+04 1.96e-02 1.02e+01 -1.0 1.02e+01 - 6.51e-01 8.85e-0
1f 1
8 1.4121445e+04 1.02e-02 6.29e-01 -1.0 2.90e+00 - 9.94e-01 4.83e-0
1f 2
9 1.3789334e+04 8.71e-03 2.69e-01 -1.7 8.66e+00 - 1.00e+00 8.36e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3758395e+04 2.14e-03 9.07e-01 -1.7 1.24e+01 - 1.00e+00 4.97e-0
1h 2
11 1.3751867e+04 2.02e-04 1.56e-02 -1.7 6.22e+00 - 1.00e+00 1.00e+0
0h 1
12 1.3596031e+04 4.83e-04 2.42e-02 -3.8 1.99e+01 - 8.46e-01 8.30e-0
1f 1
13 1.3577635e+04 1.53e-04 2.07e-01 -3.8 3.35e+00 - 9.89e-01 7.17e-0
1h 1
14 1.3572965e+04 4.03e-07 3.37e-04 -3.8 9.49e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3571776e+04 1.99e-08 4.50e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
16 1.3571763e+04 7.64e-13 4.93e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.3571762632829715e+01 1.3571762632829716e+0
4
Dual infeasibility......: 4.9301490892236346e-10 4.9301490892236346e-0
7
Constraint violation....: 7.6447181918126716e-13 7.6447181918126716e-1
3
Complementarity.........: 2.6163611400434848e-09 2.6163611400434847e-0
6
Overall NLP error.......: 2.6163611400434848e-09 2.6163611400434847e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891076e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0602418e+02 9.19e+03 5.23e+01 -1.0 8.41e+03 - 3.92e-05 1.08e-0
4h 1
3 8.1828321e+02 9.14e+03 5.24e+01 -1.0 9.19e+03 - 1.24e-05 4.81e-0
3h 1
4 5.0911014e+02 8.95e+03 5.22e+01 -1.0 9.14e+03 - 5.53e-03 2.13e-0
2h 1
5 1.9574029e+04 7.15e-02 7.74e+01 -1.0 8.95e+03 - 8.67e-02 1.00e+0
0h 1
6 1.2972291e+04 6.39e-02 3.14e+01 -1.0 2.60e+01 - 5.69e-01 9.74e-0
2f 1
7 1.1456842e+04 1.98e-02 1.02e+01 -1.0 1.50e+01 - 6.92e-01 7.89e-0
1f 1
8 1.1617387e+04 7.35e-03 8.73e-01 -1.0 3.38e+00 - 9.92e-01 5.00e-0
1f 2
9 1.1301964e+04 1.11e-02 7.37e-01 -1.7 9.82e+00 - 3.82e-01 8.28e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1284698e+04 6.86e-04 7.30e-01 -1.7 1.09e+01 - 6.81e-01 1.00e+0
0f 1
11 1.1286199e+04 1.09e-04 1.07e-02 -1.7 1.28e+01 - 9.87e-01 1.00e+0
0h 1
12 1.1112801e+04 6.16e-04 2.63e-02 -2.5 2.66e+01 - 9.68e-01 9.76e-0
1f 1
13 1.1087180e+04 1.53e-04 7.73e-02 -3.8 6.17e+00 - 9.83e-01 8.33e-0
1h 1
14 1.1084766e+04 1.94e-07 1.09e-01 -3.8 1.03e+00 - 9.14e-01 1.00e+0
0h 1
15 1.1084687e+04 4.67e-09 3.04e-05 -3.8 1.55e-04 - 1.00e+00 1.00e+0
0h 1
16 1.1083373e+04 1.92e-08 3.89e-03 -5.7 2.97e-01 - 1.00e+00 9.68e-0
1f 1
17 1.1083337e+04 5.76e-12 2.63e-08 -5.7 9.61e-03 - 1.00e+00 1.00e+0
0f 1
18 1.1083321e+04 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1083320741774417e+01 1.1083320741774416e+0
4
Dual infeasibility......: 4.4780431745241434e-09 4.4780431745241434e-0
6
Constraint violation....: 2.6340110648170878e-12 2.6340110648170878e-1
2
Complementarity.........: 3.6085483429121232e-09 3.6085483429121233e-0
6
Overall NLP error.......: 4.4780431745241434e-09 4.4780431745241434e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2300862e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.80e-0
3h 1
2 9.2018520e+02 6.71e+03 5.23e+01 -1.0 6.43e+03 - 7.59e-05 1.03e-0
4h 1
3 8.8417722e+02 6.69e+03 5.23e+01 -1.0 6.70e+03 - 7.25e-06 1.73e-0
3f 1
4 4.3415243e+02 6.54e+03 5.24e+01 -1.0 6.69e+03 - 2.08e-03 2.26e-0
2h 1
5 1.8486104e+04 7.08e-02 7.69e+01 -1.0 6.54e+03 - 8.04e-02 1.00e+0
0h 1
6 1.0916142e+04 6.40e-02 2.32e+01 -1.0 1.36e+01 - 6.65e-01 8.89e-0
2f 1
7 9.6154376e+03 1.98e-02 9.31e+00 -1.0 9.91e+00 - 6.64e-01 8.81e-0
1f 1
8 9.7199903e+03 1.05e-02 6.35e-01 -1.0 2.75e+00 - 9.95e-01 4.77e-0
1f 2
9 9.3967776e+03 9.36e-03 2.78e-01 -1.7 9.45e+00 - 1.00e+00 8.30e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.3672965e+03 2.18e-03 9.40e-01 -1.7 1.18e+01 - 1.00e+00 4.90e-0
1h 2
11 9.3624199e+03 2.10e-04 1.67e-02 -1.7 6.01e+00 - 1.00e+00 1.00e+0
0h 1
12 9.2069203e+03 4.79e-04 2.44e-02 -3.8 2.00e+01 - 8.46e-01 8.30e-0
1f 1
13 9.1886242e+03 1.49e-04 2.05e-01 -3.8 3.34e+00 - 9.89e-01 7.21e-0
1h 1
14 9.1840024e+03 3.89e-07 3.07e-04 -3.8 9.33e-01 - 1.00e+00 1.00e+0
0h 1
15 9.1828139e+03 1.95e-08 4.40e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
16 9.1828008e+03 7.97e-13 4.82e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 9.1828007717879476e+00 9.1828007717879482e+0
3
Dual infeasibility......: 4.8230733895941703e-10 4.8230733895941703e-0
7
Constraint violation....: 7.9651563122951075e-13 7.9651563122951075e-1
3
Complementarity.........: 2.6134527997876309e-09 2.6134527997876310e-0
6
Overall NLP error.......: 2.6134527997876309e-09 2.6134527997876310e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8772454e+02 4.77e+03 5.24e+01 -1.0 4.82e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8463069e+02 4.77e+03 5.24e+01 -1.0 4.12e+03 - 4.65e-05 1.15e-0
4h 1
3 6.9026570e+02 4.73e+03 5.24e+01 -1.0 4.77e+03 - 2.20e-05 8.53e-0
3f 1
4 4.0829897e+02 4.63e+03 5.20e+01 -1.0 4.73e+03 - 1.12e-02 2.07e-0
2h 1
5 1.3286165e+04 7.24e-02 7.77e+01 -1.0 4.63e+03 - 9.89e-02 1.00e+0
0h 1
6 7.8843059e+03 6.35e-02 2.09e+01 -1.0 4.48e+01 - 7.03e-01 1.14e-0
1f 1
7 6.3730707e+03 2.46e-02 2.05e+00 -1.0 2.21e+01 - 9.31e-01 6.56e-0
1f 1
8 6.5551437e+03 3.66e-03 1.26e+00 -1.0 3.60e+00 - 4.60e-01 1.00e+0
0f 1
9 6.7379662e+03 4.73e-04 1.02e+00 -1.0 6.45e+00 - 5.45e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.7247728e+03 8.52e-05 1.35e-01 -1.0 1.32e+01 - 6.21e-01 1.00e+0
0f 1
11 6.1038717e+03 1.85e-03 7.56e-02 -1.7 3.35e+00 - 1.00e+00 1.00e+0
0f 1
12 5.9470977e+03 1.19e-03 2.42e-01 -2.5 2.07e+01 - 9.57e-01 6.69e-0
1f 1
13 5.9425256e+03 1.67e-06 7.43e-03 -2.5 6.79e+00 - 1.00e+00 1.00e+0
0h 1
14 5.9217801e+03 3.88e-06 5.57e-02 -3.8 5.36e+00 - 9.44e-01 8.87e-0
1f 1
15 5.9184134e+03 5.28e-04 6.09e-04 -3.8 6.04e-01 - 1.00e+00 1.00e+0
0f 1
16 5.9173073e+03 5.34e-05 1.05e-02 -5.7 2.97e-01 - 8.30e-01 1.00e+0
0h 1
17 5.9171985e+03 3.22e-05 3.57e-05 -5.7 9.14e-03 - 1.00e+00 1.00e+0
0h 1
18 5.9172014e+03 5.63e-07 6.00e-06 -5.7 1.13e-03 - 1.00e+00 1.00e+0
0h 1
19 5.9171874e+03 3.93e-08 8.01e-05 -8.6 3.68e-03 - 1.00e+00 9.42e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 5.9171865e+03 7.73e-12 6.96e-11 -8.6 2.12e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 5.9171865435283193e+00 5.9171865435283189e+0
3
Dual infeasibility......: 6.9613344042691513e-11 6.9613344042691513e-0
8
Constraint violation....: 7.7312600765822026e-12 7.7312600765822026e-1
2
Complementarity.........: 3.1948667420220348e-09 3.1948667420220347e-0
6
Overall NLP error.......: 3.1948667420220348e-09 3.1948667420220347e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2294726e+02 3.24e+03 5.23e+01 -1.0 3.27e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1945201e+02 3.24e+03 5.23e+01 -1.0 2.47e+03 - 3.93e-05 1.30e-0
4h 1
3 3.4573144e+02 3.17e+03 5.24e+01 -1.0 3.24e+03 - 4.04e-05 2.36e-0
2f 1
4 1.5906615e+04 6.81e-02 7.93e+01 -1.0 3.17e+03 - 4.21e-02 1.00e+0
0h 1
5 7.5933644e+03 6.41e-02 5.66e+01 -1.0 2.00e+01 - 2.81e-01 5.33e-0
2f 1
6 6.3092956e+03 1.54e-02 2.51e+01 -1.0 1.01e+01 - 5.90e-01 8.06e-0
1f 1
7 6.3346293e+03 6.22e-03 2.30e-01 -1.0 1.94e+00 - 9.91e-01 1.00e+0
0f 1
8 5.9359407e+03 1.57e-03 8.95e-02 -1.7 4.62e+00 - 1.00e+00 9.66e-0
1f 1
9 5.7772838e+03 1.82e-03 5.17e-01 -2.5 1.14e+00 - 1.00e+00 7.50e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.7447658e+03 3.25e-04 1.02e-01 -2.5 2.94e-01 - 1.00e+00 8.96e-0
1h 1
11 5.7477659e+03 1.16e-05 4.01e-03 -2.5 2.85e-02 - 1.00e+00 1.00e+0
0f 1
12 5.7228582e+03 1.05e-05 8.02e-03 -3.8 5.36e+00 - 1.00e+00 9.61e-0
1f 1
13 5.7223579e+03 1.57e-08 1.36e-05 -3.8 2.04e-01 - 1.00e+00 1.00e+0
0f 1
14 5.7210148e+03 1.79e-08 5.06e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0f 1
15 5.7210000e+03 6.40e-13 4.11e-10 -8.6 3.67e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.7210000296275068e+00 5.7210000296275066e+0
3
Dual infeasibility......: 4.1141776493326646e-10 4.1141776493326646e-0
7
Constraint violation....: 6.4015459599886526e-13 6.4015459599886526e-1
3
Complementarity.........: 2.7382067500923175e-09 2.7382067500923173e-0
6
Overall NLP error.......: 2.7382067500923175e-09 2.7382067500923173e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8030290e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.83e-0
3h 1
2 8.7171466e+02 2.00e+03 5.24e+01 -1.0 1.39e+03 - 4.30e-05 3.27e-0
4h 1
3 2.9396249e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 2.57e-04 2.26e-0
2f 1
4 1.4205172e+04 6.11e-02 7.92e+01 -1.0 1.95e+03 - 5.53e-02 1.00e+0
0h 1
5 5.5467686e+03 5.67e-02 5.32e+01 -1.0 6.53e+01 - 3.16e-01 6.42e-0
2f 1
6 4.1882105e+03 3.11e-02 2.63e+01 -1.0 3.24e+01 - 4.95e-01 4.19e-0
1f 1
7 3.3783859e+03 1.31e-02 2.13e+00 -1.0 1.11e+01 - 9.19e-01 9.23e-0
1f 1
8 3.8257438e+03 3.97e-04 9.50e-02 -1.0 4.99e+00 - 9.93e-01 1.00e+0
0f 1
9 3.1588821e+03 1.17e-03 7.51e-01 -1.7 4.83e+01 - 5.89e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.2267160e+03 1.33e-05 6.20e-01 -1.7 3.46e+01 - 7.98e-01 1.00e+0
0h 1
11 3.2217568e+03 4.70e-05 2.52e-03 -1.7 1.33e+01 - 1.00e+00 1.00e+0
0h 1
12 3.1018801e+03 2.63e-05 9.51e-01 -3.8 9.97e+01 - 9.76e-01 6.35e-0
1f 1
13 3.0449941e+03 5.05e-04 1.39e-01 -3.8 3.57e+01 - 6.73e-01 1.00e+0
0f 1
14 3.0408013e+03 2.46e-03 4.96e-03 -3.8 5.55e-02 - 1.00e+00 1.00e+0
0h 1
15 3.0410840e+03 1.19e-05 6.27e-05 -3.8 5.98e-03 - 1.00e+00 1.00e+0
0h 1
16 3.0392749e+03 1.27e-04 1.12e-03 -5.7 7.43e-01 - 9.19e-01 1.00e+0
0h 1
17 3.0392348e+03 3.02e-05 6.40e-06 -5.7 8.10e-03 - 1.00e+00 1.00e+0
0h 1
18 3.0392397e+03 1.87e-07 3.02e-06 -5.7 6.22e-04 - 1.00e+00 1.00e+0
0h 1
19 3.0392192e+03 3.00e-08 2.97e-05 -8.6 9.21e-03 - 1.00e+00 9.59e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 3.0392184e+03 3.90e-12 5.08e-11 -8.6 3.75e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 3.0392183937007569e+00 3.0392183937007567e+0
3
Dual infeasibility......: 5.0767389219242807e-11 5.0767389219242807e-0
8
Constraint violation....: 3.8978820171564621e-12 3.8978820171564621e-1
2
Complementarity.........: 2.9860426962967267e-09 2.9860426962967264e-0
6
Overall NLP error.......: 2.9860426962967267e-09 2.9860426962967264e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6555974e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 4.97e-04 9.86e-0
3h 1
2 8.5244446e+02 9.17e+02 5.24e+01 -1.0 7.30e+02 - 8.21e-05 4.84e-0
4h 1
3 7.8829237e+02 9.15e+02 5.24e+01 -1.0 9.17e+02 - 4.42e-04 2.41e-0
3h 1
4 2.6739293e+02 8.95e+02 5.24e+01 -1.0 9.15e+02 - 3.00e-03 2.14e-0
2f 1
5 1.1543503e+04 6.25e-02 8.04e+01 -1.0 8.95e+02 - 5.69e-02 1.00e+0
0h 1
6 4.1429589e+03 5.79e-02 4.82e+01 -1.0 6.62e+01 - 3.87e-01 6.82e-0
2f 1
7 2.5699855e+03 3.04e-02 2.31e+01 -1.0 3.78e+01 - 5.11e-01 4.42e-0
1f 1
8 2.1270763e+03 1.26e-02 2.08e+00 -1.0 1.05e+01 - 9.22e-01 1.00e+0
0f 1
9 2.3827300e+03 3.93e-04 6.04e-02 -1.0 4.29e+00 - 9.92e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8967329e+03 5.07e-04 6.52e-01 -2.5 7.11e+00 - 8.93e-01 6.38e-0
1f 1
11 1.8182951e+03 2.37e-04 3.83e-01 -2.5 4.08e+00 - 8.89e-01 1.00e+0
0h 1
12 1.7947181e+03 5.98e-03 2.12e-01 -2.5 1.70e+00 - 1.00e+00 6.15e-0
1h 1
13 1.7856695e+03 6.78e-04 5.32e-03 -2.5 4.57e-01 - 1.00e+00 1.00e+0
0f 1
14 1.7614102e+03 1.15e-03 2.94e-02 -3.8 1.11e+01 - 8.09e-01 1.00e+0
0h 1
15 1.7585884e+03 2.27e-03 1.06e-03 -3.8 2.00e-01 - 1.00e+00 1.00e+0
0h 1
16 1.7589675e+03 4.43e-05 1.46e-04 -3.8 1.49e-02 - 1.00e+00 1.00e+0
0h 1
17 1.7572037e+03 1.05e-04 4.23e-04 -5.7 5.96e-01 - 9.51e-01 9.82e-0
1h 1
18 1.7571910e+03 2.18e-05 3.57e-03 -5.7 1.03e-02 - 1.00e+00 7.93e-0
1h 1
19 1.7571934e+03 8.55e-09 1.12e-06 -5.7 2.12e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7571732e+03 8.98e-09 1.93e-05 -8.6 7.37e-03 - 1.00e+00 9.83e-0
1h 1
21 1.7571729e+03 1.38e-12 6.48e-11 -8.6 1.22e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.7571729184919551e+00 1.7571729184919550e+0
3
Dual infeasibility......: 6.4770481888518730e-11 6.4770481888518730e-0
8
Constraint violation....: 1.3760104167204190e-12 1.3760104167204190e-1
2
Complementarity.........: 2.5092049280481112e-09 2.5092049280481112e-0
6
Overall NLP error.......: 2.5092049280481112e-09 2.5092049280481112e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318724481455e-09 2.1031318724481455e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896894379e-09 2.8882108896894380e-0
6
Overall NLP error.......: 2.8882108896894379e-09 2.8882108896894380e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318724481455e-09 2.1031318724481455e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896894379e-09 2.8882108896894380e-0
6
Overall NLP error.......: 2.8882108896894379e-09 2.8882108896894380e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101521e-01 6.4890146112101525e+0
2
Dual infeasibility......: 4.9126605618489413e-09 4.9126605618489413e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984918224e-09 4.3646094984918221e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605618489413e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.04e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.57e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235660171e+00 1.6104063235660171e+0
3
Dual infeasibility......: 2.4574009793760635e-12 2.4574009793760635e-0
9
Constraint violation....: 7.5703172614159067e-16 7.5703172614159067e-1
6
Complementarity.........: 2.5062163919681798e-09 2.5062163919681799e-0
6
Overall NLP error.......: 2.5062163919681798e-09 2.5062163919681799e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2303872e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 3.31e-04 9.86e-0
3h 1
2 8.0919006e+02 9.17e+02 5.24e+01 -1.0 7.37e+02 - 8.12e-05 5.04e-0
4h 1
3 2.4239398e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 4.72e-04 2.11e-0
2f 1
4 1.2489447e+04 5.50e-02 8.23e+01 -1.0 8.98e+02 - 3.83e-02 1.00e+0
0h 1
5 3.8941148e+03 5.25e-02 5.67e+01 -1.0 8.14e+01 - 3.09e-01 4.98e-0
2f 1
6 1.9112633e+03 3.73e-02 3.04e+01 -1.0 3.92e+01 - 4.68e-01 5.06e-0
1f 1
7 4.6876227e+03 1.23e-02 2.71e+01 -1.0 2.07e+01 - 3.99e-01 1.00e+0
0h 1
8 1.8763004e+03 1.20e-02 1.04e+00 -1.0 2.56e+01 - 9.88e-01 8.91e-0
1f 1
9 1.9981274e+03 1.95e-04 4.76e-02 -1.0 2.98e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7321093e+03 2.19e-04 1.23e+00 -2.5 1.80e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5439398e+03 3.77e-03 1.33e-01 -2.5 7.59e+00 - 7.95e-01 1.00e+0
0f 1
12 1.5209204e+03 5.17e-03 3.09e-01 -2.5 1.82e+00 - 1.00e+00 7.67e-0
1h 1
13 1.5332321e+03 2.41e-04 4.72e-03 -2.5 7.16e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5031438e+03 1.70e-04 2.15e-02 -3.8 1.35e+01 - 9.90e-01 9.29e-0
1h 1
15 1.5019709e+03 7.24e-07 6.84e-05 -3.8 9.19e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003148e+03 3.77e-07 1.78e-04 -5.7 7.43e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.79e-11 2.92e-09 -5.7 4.20e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932772897797e+00 1.5002932772897796e+0
3
Dual infeasibility......: 2.1737239513389447e-09 2.1737239513389447e-0
6
Constraint violation....: 6.2995844651858590e-11 6.2995844651858590e-1
1
Complementarity.........: 2.8882174443501544e-09 2.8882174443501544e-0
6
Overall NLP error.......: 2.8882174443501544e-09 2.8882174443501544e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
1 8.6555952e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 4.97e-04 9.86e-0
3h 1
2 8.5049278e+02 9.17e+02 5.24e+01 -1.0 7.54e+02 - 7.94e-05 5.56e-0
4h 1
3 2.6243053e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 5.25e-04 2.21e-0
2h 1
4 1.2843590e+04 5.96e-02 8.01e+01 -1.0 8.97e+02 - 5.01e-02 1.00e+0
0h 1
5 4.2877637e+03 5.57e-02 5.36e+01 -1.0 7.35e+01 - 3.21e-01 5.99e-0
2f 1
32 1.575637e+04 1.632511e+04 3.419834e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6792846e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.81e-0
3h 1
2 7.6482959e+02 1.57e+04 5.25e+01 -1.0 1.29e+04 - 2.09e-05 1.21e-0
4h 1
3 7.5475823e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 2.56e-05 7.99e-0
4h 1
4 5.2406498e+02 1.54e+04 5.27e+01 -1.0 1.57e+04 - 8.17e-04 1.97e-0
2h 1
5 2.6710522e+04 6.09e-02 8.54e+01 -1.0 1.54e+04 - 2.23e-02 1.00e+0
0h 1
6 1.8302334e+04 5.89e-02 7.21e+01 -1.0 8.36e+01 - 1.63e-01 3.64e-0
2f 1
7 1.6713591e+04 4.61e-02 3.60e+01 -1.0 2.77e+01 - 4.98e-01 4.46e-0
1f 1
8 1.7307274e+04 2.63e-02 1.68e+01 -1.0 1.62e+01 - 4.59e-01 2.50e-0
1f 3
9 1.6760223e+04 6.20e-03 2.11e-01 -1.0 6.19e+00 - 9.90e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6493379e+04 8.89e-04 1.11e+00 -1.7 5.67e+00 - 4.16e-01 9.23e-0
1f 1
11 1.6489185e+04 2.03e-04 4.11e-01 -1.7 8.76e+00 - 7.28e-01 1.00e+0
0f 1
12 1.6493639e+04 1.31e-04 1.60e-01 -1.7 2.27e+01 - 4.89e-01 1.00e+0
0f 1
13 1.6386026e+04 8.58e-04 6.69e-02 -2.5 1.26e+01 - 9.13e-01 1.00e+0
0f 1
14 1.6351048e+04 1.48e-03 1.60e-02 -2.5 1.20e+01 - 1.00e+00 1.00e+0
0h 1
15 1.6329412e+04 2.62e-04 1.06e-01 -3.8 1.22e+01 - 1.00e+00 8.34e-0
1h 1
16 1.6326632e+04 5.47e-07 1.27e-04 -3.8 1.76e+00 - 1.00e+00 1.00e+0
0h 1
17 1.6325122e+04 4.02e-07 1.10e-04 -5.7 5.92e-01 - 1.00e+00 9.98e-0
1h 1
18 1.6325123e+04 3.83e-11 3.01e-09 -5.7 1.02e-02 - 1.00e+00 1.00e+0
0f 1
19 1.6325106e+04 5.74e-11 2.58e-05 -8.6 7.33e-03 - 1.00e+00 9.58e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325105e+04 1.11e-13 3.63e-12 -8.6 4.88e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.6325105203859515e+01 1.6325105203859515e+0
4
Dual infeasibility......: 3.6322804732748407e-12 3.6322804732748407e-0
9
Constraint violation....: 1.1053657988924215e-13 1.1053657988924215e-1
3
Complementarity.........: 9.0686423449488606e-09 9.0686423449488600e-0
6
Overall NLP error.......: 9.0686423449488606e-09 9.0686423449488600e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6810371e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.29e-04 9.80e-0
3f 1
2 7.6526505e+02 1.50e+04 5.25e+01 -1.0 1.48e+04 - 9.59e-05 1.00e-0
4h 1
3 7.5759664e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 2.82e-06 5.75e-0
4f 1
4 5.0604298e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 6.13e-04 1.98e-0
2h 1
5 2.6023895e+04 6.08e-02 8.48e+01 -1.0 1.47e+04 - 2.95e-02 1.00e+0
0h 1
6 1.7508496e+04 5.84e-02 6.75e+01 -1.0 7.96e+01 - 2.09e-01 4.27e-0
2f 1
7 1.5926080e+04 4.49e-02 3.35e+01 -1.0 2.87e+01 - 5.00e-01 4.36e-0
1f 1
8 1.6222339e+04 3.06e-02 1.35e+01 -1.0 1.62e+01 - 4.67e-01 1.25e-0
1f 4
9 1.6014623e+04 5.30e-03 1.49e-01 -1.0 3.74e+00 - 9.92e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5731798e+04 1.04e-03 2.43e-01 -1.7 4.80e+00 - 1.00e+00 8.81e-0
1f 1
11 1.5707740e+04 7.55e-04 9.99e-03 -1.7 1.55e+01 - 1.00e+00 1.00e+0
0f 1
12 1.5584174e+04 1.30e-03 8.63e-02 -3.8 1.99e+01 - 8.03e-01 9.33e-0
1f 1
13 1.5559945e+04 1.43e-03 6.28e-02 -3.8 1.69e+00 - 8.52e-01 7.76e-0
1h 1
14 1.5560171e+04 2.56e-06 7.17e-04 -3.8 2.95e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5559221e+04 3.24e-07 5.84e-04 -5.7 1.49e-01 - 1.00e+00 9.89e-0
1h 1
16 1.5559215e+04 3.99e-11 6.02e-09 -5.7 1.29e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5559202e+04 6.30e-11 2.07e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5559202135392932e+01 1.5559202135392930e+0
4
Dual infeasibility......: 2.0693781735062669e-09 2.0693781735062669e-0
6
Constraint violation....: 6.2994984229014506e-11 6.2994984229014506e-1
1
Complementarity.........: 2.8881113429969139e-09 2.8881113429969139e-0
6
Overall NLP error.......: 2.8881113429969139e-09 2.8881113429969139e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.7388415e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 5.44e-04 9.80e-0
3h 1
2 8.7111148e+02 1.39e+04 5.24e+01 -1.0 1.37e+04 - 9.01e-05 1.01e-0
4h 1
3 8.6195945e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 3.14e-06 6.63e-0
4f 1
4 5.6345075e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 7.13e-04 2.22e-0
2h 1
5 2.5796453e+04 6.07e-02 7.97e+01 -1.0 1.36e+04 - 5.32e-02 1.00e+0
0h 1
6 1.7340755e+04 5.65e-02 5.31e+01 -1.0 6.89e+01 - 3.23e-01 6.27e-0
2f 1
7 1.5887744e+04 3.11e-02 2.68e+01 -1.0 3.58e+01 - 4.86e-01 4.20e-0
1f 1
8 1.5508931e+04 1.49e-02 2.64e+00 -1.0 1.11e+01 - 9.19e-01 5.00e-0
1f 2
9 1.5361313e+04 7.63e-03 1.65e+00 -1.0 6.63e+00 - 1.00e+00 4.78e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5480492e+04 5.06e-04 5.97e-02 -1.0 9.95e+01 - 1.00e+00 1.00e+0
0f 1
11 1.4965235e+04 6.58e-04 6.66e-01 -2.5 9.82e+01 - 9.02e-01 6.53e-0
1f 1
12 1.4879080e+04 6.00e-05 1.25e-01 -2.5 3.36e+01 - 9.71e-01 1.00e+0
0h 1
13 1.4857859e+04 1.69e-03 7.51e-03 -2.5 9.17e-01 - 1.00e+00 1.00e+0
0h 1
14 1.4844348e+04 4.12e-04 3.50e-02 -3.8 2.68e+00 - 8.51e-01 1.00e+0
0h 1
15 1.4841777e+04 1.57e-03 9.27e-04 -3.8 3.54e-02 - 1.00e+00 1.00e+0
0h 1
16 1.4841951e+04 4.99e-05 4.93e-05 -3.8 1.13e-02 - 1.00e+00 1.00e+0
0h 1
17 1.4840688e+04 1.23e-04 5.59e-04 -5.7 1.49e-01 - 9.38e-01 1.00e+0
0h 1
18 1.4840657e+04 1.49e-05 2.47e-05 -5.7 5.54e-03 - 1.00e+00 1.00e+0
0h 1
19 1.4840660e+04 1.32e-09 7.91e-07 -5.7 8.12e-05 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.4840647e+04 1.64e-08 3.25e-04 -8.6 1.84e-03 - 1.00e+00 8.97e-0
1h 1
21 1.4840645e+04 3.35e-11 4.75e-09 -8.6 1.89e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.4840645446541169e+01 1.4840645446541168e+0
4
Dual infeasibility......: 4.7547095113935380e-09 4.7547095113935381e-0
6
Constraint violation....: 3.3486213801836584e-11 3.3486213801836584e-1
1
Complementarity.........: 2.8279463109357632e-09 2.8279463109357632e-0
6
Overall NLP error.......: 4.7547095113935380e-09 4.7547095113935381e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4546668e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.98e-04 9.81e-0
3h 1
2 8.4238405e+02 1.26e+04 5.24e+01 -1.0 1.06e+04 - 2.39e-05 1.19e-0
4h 1
3 8.1140867e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 2.34e-05 2.02e-0
3h 1
4 5.2402605e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 2.03e-03 2.10e-0
2h 1
5 2.3678582e+04 5.86e-02 8.23e+01 -1.0 1.24e+04 - 3.62e-02 1.00e+0
0h 1
6 1.5802883e+04 5.55e-02 5.50e+01 -1.0 7.26e+01 - 3.29e-01 4.87e-0
2f 1
7 1.3694896e+04 3.62e-02 2.97e+01 -1.0 3.90e+01 - 4.71e-01 5.63e-0
1f 1
8 1.4033031e+04 2.04e-02 1.54e+01 -1.0 1.86e+01 - 3.60e-01 1.25e-0
1f 4
9 1.3872430e+04 5.40e-03 1.00e+00 -1.0 6.58e+00 - 9.47e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3788359e+04 4.72e-04 9.90e-02 -1.0 5.48e+00 - 9.49e-01 1.00e+0
0f 1
11 1.3475062e+04 3.61e-04 1.14e+00 -2.5 6.33e+00 - 9.26e-01 5.92e-0
1f 1
12 1.3305596e+04 2.03e-03 3.23e-01 -2.5 6.90e+00 - 7.33e-01 1.00e+0
0f 1
13 1.3252737e+04 8.28e-03 1.40e-01 -2.5 3.51e+00 - 1.00e+00 8.42e-0
1h 1
14 1.3262311e+04 3.47e-04 1.19e-02 -2.5 4.49e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3235762e+04 3.04e-04 5.26e-02 -3.8 9.43e+00 - 9.88e-01 8.75e-0
1h 1
16 1.3234410e+04 1.47e-06 1.38e-04 -3.8 6.43e-01 - 1.00e+00 1.00e+0
0h 1
17 1.3233080e+04 3.36e-07 2.13e-03 -5.7 4.36e-01 - 1.00e+00 9.78e-0
1h 1
18 1.3233068e+04 3.82e-11 2.13e-08 -5.7 6.62e-03 - 1.00e+00 1.00e+0
0f 1
19 1.3233051e+04 6.30e-11 4.40e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.3233050915757088e+01 1.3233050915757089e+0
4
Dual infeasibility......: 4.3996580947704301e-09 4.3996580947704301e-0
6
Constraint violation....: 6.3006225237138835e-11 6.3006225237138835e-1
1
Complementarity.........: 3.3119362131933724e-09 3.3119362131933725e-0
6
Overall NLP error.......: 4.3996580947704301e-09 4.3996580947704301e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9413836e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 7.39e-04 9.80e-0
3h 1
2 8.9137510e+02 1.11e+04 5.24e+01 -1.0 1.09e+04 - 8.71e-05 1.01e-0
4h 1
3 8.7721637e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 4.00e-06 8.65e-0
4f 1
4 5.1672378e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 9.52e-04 2.26e-0
2h 1
5 2.3115421e+04 6.38e-02 7.80e+01 -1.0 1.09e+04 - 6.89e-02 1.00e+0
0h 1
6 1.4803726e+04 5.84e-02 4.86e+01 -1.0 5.03e+01 - 3.60e-01 7.69e-0
2f 1
7 1.3499975e+04 2.71e-02 2.13e+01 -1.0 2.33e+01 - 5.53e-01 4.93e-0
1f 1
8 1.2993036e+04 7.16e-03 1.23e+00 -1.0 8.84e+00 - 9.35e-01 7.39e-0
1f 1
9 1.3247124e+04 3.29e-04 8.00e-02 -1.0 2.86e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2656630e+04 2.08e-03 9.00e-02 -2.5 4.37e+00 - 8.63e-01 8.30e-0
1f 1
11 1.2477797e+04 2.17e-03 3.44e-01 -2.5 1.07e+00 - 1.00e+00 7.80e-0
1f 1
12 1.2449217e+04 1.67e-04 5.05e-03 -2.5 2.12e-01 - 1.00e+00 1.00e+0
0h 1
13 1.2430005e+04 3.02e-05 6.24e-02 -3.8 2.68e+00 - 1.00e+00 8.45e-0
1h 1
14 1.2427858e+04 7.68e-08 5.95e-04 -3.8 4.15e-01 - 1.00e+00 1.00e+0
0f 1
15 1.2426573e+04 3.93e-08 1.68e-04 -5.7 1.49e-01 - 1.00e+00 9.95e-0
1f 1
16 1.2426572e+04 1.88e-12 1.42e-08 -5.7 7.17e-04 - 1.00e+00 1.00e+0
0f 1
17 1.2426557e+04 2.56e-12 6.75e-07 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
18 1.2426557e+04 7.11e-15 2.51e-14 -8.6 2.82e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.2426557355127487e+01 1.2426557355127487e+0
4
Dual infeasibility......: 2.5091040356528538e-14 2.5091040356528538e-1
1
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5059089042049157e-09 2.5059089042049156e-0
6
Overall NLP error.......: 2.5059089042049157e-09 2.5059089042049156e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8776327e+02 9.19e+03 5.24e+01 -1.0 9.28e+03 - 6.64e-04 9.80e-0
3h 1
2 8.8487848e+02 9.19e+03 5.24e+01 -1.0 8.49e+03 - 4.35e-05 1.07e-0
4h 1
3 8.1017701e+02 9.15e+03 5.24e+01 -1.0 9.19e+03 - 1.14e-05 4.07e-0
3h 1
4 4.8829987e+02 8.96e+03 5.23e+01 -1.0 9.15e+03 - 4.62e-03 2.12e-0
2h 1
5 1.9624072e+04 6.67e-02 7.88e+01 -1.0 8.96e+03 - 7.36e-02 1.00e+0
0h 1
6 1.2613352e+04 6.06e-02 4.34e+01 -1.0 5.13e+01 - 4.30e-01 8.42e-0
2f 1
7 1.1287964e+04 2.91e-02 1.67e+01 -1.0 2.55e+01 - 6.00e-01 4.84e-0
1f 1
8 1.0844638e+04 5.12e-03 9.75e-01 -1.0 9.16e+00 - 9.34e-01 7.59e-0
1f 1
9 1.1096445e+04 1.87e-04 6.07e-02 -1.0 4.66e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.0465431e+04 2.23e-03 8.01e-02 -2.5 4.76e+00 - 8.70e-01 8.69e-0
1f 1
11 1.0359674e+04 1.08e-03 4.55e-01 -2.5 7.61e-01 - 1.00e+00 6.04e-0
1f 1
12 1.0359707e+04 2.49e-06 8.14e-03 -2.5 1.53e-01 - 1.00e+00 1.00e+0
0h 1
13 1.0339422e+04 6.17e-06 2.39e-02 -3.8 5.36e+00 - 9.14e-01 8.89e-0
1f 1
14 1.0335906e+04 4.60e-04 4.72e-04 -3.8 5.91e-01 - 1.00e+00 1.00e+0
0f 1
15 1.0334764e+04 6.26e-05 1.12e-02 -5.7 2.97e-01 - 8.14e-01 1.00e+0
0h 1
16 1.0334651e+04 3.51e-05 3.92e-05 -5.7 9.55e-03 - 1.00e+00 1.00e+0
0h 1
17 1.0334652e+04 1.18e-06 1.11e-05 -5.7 1.44e-03 - 1.00e+00 9.97e-0
1h 1
18 1.0334638e+04 2.43e-09 9.98e-08 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
19 1.0334638e+04 3.43e-15 3.66e-14 -8.6 3.48e-07 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.0334637952206666e+01 1.0334637952206665e+0
4
Dual infeasibility......: 3.6597675511723024e-14 3.6597675511723024e-1
1
Constraint violation....: 3.4268284362729549e-15 3.4268284362729549e-1
5
Complementarity.........: 2.5516363426531677e-09 2.5516363426531676e-0
6
Overall NLP error.......: 2.5516363426531677e-09 2.5516363426531676e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2300862e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.80e-0
3h 1
2 9.2018520e+02 6.71e+03 5.23e+01 -1.0 6.43e+03 - 7.59e-05 1.03e-0
4h 1
3 8.8417722e+02 6.69e+03 5.23e+01 -1.0 6.70e+03 - 7.25e-06 1.73e-0
3f 1
4 4.3415243e+02 6.54e+03 5.24e+01 -1.0 6.69e+03 - 2.08e-03 2.26e-0
2h 1
5 1.8486104e+04 7.08e-02 7.69e+01 -1.0 6.54e+03 - 8.04e-02 1.00e+0
0h 1
6 1.0916142e+04 6.40e-02 2.32e+01 -1.0 1.36e+01 - 6.65e-01 8.89e-0
2f 1
7 9.6154376e+03 1.98e-02 9.31e+00 -1.0 9.91e+00 - 6.64e-01 8.81e-0
1f 1
8 9.7199903e+03 1.05e-02 6.35e-01 -1.0 2.75e+00 - 9.95e-01 4.77e-0
1f 2
9 9.3967776e+03 9.36e-03 2.78e-01 -1.7 9.45e+00 - 1.00e+00 8.30e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.3672965e+03 2.18e-03 9.40e-01 -1.7 1.18e+01 - 1.00e+00 4.90e-0
1h 2
11 9.3624199e+03 2.10e-04 1.67e-02 -1.7 6.01e+00 - 1.00e+00 1.00e+0
0h 1
12 9.2069203e+03 4.79e-04 2.44e-02 -3.8 2.00e+01 - 8.46e-01 8.30e-0
1f 1
13 9.1886242e+03 1.49e-04 2.05e-01 -3.8 3.34e+00 - 9.89e-01 7.21e-0
1h 1
14 9.1840024e+03 3.89e-07 3.07e-04 -3.8 9.33e-01 - 1.00e+00 1.00e+0
0h 1
15 9.1828139e+03 1.95e-08 4.40e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
16 9.1828008e+03 7.97e-13 4.82e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 9.1828007685529940e+00 9.1828007685529938e+0
3
Dual infeasibility......: 4.8230708899533561e-10 4.8230708899533561e-0
7
Constraint violation....: 7.9664053131978108e-13 7.9664053131978108e-1
3
Complementarity.........: 2.6134528002245956e-09 2.6134528002245954e-0
6
Overall NLP error.......: 2.6134528002245956e-09 2.6134528002245954e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0885267e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0522538e+02 4.77e+03 5.23e+01 -1.0 3.40e+03 - 2.93e-05 1.39e-0
4h 1
3 3.7446895e+02 4.66e+03 5.24e+01 -1.0 4.77e+03 - 4.82e-05 2.34e-0
2f 1
4 1.7343624e+04 6.51e-02 8.03e+01 -1.0 4.66e+03 - 3.33e-02 1.00e+0
0h 1
5 8.8835455e+03 6.19e-02 6.15e+01 -1.0 3.76e+01 - 2.33e-01 4.52e-0
2f 1
6 7.5996542e+03 2.03e-02 2.88e+01 -1.0 1.63e+01 - 5.42e-01 6.20e-0
1f 1
7 7.1823993e+03 5.79e-03 8.85e-01 -1.0 5.30e+00 - 9.57e-01 7.82e-0
1f 1
8 7.4476292e+03 1.69e-04 6.59e-02 -1.0 5.07e+00 - 1.00e+00 1.00e+0
0f 1
9 6.8807542e+03 2.12e-03 8.08e-02 -2.5 3.15e+00 - 8.55e-01 8.48e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.7194703e+03 2.16e-03 4.17e-01 -2.5 9.54e-01 - 1.00e+00 7.62e-0
1f 1
11 6.6937548e+03 1.24e-04 4.69e-03 -2.5 2.10e-01 - 1.00e+00 1.00e+0
0h 1
12 6.6728221e+03 3.31e-05 1.45e-01 -3.8 8.04e+00 - 1.00e+00 7.62e-0
1h 1
13 6.6674261e+03 1.25e-07 3.38e-04 -3.8 1.91e+00 - 1.00e+00 1.00e+0
0f 1
14 6.6659052e+03 2.85e-08 9.91e-04 -5.7 4.46e-01 - 1.00e+00 9.85e-0
1h 1
15 6.6658878e+03 1.92e-12 1.39e-08 -5.7 6.69e-03 - 1.00e+00 1.00e+0
0f 1
16 6.6658693e+03 2.63e-12 4.48e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.6658693354677263e+00 6.6658693354677262e+0
3
Dual infeasibility......: 4.4776951053169011e-09 4.4776951053169011e-0
6
Constraint violation....: 2.6311661183164858e-12 2.6311661183164858e-1
2
Complementarity.........: 3.6084978101473437e-09 3.6084978101473437e-0
6
Overall NLP error.......: 4.4776951053169011e-09 4.4776951053169011e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6647742e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 4.97e-04 9.81e-0
3h 1
2 8.6258607e+02 3.24e+03 5.24e+01 -1.0 2.21e+03 - 3.91e-05 1.45e-0
4h 1
3 3.1400433e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 5.82e-05 2.24e-0
2f 1
4 1.5420372e+04 5.91e-02 8.12e+01 -1.0 3.17e+03 - 3.49e-02 1.00e+0
0h 1
5 6.7290069e+03 5.61e-02 6.00e+01 -1.0 7.11e+01 - 2.59e-01 4.63e-0
2f 1
6 4.9141782e+03 2.50e-02 3.24e+01 -1.0 3.47e+01 - 4.68e-01 5.32e-0
1f 1
7 4.4464852e+03 1.14e-02 2.56e+00 -1.0 9.40e+00 - 9.28e-01 1.00e+0
0f 1
8 4.7445322e+03 5.19e-04 7.22e-02 -1.0 2.72e+00 - 9.99e-01 1.00e+0
0f 1
9 4.1967949e+03 5.77e-04 4.24e-01 -2.5 7.14e+00 - 8.93e-01 7.24e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.1292527e+03 1.97e-04 2.34e-01 -2.5 2.25e+00 - 9.13e-01 1.00e+0
0h 1
11 4.1116441e+03 2.84e-04 9.33e-02 -2.5 9.70e-01 - 1.00e+00 7.64e-0
1H 1
12 4.1091626e+03 3.40e-04 1.77e-03 -2.5 1.24e-01 - 1.00e+00 1.00e+0
0f 1
13 4.0879671e+03 1.22e-03 3.19e-02 -3.8 8.05e+00 - 7.96e-01 1.00e+0
0h 1
14 4.0846007e+03 2.79e-03 1.11e-03 -3.8 4.90e-02 - 1.00e+00 1.00e+0
0h 1
15 4.0849547e+03 3.93e-05 1.31e-04 -3.8 1.35e-02 - 1.00e+00 1.00e+0
0h 1
16 4.0833586e+03 1.01e-04 3.52e-04 -5.7 4.46e-01 - 9.51e-01 9.77e-0
1h 1
17 4.0833414e+03 2.19e-05 3.67e-03 -5.7 1.03e-02 - 1.00e+00 7.83e-0
1h 1
18 4.0833430e+03 8.57e-09 1.21e-06 -5.7 2.23e-03 - 1.00e+00 1.00e+0
0f 1
19 4.0833247e+03 9.02e-09 1.92e-05 -8.6 5.53e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 4.0833244e+03 1.37e-12 6.48e-11 -8.6 9.17e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 4.0833243917501507e+00 4.0833243917501504e+0
3
Dual infeasibility......: 6.4813000768339152e-11 6.4813000768339152e-0
8
Constraint violation....: 1.3687939670603555e-12 1.3687939670603555e-1
2
Complementarity.........: 2.8313605709005030e-09 2.8313605709005028e-0
6
Overall NLP error.......: 2.8313605709005030e-09 2.8313605709005028e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1576532e+02 2.00e+03 5.23e+01 -1.0 2.01e+03 - 1.20e-03 9.82e-0
3h 1
2 9.1032142e+02 2.00e+03 5.23e+01 -1.0 1.04e+03 - 3.89e-05 2.06e-0
4h 1
3 3.1311212e+02 1.95e+03 5.24e+01 -1.0 2.00e+03 - 1.27e-04 2.35e-0
2f 1
4 1.4582884e+04 6.66e-02 7.62e+01 -1.0 1.95e+03 - 8.09e-02 1.00e+0
0h 1
5 6.1165383e+03 6.02e-02 3.22e+01 -1.0 2.09e+01 - 5.47e-01 8.74e-0
2f 1
6 4.5880149e+03 1.60e-02 1.42e+01 -1.0 1.27e+01 - 6.20e-01 8.67e-0
1f 1
7 4.8954300e+03 1.60e-03 1.25e-01 -1.0 3.70e+00 - 9.91e-01 1.00e+0
0f 1
8 4.4215677e+03 1.88e-03 1.47e-01 -1.7 9.25e+00 - 1.00e+00 1.00e+0
0f 1
9 4.2329321e+03 2.04e-03 3.71e-01 -2.5 1.48e+00 - 1.00e+00 7.85e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2060799e+03 1.91e-04 1.99e-02 -2.5 3.08e-01 - 1.00e+00 9.80e-0
1h 1
11 4.1818692e+03 1.86e-06 1.85e-02 -3.8 8.06e+00 - 9.84e-01 1.00e+0
0h 1
12 4.1819975e+03 1.74e-09 4.82e-06 -3.8 9.86e-03 - 1.00e+00 1.00e+0
0h 1
13 4.1805106e+03 1.80e-08 1.81e-04 -5.7 4.46e-01 - 1.00e+00 9.96e-0
1f 1
14 4.1805076e+03 1.80e-12 2.29e-09 -5.7 1.79e-03 - 1.00e+00 1.00e+0
0f 1
15 4.1804892e+03 2.63e-12 1.52e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 4.1804891548667369e+00 4.1804891548667365e+0
3
Dual infeasibility......: 1.5189631136415136e-09 1.5189631136415136e-0
6
Constraint violation....: 2.6291469001904488e-12 2.6291469001904488e-1
2
Complementarity.........: 3.1952101756799911e-09 3.1952101756799909e-0
6
Overall NLP error.......: 3.1952101756799911e-09 3.1952101756799909e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2303872e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 3.31e-04 9.86e-0
3h 1
2 8.0919006e+02 9.17e+02 5.24e+01 -1.0 7.37e+02 - 8.12e-05 5.04e-0
4h 1
3 2.4239398e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 4.72e-04 2.11e-0
2f 1
4 1.2489447e+04 5.50e-02 8.23e+01 -1.0 8.98e+02 - 3.83e-02 1.00e+0
0h 1
5 3.8941148e+03 5.25e-02 5.67e+01 -1.0 8.14e+01 - 3.09e-01 4.98e-0
2f 1
6 1.9112633e+03 3.73e-02 3.04e+01 -1.0 3.92e+01 - 4.68e-01 5.06e-0
1f 1
7 4.6876227e+03 1.23e-02 2.71e+01 -1.0 2.07e+01 - 3.99e-01 1.00e+0
0h 1
8 1.8763004e+03 1.20e-02 1.04e+00 -1.0 2.56e+01 - 9.88e-01 8.91e-0
1f 1
9 1.9981274e+03 1.95e-04 4.76e-02 -1.0 2.98e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7321093e+03 2.19e-04 1.23e+00 -2.5 1.80e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5439398e+03 3.77e-03 1.33e-01 -2.5 7.59e+00 - 7.95e-01 1.00e+0
0f 1
12 1.5209204e+03 5.17e-03 3.09e-01 -2.5 1.82e+00 - 1.00e+00 7.67e-0
1h 1
13 1.5332321e+03 2.41e-04 4.72e-03 -2.5 7.16e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5031438e+03 1.70e-04 2.15e-02 -3.8 1.35e+01 - 9.90e-01 9.29e-0
1h 1
15 1.5019709e+03 7.24e-07 6.84e-05 -3.8 9.19e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003148e+03 3.77e-07 1.78e-04 -5.7 7.43e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.79e-11 2.92e-09 -5.7 4.20e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932772897799e+00 1.5002932772897798e+0
3
Dual infeasibility......: 2.1737237292672347e-09 2.1737237292672347e-0
6
Constraint violation....: 6.2995497707163395e-11 6.2995497707163395e-1
1
Complementarity.........: 2.8882174443513331e-09 2.8882174443513331e-0
6
Overall NLP error.......: 2.8882174443513331e-09 2.8882174443513331e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.77e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5003661e+02 7.50e+01 9.04e+01 -1.0 2.59e+01 - 3.83e-04 3.52e-0
2f 1
2 1.1818872e+04 5.63e-02 8.12e+01 -1.0 2.87e+01 - 4.64e-02 1.00e+0
0h 1
3 3.1585743e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.65e-0
2f 1
4 1.0154810e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8148897e+03 7.28e-03 1.55e+01 -1.0 1.93e+01 - 6.11e-01 1.00e+0
0h 1
6 1.1196673e+03 5.40e-03 4.04e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8244210e+02 9.99e-04 2.10e-01 -1.7 5.71e+00 - 1.00e+00 8.87e-0
1h 1
8 7.2817516e+02 8.46e-04 1.35e-02 -1.7 3.45e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0982259e+02 1.50e-03 1.13e-01 -3.8 4.49e+00 - 7.71e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8216110e+02 2.17e-03 7.23e-02 -3.8 2.11e+00 - 8.07e-01 7.40e-0
1h 1
11 5.8336684e+02 9.52e-05 4.78e-02 -3.8 3.17e-02 - 1.00e+00 9.56e-0
1h 1
12 5.8368716e+02 2.82e-07 1.33e-05 -3.8 3.28e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278928e+02 4.12e-07 5.39e-04 -5.7 3.47e-02 - 1.00e+00 9.91e-0
1h 1
14 5.8278859e+02 4.36e-11 3.52e-09 -5.7 2.10e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.65e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753111572761e-01 5.8277753111572758e+0
2
Dual infeasibility......: 2.6503250686288344e-09 2.6503250686288344e-0
6
Constraint violation....: 6.3002297823189224e-11 6.3002297823189224e-1
1
Complementarity.........: 2.8882681473376355e-09 2.8882681473376355e-0
6
Overall NLP error.......: 2.8882681473376355e-09 2.8882681473376355e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1584841e+02 1.09e+02 1.13e+02 -1.0 3.76e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1398692e+04 5.38e-02 8.36e+01 -1.0 4.53e+01 - 3.10e-02 1.00e+0
0h 1
3 2.7848916e+03 5.17e-02 6.48e+01 -1.0 8.43e+01 - 2.27e-01 4.32e-0
2f 1
4 9.8155785e+02 4.24e-02 3.38e+01 -1.0 3.41e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5909723e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.21e-01 1.00e+0
0h 1
6 9.4491032e+02 1.01e-02 8.73e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6264865e+02 4.59e-04 6.60e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536469e+02 1.94e-03 1.94e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379741e+02 3.25e-03 6.12e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140235e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388164e+02 1.57e-04 1.69e-02 -3.8 7.57e-01 - 9.93e-01 9.41e-0
1h 1
12 5.8370191e+02 7.28e-07 6.65e-05 -3.8 8.63e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278679e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.06e-09 -5.7 3.41e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148935374e-01 5.8277753148935369e+0
2
Dual infeasibility......: 2.0880540103884580e-09 2.0880540103884580e-0
6
Constraint violation....: 6.2994123806170421e-11 6.2994123806170421e-1
1
Complementarity.........: 2.8882094461374997e-09 2.8882094461374996e-0
6
Overall NLP error.......: 2.8882094461374997e-09 2.8882094461374996e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.77e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5003661e+02 7.50e+01 9.04e+01 -1.0 2.59e+01 - 3.83e-04 3.52e-0
2f 1
2 1.1818872e+04 5.63e-02 8.12e+01 -1.0 2.87e+01 - 4.64e-02 1.00e+0
0h 1
3 3.1585743e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.65e-0
2f 1
4 1.0154810e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8148897e+03 7.28e-03 1.55e+01 -1.0 1.93e+01 - 6.11e-01 1.00e+0
0h 1
6 1.1196673e+03 5.40e-03 4.04e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8244210e+02 9.99e-04 2.10e-01 -1.7 5.71e+00 - 1.00e+00 8.87e-0
1h 1
8 7.2817516e+02 8.46e-04 1.35e-02 -1.7 3.45e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0982259e+02 1.50e-03 1.13e-01 -3.8 4.49e+00 - 7.71e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8216110e+02 2.17e-03 7.23e-02 -3.8 2.11e+00 - 8.07e-01 7.40e-0
1h 1
11 5.8336684e+02 9.52e-05 4.78e-02 -3.8 3.17e-02 - 1.00e+00 9.56e-0
1h 1
12 5.8368716e+02 2.82e-07 1.33e-05 -3.8 3.28e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278928e+02 4.12e-07 5.39e-04 -5.7 3.47e-02 - 1.00e+00 9.91e-0
1h 1
14 5.8278859e+02 4.36e-11 3.52e-09 -5.7 2.10e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.65e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753111572761e-01 5.8277753111572758e+0
2
Dual infeasibility......: 2.6503250686288344e-09 2.6503250686288344e-0
6
Constraint violation....: 6.3002297823189224e-11 6.3002297823189224e-1
1
Complementarity.........: 2.8882681473376355e-09 2.8882681473376355e-0
6
Overall NLP error.......: 2.8882681473376355e-09 2.8882681473376355e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.27e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9796473e+02 4.09e+01 5.94e+01 -1.0 1.42e+01 - 6.99e-04 4.23e-0
2f 1
2 1.2226497e+04 6.07e-02 7.87e+01 -1.0 1.80e+01 - 7.07e-02 1.00e+0
0h 1
3 3.6201832e+03 5.54e-02 5.15e+01 -1.0 5.45e+01 - 3.33e-01 7.87e-0
2f 1
4 2.3523812e+03 2.93e-02 2.28e+01 -1.0 2.70e+01 - 5.45e-01 4.46e-0
1f 1
5 1.7571767e+03 8.49e-03 1.17e+00 -1.0 9.96e+00 - 9.27e-01 7.68e-0
1f 1
6 2.0298800e+03 3.42e-04 8.15e-02 -1.0 3.35e+00 - 1.00e+00 1.00e+0
0h 1
7 1.4033455e+03 2.08e-03 8.15e-02 -2.5 4.87e+00 - 8.66e-01 8.50e-0
1f 1
8 1.2236679e+03 2.16e-03 2.06e-01 -2.5 1.05e+00 - 1.00e+00 8.33e-0
1f 1
9 1.2066818e+03 8.65e-05 3.81e-03 -2.5 1.49e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1969333e+03 4.60e-05 1.08e+00 -3.8 9.70e-02 - 1.00e+00 4.99e-0
1h 1
11 1.1949894e+03 3.31e-07 1.13e-01 -3.8 3.83e-02 - 9.68e-01 1.00e+0
0f 1
12 1.1939528e+03 1.38e-08 1.76e-03 -3.8 3.31e-02 - 1.00e+00 1.00e+0
0H 1
13 1.1941496e+03 1.10e-05 2.71e-04 -3.8 3.66e-03 - 1.00e+00 1.00e+0
0f 1
14 1.1935294e+03 1.78e-06 6.37e-02 -5.7 1.23e-02 - 7.78e-01 9.68e-0
1h 1
15 1.1933614e+03 1.24e-05 2.14e-04 -5.7 5.02e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1933675e+03 2.91e-08 2.24e-06 -5.7 2.67e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1933542e+03 2.76e-08 9.71e-06 -8.6 2.46e-04 - 9.82e-01 9.89e-0
1h 1
18 1.1933541e+03 2.43e-13 3.27e-11 -8.6 1.97e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1933540960405622e+00 1.1933540960405621e+0
3
Dual infeasibility......: 3.2688510474163914e-11 3.2688510474163914e-0
8
Constraint violation....: 2.4302782009044677e-13 2.4302782009044677e-1
3
Complementarity.........: 2.5120652665543413e-09 2.5120652665543412e-0
6
Overall NLP error.......: 2.5120652665543413e-09 2.5120652665543412e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2278116e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 3.31e-04 9.87e-0
3h 1
2 8.0655676e+02 9.17e+02 5.24e+01 -1.0 7.64e+02 - 9.12e-05 5.91e-0
4h 1
3 6.8551301e+02 9.13e+02 5.24e+01 -1.0 9.17e+02 - 5.58e-04 4.52e-0
3h 1
4 2.5424763e+02 8.94e+02 5.24e+01 -1.0 9.13e+02 - 5.37e-03 2.03e-0
2f 1
5 1.0171548e+04 5.97e-02 8.27e+01 -1.0 8.94e+02 - 4.73e-02 1.00e+0
0h 1
6 3.6641630e+03 5.57e-02 4.00e+01 -1.0 6.42e+01 - 5.07e-01 6.19e-0
2f 1
7 1.8848290e+03 3.80e-02 1.82e+01 -1.0 3.83e+01 - 5.39e-01 4.87e-0
1f 1
8 2.8688330e+03 3.43e-03 5.12e+00 -1.0 6.15e+00 - 8.07e-01 1.00e+0
0f 1
9 2.1131668e+03 1.02e-03 8.38e-02 -1.0 6.46e+00 - 9.90e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6959769e+03 7.22e-04 4.22e-01 -2.5 7.50e+00 - 9.09e-01 7.34e-0
1f 1
11 1.5457175e+03 3.09e-03 2.28e-01 -2.5 7.75e+00 - 7.23e-01 1.00e+0
0f 1
12 1.5243126e+03 2.42e-03 2.16e-01 -2.5 1.67e+00 - 1.00e+00 8.40e-0
1h 1
13 1.5335197e+03 1.10e-04 3.95e-03 -2.5 4.58e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5029409e+03 1.62e-04 2.15e-02 -3.8 1.39e+01 - 9.92e-01 9.31e-0
1h 1
15 1.5019708e+03 7.72e-07 7.02e-05 -3.8 7.26e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003141e+03 3.77e-07 1.79e-04 -5.7 7.43e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.80e-11 2.93e-09 -5.7 1.63e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932771778976e+00 1.5002932771778976e+0
3
Dual infeasibility......: 2.1737167689556792e-09 2.1737167689556792e-0
6
Constraint violation....: 6.2995664240617089e-11 6.2995664240617089e-1
1
Complementarity.........: 2.8882173002740616e-09 2.8882173002740615e-0
6
Overall NLP error.......: 2.8882173002740616e-09 2.8882173002740615e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6534799e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 4.97e-04 9.87e-0
3h 1
2 8.4756645e+02 9.17e+02 5.24e+01 -1.0 7.79e+02 - 8.94e-05 6.57e-0
4h 1
3 7.0654394e+02 9.12e+02 5.24e+01 -1.0 9.17e+02 - 6.24e-04 5.32e-0
3h 1
4 2.7668053e+02 8.93e+02 5.23e+01 -1.0 9.12e+02 - 6.28e-03 2.08e-0
2f 1
5 1.0297990e+04 6.55e-02 8.03e+01 -1.0 8.93e+02 - 6.71e-02 1.00e+0
0h 1
33 1.370274e+04 1.632511e+04 3.476394e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1152978e+02 1.57e+04 5.50e+01 -1.0 1.59e+04 - 1.75e-04 9.81e-0
3h 1
2 7.0846226e+02 1.57e+04 5.50e+01 -1.0 1.30e+04 - 2.15e-05 1.20e-0
4h 1
3 6.9862880e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 2.49e-05 7.94e-0
4h 1
4 4.8807795e+02 1.54e+04 5.40e+01 -1.0 1.57e+04 - 8.11e-04 1.87e-0
2h 1
5 2.6333353e+04 7.61e-02 8.72e+01 -1.0 1.54e+04 - 2.12e-02 1.00e+0
0h 1
6 1.7903326e+04 7.35e-02 7.58e+01 -1.0 7.79e+01 - 1.40e-01 3.60e-0
2f 1
7 1.6637534e+04 4.63e-02 3.54e+01 -1.0 1.94e+01 - 5.28e-01 3.81e-0
1f 1
8 1.7141097e+04 3.51e-02 1.22e+01 -1.0 1.35e+01 - 5.62e-01 2.50e-0
1f 3
9 1.6797852e+04 7.57e-03 2.35e-01 -1.0 1.35e+00 - 9.85e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6498441e+04 7.09e-04 1.52e+00 -1.7 5.67e+00 - 1.83e-01 9.19e-0
1f 1
11 1.6491241e+04 1.40e-04 4.24e-01 -1.7 5.73e+00 - 7.84e-01 1.00e+0
0f 1
12 1.6486859e+04 1.69e-04 1.63e-01 -1.7 2.00e+01 - 4.44e-01 1.00e+0
0f 1
13 1.6385280e+04 8.17e-04 6.39e-02 -2.5 7.88e+00 - 9.16e-01 1.00e+0
0f 1
14 1.6351083e+04 1.54e-03 1.65e-02 -2.5 1.02e+01 - 1.00e+00 1.00e+0
0h 1
15 1.6329424e+04 2.71e-04 1.06e-01 -3.8 1.24e+01 - 1.00e+00 8.34e-0
1h 1
16 1.6326632e+04 4.62e-07 1.26e-04 -3.8 1.80e+00 - 1.00e+00 1.00e+0
0h 1
17 1.6325122e+04 4.04e-07 1.02e-04 -5.7 5.91e-01 - 1.00e+00 9.98e-0
1h 1
18 1.6325123e+04 3.83e-11 3.02e-09 -5.7 6.01e-02 - 1.00e+00 1.00e+0
0f 1
19 1.6325106e+04 5.74e-11 2.57e-05 -8.6 7.33e-03 - 1.00e+00 9.58e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325105e+04 1.11e-13 3.63e-12 -8.6 1.39e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.6325105203870248e+01 1.6325105203870247e+0
4
Dual infeasibility......: 3.6262601022959828e-12 3.6262601022959828e-0
9
Constraint violation....: 1.1127210264305631e-13 1.1127210264305631e-1
3
Complementarity.........: 9.0796666292448685e-09 9.0796666292448684e-0
6
Overall NLP error.......: 9.0796666292448685e-09 9.0796666292448684e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.4942966e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.08e-04 9.80e-0
3f 1
2 7.4655367e+02 1.50e+04 5.25e+01 -1.0 1.43e+04 - 4.85e-05 1.03e-0
4h 1
3 7.4550311e+02 1.50e+04 5.25e+01 -1.0 1.48e+04 - 6.41e-06 7.78e-0
5h 1
4 7.4417463e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 8.24e-05 1.00e-0
4h 1
5 4.8934568e+02 1.47e+04 5.28e+01 -1.0 1.50e+04 - 1.85e-04 1.96e-0
2f 1
6 2.6103240e+04 6.57e-02 8.55e+01 -1.0 1.47e+04 - 2.75e-02 1.00e+0
0h 1
7 1.7383147e+04 6.33e-02 7.06e+01 -1.0 8.03e+01 - 1.81e-01 4.10e-0
2f 1
8 1.5905568e+04 4.53e-02 3.43e+01 -1.0 2.55e+01 - 5.09e-01 4.17e-0
1f 1
9 1.6187916e+04 3.37e-02 1.29e+01 -1.0 1.52e+01 - 4.95e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6018467e+04 5.45e-03 1.62e-01 -1.0 2.45e+00 - 9.91e-01 1.00e+0
0h 1
11 1.5730820e+04 9.20e-04 2.25e-01 -1.7 4.76e+00 - 1.00e+00 8.87e-0
1f 1
12 1.5707880e+04 7.68e-04 9.25e-03 -1.7 1.79e+01 - 1.00e+00 1.00e+0
0f 1
13 1.5583219e+04 1.28e-03 8.44e-02 -3.8 2.19e+01 - 8.05e-01 9.33e-0
1f 1
14 1.5559760e+04 1.42e-03 6.37e-02 -3.8 1.68e+00 - 8.55e-01 7.77e-0
1h 1
15 1.5560174e+04 2.52e-06 7.07e-04 -3.8 9.35e-02 - 1.00e+00 1.00e+0
0h 1
16 1.5559221e+04 3.27e-07 5.70e-04 -5.7 1.49e-01 - 1.00e+00 9.89e-0
1h 1
17 1.5559215e+04 4.01e-11 5.95e-09 -5.7 2.26e-01 - 1.00e+00 1.00e+0
0f 1
18 1.5559202e+04 6.30e-11 2.06e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5559202135389532e+01 1.5559202135389531e+0
4
Dual infeasibility......: 2.0613858938022434e-09 2.0613858938022434e-0
6
Constraint violation....: 6.2994859328924235e-11 6.2994859328924235e-1
1
Complementarity.........: 2.8881125657053034e-09 2.8881125657053032e-0
6
Overall NLP error.......: 2.8881125657053034e-09 2.8881125657053032e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2477202e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.32e-04 9.80e-0
3h 1
2 8.2190479e+02 1.39e+04 5.24e+01 -1.0 1.32e+04 - 4.69e-05 1.04e-0
4h 1
3 7.8950083e+02 1.39e+04 5.25e+01 -1.0 1.39e+04 - 7.01e-06 2.27e-0
3h 1
4 5.4047095e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 2.44e-03 2.05e-0
2h 1
5 2.4539150e+04 5.69e-02 8.25e+01 -1.0 1.36e+04 - 4.12e-02 1.00e+0
0h 1
6 1.6794213e+04 5.37e-02 4.84e+01 -1.0 7.42e+01 - 4.08e-01 5.37e-0
2f 1
7 1.4876882e+04 3.65e-02 2.50e+01 -1.0 3.96e+01 - 4.85e-01 4.96e-0
1f 1
8 1.5167561e+04 2.34e-02 9.12e+00 -1.0 1.69e+01 - 4.59e-01 1.25e-0
1f 4
9 1.4986241e+04 5.71e-03 2.91e-01 -1.0 4.09e+00 - 9.79e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4676992e+04 1.38e-03 4.19e-01 -1.7 5.52e+00 - 1.00e+00 8.20e-0
1f 1
11 1.4652937e+04 8.21e-04 1.71e-02 -1.7 3.65e+01 - 1.00e+00 1.00e+0
0f 1
12 1.4505621e+04 1.45e-03 9.94e-02 -3.8 3.98e+01 - 7.86e-01 9.30e-0
1f 1
13 1.4480997e+04 1.64e-03 8.46e-02 -3.8 2.77e+00 - 8.42e-01 7.51e-0
1h 1
14 1.4481157e+04 3.16e-06 8.54e-04 -3.8 6.88e-01 - 1.00e+00 1.00e+0
0h 1
15 1.4480075e+04 2.83e-07 6.62e-04 -5.7 2.97e-01 - 1.00e+00 9.87e-0
1h 1
16 1.4480067e+04 3.62e-11 6.68e-09 -5.7 2.13e-01 - 1.00e+00 1.00e+0
0f 1
17 1.4480052e+04 6.30e-11 2.18e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.4480051766438917e+01 1.4480051766438917e+0
4
Dual infeasibility......: 2.1763020492058010e-09 2.1763020492058010e-0
6
Constraint violation....: 6.2998509187117691e-11 6.2998509187117691e-1
1
Complementarity.........: 2.8881023713376532e-09 2.8881023713376533e-0
6
Overall NLP error.......: 2.8881023713376532e-09 2.8881023713376533e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.3466616e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.61e-04 9.81e-0
3h 1
2 8.3141108e+02 1.26e+04 5.24e+01 -1.0 9.71e+03 - 2.04e-05 1.29e-0
4h 1
3 8.0999059e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 3.45e-05 1.39e-0
3h 1
4 5.1070051e+02 1.24e+04 5.26e+01 -1.0 1.26e+04 - 1.42e-03 2.10e-0
2h 1
5 2.3858922e+04 5.69e-02 8.25e+01 -1.0 1.24e+04 - 3.60e-02 1.00e+0
0h 1
6 1.5711908e+04 5.39e-02 5.68e+01 -1.0 7.64e+01 - 3.09e-01 4.82e-0
2f 1
7 1.3671704e+04 3.75e-02 3.06e+01 -1.0 3.91e+01 - 4.69e-01 5.33e-0
1f 1
8 1.4016664e+04 2.17e-02 1.51e+01 -1.0 2.01e+01 - 3.81e-01 1.25e-0
1f 4
9 1.3765952e+04 5.79e-03 5.77e-01 -1.0 4.74e+00 - 9.70e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3445587e+04 1.57e-03 4.91e-01 -1.7 6.32e+00 - 9.89e-01 7.92e-0
1f 1
11 1.3521086e+04 9.79e-04 2.78e-01 -1.7 1.50e+02 - 1.72e-01 1.00e+0
0f 1
12 1.3481056e+04 1.35e-05 1.67e-03 -1.7 4.19e+01 - 1.00e+00 1.00e+0
0h 1
13 1.3264341e+04 1.28e-03 1.04e-01 -3.8 1.14e+02 - 7.86e-01 9.21e-0
1f 1
14 1.3234071e+04 1.71e-03 6.55e-02 -3.8 5.65e+00 - 8.26e-01 7.59e-0
1h 1
15 1.3234230e+04 2.90e-06 9.11e-04 -3.8 4.82e-01 - 1.00e+00 1.00e+0
0h 1
16 1.3233073e+04 2.58e-07 9.07e-04 -5.7 4.26e-01 - 1.00e+00 9.85e-0
1h 1
17 1.3233068e+04 3.56e-11 6.49e-09 -5.7 3.33e-02 - 1.00e+00 1.00e+0
0f 1
18 1.3233051e+04 6.30e-11 2.30e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.3233050916700394e+01 1.3233050916700395e+0
4
Dual infeasibility......: 2.2973817614026706e-09 2.2973817614026706e-0
6
Constraint violation....: 6.3001603933798833e-11 6.3001603933798833e-1
1
Complementarity.........: 2.9659953371716108e-09 2.9659953371716106e-0
6
Overall NLP error.......: 2.9659953371716108e-09 2.9659953371716106e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6062440e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 4.64e-04 9.80e-0
3f 1
2 8.5782562e+02 1.11e+04 5.24e+01 -1.0 1.09e+04 - 9.20e-05 1.01e-0
4h 1
3 8.4420352e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 3.89e-06 8.15e-0
4f 1
4 4.9085561e+02 1.09e+04 5.25e+01 -1.0 1.11e+04 - 8.94e-04 2.18e-0
2h 1
5 2.2805138e+04 5.93e-02 8.05e+01 -1.0 1.09e+04 - 4.92e-02 1.00e+0
0h 1
6 1.4407968e+04 5.54e-02 5.29e+01 -1.0 7.49e+01 - 3.32e-01 5.94e-0
2f 1
7 1.2684666e+04 2.89e-02 2.79e+01 -1.0 4.05e+01 - 4.71e-01 4.55e-0
1f 1
8 1.2392796e+04 1.23e-02 2.57e+00 -1.0 1.13e+01 - 9.19e-01 1.00e+0
0f 1
9 1.2487379e+04 7.23e-04 6.67e-02 -1.0 5.33e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2046314e+04 4.88e-04 7.05e-01 -2.5 7.37e+00 - 8.99e-01 6.25e-0
1f 1
11 1.1932645e+04 4.65e-04 3.60e-01 -2.5 4.02e+00 - 8.56e-01 1.00e+0
0f 1
12 1.1932412e+04 5.68e-05 1.07e-02 -2.5 1.07e-02 0.0 1.00e+00 1.00e+0
0h 1
13 1.1897738e+04 1.93e-04 1.06e-01 -3.8 1.05e+01 - 6.03e-01 1.60e-0
1f 1
14 1.1884962e+04 4.79e-03 3.92e-02 -3.8 2.25e+00 - 5.71e-01 6.49e-0
1h 1
15 1.1878949e+04 4.23e-03 4.44e-03 -3.8 7.88e-01 - 1.00e+00 8.86e-0
1h 1
16 1.1878776e+04 2.35e-03 2.18e-02 -3.8 8.99e-02 - 1.00e+00 4.45e-0
1f 2
17 1.1878748e+04 8.20e-06 2.48e-04 -3.8 4.98e-02 - 1.00e+00 1.00e+0
0h 1
18 1.1877686e+04 6.18e-05 6.87e-03 -5.7 1.49e-01 - 9.63e-01 7.46e-0
1h 1
19 1.1877396e+04 5.62e-06 6.50e-04 -5.7 3.77e-02 - 8.99e-01 9.76e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.1877392e+04 6.54e-09 4.60e-06 -5.7 9.20e-04 - 1.00e+00 1.00e+0
0f 1
21 1.1877379e+04 5.47e-09 6.22e-04 -8.6 1.84e-03 - 1.00e+00 9.21e-0
1h 1
22 1.1877378e+04 1.36e-11 1.55e-09 -8.6 1.46e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.1877378022083647e+01 1.1877378022083647e+0
4
Dual infeasibility......: 1.5490305595284574e-09 1.5490305595284574e-0
6
Constraint violation....: 1.3575029988999177e-11 1.3575029988999177e-1
1
Complementarity.........: 2.8813599948672401e-09 2.8813599948672402e-0
6
Overall NLP error.......: 2.8813599948672401e-09 2.8813599948672402e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0890313e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0580412e+02 9.19e+03 5.23e+01 -1.0 7.60e+03 - 2.53e-05 1.20e-0
4h 1
3 6.0977315e+02 9.04e+03 5.24e+01 -1.0 9.19e+03 - 2.50e-05 1.62e-0
2h 1
4 7.3775373e+02 8.79e+03 5.16e+01 -1.0 9.04e+03 - 1.91e-02 2.80e-0
2h 1
5 1.6473472e+04 8.05e-02 7.71e+01 -1.0 8.79e+03 - 1.08e-01 1.00e+0
0h 1
6 1.2523404e+04 6.93e-02 1.94e+01 -1.0 2.11e+01 - 7.28e-01 1.32e-0
1f 1
7 1.1378990e+04 1.42e-02 9.47e-01 -1.0 1.26e+01 - 9.48e-01 8.00e-0
1f 1
8 1.1688198e+04 1.32e-02 7.15e-01 -1.0 5.96e+00 - 2.43e-01 9.06e-0
1f 1
9 1.1276063e+04 2.90e-03 2.94e-01 -1.7 2.79e+00 - 8.69e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1254621e+04 8.00e-04 3.75e-01 -1.7 8.99e+00 - 7.46e-01 1.00e+0
0h 1
11 1.1290037e+04 1.05e-05 1.40e-01 -1.7 1.96e+01 - 7.36e-01 1.00e+0
0f 1
12 1.1127902e+04 4.70e-04 3.08e-02 -2.5 2.05e+01 - 9.74e-01 9.34e-0
1f 1
13 1.1113098e+04 2.29e-05 2.07e-03 -2.5 8.00e+00 - 1.00e+00 1.00e+0
0f 1
14 1.1088297e+04 1.29e-05 6.11e-02 -3.8 8.11e+00 - 1.00e+00 8.44e-0
1f 1
15 1.1084886e+04 5.05e-08 2.75e-04 -3.8 1.26e+00 - 1.00e+00 1.00e+0
0f 1
16 1.1083359e+04 2.99e-08 1.20e-03 -5.7 4.46e-01 - 1.00e+00 9.83e-0
1f 1
17 1.1083339e+04 2.24e-12 1.57e-08 -5.7 7.56e-03 - 1.00e+00 1.00e+0
0f 1
18 1.1083321e+04 2.63e-12 4.48e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1083320738304957e+01 1.1083320738304958e+0
4
Dual infeasibility......: 4.4777014953211732e-09 4.4777014953211732e-0
6
Constraint violation....: 2.6316518408897593e-12 2.6316518408897593e-1
2
Complementarity.........: 3.8998591387757207e-09 3.8998591387757207e-0
6
Overall NLP error.......: 4.4777014953211732e-09 4.4777014953211732e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2299660e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1994562e+02 6.71e+03 5.23e+01 -1.0 5.82e+03 - 3.44e-05 1.14e-0
4h 1
3 7.2850984e+02 6.64e+03 5.23e+01 -1.0 6.70e+03 - 1.95e-05 9.17e-0
3f 1
4 4.9339551e+02 6.50e+03 5.19e+01 -1.0 6.64e+03 - 1.16e-02 2.10e-0
2h 1
5 1.5628520e+04 8.10e-02 7.81e+01 -1.0 6.50e+03 - 8.90e-02 1.00e+0
0h 1
6 1.0636045e+04 7.19e-02 2.13e+01 -1.0 1.24e+01 - 7.05e-01 1.06e-0
1f 1
7 9.4596866e+03 2.23e-02 3.10e+00 -1.0 9.08e+00 - 8.57e-01 8.74e-0
1f 1
8 9.7561577e+03 1.77e-02 2.22e-01 -1.0 2.44e+00 - 9.28e-01 9.15e-0
1f 1
9 9.3878277e+03 3.07e-03 9.20e-01 -1.7 4.14e+00 - 5.04e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.3557721e+03 3.37e-04 5.85e-01 -1.7 6.71e+00 - 6.85e-01 1.00e+0
0h 1
11 9.3720014e+03 7.81e-05 1.58e-01 -1.7 1.20e+01 - 8.01e-01 1.00e+0
0h 1
12 9.2177004e+03 4.44e-04 1.80e-02 -2.5 1.52e+01 - 9.62e-01 9.38e-0
1f 1
13 9.1913508e+03 1.49e-04 1.98e-01 -3.8 1.01e+01 - 9.88e-01 7.20e-0
1h 1
14 9.1841523e+03 4.17e-07 3.53e-04 -3.8 2.91e+00 - 1.00e+00 1.00e+0
0h 1
15 9.1828158e+03 2.02e-08 4.16e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
16 9.1828008e+03 8.64e-13 5.06e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 9.1828007741867239e+00 9.1828007741867241e+0
3
Dual infeasibility......: 5.0608416507134745e-10 5.0608416507134745e-0
7
Constraint violation....: 8.6421148015602967e-13 8.6421148015602967e-1
3
Complementarity.........: 4.3844378558970371e-09 4.3844378558970372e-0
6
Overall NLP error.......: 4.3844378558970371e-09 4.3844378558970372e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0890039e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0606063e+02 4.77e+03 5.23e+01 -1.0 4.53e+03 - 8.51e-05 1.04e-0
4h 1
3 8.5674884e+02 4.76e+03 5.23e+01 -1.0 4.77e+03 - 9.62e-06 2.18e-0
3f 1
4 3.8122229e+02 4.65e+03 5.23e+01 -1.0 4.76e+03 - 2.82e-03 2.23e-0
2h 1
5 1.6129511e+04 6.86e-02 7.70e+01 -1.0 4.65e+03 - 8.42e-02 1.00e+0
0h 1
6 8.6428592e+03 6.17e-02 3.53e+01 -1.0 2.77e+01 - 5.15e-01 9.25e-0
2f 1
7 7.1353041e+03 1.99e-02 1.35e+01 -1.0 1.52e+01 - 6.41e-01 7.60e-0
1f 1
8 7.2345504e+03 6.03e-03 1.10e+00 -1.0 2.38e+00 - 9.93e-01 5.00e-0
1f 2
9 7.4467494e+03 2.48e-04 6.11e-02 -1.0 3.13e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.8841153e+03 2.26e-03 8.91e-02 -2.5 2.93e+01 - 8.55e-01 8.27e-0
1f 1
11 6.7163515e+03 2.12e-03 4.49e-01 -2.5 4.53e+00 - 1.00e+00 7.51e-0
1f 1
12 6.6879049e+03 1.53e-04 4.78e-03 -2.5 1.12e+00 - 1.00e+00 1.00e+0
0h 1
13 6.6714076e+03 4.08e-05 1.58e-01 -3.8 2.68e+00 - 1.00e+00 7.53e-0
1h 1
14 6.6671226e+03 1.41e-07 3.55e-04 -3.8 6.62e-01 - 1.00e+00 1.00e+0
0f 1
15 6.6658964e+03 2.80e-08 9.30e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 6.6658841e+03 1.87e-12 1.34e-08 -5.7 2.14e-03 - 1.00e+00 1.00e+0
0f 1
17 6.6658693e+03 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 6.6658693338052357e+00 6.6658693338052353e+0
3
Dual infeasibility......: 4.4776950740440212e-09 4.4776950740440212e-0
6
Constraint violation....: 2.6307775402578670e-12 2.6307775402578670e-1
2
Complementarity.........: 3.6084999010216066e-09 3.6084999010216063e-0
6
Overall NLP error.......: 4.4776950740440212e-09 4.4776950740440212e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9465052e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3h 1
2 8.8961066e+02 3.24e+03 5.24e+01 -1.0 1.65e+03 - 3.15e-05 1.94e-0
4h 1
3 3.3049321e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 1.10e-04 2.31e-0
2f 1
4 1.5661028e+04 6.29e-02 8.00e+01 -1.0 3.17e+03 - 4.12e-02 1.00e+0
0h 1
5 7.0966213e+03 5.93e-02 5.59e+01 -1.0 4.98e+01 - 2.95e-01 5.19e-0
2f 1
6 5.7201217e+03 2.49e-02 2.72e+01 -1.0 2.33e+01 - 5.16e-01 5.36e-0
1f 1
7 5.1215760e+03 9.32e-03 1.31e+00 -1.0 8.82e+00 - 9.35e-01 7.62e-0
1f 1
8 5.4190355e+03 3.08e-04 8.41e-02 -1.0 3.70e+00 - 9.98e-01 1.00e+0
0f 1
9 4.8034847e+03 2.09e-03 8.11e-02 -2.5 6.03e+00 - 8.62e-01 8.49e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.6320243e+03 2.20e-03 3.43e-01 -2.5 2.10e+00 - 1.00e+00 7.81e-0
1f 1
11 4.6055456e+03 1.52e-04 4.72e-03 -2.5 5.20e-01 - 1.00e+00 1.00e+0
0h 1
12 4.5784264e+03 2.24e-05 4.27e-02 -3.8 1.07e+01 - 1.00e+00 8.84e-0
1h 1
13 4.5760808e+03 5.69e-08 5.99e-04 -3.8 1.23e+00 - 1.00e+00 1.00e+0
0f 1
14 4.5743301e+03 4.25e-08 5.46e-05 -5.7 5.94e-01 - 1.00e+00 9.98e-0
1f 1
15 4.5743305e+03 1.88e-12 1.31e-08 -5.7 1.23e-03 - 1.00e+00 1.00e+0
0f 1
16 4.5743102e+03 2.57e-12 3.30e-06 -8.6 7.37e-03 - 1.00e+00 9.99e-0
1f 1
17 4.5743102e+03 7.11e-15 4.85e-14 -8.6 4.09e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 4.5743102020047735e+00 4.5743102020047736e+0
3
Dual infeasibility......: 4.8502413061780263e-14 4.8502413061780263e-1
1
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.6893885099202401e-09 2.6893885099202401e-0
6
Overall NLP error.......: 2.6893885099202401e-09 2.6893885099202401e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1583257e+02 2.00e+03 5.23e+01 -1.0 2.01e+03 - 1.20e-03 9.81e-0
3h 1
2 9.1195716e+02 2.00e+03 5.23e+01 -1.0 1.37e+03 - 4.87e-05 1.44e-0
4h 1
3 3.1303385e+02 1.95e+03 5.24e+01 -1.0 2.00e+03 - 6.04e-05 2.36e-0
2f 1
4 1.4608110e+04 6.65e-02 7.72e+01 -1.0 1.95e+03 - 6.92e-02 1.00e+0
0h 1
5 6.1485043e+03 6.09e-02 3.60e+01 -1.0 2.22e+01 - 5.08e-01 7.70e-0
2f 1
6 4.6744427e+03 1.15e-02 1.62e+01 -1.0 1.30e+01 - 6.04e-01 8.35e-0
1f 1
7 4.8737737e+03 2.78e-03 1.37e-01 -1.0 3.28e+00 - 9.92e-01 1.00e+0
0f 1
8 4.4144754e+03 1.77e-03 1.46e-01 -1.7 7.23e+00 - 1.00e+00 1.00e+0
0f 1
9 4.2301440e+03 2.01e-03 3.83e-01 -2.5 2.14e+00 - 1.00e+00 7.84e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2032539e+03 1.87e-04 1.95e-02 -2.5 4.46e-01 - 1.00e+00 9.81e-0
1f 1
11 4.1817214e+03 1.90e-06 1.87e-02 -3.8 5.38e+00 - 9.84e-01 1.00e+0
0h 1
12 4.1818471e+03 1.75e-09 4.85e-06 -3.8 6.74e-03 - 1.00e+00 1.00e+0
0h 1
13 4.1805081e+03 1.80e-08 1.81e-04 -5.7 2.97e-01 - 1.00e+00 9.96e-0
1f 1
14 4.1805057e+03 1.80e-12 2.29e-09 -5.7 1.19e-03 - 1.00e+00 1.00e+0
0f 1
15 4.1804892e+03 2.63e-12 1.52e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 4.1804891588455781e+00 4.1804891588455785e+0
3
Dual infeasibility......: 1.5189628582509157e-09 1.5189628582509157e-0
6
Constraint violation....: 2.6288762833281965e-12 2.6288762833281965e-1
2
Complementarity.........: 3.4967982948854550e-09 3.4967982948854549e-0
6
Overall NLP error.......: 3.4967982948854550e-09 3.4967982948854549e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2278116e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 3.31e-04 9.87e-0
3h 1
2 8.0655676e+02 9.17e+02 5.24e+01 -1.0 7.64e+02 - 9.12e-05 5.91e-0
4h 1
3 6.8551301e+02 9.13e+02 5.24e+01 -1.0 9.17e+02 - 5.58e-04 4.52e-0
3h 1
4 2.5424763e+02 8.94e+02 5.24e+01 -1.0 9.13e+02 - 5.37e-03 2.03e-0
2f 1
5 1.0171548e+04 5.97e-02 8.27e+01 -1.0 8.94e+02 - 4.73e-02 1.00e+0
0h 1
6 3.6641630e+03 5.57e-02 4.00e+01 -1.0 6.42e+01 - 5.07e-01 6.19e-0
2f 1
7 1.8848290e+03 3.80e-02 1.82e+01 -1.0 3.83e+01 - 5.39e-01 4.87e-0
1f 1
8 2.8688330e+03 3.43e-03 5.12e+00 -1.0 6.15e+00 - 8.07e-01 1.00e+0
0f 1
9 2.1131668e+03 1.02e-03 8.38e-02 -1.0 6.46e+00 - 9.90e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6959769e+03 7.22e-04 4.22e-01 -2.5 7.50e+00 - 9.09e-01 7.34e-0
1f 1
11 1.5457175e+03 3.09e-03 2.28e-01 -2.5 7.75e+00 - 7.23e-01 1.00e+0
0f 1
12 1.5243126e+03 2.42e-03 2.16e-01 -2.5 1.67e+00 - 1.00e+00 8.40e-0
1h 1
13 1.5335197e+03 1.10e-04 3.95e-03 -2.5 4.58e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5029409e+03 1.62e-04 2.15e-02 -3.8 1.39e+01 - 9.92e-01 9.31e-0
1h 1
15 1.5019708e+03 7.72e-07 7.02e-05 -3.8 7.26e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003141e+03 3.77e-07 1.79e-04 -5.7 7.43e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.80e-11 2.93e-09 -5.7 1.63e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932771778976e+00 1.5002932771778976e+0
3
Dual infeasibility......: 2.1737167689556792e-09 2.1737167689556792e-0
6
Constraint violation....: 6.2995664240617089e-11 6.2995664240617089e-1
1
Complementarity.........: 2.8882173002740616e-09 2.8882173002740615e-0
6
Overall NLP error.......: 2.8882173002740616e-09 2.8882173002740615e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.27e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9794778e+02 4.09e+01 5.94e+01 -1.0 1.43e+01 - 6.99e-04 4.23e-0
2f 1
2 1.2226387e+04 6.07e-02 7.87e+01 -1.0 1.80e+01 - 7.07e-02 1.00e+0
0h 1
3 3.6200419e+03 5.54e-02 5.15e+01 -1.0 5.46e+01 - 3.33e-01 7.87e-0
2f 1
4 2.3521653e+03 2.93e-02 2.28e+01 -1.0 2.70e+01 - 5.45e-01 4.46e-0
1f 1
5 1.7566465e+03 8.50e-03 1.17e+00 -1.0 9.97e+00 - 9.27e-01 7.68e-0
1f 1
6 2.0294849e+03 3.42e-04 8.15e-02 -1.0 3.36e+00 - 1.00e+00 1.00e+0
0h 1
7 1.4027449e+03 2.08e-03 8.14e-02 -2.5 4.87e+00 - 8.66e-01 8.50e-0
1f 1
8 1.2230780e+03 2.16e-03 2.05e-01 -2.5 1.05e+00 - 1.00e+00 8.33e-0
1f 1
9 1.2062994e+03 8.52e-05 3.86e-03 -2.5 1.48e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1967643e+03 4.57e-05 1.12e+00 -3.8 9.65e-02 - 1.00e+00 4.94e-0
1h 1
11 1.1947754e+03 3.49e-07 1.15e-01 -3.8 3.95e-02 - 9.67e-01 1.00e+0
0f 1
12 1.1937327e+03 1.72e-08 1.86e-03 -3.8 3.32e-02 - 1.00e+00 1.00e+0
0H 1
13 1.1939328e+03 1.19e-05 2.86e-04 -3.8 3.90e-03 - 1.00e+00 1.00e+0
0f 1
14 1.1933097e+03 1.90e-06 6.24e-02 -5.7 1.24e-02 - 7.78e-01 9.69e-0
1h 1
15 1.1931429e+03 1.23e-05 2.09e-04 -5.7 5.02e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1931489e+03 2.62e-08 2.07e-06 -5.7 2.53e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1931357e+03 2.71e-08 6.92e-06 -8.6 2.43e-04 - 9.82e-01 9.88e-0
1h 1
18 1.1931355e+03 3.15e-13 3.35e-11 -8.6 2.20e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1931355131331243e+00 1.1931355131331243e+0
3
Dual infeasibility......: 3.3465937950913147e-11 3.3465937950913147e-0
8
Constraint violation....: 3.1463720517876936e-13 3.1463720517876936e-1
3
Complementarity.........: 2.5121780394719033e-09 2.5121780394719031e-0
6
Overall NLP error.......: 2.5121780394719033e-09 2.5121780394719031e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1583979e+02 1.09e+02 1.13e+02 -1.0 3.76e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1398569e+04 5.38e-02 8.36e+01 -1.0 4.53e+01 - 3.10e-02 1.00e+0
0h 1
3 2.7847768e+03 5.17e-02 6.48e+01 -1.0 8.43e+01 - 2.27e-01 4.32e-0
2f 1
4 9.8154680e+02 4.24e-02 3.38e+01 -1.0 3.41e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5908602e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.21e-01 1.00e+0
0h 1
6 9.4490807e+02 1.01e-02 8.73e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6264784e+02 4.59e-04 6.60e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536457e+02 1.94e-03 1.94e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379731e+02 3.25e-03 6.12e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140236e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388162e+02 1.57e-04 1.69e-02 -3.8 7.57e-01 - 9.93e-01 9.41e-0
1h 1
12 5.8370191e+02 7.28e-07 6.65e-05 -3.8 8.63e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278679e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.06e-09 -5.7 3.41e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148936462e-01 5.8277753148936461e+0
2
Dual infeasibility......: 2.0880379873753618e-09 2.0880379873753618e-0
6
Constraint violation....: 6.2994234828472884e-11 6.2994234828472884e-1
1
Complementarity.........: 2.8882094445776860e-09 2.8882094445776859e-0
6
Overall NLP error.......: 2.8882094445776860e-09 2.8882094445776859e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.77e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5002486e+02 7.50e+01 9.04e+01 -1.0 2.59e+01 - 3.83e-04 3.52e-0
2f 1
2 1.1818748e+04 5.63e-02 8.12e+01 -1.0 2.87e+01 - 4.64e-02 1.00e+0
0h 1
3 3.1584760e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.65e-0
2f 1
4 1.0154559e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8154931e+03 7.28e-03 1.55e+01 -1.0 1.93e+01 - 6.10e-01 1.00e+0
0h 1
6 1.1193857e+03 5.40e-03 4.04e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8239835e+02 9.98e-04 2.09e-01 -1.7 5.71e+00 - 1.00e+00 8.88e-0
1h 1
8 7.2813380e+02 8.47e-04 1.34e-02 -1.7 3.45e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0980708e+02 1.50e-03 1.13e-01 -3.8 4.49e+00 - 7.71e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8216323e+02 2.17e-03 7.25e-02 -3.8 2.11e+00 - 8.07e-01 7.40e-0
1h 1
11 5.8336793e+02 9.41e-05 4.73e-02 -3.8 3.16e-02 - 1.00e+00 9.56e-0
1h 1
12 5.8368716e+02 2.82e-07 1.32e-05 -3.8 3.31e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278927e+02 4.12e-07 5.37e-04 -5.7 3.47e-02 - 1.00e+00 9.91e-0
1h 1
14 5.8278859e+02 4.36e-11 3.51e-09 -5.7 2.12e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.65e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753111686337e-01 5.8277753111686332e+0
2
Dual infeasibility......: 2.6486153403001907e-09 2.6486153403001907e-0
6
Constraint violation....: 6.3002117411947722e-11 6.3002117411947722e-1
1
Complementarity.........: 2.8882678877055849e-09 2.8882678877055848e-0
6
Overall NLP error.......: 2.8882678877055849e-09 2.8882678877055848e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.27e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9794778e+02 4.09e+01 5.94e+01 -1.0 1.43e+01 - 6.99e-04 4.23e-0
2f 1
2 1.2226387e+04 6.07e-02 7.87e+01 -1.0 1.80e+01 - 7.07e-02 1.00e+0
0h 1
3 3.6200419e+03 5.54e-02 5.15e+01 -1.0 5.46e+01 - 3.33e-01 7.87e-0
2f 1
4 2.3521653e+03 2.93e-02 2.28e+01 -1.0 2.70e+01 - 5.45e-01 4.46e-0
1f 1
5 1.7566465e+03 8.50e-03 1.17e+00 -1.0 9.97e+00 - 9.27e-01 7.68e-0
1f 1
6 2.0294849e+03 3.42e-04 8.15e-02 -1.0 3.36e+00 - 1.00e+00 1.00e+0
0h 1
7 1.4027449e+03 2.08e-03 8.14e-02 -2.5 4.87e+00 - 8.66e-01 8.50e-0
1f 1
8 1.2230780e+03 2.16e-03 2.05e-01 -2.5 1.05e+00 - 1.00e+00 8.33e-0
1f 1
9 1.2062994e+03 8.52e-05 3.86e-03 -2.5 1.48e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1967643e+03 4.57e-05 1.12e+00 -3.8 9.65e-02 - 1.00e+00 4.94e-0
1h 1
11 1.1947754e+03 3.49e-07 1.15e-01 -3.8 3.95e-02 - 9.67e-01 1.00e+0
0f 1
12 1.1937327e+03 1.72e-08 1.86e-03 -3.8 3.32e-02 - 1.00e+00 1.00e+0
0H 1
13 1.1939328e+03 1.19e-05 2.86e-04 -3.8 3.90e-03 - 1.00e+00 1.00e+0
0f 1
14 1.1933097e+03 1.90e-06 6.24e-02 -5.7 1.24e-02 - 7.78e-01 9.69e-0
1h 1
15 1.1931429e+03 1.23e-05 2.09e-04 -5.7 5.02e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1931489e+03 2.62e-08 2.07e-06 -5.7 2.53e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1931357e+03 2.71e-08 6.92e-06 -8.6 2.43e-04 - 9.82e-01 9.88e-0
1h 1
18 1.1931355e+03 3.15e-13 3.35e-11 -8.6 2.20e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1931355131331243e+00 1.1931355131331243e+0
3
Dual infeasibility......: 3.3465937950913147e-11 3.3465937950913147e-0
8
Constraint violation....: 3.1463720517876936e-13 3.1463720517876936e-1
3
Complementarity.........: 2.5121780394719033e-09 2.5121780394719031e-0
6
Overall NLP error.......: 2.5121780394719033e-09 2.5121780394719031e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2252371e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 3.31e-04 9.88e-0
3h 1
2 8.0445960e+02 9.17e+02 5.24e+01 -1.0 7.80e+02 - 1.02e-04 6.58e-0
4h 1
3 7.4450001e+02 9.15e+02 5.24e+01 -1.0 9.17e+02 - 6.37e-04 2.25e-0
3h 1
4 2.4840622e+02 8.96e+02 5.25e+01 -1.0 9.15e+02 - 3.05e-03 2.07e-0
2f 1
5 1.1004291e+04 5.79e-02 8.27e+01 -1.0 8.96e+02 - 4.32e-02 1.00e+0
0h 1
6 3.7548066e+03 5.44e-02 4.55e+01 -1.0 7.01e+01 - 4.43e-01 5.64e-0
2f 1
7 1.8925967e+03 3.73e-02 2.26e+01 -1.0 3.91e+01 - 5.02e-01 4.92e-0
1f 1
8 3.4775491e+03 6.84e-03 1.32e+01 -1.0 1.10e+01 - 6.02e-01 1.00e+0
0h 1
9 2.0261981e+03 3.16e-03 2.34e-01 -1.0 1.21e+01 - 9.88e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6958808e+03 6.81e-04 1.57e-01 -1.7 9.87e+00 - 1.00e+00 9.09e-0
1f 1
11 1.5631128e+03 2.03e-03 2.54e-01 -2.5 6.02e+00 - 7.53e-01 1.00e+0
0f 1
12 1.5239272e+03 3.40e-03 8.98e-02 -2.5 2.39e+00 - 1.00e+00 9.28e-0
1h 1
13 1.5338912e+03 1.59e-04 4.71e-03 -2.5 7.21e-01 - 1.00e+00 1.00e+0
0h 1
14 1.5025307e+03 1.72e-04 1.85e-02 -3.8 1.44e+01 - 9.96e-01 9.39e-0
1h 1
15 1.5019708e+03 6.54e-07 7.00e-05 -3.8 4.18e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003135e+03 3.80e-07 1.83e-04 -5.7 7.45e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.83e-11 2.97e-09 -5.7 6.54e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932770662363e+00 1.5002932770662362e+0
3
Dual infeasibility......: 2.1737100737734830e-09 2.1737100737734830e-0
6
Constraint violation....: 6.2995678118404896e-11 6.2995678118404896e-1
1
Complementarity.........: 2.8882165689125594e-09 2.8882165689125595e-0
6
Overall NLP error.......: 2.8882165689125594e-09 2.8882165689125595e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
1 8.6513656e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 4.97e-04 9.88e-0
3h 1
2 8.4530680e+02 9.17e+02 5.24e+01 -1.0 7.94e+02 - 1.00e-04 7.33e-0
4h 1
3 7.7732358e+02 9.14e+02 5.24e+01 -1.0 9.17e+02 - 7.11e-04 2.57e-0
3h 1
4 2.6899855e+02 8.95e+02 5.24e+01 -1.0 9.15e+02 - 3.47e-03 2.14e-0
2f 1
5 1.1246095e+04 6.32e-02 8.04e+01 -1.0 8.95e+02 - 5.91e-02 1.00e+0
0h 1
34 1.464299e+04 1.632511e+04 3.532551e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6791917e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.81e-0
3h 1
2 7.6469919e+02 1.57e+04 5.25e+01 -1.0 1.19e+04 - 1.83e-05 1.31e-0
4h 1
3 7.5968954e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 3.57e-05 3.97e-0
4h 1
4 7.2782717e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 4.28e-04 2.63e-0
3h 1
5 5.6149053e+02 1.54e+04 5.26e+01 -1.0 1.57e+04 - 3.23e-03 1.97e-0
2f 1
6 2.5385998e+04 6.26e-02 8.49e+01 -1.0 1.54e+04 - 3.20e-02 1.00e+0
0h 1
7 1.8194596e+04 5.98e-02 5.84e+01 -1.0 6.69e+01 - 3.16e-01 4.69e-0
2f 1
8 1.6680320e+04 4.58e-02 2.78e+01 -1.0 2.90e+01 - 5.19e-01 4.30e-0
1f 1
9 1.7242262e+04 2.74e-02 1.99e+01 -1.0 1.54e+01 - 4.85e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6786075e+04 5.94e-03 2.13e+00 -1.0 5.78e+00 - 8.53e-01 1.00e+0
0f 1
11 1.6825733e+04 1.93e-04 1.60e+00 -1.0 2.39e+00 - 3.78e-01 1.00e+0
0f 1
12 1.6830794e+04 5.37e-06 7.24e-01 -1.0 3.87e+00 - 5.32e-01 1.00e+0
0f 1
13 1.6531362e+04 2.34e-04 4.32e-01 -1.7 4.85e+00 - 9.27e-01 7.96e-0
1f 1
14 1.6487722e+04 6.81e-04 3.41e-01 -1.7 1.76e+01 - 4.38e-01 1.00e+0
0f 1
15 1.6502410e+04 3.91e-05 2.61e-02 -1.7 2.22e+01 - 8.98e-01 1.00e+0
0h 1
16 1.6372168e+04 9.91e-04 4.70e-02 -2.5 3.34e+01 - 9.25e-01 1.00e+0
0f 1
17 1.6351030e+04 1.08e-03 1.14e-02 -2.5 2.64e+00 - 1.00e+00 1.00e+0
0h 1
18 1.6328803e+04 1.81e-04 8.31e-02 -3.8 1.15e+01 - 1.00e+00 8.55e-0
1h 1
19 1.6326632e+04 5.74e-07 9.83e-05 -3.8 1.27e+00 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325121e+04 4.00e-07 1.12e-04 -5.7 5.93e-01 - 1.00e+00 9.97e-0
1h 1
21 1.6325123e+04 3.81e-11 2.99e-09 -5.7 1.66e-03 - 1.00e+00 1.00e+0
0f 1
22 1.6325106e+04 5.74e-11 2.62e-05 -8.6 7.33e-03 - 1.00e+00 9.58e-0
1h 1
23 1.6325105e+04 1.13e-13 3.73e-12 -8.6 8.60e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 23
(scaled) (unscaled)
Objective...............: 1.6325105203899259e+01 1.6325105203899258e+0
4
Dual infeasibility......: 3.7260643161281115e-12 3.7260643161281115e-0
9
Constraint violation....: 1.1304845948245656e-13 1.1304845948245656e-1
3
Complementarity.........: 9.1094253014217603e-09 9.1094253014217595e-0
6
Overall NLP error.......: 9.1094253014217603e-09 9.1094253014217595e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 24
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 24
Number of inequality constraint Jacobian evaluations = 24
Number of Lagrangian Hessian evaluations = 23
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6676934e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 4.98e-04 9.80e-0
3h 1
2 8.6388343e+02 1.50e+04 5.24e+01 -1.0 1.36e+04 - 2.94e-05 1.09e-0
4h 1
3 8.6310009e+02 1.50e+04 5.24e+01 -1.0 1.47e+04 - 1.28e-05 6.00e-0
5h 1
4 8.6247353e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 7.12e-05 4.91e-0
5h 1
5 5.7821442e+02 1.46e+04 5.25e+01 -1.0 1.50e+04 - 1.21e-04 2.24e-0
2f 1
6 2.7084408e+04 5.92e-02 8.01e+01 -1.0 1.46e+04 - 4.94e-02 1.00e+0
0h 1
7 1.8366154e+04 5.54e-02 5.42e+01 -1.0 7.45e+01 - 3.13e-01 5.90e-0
2f 1
8 1.6778893e+04 3.01e-02 2.85e+01 -1.0 3.90e+01 - 4.69e-01 4.31e-0
1f 1
9 1.6486417e+04 1.45e-02 2.61e+00 -1.0 1.11e+01 - 9.18e-01 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6313385e+04 7.29e-03 1.89e+00 -1.0 8.40e+00 - 9.94e-01 4.88e-0
1f 2
11 1.6403085e+04 6.00e-04 4.34e-02 -1.0 8.71e+01 - 1.00e+00 1.00e+0
0f 1
12 1.5955196e+04 4.64e-04 9.57e-01 -2.5 1.24e+02 - 9.17e-01 5.85e-0
1f 1
13 1.5859699e+04 2.18e-04 2.18e-01 -2.5 1.40e+01 - 9.26e-01 1.00e+0
0f 1
14 1.5835492e+04 3.07e-03 1.92e-02 -2.5 1.66e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5822070e+04 7.98e-04 3.58e-02 -3.8 2.78e+00 - 8.04e-01 1.00e+0
0h 1
16 1.5819177e+04 2.14e-03 1.02e-03 -3.8 4.83e-02 - 1.00e+00 1.00e+0
0h 1
17 1.5819391e+04 4.90e-05 1.31e-04 -3.8 1.21e-02 - 1.00e+00 1.00e+0
0h 1
18 1.5818089e+04 1.01e-04 3.42e-04 -5.7 1.49e-01 - 9.50e-01 9.75e-0
1h 1
19 1.5818076e+04 2.31e-05 3.77e-03 -5.7 3.57e-03 - 1.00e+00 7.73e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5818079e+04 9.13e-09 1.28e-06 -5.7 8.10e-04 - 1.00e+00 1.00e+0
0f 1
21 1.5818064e+04 9.12e-09 1.91e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
22 1.5818064e+04 1.36e-12 6.49e-11 -8.6 3.06e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.5818063685937286e+01 1.5818063685937286e+0
4
Dual infeasibility......: 6.4916613384074276e-11 6.4916613384074276e-0
8
Constraint violation....: 1.3581358260239540e-12 1.3581358260239540e-1
2
Complementarity.........: 2.5092891211060463e-09 2.5092891211060461e-0
6
Overall NLP error.......: 2.5092891211060463e-09 2.5092891211060461e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0892160e+02 1.39e+04 5.23e+01 -1.0 1.40e+04 - 1.00e-03 9.80e-0
3h 1
2 9.0601608e+02 1.39e+04 5.23e+01 -1.0 1.22e+04 - 2.38e-05 1.13e-0
4h 1
3 9.0281307e+02 1.39e+04 5.23e+01 -1.0 1.38e+04 - 1.66e-05 2.36e-0
4h 1
4 8.9073755e+02 1.39e+04 5.23e+01 -1.0 1.39e+04 - 2.49e-04 9.00e-0
4h 1
5 5.9687482e+02 1.36e+04 5.24e+01 -1.0 1.39e+04 - 1.19e-03 2.29e-0
2f 1
6 2.5843164e+04 6.69e-02 7.66e+01 -1.0 1.36e+04 - 8.33e-02 1.00e+0
0h 1
7 1.7814634e+04 6.02e-02 3.74e+01 -1.0 2.88e+01 - 4.86e-01 9.05e-0
2f 1
8 1.6314594e+04 1.95e-02 1.51e+01 -1.0 1.53e+01 - 6.20e-01 7.44e-0
1f 1
9 1.6376844e+04 5.59e-03 1.23e+00 -1.0 2.09e+00 - 9.91e-01 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6564729e+04 3.10e-04 6.98e-02 -1.0 2.79e+01 - 9.44e-01 1.00e+0
0f 1
11 1.6017320e+04 2.19e-03 9.39e-02 -2.5 2.25e+01 - 8.55e-01 8.16e-0
1f 1
12 1.5847443e+04 2.10e-03 4.71e-01 -2.5 4.25e+00 - 1.00e+00 7.43e-0
1f 1
13 1.5816896e+04 1.69e-04 4.84e-03 -2.5 9.19e-01 - 1.00e+00 1.00e+0
0h 1
14 1.5798569e+04 4.58e-05 1.69e-01 -3.8 5.51e+00 - 1.00e+00 7.46e-0
1h 1
15 1.5793524e+04 1.52e-07 3.67e-04 -3.8 1.33e+00 - 1.00e+00 1.00e+0
0f 1
16 1.5792153e+04 2.76e-08 8.93e-04 -5.7 2.97e-01 - 1.00e+00 9.86e-0
1h 1
17 1.5792139e+04 1.87e-12 1.30e-08 -5.7 3.94e-03 - 1.00e+00 1.00e+0
0f 1
18 1.5792122e+04 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5792122198912633e+01 1.5792122198912633e+0
4
Dual infeasibility......: 4.4776947452101610e-09 4.4776947452101610e-0
6
Constraint violation....: 2.6307775402578670e-12 2.6307775402578670e-1
2
Complementarity.........: 3.6085012954411885e-09 3.6085012954411885e-0
6
Overall NLP error.......: 4.4776947452101610e-09 4.4776947452101610e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1596050e+02 1.27e+04 5.23e+01 -1.0 1.28e+04 - 1.20e-03 9.81e-0
3h 1
2 9.1121757e+02 1.26e+04 5.23e+01 -1.0 7.32e+03 - 9.51e-06 2.35e-0
4h 1
3 9.0149277e+02 1.26e+04 5.23e+01 -1.0 1.26e+04 - 1.41e-04 6.58e-0
4h 1
4 8.4330564e+02 1.26e+04 5.23e+01 -1.0 1.26e+04 - 7.92e-04 4.04e-0
3h 1
5 6.1148479e+02 1.23e+04 5.22e+01 -1.0 1.26e+04 - 5.45e-03 2.18e-0
2f 1
6 2.2867759e+04 7.39e-02 7.76e+01 -1.0 1.23e+04 - 8.57e-02 1.00e+0
0h 1
7 1.6570381e+04 6.62e-02 2.51e+01 -1.0 1.87e+01 - 6.49e-01 9.75e-0
2f 1
8 1.5182886e+04 1.48e-02 7.70e+00 -1.0 1.23e+01 - 7.17e-01 8.29e-0
1f 1
9 1.5487396e+04 4.84e-03 2.22e+00 -1.0 3.33e+00 - 7.26e-01 9.56e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5667390e+04 1.28e-03 1.16e+00 -1.0 1.85e+00 - 4.35e-01 1.00e+0
0f 1
11 1.5632110e+04 3.16e-04 5.39e-01 -1.0 3.53e+00 - 5.41e-01 1.00e+0
0f 1
12 1.5062945e+04 2.28e-03 2.04e-01 -1.7 2.03e+00 - 8.89e-01 1.00e+0
0f 1
13 1.5015795e+04 9.11e-04 6.04e-01 -1.7 1.40e+01 - 5.14e-01 1.00e+0
0f 1
14 1.5043358e+04 1.39e-05 1.58e-01 -1.7 2.21e+01 - 7.72e-01 1.00e+0
0h 1
15 1.4879611e+04 4.75e-04 2.20e-02 -2.5 2.39e+01 - 9.71e-01 9.44e-0
1f 1
16 1.4842034e+04 1.61e-04 1.42e-01 -3.8 2.43e+01 - 9.80e-01 7.36e-0
1h 1
17 1.4835177e+04 4.39e-07 1.42e-03 -3.8 3.32e+00 - 1.00e+00 9.98e-0
1h 1
18 1.4834114e+04 2.60e-08 9.95e-03 -5.7 5.22e-03 - 2.01e-01 1.00e+0
0h 1
19 1.4834115e+04 3.12e-13 1.62e-10 -5.7 1.94e-04 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.4834096e+04 2.63e-12 1.52e-09 -8.6 5.52e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.4834096290894156e+01 1.4834096290894155e+0
4
Dual infeasibility......: 1.5194085338708902e-09 1.5194085338708902e-0
6
Constraint violation....: 2.6325816526728829e-12 2.6325816526728829e-1
2
Complementarity.........: 2.9662092825021564e-09 2.9662092825021564e-0
6
Overall NLP error.......: 2.9662092825021564e-09 2.9662092825021564e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6662389e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 4.97e-04 9.80e-0
3h 1
2 8.6375901e+02 1.11e+04 5.24e+01 -1.0 1.04e+04 - 4.51e-05 1.05e-0
4h 1
3 8.1247869e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 9.09e-06 3.08e-0
3h 1
4 5.1271375e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 3.39e-03 2.10e-0
2h 1
5 2.1781269e+04 6.25e-02 8.04e+01 -1.0 1.09e+04 - 5.65e-02 1.00e+0
0h 1
6 1.4355473e+04 5.79e-02 4.85e+01 -1.0 6.64e+01 - 3.84e-01 6.77e-0
2f 1
7 1.2780687e+04 3.04e-02 2.34e+01 -1.0 3.79e+01 - 5.09e-01 4.42e-0
1f 1
8 1.2333284e+04 1.27e-02 2.11e+00 -1.0 1.05e+01 - 9.22e-01 1.00e+0
0f 1
9 1.2590751e+04 3.91e-04 7.29e-02 -1.0 4.30e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2099307e+04 5.08e-04 6.40e-01 -2.5 7.12e+00 - 8.93e-01 6.41e-0
1f 1
11 1.2017941e+04 2.37e-04 3.82e-01 -2.5 2.45e+00 - 8.88e-01 1.00e+0
0h 1
12 1.1994709e+04 6.02e-03 2.19e-01 -2.5 1.69e+00 - 1.00e+00 6.03e-0
1h 1
13 1.1985170e+04 7.03e-04 5.56e-03 -2.5 4.75e-01 - 1.00e+00 1.00e+0
0f 1
14 1.1966692e+04 1.15e-03 2.92e-02 -3.8 5.36e+00 - 8.09e-01 1.00e+0
0h 1
15 1.1963688e+04 2.25e-03 1.06e-03 -3.8 4.73e-02 - 1.00e+00 1.00e+0
0h 1
16 1.1964070e+04 4.49e-05 1.48e-04 -3.8 1.50e-02 - 1.00e+00 1.00e+0
0h 1
17 1.1962598e+04 1.05e-04 4.27e-04 -5.7 2.97e-01 - 9.51e-01 9.82e-0
1h 1
18 1.1962590e+04 2.18e-05 3.56e-03 -5.7 5.37e-03 - 1.00e+00 7.94e-0
1h 1
19 1.1962593e+04 8.54e-09 1.12e-06 -5.7 1.11e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.1962577e+04 8.97e-09 1.93e-05 -8.6 3.68e-03 - 1.00e+00 9.83e-0
1h 1
21 1.1962576e+04 1.38e-12 6.48e-11 -8.6 6.12e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.1962576492424022e+01 1.1962576492424021e+0
4
Dual infeasibility......: 6.4763639048016211e-11 6.4763639048016204e-0
8
Constraint violation....: 1.3764545059302691e-12 1.3764545059302691e-1
2
Complementarity.........: 3.6107661046596899e-09 3.6107661046596897e-0
6
Overall NLP error.......: 3.6107661046596899e-09 3.6107661046596897e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8776327e+02 9.19e+03 5.24e+01 -1.0 9.28e+03 - 6.64e-04 9.80e-0
3h 1
2 8.8487848e+02 9.19e+03 5.24e+01 -1.0 8.49e+03 - 4.35e-05 1.07e-0
4h 1
3 8.1017700e+02 9.15e+03 5.24e+01 -1.0 9.19e+03 - 1.14e-05 4.07e-0
3h 1
4 4.8829987e+02 8.96e+03 5.23e+01 -1.0 9.15e+03 - 4.62e-03 2.12e-0
2h 1
5 1.9624072e+04 6.67e-02 7.88e+01 -1.0 8.96e+03 - 7.36e-02 1.00e+0
0h 1
6 1.2613352e+04 6.06e-02 4.34e+01 -1.0 5.13e+01 - 4.30e-01 8.42e-0
2f 1
7 1.1287964e+04 2.91e-02 1.67e+01 -1.0 2.55e+01 - 6.00e-01 4.84e-0
1f 1
8 1.0844638e+04 5.12e-03 9.75e-01 -1.0 9.16e+00 - 9.34e-01 7.59e-0
1f 1
9 1.1096445e+04 1.87e-04 6.07e-02 -1.0 4.66e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.0465431e+04 2.23e-03 8.01e-02 -2.5 4.76e+00 - 8.70e-01 8.69e-0
1f 1
11 1.0359674e+04 1.08e-03 4.55e-01 -2.5 7.61e-01 - 1.00e+00 6.04e-0
1f 1
12 1.0359707e+04 2.49e-06 8.14e-03 -2.5 1.53e-01 - 1.00e+00 1.00e+0
0h 1
13 1.0339422e+04 6.17e-06 2.39e-02 -3.8 5.36e+00 - 9.14e-01 8.89e-0
1f 1
14 1.0335906e+04 4.60e-04 4.72e-04 -3.8 5.91e-01 - 1.00e+00 1.00e+0
0f 1
15 1.0334764e+04 6.26e-05 1.12e-02 -5.7 2.97e-01 - 8.14e-01 1.00e+0
0h 1
16 1.0334651e+04 3.51e-05 3.92e-05 -5.7 9.55e-03 - 1.00e+00 1.00e+0
0h 1
17 1.0334652e+04 1.18e-06 1.11e-05 -5.7 1.44e-03 - 1.00e+00 9.97e-0
1h 1
18 1.0334638e+04 2.43e-09 9.98e-08 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
19 1.0334638e+04 3.63e-15 3.66e-14 -8.6 2.91e-07 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.0334637950596091e+01 1.0334637950596090e+0
4
Dual infeasibility......: 3.6599096405356140e-14 3.6599096405356140e-1
1
Constraint violation....: 3.6322999416124493e-15 3.6322999416124493e-1
5
Complementarity.........: 2.5409556339795792e-09 2.5409556339795790e-0
6
Overall NLP error.......: 2.5409556339795792e-09 2.5409556339795790e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3710605e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 3.06e-03 9.80e-0
3h 1
2 9.3410771e+02 6.71e+03 5.23e+01 -1.0 6.33e+03 - 5.53e-05 1.05e-0
4h 1
3 8.7601628e+02 6.69e+03 5.23e+01 -1.0 6.70e+03 - 8.90e-06 2.62e-0
3f 1
4 4.4078555e+02 6.54e+03 5.23e+01 -1.0 6.69e+03 - 3.32e-03 2.17e-0
2h 1
5 1.7952487e+04 7.75e-02 7.79e+01 -1.0 6.54e+03 - 7.84e-02 1.00e+0
0h 1
6 1.1162158e+04 7.00e-02 2.30e+01 -1.0 4.32e+00 - 6.80e-01 8.97e-0
2f 1
7 1.0161093e+04 3.32e-02 7.43e+00 -1.0 4.23e+00 - 7.42e-01 1.00e+0
0f 1
8 1.0283900e+04 1.70e-02 7.27e-01 -1.0 1.10e+00 - 9.96e-01 4.94e-0
1f 2
9 1.0000013e+04 8.27e-03 3.35e-01 -1.7 1.28e+01 - 1.00e+00 8.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.9361941e+03 1.02e-03 1.04e-01 -1.7 8.95e+00 - 1.00e+00 1.00e+0
0f 1
11 9.8169976e+03 2.77e-04 1.12e-01 -2.5 1.73e+01 - 9.89e-01 8.85e-0
1f 1
12 9.8069007e+03 4.94e-06 1.10e-03 -2.5 1.95e+00 - 1.00e+00 1.00e+0
0f 1
13 9.7851225e+03 5.56e-06 7.61e-04 -3.8 2.68e+00 - 1.00e+00 1.00e+0
0f 1
14 9.7842068e+03 3.44e-09 3.52e-06 -5.7 1.48e-01 - 1.00e+00 1.00e+0
0h 1
15 9.7841926e+03 2.34e-12 4.09e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 9.7841925745913816e+00 9.7841925745913813e+0
3
Dual infeasibility......: 4.0868873994108317e-10 4.0868873994108317e-0
7
Constraint violation....: 2.3424456818688100e-12 2.3424456818688100e-1
2
Complementarity.........: 2.5729802584916608e-09 2.5729802584916606e-0
6
Overall NLP error.......: 2.5729802584916608e-09 2.5729802584916606e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8772454e+02 4.77e+03 5.24e+01 -1.0 4.82e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8463069e+02 4.77e+03 5.24e+01 -1.0 4.12e+03 - 4.65e-05 1.15e-0
4h 1
3 6.9026546e+02 4.73e+03 5.24e+01 -1.0 4.77e+03 - 2.20e-05 8.53e-0
3f 1
4 4.0829906e+02 4.63e+03 5.20e+01 -1.0 4.73e+03 - 1.12e-02 2.07e-0
2h 1
5 1.3286162e+04 7.24e-02 7.77e+01 -1.0 4.63e+03 - 9.89e-02 1.00e+0
0h 1
6 7.8843055e+03 6.35e-02 2.09e+01 -1.0 4.48e+01 - 7.03e-01 1.14e-0
1f 1
7 6.3730704e+03 2.46e-02 2.05e+00 -1.0 2.21e+01 - 9.31e-01 6.56e-0
1f 1
8 6.5551438e+03 3.66e-03 9.18e-01 -1.0 3.60e+00 - 6.07e-01 1.00e+0
0f 1
9 6.0463671e+03 1.23e-03 2.66e-01 -1.7 3.64e+00 - 8.35e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0517022e+03 6.57e-04 3.87e-01 -1.7 7.65e+00 - 6.39e-01 1.00e+0
0h 1
11 6.0601728e+03 7.79e-06 5.65e-02 -1.7 1.19e+01 - 8.11e-01 1.00e+0
0h 1
12 5.9510656e+03 1.65e-04 3.95e-01 -2.5 1.56e+01 - 1.00e+00 6.77e-0
1f 1
13 5.9402761e+03 6.33e-06 9.40e-03 -2.5 8.75e+00 - 1.00e+00 1.00e+0
0f 1
14 5.9216846e+03 9.10e-06 3.91e-02 -3.8 5.36e+00 - 8.64e-01 9.09e-0
1f 1
15 5.9184407e+03 5.07e-04 9.83e-04 -3.8 4.87e-01 - 1.00e+00 1.00e+0
0f 1
16 5.9173040e+03 5.44e-05 1.03e-02 -5.7 2.97e-01 - 8.32e-01 1.00e+0
0h 1
17 5.9171980e+03 3.17e-05 3.48e-05 -5.7 9.03e-03 - 1.00e+00 1.00e+0
0h 1
18 5.9172014e+03 4.80e-07 6.10e-06 -5.7 1.05e-03 - 1.00e+00 1.00e+0
0h 1
19 5.9171874e+03 3.25e-08 7.71e-05 -8.6 3.68e-03 - 1.00e+00 9.44e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 5.9171865e+03 7.33e-12 6.33e-11 -8.6 2.05e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 5.9171865451349444e+00 5.9171865451349440e+0
3
Dual infeasibility......: 6.3278841199884224e-11 6.3278841199884224e-0
8
Constraint violation....: 7.3299144531802085e-12 7.3299144531802085e-1
2
Complementarity.........: 2.8735097025496894e-09 2.8735097025496892e-0
6
Overall NLP error.......: 2.8735097025496894e-09 2.8735097025496892e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9469463e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3h 1
2 8.9070845e+02 3.24e+03 5.24e+01 -1.0 2.13e+03 - 3.61e-05 1.51e-0
4h 1
3 3.3042115e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 6.40e-05 2.31e-0
2f 1
4 1.5680539e+04 6.28e-02 8.02e+01 -1.0 3.17e+03 - 3.82e-02 1.00e+0
0h 1
5 7.1096017e+03 5.94e-02 5.80e+01 -1.0 5.03e+01 - 2.72e-01 4.93e-0
2f 1
6 5.7281758e+03 2.48e-02 2.85e+01 -1.0 2.32e+01 - 5.13e-01 5.39e-0
1f 1
7 5.1166765e+03 1.01e-02 1.45e+00 -1.0 8.86e+00 - 9.34e-01 7.73e-0
1f 1
8 5.4253179e+03 3.01e-04 8.55e-02 -1.0 3.30e+00 - 1.00e+00 1.00e+0
0f 1
9 4.8000123e+03 2.08e-03 7.84e-02 -2.5 5.01e+00 - 8.62e-01 8.55e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.6289686e+03 2.21e-03 3.37e-01 -2.5 1.04e+00 - 1.00e+00 7.83e-0
1f 1
11 4.6028030e+03 1.45e-04 4.54e-03 -2.5 1.98e-01 - 1.00e+00 1.00e+0
0h 1
12 4.5779283e+03 2.15e-05 4.19e-02 -3.8 8.05e+00 - 1.00e+00 8.86e-0
1h 1
13 4.5759312e+03 5.61e-08 5.97e-04 -3.8 9.12e-01 - 1.00e+00 1.00e+0
0f 1
14 4.5743283e+03 4.27e-08 6.52e-05 -5.7 4.46e-01 - 1.00e+00 9.98e-0
1f 1
15 4.5743286e+03 1.89e-12 1.39e-08 -5.7 1.07e-03 - 1.00e+00 1.00e+0
0f 1
16 4.5743102e+03 2.57e-12 3.30e-06 -8.6 5.53e-03 - 1.00e+00 9.99e-0
1f 1
17 4.5743102e+03 1.65e-15 4.85e-14 -8.6 3.21e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 4.5743101963887938e+00 4.5743101963887939e+0
3
Dual infeasibility......: 4.8497627726810873e-14 4.8497627726810873e-1
1
Constraint violation....: 1.6500839469504375e-15 1.6500839469504375e-1
5
Complementarity.........: 2.5411480264146048e-09 2.5411480264146049e-0
6
Overall NLP error.......: 2.5411480264146048e-09 2.5411480264146049e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8047271e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.82e-0
3h 1
2 8.7571780e+02 2.00e+03 5.24e+01 -1.0 1.11e+03 - 4.57e-05 1.77e-0
4h 1
3 2.9373644e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 9.83e-05 2.27e-0
2f 1
4 1.4280611e+04 6.09e-02 7.92e+01 -1.0 1.95e+03 - 5.49e-02 1.00e+0
0h 1
5 5.5544141e+03 5.66e-02 5.35e+01 -1.0 6.57e+01 - 3.12e-01 6.38e-0
2f 1
6 4.1958834e+03 3.11e-02 2.65e+01 -1.0 3.24e+01 - 4.93e-01 4.18e-0
1f 1
7 3.3759781e+03 1.36e-02 2.17e+00 -1.0 1.11e+01 - 9.19e-01 9.26e-0
1f 1
8 3.8304846e+03 4.15e-04 1.06e-01 -1.0 5.03e+00 - 9.97e-01 1.00e+0
0f 1
9 3.1581618e+03 1.16e-03 3.31e-01 -1.7 4.57e+01 - 8.19e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.1973111e+03 1.21e-05 1.36e-02 -1.7 1.11e+01 - 1.00e+00 1.00e+0
0h 1
11 3.0812330e+03 2.34e-05 6.04e-01 -3.8 6.01e+01 - 9.63e-01 6.99e-0
1f 1
12 3.0448685e+03 4.02e-04 1.51e-01 -3.8 1.76e+01 - 7.02e-01 1.00e+0
0f 1
13 3.0405770e+03 2.39e-03 4.95e-03 -3.8 6.15e-02 - 1.00e+00 1.00e+0
0h 1
14 3.0407895e+03 2.33e-05 9.09e-05 -3.8 7.08e-03 - 1.00e+00 1.00e+0
0h 1
15 3.0392724e+03 1.32e-04 1.14e-03 -5.7 4.46e-01 - 9.17e-01 1.00e+0
0h 1
16 3.0392312e+03 3.18e-05 6.88e-06 -5.7 8.31e-03 - 1.00e+00 1.00e+0
0h 1
17 3.0392359e+03 2.56e-07 3.52e-06 -5.7 7.30e-04 - 1.00e+00 1.00e+0
0h 1
18 3.0392191e+03 3.03e-08 3.45e-05 -8.6 5.53e-03 - 1.00e+00 9.56e-0
1h 1
19 3.0392184e+03 4.62e-12 5.46e-11 -8.6 2.42e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 3.0392183915416253e+00 3.0392183915416254e+0
3
Dual infeasibility......: 5.4554368613332009e-11 5.4554368613332009e-0
8
Constraint violation....: 4.6151971133667757e-12 4.6151971133667757e-1
2
Complementarity.........: 2.9502553544799373e-09 2.9502553544799373e-0
6
Overall NLP error.......: 2.9502553544799373e-09 2.9502553544799373e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6513656e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 4.97e-04 9.88e-0
3h 1
2 8.4530680e+02 9.17e+02 5.24e+01 -1.0 7.94e+02 - 1.00e-04 7.33e-0
4h 1
3 7.7732358e+02 9.14e+02 5.24e+01 -1.0 9.17e+02 - 7.11e-04 2.57e-0
3h 1
4 2.6899855e+02 8.95e+02 5.24e+01 -1.0 9.15e+02 - 3.47e-03 2.14e-0
2f 1
5 1.1246095e+04 6.32e-02 8.04e+01 -1.0 8.95e+02 - 5.91e-02 1.00e+0
0h 1
6 4.1043495e+03 5.84e-02 4.64e+01 -1.0 6.47e+01 - 4.08e-01 7.07e-0
2f 1
7 2.5373842e+03 3.04e-02 2.16e+01 -1.0 3.75e+01 - 5.25e-01 4.45e-0
1f 1
8 2.1261287e+03 1.21e-02 1.93e+00 -1.0 1.04e+01 - 9.23e-01 1.00e+0
0f 1
9 2.3647204e+03 4.01e-04 1.42e-01 -1.0 4.25e+00 - 9.45e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8960248e+03 5.00e-04 7.28e-01 -2.5 7.03e+00 - 8.95e-01 6.15e-0
1f 1
11 1.8173277e+03 2.39e-04 8.84e-01 -2.5 5.67e+00 - 7.50e-01 1.00e+0
0f 1
12 1.7894652e+03 5.30e-04 1.01e-02 -2.5 3.95e+00 - 1.00e+00 1.00e+0
0h 1
13 1.7624752e+03 2.18e-03 5.94e-02 -3.8 1.35e+01 - 7.10e-01 1.00e+0
0h 1
14 1.7588746e+03 3.98e-03 1.60e-03 -3.8 4.31e-01 - 9.72e-01 1.00e+0
0h 1
15 1.7591097e+03 7.58e-05 2.49e-04 -3.8 1.53e-02 - 1.00e+00 1.00e+0
0h 1
16 1.7572117e+03 1.10e-04 4.79e-04 -5.7 7.46e-01 - 9.46e-01 9.80e-0
1h 1
17 1.7571928e+03 2.83e-05 4.37e-03 -5.7 1.33e-02 - 1.00e+00 7.44e-0
1h 1
18 1.7571953e+03 1.09e-08 1.45e-06 -5.7 3.40e-03 - 1.00e+00 1.00e+0
0f 1
19 1.7571733e+03 9.26e-09 2.00e-05 -8.6 9.21e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7571729e+03 1.42e-12 6.99e-11 -8.6 1.56e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.7571729206127900e+00 1.7571729206127900e+0
3
Dual infeasibility......: 6.9938539532292620e-11 6.9938539532292627e-0
8
Constraint violation....: 1.4189760477734126e-12 1.4189760477734126e-1
2
Complementarity.........: 2.7900816770582988e-09 2.7900816770582988e-0
6
Overall NLP error.......: 2.7900816770582988e-09 2.7900816770582988e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101443e-01 6.4890146112101445e+0
2
Dual infeasibility......: 4.9126605653154236e-09 4.9126605653154236e-0
6
Constraint violation....: 6.2123811650494076e-09 6.2123811650494076e-0
9
Complementarity.........: 4.3646094984826291e-09 4.3646094984826293e-0
6
Overall NLP error.......: 6.2123811650494076e-09 4.9126605653154236e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318724752505e-09 2.1031318724752505e-0
6
Constraint violation....: 6.2994442995290001e-11 6.2994442995290001e-1
1
Complementarity.........: 2.8882108897038180e-09 2.8882108897038180e-0
6
Overall NLP error.......: 2.8882108897038180e-09 2.8882108897038180e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101443e-01 6.4890146112101445e+0
2
Dual infeasibility......: 4.9126605653154236e-09 4.9126605653154236e-0
6
Constraint violation....: 6.2123811650494076e-09 6.2123811650494076e-0
9
Complementarity.........: 4.3646094984826291e-09 4.3646094984826293e-0
6
Overall NLP error.......: 6.2123811650494076e-09 4.9126605653154236e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.06e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.11e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235660158e+00 1.6104063235660158e+0
3
Dual infeasibility......: 2.4574495516333908e-12 2.4574495516333908e-0
9
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5062163919681806e-09 2.5062163919681808e-0
6
Overall NLP error.......: 2.5062163919681806e-09 2.5062163919681808e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2278083e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 3.31e-04 9.87e-0
3h 1
2 8.0391474e+02 9.17e+02 5.24e+01 -1.0 7.85e+02 - 8.87e-05 6.88e-0
4h 1
3 2.4271271e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 6.68e-04 2.10e-0
2h 1
4 1.2385916e+04 5.52e-02 8.23e+01 -1.0 8.98e+02 - 3.86e-02 1.00e+0
0h 1
5 3.8851959e+03 5.26e-02 5.59e+01 -1.0 8.06e+01 - 3.19e-01 5.02e-0
2f 1
6 1.9099004e+03 3.73e-02 2.99e+01 -1.0 3.93e+01 - 4.69e-01 5.04e-0
1f 1
7 4.6737272e+03 1.22e-02 2.67e+01 -1.0 2.06e+01 - 4.01e-01 1.00e+0
0h 1
8 1.8754601e+03 1.19e-02 1.01e+00 -1.0 2.53e+01 - 9.88e-01 8.94e-0
1f 1
9 2.0005994e+03 1.84e-04 4.66e-02 -1.0 3.18e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7351413e+03 2.16e-04 1.24e+00 -2.5 1.71e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5469297e+03 3.76e-03 1.33e-01 -2.5 7.60e+00 - 7.95e-01 1.00e+0
0f 1
12 1.5237159e+03 5.30e-03 3.11e-01 -2.5 1.84e+00 - 1.00e+00 7.66e-0
1h 1
13 1.5360639e+03 2.44e-04 4.74e-03 -2.5 7.11e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5034784e+03 1.70e-04 2.15e-02 -3.8 1.62e+01 - 9.91e-01 9.29e-0
1h 1
15 1.5021214e+03 7.21e-07 6.83e-05 -3.8 1.10e+00 - 1.00e+00 1.00e+0
0h 1
16 1.5003172e+03 3.77e-07 1.78e-04 -5.7 8.92e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003154e+03 3.79e-11 2.92e-09 -5.7 4.18e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.11e-02 - 1.00e+00 1.00e+0
0h 1
1 8.6534772e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 4.97e-04 9.87e-0
3h 1
2 8.4418057e+02 9.17e+02 5.24e+01 -1.0 8.02e+02 - 8.70e-05 7.83e-0
4h 1
3 2.6276094e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 7.65e-04 2.20e-0
2h 1
4 1.2724514e+04 5.99e-02 8.02e+01 -1.0 8.97e+02 - 5.06e-02 1.00e+0
0h 1
5 4.2755874e+03 5.59e-02 5.32e+01 -1.0 7.28e+01 - 3.26e-01 6.05e-0
2f 1
35 1.557557e+04 1.632511e+04 3.589511e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2432143e+02 1.57e+04 5.24e+01 -1.0 1.59e+04 - 3.31e-04 9.81e-0
3h 1
2 8.2109446e+02 1.57e+04 5.24e+01 -1.0 1.17e+04 - 1.72e-05 1.33e-0
4h 1
3 8.1475064e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 3.85e-05 5.10e-0
4h 1
4 7.6046036e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 5.44e-04 4.53e-0
3h 1
5 6.2900535e+02 1.53e+04 5.24e+01 -1.0 1.57e+04 - 5.55e-03 2.03e-0
2f 1
6 2.4951450e+04 5.98e-02 8.27e+01 -1.0 1.53e+04 - 4.74e-02 1.00e+0
0h 1
7 1.8484725e+04 5.58e-02 5.01e+01 -1.0 6.39e+01 - 5.10e-01 6.21e-0
2f 1
8 1.6709099e+04 3.81e-02 2.57e+01 -1.0 3.83e+01 - 5.41e-01 4.87e-0
1f 1
9 1.7191712e+04 1.45e-02 1.30e+01 -1.0 6.00e+00 - 8.15e-01 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6879409e+04 3.05e-03 1.49e+00 -1.0 4.31e+00 - 3.47e-01 1.00e+0
0f 1
11 1.6861550e+04 1.17e-04 9.38e-01 -1.0 2.25e+00 - 5.62e-01 1.00e+0
0f 1
12 1.6860472e+04 4.24e-06 3.80e-01 -1.0 5.19e+00 - 6.47e-01 1.00e+0
0f 1
13 1.6552478e+04 2.50e-04 2.94e-01 -1.7 5.27e+00 - 8.53e-01 7.64e-0
1f 1
14 1.6502273e+04 5.54e-04 2.93e-01 -1.7 1.58e+01 - 6.90e-01 1.00e+0
0f 1
15 1.6517290e+04 9.68e-05 8.65e-02 -1.7 3.09e+01 - 6.68e-01 1.00e+0
0h 1
16 1.6380004e+04 1.06e-03 6.14e-02 -2.5 3.57e+01 - 9.11e-01 1.00e+0
0f 1
17 1.6350621e+04 1.31e-03 1.50e-02 -2.5 1.04e+01 - 1.00e+00 1.00e+0
0h 1
18 1.6329105e+04 2.36e-04 1.07e-01 -3.8 1.17e+01 - 1.00e+00 8.33e-0
1h 1
19 1.6326629e+04 4.86e-07 1.27e-04 -3.8 1.43e+00 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325122e+04 4.02e-07 1.61e-04 -5.7 5.91e-01 - 1.00e+00 9.97e-0
1h 1
21 1.6325123e+04 3.87e-11 2.92e-09 -5.7 7.91e-04 - 1.00e+00 1.00e+0
0f 1
22 1.6325106e+04 5.74e-11 2.73e-05 -8.6 7.33e-03 - 1.00e+00 9.58e-0
1h 1
23 1.6325105e+04 1.11e-13 3.85e-12 -8.6 1.33e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 23
(scaled) (unscaled)
Objective...............: 1.6325105203842440e+01 1.6325105203842440e+0
4
Dual infeasibility......: 3.8530623650248928e-12 3.8530623650248928e-0
9
Constraint violation....: 1.1142475830894227e-13 1.1142475830894227e-1
3
Complementarity.........: 9.0489020964544730e-09 9.0489020964544720e-0
6
Overall NLP error.......: 9.0489020964544730e-09 9.0489020964544720e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 24
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 24
Number of inequality constraint Jacobian evaluations = 24
Number of Lagrangian Hessian evaluations = 23
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9092977e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 6.99e-04 9.80e-0
3h 1
2 8.8817884e+02 1.50e+04 5.24e+01 -1.0 1.47e+04 - 8.73e-05 1.01e-0
4h 1
3 8.8019535e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 2.96e-06 6.36e-0
4f 1
4 6.0281933e+02 1.46e+04 5.25e+01 -1.0 1.50e+04 - 6.80e-04 2.27e-0
2h 1
5 2.7061250e+04 6.30e-02 7.83e+01 -1.0 1.46e+04 - 6.43e-02 1.00e+0
0h 1
6 1.8630005e+04 5.80e-02 5.03e+01 -1.0 5.45e+01 - 3.42e-01 7.26e-0
2f 1
7 1.7334783e+04 2.88e-02 2.29e+01 -1.0 2.56e+01 - 5.35e-01 4.63e-0
1f 1
8 1.6727092e+04 8.82e-03 1.18e+00 -1.0 9.84e+00 - 9.28e-01 7.64e-0
1f 1
9 1.7008792e+04 3.29e-04 8.10e-02 -1.0 3.33e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6382322e+04 2.09e-03 8.12e-02 -2.5 4.87e+00 - 8.66e-01 8.50e-0
1f 1
11 1.6202338e+04 2.17e-03 2.02e-01 -2.5 1.04e+00 - 1.00e+00 8.35e-0
1f 1
12 1.6185689e+04 8.56e-05 3.85e-03 -2.5 1.46e-01 - 1.00e+00 1.00e+0
0h 1
13 1.6174722e+04 4.57e-05 1.10e+00 -3.8 2.68e+00 - 1.00e+00 4.97e-0
1h 1
14 1.6171406e+04 3.44e-07 1.13e-01 -3.8 1.35e+00 - 9.68e-01 1.00e+0
0f 1
15 1.6170371e+04 1.54e-08 1.79e-03 -3.8 3.29e-02 - 1.00e+00 1.00e+0
0H 1
16 1.6170569e+04 1.15e-05 2.77e-04 -3.8 3.78e-03 - 1.00e+00 1.00e+0
0f 1
17 1.6169803e+04 1.86e-06 6.31e-02 -5.7 1.49e-01 - 7.77e-01 9.69e-0
1h 1
18 1.6169630e+04 1.24e-05 2.12e-04 -5.7 5.04e-03 - 1.00e+00 1.00e+0
0f 1
19 1.6169636e+04 2.69e-08 2.12e-06 -5.7 2.56e-04 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6169621e+04 2.73e-08 7.73e-06 -8.6 1.84e-03 - 9.82e-01 9.88e-0
1h 1
21 1.6169621e+04 2.92e-13 3.32e-11 -8.6 2.21e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.6169621190174638e+01 1.6169621190174637e+0
4
Dual infeasibility......: 3.3197872653785732e-11 3.3197872653785732e-0
8
Constraint violation....: 2.9176661087149114e-13 2.9176661087149114e-1
3
Complementarity.........: 2.5121396876219042e-09 2.5121396876219040e-0
6
Overall NLP error.......: 2.5121396876219042e-09 2.5121396876219040e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6663632e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 4.97e-04 9.80e-0
3h 1
2 8.6385551e+02 1.39e+04 5.24e+01 -1.0 1.37e+04 - 9.10e-05 1.01e-0
4h 1
3 8.5474456e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 3.12e-06 6.56e-0
4f 1
4 5.5736289e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 7.05e-04 2.21e-0
2h 1
5 2.5729005e+04 5.98e-02 8.02e+01 -1.0 1.36e+04 - 5.05e-02 1.00e+0
0h 1
6 1.7257833e+04 5.58e-02 5.33e+01 -1.0 7.29e+01 - 3.25e-01 6.04e-0
2f 1
7 1.5669674e+04 3.02e-02 2.77e+01 -1.0 3.88e+01 - 4.75e-01 4.33e-0
1f 1
8 1.5391032e+04 1.45e-02 2.54e+00 -1.0 1.10e+01 - 9.18e-01 5.00e-0
1f 2
9 1.5231410e+04 7.14e-03 1.81e+00 -1.0 7.85e+00 - 1.00e+00 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5334693e+04 5.59e-04 4.23e-02 -1.0 9.95e+01 - 1.00e+00 1.00e+0
0f 1
11 1.4902809e+04 4.46e-04 9.63e-01 -2.5 9.82e+01 - 9.17e-01 5.84e-0
1f 1
12 1.4780239e+04 2.23e-04 2.20e-01 -2.5 4.04e+01 - 9.25e-01 1.00e+0
0f 1
13 1.4754279e+04 3.09e-03 1.97e-02 -2.5 1.15e+00 - 1.00e+00 1.00e+0
0h 1
14 1.4740982e+04 8.07e-04 3.65e-02 -3.8 2.68e+00 - 8.02e-01 1.00e+0
0h 1
15 1.4738047e+04 2.15e-03 1.02e-03 -3.8 4.89e-02 - 1.00e+00 1.00e+0
0h 1
16 1.4738260e+04 4.87e-05 1.38e-04 -3.8 1.22e-02 - 1.00e+00 1.00e+0
0h 1
17 1.4736958e+04 1.01e-04 3.31e-04 -5.7 1.49e-01 - 9.50e-01 9.74e-0
1h 1
18 1.4736943e+04 2.31e-05 3.85e-03 -5.7 3.81e-03 - 1.00e+00 7.72e-0
1h 1
19 1.4736946e+04 9.00e-09 1.28e-06 -5.7 8.67e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.4736932e+04 9.08e-09 1.93e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
21 1.4736931e+04 1.37e-12 6.54e-11 -8.6 3.06e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.4736931409137306e+01 1.4736931409137305e+0
4
Dual infeasibility......: 6.5446542832867271e-11 6.5446542832867271e-0
8
Constraint violation....: 1.3696821454800556e-12 1.3696821454800556e-1
2
Complementarity.........: 2.5092871219101181e-09 2.5092871219101183e-0
6
Overall NLP error.......: 2.5092871219101181e-09 2.5092871219101183e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8073105e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.97e-04 9.80e-0
3h 1
2 8.7796146e+02 1.27e+04 5.24e+01 -1.0 1.24e+04 - 8.93e-05 1.01e-0
4h 1
3 8.6692458e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 3.47e-06 7.37e-0
4f 1
4 5.4092019e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 7.99e-04 2.24e-0
2h 1
5 2.4576710e+04 6.17e-02 7.93e+01 -1.0 1.24e+04 - 5.67e-02 1.00e+0
0h 1
6 1.6171478e+04 5.73e-02 5.23e+01 -1.0 6.39e+01 - 3.28e-01 6.59e-0
2f 1
7 1.4812866e+04 3.11e-02 2.54e+01 -1.0 3.21e+01 - 5.03e-01 4.22e-0
1f 1
8 1.4040427e+04 1.14e-02 2.00e+00 -1.0 1.10e+01 - 9.20e-01 9.11e-0
1f 1
9 1.4460004e+04 3.38e-04 9.28e-02 -1.0 4.85e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3750291e+04 1.39e-03 7.06e-02 -2.5 6.50e+00 - 8.71e-01 8.55e-0
1f 1
11 1.3727058e+04 1.41e-05 1.70e-02 -2.5 6.60e-01 - 1.00e+00 1.00e+0
0h 1
12 1.3695913e+04 1.35e-03 3.69e-02 -3.8 2.68e+00 - 7.12e-01 1.00e+0
0f 1
13 1.3693938e+04 9.56e-04 1.56e-03 -3.8 3.41e-02 - 9.61e-01 1.00e+0
0h 1
14 1.3694087e+04 1.22e-04 1.32e-04 -3.8 1.60e-02 - 1.00e+00 1.00e+0
0h 1
15 1.3692879e+04 1.38e-04 1.17e-03 -5.7 1.49e-01 - 9.16e-01 1.00e+0
0h 1
16 1.3692835e+04 3.55e-05 7.55e-06 -5.7 8.77e-03 - 1.00e+00 1.00e+0
0h 1
17 1.3692839e+04 4.36e-07 4.70e-06 -5.7 9.55e-04 - 1.00e+00 1.00e+0
0h 1
18 1.3692826e+04 3.62e-08 4.80e-05 -8.6 1.84e-03 - 1.00e+00 9.49e-0
1h 1
19 1.3692826e+04 6.54e-12 6.63e-11 -8.6 9.47e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.3692825520278392e+01 1.3692825520278391e+0
4
Dual infeasibility......: 6.6307839230485711e-11 6.6307839230485711e-0
8
Constraint violation....: 6.5409899718815723e-12 6.5409899718815723e-1
2
Complementarity.........: 2.5095397414796277e-09 2.5095397414796277e-0
6
Overall NLP error.......: 2.5095397414796277e-09 2.5095397414796277e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6662389e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 4.97e-04 9.80e-0
3h 1
2 8.6375901e+02 1.11e+04 5.24e+01 -1.0 1.04e+04 - 4.51e-05 1.05e-0
4h 1
3 8.1247868e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 9.09e-06 3.08e-0
3h 1
4 5.1271376e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 3.39e-03 2.10e-0
2h 1
5 2.1781269e+04 6.25e-02 8.04e+01 -1.0 1.09e+04 - 5.65e-02 1.00e+0
0h 1
6 1.4355473e+04 5.79e-02 4.85e+01 -1.0 6.64e+01 - 3.84e-01 6.77e-0
2f 1
7 1.2780687e+04 3.04e-02 2.34e+01 -1.0 3.79e+01 - 5.09e-01 4.42e-0
1f 1
8 1.2333284e+04 1.27e-02 2.11e+00 -1.0 1.05e+01 - 9.22e-01 1.00e+0
0f 1
9 1.2590751e+04 3.91e-04 7.29e-02 -1.0 4.30e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2099307e+04 5.08e-04 6.40e-01 -2.5 7.12e+00 - 8.93e-01 6.41e-0
1f 1
11 1.2017941e+04 2.37e-04 3.82e-01 -2.5 2.45e+00 - 8.88e-01 1.00e+0
0h 1
12 1.1994709e+04 6.02e-03 2.19e-01 -2.5 1.69e+00 - 1.00e+00 6.03e-0
1h 1
13 1.1985170e+04 7.03e-04 5.56e-03 -2.5 4.75e-01 - 1.00e+00 1.00e+0
0f 1
14 1.1966692e+04 1.15e-03 2.92e-02 -3.8 5.36e+00 - 8.09e-01 1.00e+0
0h 1
15 1.1963688e+04 2.25e-03 1.06e-03 -3.8 4.73e-02 - 1.00e+00 1.00e+0
0h 1
16 1.1964070e+04 4.49e-05 1.48e-04 -3.8 1.50e-02 - 1.00e+00 1.00e+0
0h 1
17 1.1962598e+04 1.05e-04 4.27e-04 -5.7 2.97e-01 - 9.51e-01 9.82e-0
1h 1
18 1.1962590e+04 2.18e-05 3.56e-03 -5.7 5.37e-03 - 1.00e+00 7.94e-0
1h 1
19 1.1962593e+04 8.54e-09 1.12e-06 -5.7 1.11e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.1962577e+04 8.97e-09 1.93e-05 -8.6 3.68e-03 - 1.00e+00 9.83e-0
1h 1
21 1.1962576e+04 1.38e-12 6.48e-11 -8.6 6.12e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.1962576491431372e+01 1.1962576491431371e+0
4
Dual infeasibility......: 6.4763639507680477e-11 6.4763639507680471e-0
8
Constraint violation....: 1.3765655282327316e-12 1.3765655282327316e-1
2
Complementarity.........: 3.3189532606670451e-09 3.3189532606670450e-0
6
Overall NLP error.......: 3.3189532606670451e-09 3.3189532606670450e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0890313e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0580412e+02 9.19e+03 5.23e+01 -1.0 7.60e+03 - 2.53e-05 1.20e-0
4h 1
3 6.0977303e+02 9.04e+03 5.24e+01 -1.0 9.19e+03 - 2.50e-05 1.62e-0
2h 1
4 7.3775410e+02 8.79e+03 5.16e+01 -1.0 9.04e+03 - 1.91e-02 2.80e-0
2h 1
5 1.6473471e+04 8.05e-02 7.71e+01 -1.0 8.79e+03 - 1.08e-01 1.00e+0
0h 1
6 1.2523404e+04 6.93e-02 1.94e+01 -1.0 2.11e+01 - 7.28e-01 1.32e-0
1f 1
7 1.1378990e+04 1.42e-02 9.47e-01 -1.0 1.26e+01 - 9.48e-01 8.00e-0
1f 1
8 1.1688198e+04 1.32e-02 7.03e-01 -1.0 5.96e+00 - 2.55e-01 9.06e-0
1f 1
9 1.1276559e+04 2.89e-03 2.91e-01 -1.7 2.79e+00 - 8.70e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1254859e+04 8.02e-04 3.91e-01 -1.7 9.15e+00 - 7.34e-01 1.00e+0
0h 1
11 1.1289917e+04 1.02e-05 1.40e-01 -1.7 1.92e+01 - 7.44e-01 1.00e+0
0f 1
12 1.1127811e+04 4.70e-04 3.07e-02 -2.5 2.04e+01 - 9.74e-01 9.34e-0
1f 1
13 1.1113097e+04 2.29e-05 2.07e-03 -2.5 7.92e+00 - 1.00e+00 1.00e+0
0f 1
14 1.1088295e+04 1.29e-05 6.11e-02 -3.8 8.11e+00 - 1.00e+00 8.44e-0
1f 1
15 1.1084886e+04 5.05e-08 2.75e-04 -3.8 1.26e+00 - 1.00e+00 1.00e+0
0f 1
16 1.1083359e+04 2.99e-08 1.20e-03 -5.7 4.46e-01 - 1.00e+00 9.83e-0
1f 1
17 1.1083339e+04 2.25e-12 1.57e-08 -5.7 7.57e-03 - 1.00e+00 1.00e+0
0f 1
18 1.1083321e+04 2.63e-12 4.48e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1083320738637470e+01 1.1083320738637469e+0
4
Dual infeasibility......: 4.4777017096090739e-09 4.4777017096090739e-0
6
Constraint violation....: 2.6315200019055851e-12 2.6315200019055851e-1
2
Complementarity.........: 3.8224513711478114e-09 3.8224513711478116e-0
6
Overall NLP error.......: 4.4777017096090739e-09 4.4777017096090739e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891119e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0611351e+02 6.71e+03 5.23e+01 -1.0 6.46e+03 - 8.39e-05 1.03e-0
4h 1
3 8.7440044e+02 6.70e+03 5.23e+01 -1.0 6.70e+03 - 6.84e-06 1.53e-0
3f 1
4 4.2534165e+02 6.54e+03 5.24e+01 -1.0 6.70e+03 - 1.83e-03 2.26e-0
2h 1
5 1.8469067e+04 6.74e-02 7.67e+01 -1.0 6.54e+03 - 8.35e-02 1.00e+0
0h 1
6 1.0609292e+04 6.07e-02 3.68e+01 -1.0 2.85e+01 - 4.94e-01 9.10e-0
2f 1
7 9.1070968e+03 1.97e-02 1.46e+01 -1.0 1.53e+01 - 6.26e-01 7.49e-0
1f 1
8 9.1804482e+03 5.62e-03 1.19e+00 -1.0 2.08e+00 - 9.93e-01 5.00e-0
1f 2
9 9.3751841e+03 2.91e-04 6.67e-02 -1.0 2.88e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.8198147e+03 2.22e-03 9.09e-02 -2.5 2.66e+01 - 8.56e-01 8.23e-0
1f 1
11 8.6513288e+03 2.12e-03 4.55e-01 -2.5 4.37e+00 - 1.00e+00 7.50e-0
1f 1
12 8.6223061e+03 1.56e-04 4.78e-03 -2.5 1.09e+00 - 1.00e+00 1.00e+0
0h 1
13 8.6058823e+03 4.18e-05 1.61e-01 -3.8 2.68e+00 - 1.00e+00 7.51e-0
1h 1
14 8.6015687e+03 1.44e-07 3.57e-04 -3.8 6.67e-01 - 1.00e+00 1.00e+0
0f 1
15 8.6003430e+03 2.79e-08 9.26e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 8.6003307e+03 1.87e-12 1.33e-08 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
17 8.6003159e+03 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 8.6003159229078729e+00 8.6003159229078719e+0
3
Dual infeasibility......: 4.4776952254380315e-09 4.4776952254380315e-0
6
Constraint violation....: 2.6309024403481374e-12 2.6309024403481374e-1
2
Complementarity.........: 3.6085002106138123e-09 3.6085002106138121e-0
6
Overall NLP error.......: 4.4776952254380315e-09 4.4776952254380315e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8769624e+02 4.77e+03 5.24e+01 -1.0 4.82e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8418913e+02 4.77e+03 5.24e+01 -1.0 3.56e+03 - 3.31e-05 1.33e-0
4h 1
3 3.6133643e+02 4.66e+03 5.25e+01 -1.0 4.77e+03 - 4.21e-05 2.30e-0
2f 1
4 1.7154392e+04 6.18e-02 8.10e+01 -1.0 4.66e+03 - 3.09e-02 1.00e+0
0h 1
5 8.5606749e+03 5.89e-02 6.28e+01 -1.0 5.79e+01 - 2.24e-01 4.28e-0
2f 1
6 7.0723371e+03 2.48e-02 3.20e+01 -1.0 2.57e+01 - 4.96e-01 5.40e-0
1f 1
7 6.3632320e+03 1.23e-02 2.18e+00 -1.0 9.60e+00 - 9.29e-01 8.90e-0
1f 1
8 6.7901981e+03 4.37e-04 9.74e-02 -1.0 4.08e+00 - 9.98e-01 1.00e+0
0f 1
9 6.0059382e+03 2.23e-03 2.20e-01 -2.5 5.68e+00 - 8.65e-01 9.65e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.9388863e+03 1.04e-03 6.17e-01 -2.5 1.01e+00 - 1.00e+00 5.72e-0
1h 1
11 5.9432442e+03 3.92e-06 8.28e-03 -2.5 4.56e-01 - 1.00e+00 1.00e+0
0h 1
12 5.9223336e+03 4.94e-06 4.04e-02 -3.8 8.04e+00 - 9.21e-01 8.83e-0
1f 1
13 5.9186052e+03 4.67e-04 5.92e-04 -3.8 9.38e-01 - 1.00e+00 1.00e+0
0f 1
14 5.9173166e+03 6.39e-05 1.15e-02 -5.7 4.46e-01 - 8.12e-01 1.00e+0
0h 1
15 5.9172009e+03 3.63e-05 4.14e-05 -5.7 9.71e-03 - 1.00e+00 1.00e+0
0h 1
16 5.9172026e+03 1.61e-06 4.52e-05 -5.7 1.47e-03 - 1.00e+00 9.88e-0
1h 1
17 5.9172051e+03 3.53e-08 5.15e-07 -5.7 2.92e-04 - 1.00e+00 1.00e+0
0f 1
18 5.9171869e+03 3.96e-08 7.27e-06 -8.6 5.53e-03 - 9.97e-01 9.81e-0
1h 1
19 5.9171865e+03 5.33e-13 2.97e-11 -8.6 1.06e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 5.9171865468617089e+00 5.9171865468617088e+0
3
Dual infeasibility......: 2.9739116213527963e-11 2.9739116213527963e-0
8
Constraint violation....: 5.3279602951761262e-13 5.3279602951761262e-1
3
Complementarity.........: 2.9677595539690797e-09 2.9677595539690797e-0
6
Overall NLP error.......: 2.9677595539690797e-09 2.9677595539690797e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2287642e+02 3.24e+03 5.23e+01 -1.0 3.27e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1570379e+02 3.24e+03 5.23e+01 -1.0 2.10e+03 - 2.38e-05 2.81e-0
4h 1
3 3.4600376e+02 3.17e+03 5.24e+01 -1.0 3.24e+03 - 1.97e-04 2.35e-0
2f 1
4 1.5844512e+04 6.83e-02 7.63e+01 -1.0 3.17e+03 - 7.93e-02 1.00e+0
0h 1
5 7.5150435e+03 6.18e-02 2.59e+01 -1.0 1.38e+01 - 6.27e-01 8.62e-0
2f 1
6 6.1543860e+03 2.18e-02 1.14e+01 -1.0 9.93e+00 - 6.43e-01 9.14e-0
1f 1
7 6.3961781e+03 2.56e-03 1.09e-01 -1.0 3.02e+00 - 9.91e-01 9.87e-0
1f 1
8 5.9626875e+03 2.64e-03 1.93e-01 -1.7 1.28e+01 - 9.34e-01 1.00e+0
0f 1
9 5.7850490e+03 1.68e-03 8.02e-02 -2.5 1.78e+00 - 8.03e-01 7.50e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.7498365e+03 4.12e-04 1.11e-01 -2.5 9.82e-01 - 1.00e+00 9.05e-0
1h 1
11 5.7535778e+03 1.34e-05 4.97e-03 -2.5 1.59e-01 - 1.00e+00 1.00e+0
0f 1
12 5.7231686e+03 1.12e-05 6.55e-03 -3.8 1.07e+01 - 1.00e+00 9.68e-0
1f 1
13 5.7226587e+03 1.60e-08 1.24e-05 -3.8 3.33e-01 - 1.00e+00 1.00e+0
0f 1
14 5.7210185e+03 1.79e-08 5.06e-06 -5.7 5.94e-01 - 1.00e+00 1.00e+0
0f 1
15 5.7210000e+03 6.41e-13 4.12e-10 -8.6 7.35e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.7210000339626461e+00 5.7210000339626458e+0
3
Dual infeasibility......: 4.1156180167257236e-10 4.1156180167257236e-0
7
Constraint violation....: 6.4076521866240910e-13 6.4076521866240910e-1
3
Complementarity.........: 2.8803092497180229e-09 2.8803092497180228e-0
6
Overall NLP error.......: 2.8803092497180229e-09 2.8803092497180228e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4528265e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 3.98e-04 9.81e-0
3f 1
2 8.4160251e+02 2.00e+03 5.24e+01 -1.0 1.48e+03 - 5.90e-05 1.34e-0
4h 1
3 2.7509537e+02 1.95e+03 5.26e+01 -1.0 2.00e+03 - 4.97e-05 2.18e-0
2f 1
4 1.3978763e+04 5.67e-02 8.10e+01 -1.0 1.95e+03 - 4.46e-02 1.00e+0
0h 1
5 5.1663756e+03 5.32e-02 5.38e+01 -1.0 8.22e+01 - 3.29e-01 5.48e-0
2f 1
6 3.0169279e+03 3.33e-02 2.97e+01 -1.0 4.25e+01 - 4.59e-01 5.39e-0
1f 1
7 5.0512416e+03 9.15e-03 1.65e+01 -1.0 2.43e+01 - 5.91e-01 1.00e+0
0h 1
8 3.0927580e+03 7.42e-03 4.15e-01 -1.0 2.10e+01 - 9.67e-01 1.00e+0
0f 1
9 2.7847845e+03 1.00e-03 1.63e-01 -1.7 5.24e+00 - 1.00e+00 9.12e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.6486959e+03 1.59e-03 2.72e-01 -2.5 6.05e+00 - 7.52e-01 1.00e+0
0f 1
11 2.5962169e+03 4.61e-03 3.97e-02 -2.5 2.93e+00 - 1.00e+00 1.00e+0
0h 1
12 2.6062895e+03 2.11e-04 6.40e-03 -2.5 4.76e-01 - 1.00e+00 1.00e+0
0h 1
13 2.5818658e+03 2.58e-04 4.25e-02 -3.8 5.37e+00 - 9.87e-01 8.87e-0
1h 1
14 2.5806677e+03 1.91e-06 1.63e-04 -3.8 6.01e-01 - 1.00e+00 1.00e+0
0h 1
15 2.5794704e+03 3.21e-07 2.10e-03 -5.7 2.97e-01 - 1.00e+00 9.78e-0
1h 1
16 2.5794585e+03 3.73e-11 2.11e-08 -5.7 6.59e-03 - 1.00e+00 1.00e+0
0f 1
17 2.5794438e+03 6.30e-11 4.40e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 2.5794437834941810e+00 2.5794437834941809e+0
3
Dual infeasibility......: 4.3996203304006703e-09 4.3996203304006703e-0
6
Constraint violation....: 6.3009708561878597e-11 6.3009708561878597e-1
1
Complementarity.........: 3.4185721264126528e-09 3.4185721264126529e-0
6
Overall NLP error.......: 4.3996203304006703e-09 4.3996203304006703e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0721930e+02 9.17e+02 5.23e+01 -1.0 9.21e+02 - 9.83e-04 9.87e-0
3h 1
2 8.7181091e+02 9.16e+02 5.23e+01 -1.0 8.49e+02 - 8.21e-05 1.33e-0
3h 1
3 2.8525681e+02 8.96e+02 5.24e+01 -1.0 9.16e+02 - 1.33e-03 2.27e-0
2h 1
4 1.2888349e+04 6.67e-02 7.66e+01 -1.0 8.96e+02 - 8.35e-02 1.00e+0
0h 1
5 4.8212225e+03 6.00e-02 3.81e+01 -1.0 2.98e+01 - 4.77e-01 9.05e-0
2f 1
6 3.3289633e+03 2.04e-02 1.54e+01 -1.0 1.56e+01 - 6.18e-01 7.30e-0
1f 1
7 3.4187691e+03 4.87e-03 1.79e-01 -1.0 2.13e+00 - 9.89e-01 1.00e+0
0f 1
8 2.9971950e+03 1.46e-03 1.26e-01 -1.7 8.19e+00 - 1.00e+00 1.00e+0
0f 1
9 2.8443266e+03 2.01e-03 4.21e-01 -2.5 8.27e+00 - 1.00e+00 7.83e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8202834e+03 1.63e-04 5.17e-03 -2.5 1.65e+00 - 1.00e+00 1.00e+0
0h 1
11 2.7936251e+03 4.18e-05 1.50e-01 -3.8 1.62e+01 - 1.00e+00 7.59e-0
1h 1
12 2.7862968e+03 1.42e-07 4.01e-04 -3.8 3.85e+00 - 1.00e+00 1.00e+0
0f 1
13 2.7843309e+03 2.94e-08 8.76e-04 -5.7 8.92e-01 - 1.00e+00 9.86e-0
1f 1
14 2.7843088e+03 1.88e-12 1.50e-08 -5.7 1.23e-02 - 1.00e+00 1.00e+0
0f 1
15 2.7842848e+03 2.63e-12 5.21e-09 -8.6 1.11e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 2.7842848289390760e+00 2.7842848289390759e+0
3
Dual infeasibility......: 5.2103780961917347e-09 5.2103780961917347e-0
6
Constraint violation....: 2.6308885625603295e-12 2.6308885625603295e-1
2
Complementarity.........: 3.7933910750949593e-09 3.7933910750949591e-0
6
Overall NLP error.......: 5.2103780961917347e-09 5.2103780961917347e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254149705e-01 6.4890146254149704e+0
2
Dual infeasibility......: 4.9126604805742242e-09 4.9126604805742242e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646095252258498e-09 4.3646095252258497e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126604805742242e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933498e-01 5.8277753147933493e+0
2
Dual infeasibility......: 2.1031320943161440e-09 2.1031320943161440e-0
6
Constraint violation....: 6.2994262584048499e-11 6.2994262584048499e-1
1
Complementarity.........: 2.8882108896910881e-09 2.8882108896910880e-0
6
Overall NLP error.......: 2.8882108896910881e-09 2.8882108896910880e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254149705e-01 6.4890146254149704e+0
2
Dual infeasibility......: 4.9126604805742242e-09 4.9126604805742242e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646095252258498e-09 4.3646095252258497e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126604805742242e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.06e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 6.36e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281623762e+00 1.6104063281623762e+0
3
Dual infeasibility......: 2.4575407234705803e-12 2.4575407234705803e-0
9
Constraint violation....: 6.3603121674174175e-15 6.3603121674174175e-1
5
Complementarity.........: 2.5062163910051658e-09 2.5062163910051657e-0
6
Overall NLP error.......: 2.5062163910051658e-09 2.5062163910051657e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2234417e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 3.29e-04 9.86e-0
3h 1
2 8.0850707e+02 9.17e+02 5.24e+01 -1.0 7.37e+02 - 8.13e-05 5.03e-0
4h 1
3 2.4208585e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 4.72e-04 2.11e-0
2f 1
4 1.2483871e+04 5.50e-02 8.24e+01 -1.0 8.98e+02 - 3.81e-02 1.00e+0
0h 1
5 3.8885008e+03 5.25e-02 5.69e+01 -1.0 8.15e+01 - 3.07e-01 4.97e-0
2f 1
6 1.9109576e+03 3.75e-02 3.05e+01 -1.0 3.91e+01 - 4.68e-01 5.05e-0
1f 1
7 4.6824120e+03 1.22e-02 2.71e+01 -1.0 2.06e+01 - 4.00e-01 1.00e+0
0h 1
8 1.8756802e+03 1.20e-02 1.03e+00 -1.0 2.55e+01 - 9.88e-01 8.91e-0
1f 1
9 1.9982545e+03 1.92e-04 4.73e-02 -1.0 3.03e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7319192e+03 2.18e-04 1.23e+00 -2.5 1.85e+01 - 9.37e-01 5.95e-0
1f 1
11 1.5438680e+03 3.77e-03 1.33e-01 -2.5 7.58e+00 - 7.97e-01 1.00e+0
0f 1
12 1.5209377e+03 5.20e-03 3.06e-01 -2.5 1.81e+00 - 1.00e+00 7.69e-0
1h 1
13 1.5332266e+03 2.42e-04 4.66e-03 -2.5 7.13e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5031328e+03 1.70e-04 2.13e-02 -3.8 1.35e+01 - 9.90e-01 9.30e-0
1h 1
15 1.5019710e+03 7.23e-07 6.84e-05 -3.8 9.12e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003147e+03 3.77e-07 1.76e-04 -5.7 7.43e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.79e-11 2.93e-09 -5.7 3.98e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
1 8.6486496e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 4.93e-04 9.86e-0
3h 1
2 8.4983215e+02 9.17e+02 5.24e+01 -1.0 7.54e+02 - 7.95e-05 5.55e-0
4h 1
3 2.6208357e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 5.24e-04 2.21e-0
2h 1
4 1.2837707e+04 5.95e-02 8.02e+01 -1.0 8.97e+02 - 4.99e-02 1.00e+0
0h 1
5 4.2800818e+03 5.56e-02 5.36e+01 -1.0 7.38e+01 - 3.21e-01 5.97e-0
2f 1
36 1.500950e+04 1.632511e+04 3.644614e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2434996e+02 1.57e+04 5.24e+01 -1.0 1.59e+04 - 3.31e-04 9.80e-0
3f 1
2 8.2153457e+02 1.57e+04 5.24e+01 -1.0 1.55e+04 - 9.39e-05 1.00e-0
4h 1
3 8.1459817e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 2.71e-06 5.59e-0
4f 1
4 5.6303935e+02 1.54e+04 5.26e+01 -1.0 1.57e+04 - 5.94e-04 2.11e-0
2h 1
5 2.7243420e+04 5.51e-02 8.23e+01 -1.0 1.54e+04 - 3.85e-02 1.00e+0
0h 1
6 1.8712670e+04 5.26e-02 5.62e+01 -1.0 8.09e+01 - 3.15e-01 5.01e-0
2f 1
7 1.6735095e+04 3.73e-02 3.01e+01 -1.0 3.93e+01 - 4.69e-01 5.05e-0
1f 1
8 1.7081057e+04 2.27e-02 1.40e+01 -1.0 2.06e+01 - 4.01e-01 1.25e-0
1f 4
9 1.6823825e+04 6.02e-03 3.99e-01 -1.0 4.95e+00 - 9.78e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6518223e+04 1.44e-03 4.07e-01 -1.7 5.54e+00 - 1.00e+00 8.24e-0
1f 1
11 1.6477062e+04 9.19e-04 1.44e-02 -1.7 1.81e+01 - 1.00e+00 1.00e+0
0f 1
12 1.6349132e+04 1.44e-03 9.77e-02 -3.8 1.99e+01 - 7.88e-01 9.29e-0
1f 1
13 1.6325614e+04 1.62e-03 8.54e-02 -3.8 1.71e+00 - 8.43e-01 7.51e-0
1h 1
14 1.6326057e+04 3.34e-06 8.55e-04 -3.8 3.46e-01 - 1.00e+00 1.00e+0
0h 1
15 1.6325125e+04 2.80e-07 6.76e-04 -5.7 1.49e-01 - 1.00e+00 9.87e-0
1h 1
16 1.6325118e+04 3.64e-11 6.71e-09 -5.7 2.77e-01 - 1.00e+00 1.00e+0
0f 1
17 1.6325105e+04 6.30e-11 2.17e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.6325105231741457e+01 1.6325105231741456e+0
4
Dual infeasibility......: 2.1734469844549164e-09 2.1734469844549164e-0
6
Constraint violation....: 6.2999036543054387e-11 6.2999036543054387e-1
1
Complementarity.........: 2.8881015128873532e-09 2.8881015128873533e-0
6
Overall NLP error.......: 2.8881015128873532e-09 2.8881015128873533e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9219972e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.64e-04 9.80e-0
3f 1
2 7.8936538e+02 1.50e+04 5.25e+01 -1.0 1.48e+04 - 9.52e-05 1.00e-0
4h 1
3 7.8165259e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 2.83e-06 5.80e-0
4f 1
4 5.2277492e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 6.18e-04 2.03e-0
2h 1
5 2.6202792e+04 5.40e-02 8.38e+01 -1.0 1.47e+04 - 3.24e-02 1.00e+0
0h 1
6 1.7689763e+04 5.19e-02 6.38e+01 -1.0 8.06e+01 - 2.42e-01 4.50e-0
2f 1
7 1.5948389e+04 4.29e-02 3.26e+01 -1.0 3.30e+01 - 4.86e-01 4.64e-0
1f 1
8 1.6265515e+04 2.68e-02 1.43e+01 -1.0 1.79e+01 - 4.34e-01 1.25e-0
1f 4
9 1.6015491e+04 6.01e-03 1.46e-01 -1.0 4.94e+00 - 9.92e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5733614e+04 1.19e-03 2.76e-01 -1.7 4.61e+00 - 1.00e+00 8.68e-0
1f 1
11 1.5708919e+04 7.68e-04 1.10e-02 -1.7 1.57e+01 - 1.00e+00 1.00e+0
0f 1
12 1.5584125e+04 1.33e-03 8.93e-02 -3.8 1.99e+01 - 7.99e-01 9.32e-0
1f 1
13 1.5559913e+04 1.47e-03 6.38e-02 -3.8 1.70e+00 - 8.49e-01 7.73e-0
1h 1
14 1.5560166e+04 2.69e-06 7.40e-04 -3.8 3.03e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5559221e+04 3.16e-07 6.09e-04 -5.7 1.49e-01 - 1.00e+00 9.88e-0
1h 1
16 1.5559215e+04 3.95e-11 6.17e-09 -5.7 1.22e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5559202e+04 6.30e-11 2.09e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5559202139435605e+01 1.5559202139435605e+0
4
Dual infeasibility......: 2.0877711388805296e-09 2.0877711388805296e-0
6
Constraint violation....: 6.2995914040797629e-11 6.2995914040797629e-1
1
Complementarity.........: 2.8881089341861380e-09 2.8881089341861380e-0
6
Overall NLP error.......: 2.8881089341861380e-09 2.8881089341861380e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9898380e+02 1.39e+04 5.25e+01 -1.0 1.40e+04 - 2.76e-04 9.80e-0
3f 1
2 7.9610238e+02 1.39e+04 5.25e+01 -1.0 1.33e+04 - 4.77e-05 1.04e-0
4h 1
3 7.6420161e+02 1.39e+04 5.25e+01 -1.0 1.39e+04 - 6.93e-06 2.22e-0
3h 1
4 5.2262031e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 2.38e-03 2.00e-0
2h 1
5 2.4340376e+04 5.54e-02 8.37e+01 -1.0 1.36e+04 - 3.52e-02 1.00e+0
0h 1
6 1.6601771e+04 5.29e-02 5.67e+01 -1.0 7.37e+01 - 3.24e-01 4.85e-0
2f 1
7 1.4864966e+04 4.22e-02 2.85e+01 -1.0 3.45e+01 - 4.95e-01 4.65e-0
1f 1
8 1.5177092e+04 2.66e-02 1.18e+01 -1.0 1.77e+01 - 4.38e-01 1.25e-0
1f 4
9 1.4944460e+04 6.09e-03 1.34e-01 -1.0 4.83e+00 - 9.92e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4659348e+04 1.23e-03 2.92e-01 -1.7 7.12e+00 - 1.00e+00 8.62e-0
1f 1
11 1.4650421e+04 7.35e-04 1.23e-02 -1.7 3.34e+01 - 1.00e+00 1.00e+0
0f 1
12 1.4506431e+04 1.34e-03 9.11e-02 -3.8 3.98e+01 - 7.97e-01 9.32e-0
1f 1
13 1.4481188e+04 1.49e-03 6.43e-02 -3.8 2.69e+00 - 8.47e-01 7.71e-0
1h 1
14 1.4481165e+04 2.72e-06 7.50e-04 -3.8 6.15e-01 - 1.00e+00 1.00e+0
0h 1
15 1.4480074e+04 3.13e-07 6.11e-04 -5.7 2.97e-01 - 1.00e+00 9.88e-0
1h 1
16 1.4480067e+04 3.91e-11 6.21e-09 -5.7 9.60e-02 - 1.00e+00 1.00e+0
0f 1
17 1.4480052e+04 6.30e-11 2.10e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.4480051768036780e+01 1.4480051768036779e+0
4
Dual infeasibility......: 2.0963024756143779e-09 2.0963024756143779e-0
6
Constraint violation....: 6.2996219352129401e-11 6.2996219352129401e-1
1
Complementarity.........: 2.8881085329979397e-09 2.8881085329979395e-0
6
Overall NLP error.......: 2.8881085329979397e-09 2.8881085329979395e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9352552e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 7.31e-04 9.80e-0
3h 1
2 8.9070666e+02 1.27e+04 5.24e+01 -1.0 1.19e+04 - 4.17e-05 1.05e-0
4h 1
3 8.4604502e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 8.43e-06 3.01e-0
3h 1
4 5.6876527e+02 1.23e+04 5.24e+01 -1.0 1.26e+04 - 3.29e-03 2.16e-0
2h 1
5 2.3661273e+04 6.63e-02 7.81e+01 -1.0 1.23e+04 - 7.60e-02 1.00e+0
0h 1
6 1.6212094e+04 6.01e-02 4.43e+01 -1.0 4.74e+01 - 4.14e-01 8.52e-0
2f 1
7 1.4884441e+04 2.75e-02 1.73e+01 -1.0 2.25e+01 - 5.97e-01 5.19e-0
1f 1
8 1.4500379e+04 5.03e-03 1.03e+00 -1.0 7.86e+00 - 9.42e-01 7.45e-0
1f 1
9 1.4745378e+04 2.05e-04 6.63e-02 -1.0 5.14e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4155417e+04 2.15e-03 8.60e-02 -2.5 4.18e+00 - 8.63e-01 8.39e-0
1f 1
11 1.3981533e+04 2.15e-03 3.19e-01 -2.5 9.33e-01 - 1.00e+00 7.88e-0
1f 1
12 1.3955703e+04 1.59e-04 4.73e-03 -2.5 1.83e-01 - 1.00e+00 1.00e+0
0h 1
13 1.3934539e+04 3.33e-05 8.19e-02 -3.8 5.36e+00 - 1.00e+00 8.18e-0
1h 1
14 1.3931366e+04 9.93e-08 5.81e-04 -3.8 9.74e-01 - 1.00e+00 1.00e+0
0f 1
15 1.3929956e+04 3.70e-08 3.89e-04 -5.7 2.97e-01 - 1.00e+00 9.92e-0
1f 1
16 1.3929951e+04 1.90e-12 1.60e-08 -5.7 2.51e-03 - 1.00e+00 1.00e+0
0f 1
17 1.3929934e+04 2.56e-12 9.30e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.3929934120688509e+01 1.3929934120688509e+0
4
Dual infeasibility......: 9.2983892951063217e-09 9.2983892951063217e-0
6
Constraint violation....: 2.5570934258922762e-12 2.5570934258922762e-1
2
Complementarity.........: 4.6715186569405880e-09 4.6715186569405877e-0
6
Overall NLP error.......: 9.2983892951063217e-09 9.2983892951063217e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9481357e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 7.48e-04 9.80e-0
3h 1
2 8.9183826e+02 1.11e+04 5.24e+01 -1.0 9.65e+03 - 2.73e-05 1.14e-0
4h 1
3 7.2358265e+02 1.10e+04 5.24e+01 -1.0 1.11e+04 - 1.86e-05 1.03e-0
2h 1
4 6.2607035e+02 1.08e+04 5.20e+01 -1.0 1.10e+04 - 1.15e-02 2.10e-0
2h 1
5 1.9624054e+04 7.36e-02 7.76e+01 -1.0 1.08e+04 - 9.80e-02 1.00e+0
0h 1
6 1.4380395e+04 6.46e-02 2.08e+01 -1.0 3.73e+01 - 7.04e-01 1.14e-0
1f 1
7 1.2837848e+04 2.05e-02 1.65e+00 -1.0 1.97e+01 - 9.31e-01 7.25e-0
1f 1
8 1.3179866e+04 1.96e-03 6.36e-01 -1.0 4.05e+00 - 6.74e-01 1.00e+0
0f 1
9 1.2676406e+04 1.67e-03 4.03e-01 -1.7 4.06e+00 - 7.62e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2647182e+04 7.07e-04 3.67e-01 -1.7 8.02e+00 - 7.38e-01 1.00e+0
0h 1
11 1.2666232e+04 1.79e-05 2.07e-01 -1.7 1.83e+01 - 6.18e-01 1.00e+0
0h 1
12 1.2682915e+04 9.58e-09 3.05e-06 -1.7 1.73e+01 - 1.00e+00 1.00e+0
0h 1
13 1.2489752e+04 5.20e-04 2.56e-02 -3.8 4.98e+01 - 8.44e-01 8.28e-0
1f 1
14 1.2456802e+04 1.38e-04 7.46e-02 -3.8 8.53e+00 - 9.72e-01 8.79e-0
1h 1
15 1.2455202e+04 2.22e-07 8.34e-01 -3.8 1.03e+00 - 6.28e-01 1.00e+0
0h 1
16 1.2455102e+04 6.34e-09 1.81e-04 -3.8 1.35e-04 - 1.00e+00 1.00e+0
0h 1
17 1.2453702e+04 2.26e-08 2.70e-02 -5.7 4.46e-01 - 1.00e+00 9.07e-0
1f 1
18 1.2453581e+04 4.41e-11 2.94e-07 -5.7 4.14e-02 - 1.00e+00 1.00e+0
0f 1
19 1.2453562e+04 2.64e-12 3.14e-06 -8.6 5.53e-03 - 1.00e+00 9.99e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.2453562e+04 5.49e-15 4.81e-14 -8.6 2.79e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.2453562303433310e+01 1.2453562303433309e+0
4
Dual infeasibility......: 4.8057405642572778e-14 4.8057405642572778e-1
1
Constraint violation....: 5.4864797594564812e-15 5.4864797594564812e-1
5
Complementarity.........: 2.6532776943582678e-09 2.6532776943582677e-0
6
Overall NLP error.......: 2.6532776943582678e-09 2.6532776943582677e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3006359e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 2.02e-03 9.80e-0
3h 1
2 9.2722762e+02 9.19e+03 5.23e+01 -1.0 8.88e+03 - 6.77e-05 1.02e-0
4h 1
3 9.0058749e+02 9.18e+03 5.23e+01 -1.0 9.18e+03 - 5.63e-06 1.42e-0
3f 1
4 4.9463665e+02 8.97e+03 5.24e+01 -1.0 9.18e+03 - 1.64e-03 2.27e-0
2h 1
5 2.1164030e+04 7.23e-02 7.69e+01 -1.0 8.97e+03 - 7.85e-02 1.00e+0
0h 1
6 1.3562973e+04 6.54e-02 2.35e+01 -1.0 8.38e+00 - 6.64e-01 8.73e-0
2f 1
7 1.2324131e+04 3.29e-02 9.64e+00 -1.0 7.01e+00 - 6.84e-01 1.00e+0
0f 1
8 1.2476105e+04 1.68e-02 6.52e-01 -1.0 2.39e+00 - 9.95e-01 4.91e-0
1f 2
9 1.2182671e+04 6.71e-03 2.78e-01 -1.7 9.98e+00 - 1.00e+00 8.44e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2122153e+04 1.23e-03 8.86e-02 -1.7 1.11e+01 - 1.00e+00 1.00e+0
0f 1
11 1.1995228e+04 3.35e-04 9.60e-02 -2.5 1.72e+01 - 9.85e-01 8.95e-0
1f 1
12 1.1986791e+04 4.66e-06 1.02e-03 -2.5 1.79e+00 - 1.00e+00 1.00e+0
0f 1
13 1.1965361e+04 5.87e-06 5.32e-03 -3.8 2.68e+00 - 1.00e+00 9.75e-0
1f 1
14 1.1965205e+04 1.30e-08 6.21e-06 -3.8 6.52e-02 - 1.00e+00 1.00e+0
0f 1
15 1.1964013e+04 1.73e-08 3.04e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0f 1
16 1.1963999e+04 1.28e-12 4.22e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.1963999138086265e+01 1.1963999138086265e+0
4
Dual infeasibility......: 4.2180166557119448e-10 4.2180166557119448e-0
7
Constraint violation....: 1.2799344917269195e-12 1.2799344917269195e-1
2
Complementarity.........: 2.5909993213750105e-09 2.5909993213750105e-0
6
Overall NLP error.......: 2.5909993213750105e-09 2.5909993213750105e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3709613e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 3.06e-03 9.81e-0
3h 1
2 9.3353198e+02 6.71e+03 5.23e+01 -1.0 5.10e+03 - 1.89e-05 1.30e-0
4h 1
3 4.2613385e+02 6.55e+03 5.24e+01 -1.0 6.71e+03 - 3.56e-05 2.29e-0
2f 1
4 1.9281092e+04 7.30e-02 8.02e+01 -1.0 6.55e+03 - 3.74e-02 1.00e+0
0h 1
5 1.1339331e+04 6.91e-02 5.90e+01 -1.0 8.02e+00 - 2.64e-01 5.00e-0
2f 1
6 1.0190236e+04 2.14e-02 2.42e+01 -1.0 5.08e+00 - 6.39e-01 1.00e+0
0f 1
7 1.0517954e+04 2.95e-03 2.00e-01 -1.0 2.03e+00 - 9.91e-01 1.00e+0
0f 1
8 1.0004069e+04 1.59e-03 6.62e-02 -1.7 5.17e+00 - 1.00e+00 9.87e-0
1f 1
9 9.8321730e+03 1.66e-03 3.42e-01 -2.5 1.25e+00 - 1.00e+00 8.01e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.8071757e+03 3.62e-05 7.24e-03 -2.5 2.80e-01 - 1.00e+00 1.00e+0
0h 1
11 9.7854015e+03 2.15e-06 7.23e-04 -3.8 5.36e+00 - 1.00e+00 1.00e+0
0h 1
12 9.7842083e+03 1.50e-08 3.75e-06 -5.7 2.95e-01 - 1.00e+00 1.00e+0
0h 1
13 9.7841926e+03 1.71e-12 4.05e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 13
(scaled) (unscaled)
Objective...............: 9.7841925835041028e+00 9.7841925835041020e+0
3
Dual infeasibility......: 4.0517096613969339e-10 4.0517096613969339e-0
7
Constraint violation....: 1.7060797219414781e-12 1.7060797219414781e-1
2
Complementarity.........: 2.5700935729889048e-09 2.5700935729889048e-0
6
Overall NLP error.......: 2.5700935729889048e-09 2.5700935729889048e-0
6
Number of objective function evaluations = 14
Number of objective gradient evaluations = 14
Number of equality constraint evaluations = 14
Number of inequality constraint evaluations = 14
Number of equality constraint Jacobian evaluations = 14
Number of inequality constraint Jacobian evaluations = 14
Number of Lagrangian Hessian evaluations = 13
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0885267e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0522538e+02 4.77e+03 5.23e+01 -1.0 3.40e+03 - 2.93e-05 1.39e-0
4h 1
3 3.7446895e+02 4.66e+03 5.24e+01 -1.0 4.77e+03 - 4.82e-05 2.34e-0
2f 1
4 1.7343624e+04 6.51e-02 8.03e+01 -1.0 4.66e+03 - 3.33e-02 1.00e+0
0h 1
5 8.8835455e+03 6.19e-02 6.15e+01 -1.0 3.76e+01 - 2.33e-01 4.52e-0
2f 1
6 7.5996542e+03 2.03e-02 2.88e+01 -1.0 1.63e+01 - 5.42e-01 6.20e-0
1f 1
7 7.1823993e+03 5.79e-03 8.85e-01 -1.0 5.30e+00 - 9.57e-01 7.82e-0
1f 1
8 7.4476292e+03 1.69e-04 6.59e-02 -1.0 5.07e+00 - 1.00e+00 1.00e+0
0f 1
9 6.8807542e+03 2.12e-03 8.08e-02 -2.5 3.15e+00 - 8.55e-01 8.48e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.7194703e+03 2.16e-03 4.17e-01 -2.5 9.54e-01 - 1.00e+00 7.62e-0
1f 1
11 6.6937548e+03 1.24e-04 4.69e-03 -2.5 2.10e-01 - 1.00e+00 1.00e+0
0h 1
12 6.6728221e+03 3.31e-05 1.45e-01 -3.8 8.04e+00 - 1.00e+00 7.62e-0
1h 1
13 6.6674261e+03 1.25e-07 3.38e-04 -3.8 1.91e+00 - 1.00e+00 1.00e+0
0f 1
14 6.6659052e+03 2.85e-08 9.91e-04 -5.7 4.46e-01 - 1.00e+00 9.85e-0
1h 1
15 6.6658878e+03 1.92e-12 1.39e-08 -5.7 6.69e-03 - 1.00e+00 1.00e+0
0f 1
16 6.6658693e+03 2.63e-12 4.48e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.6658693374094771e+00 6.6658693374094773e+0
3
Dual infeasibility......: 4.4776952405092887e-09 4.4776952405092887e-0
6
Constraint violation....: 2.6311175460591585e-12 2.6311175460591585e-1
2
Complementarity.........: 3.6084978097547807e-09 3.6084978097547807e-0
6
Overall NLP error.......: 4.4776952405092887e-09 4.4776952405092887e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9465052e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3h 1
2 8.8961066e+02 3.24e+03 5.24e+01 -1.0 1.65e+03 - 3.15e-05 1.94e-0
4h 1
3 3.3049321e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 1.10e-04 2.31e-0
2f 1
4 1.5661028e+04 6.29e-02 8.00e+01 -1.0 3.17e+03 - 4.12e-02 1.00e+0
0h 1
5 7.0966213e+03 5.93e-02 5.59e+01 -1.0 4.98e+01 - 2.95e-01 5.19e-0
2f 1
6 5.7201217e+03 2.49e-02 2.72e+01 -1.0 2.33e+01 - 5.16e-01 5.36e-0
1f 1
7 5.1215761e+03 9.32e-03 1.31e+00 -1.0 8.82e+00 - 9.35e-01 7.62e-0
1f 1
8 5.4190355e+03 3.08e-04 8.41e-02 -1.0 3.70e+00 - 9.98e-01 1.00e+0
0f 1
9 4.8037419e+03 2.09e-03 8.11e-02 -2.5 6.35e+00 - 8.62e-01 8.49e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.6320854e+03 2.20e-03 3.43e-01 -2.5 1.85e+00 - 1.00e+00 7.81e-0
1f 1
11 4.6055472e+03 1.52e-04 4.72e-03 -2.5 4.44e-01 - 1.00e+00 1.00e+0
0h 1
12 4.5784255e+03 2.24e-05 4.27e-02 -3.8 1.07e+01 - 1.00e+00 8.84e-0
1h 1
13 4.5760808e+03 5.69e-08 5.99e-04 -3.8 1.23e+00 - 1.00e+00 1.00e+0
0f 1
14 4.5743301e+03 4.25e-08 5.52e-05 -5.7 5.94e-01 - 1.00e+00 9.98e-0
1f 1
15 4.5743305e+03 1.88e-12 1.31e-08 -5.7 1.24e-03 - 1.00e+00 1.00e+0
0f 1
16 4.5743102e+03 2.57e-12 3.30e-06 -8.6 7.37e-03 - 1.00e+00 9.99e-0
1f 1
17 4.5743102e+03 5.47e-15 4.85e-14 -8.6 4.26e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 4.5743102027491176e+00 4.5743102027491177e+0
3
Dual infeasibility......: 4.8497493495249791e-14 4.8497493495249791e-1
1
Constraint violation....: 5.4676445657410731e-15 5.4676445657410731e-1
5
Complementarity.........: 2.5919205614599919e-09 2.5919205614599919e-0
6
Overall NLP error.......: 2.5919205614599919e-09 2.5919205614599919e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4518010e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 3.98e-04 9.82e-0
3f 1
2 8.4053778e+02 2.00e+03 5.24e+01 -1.0 1.16e+03 - 4.81e-05 1.70e-0
4h 1
3 8.2353960e+02 2.00e+03 5.24e+01 -1.0 1.99e+03 - 9.16e-05 6.55e-0
4h 1
4 2.7656016e+02 1.95e+03 5.26e+01 -1.0 2.00e+03 - 7.38e-04 2.15e-0
2f 1
5 1.3590771e+04 5.75e-02 8.12e+01 -1.0 1.95e+03 - 4.60e-02 1.00e+0
0h 1
6 5.1287561e+03 5.39e-02 5.24e+01 -1.0 7.94e+01 - 3.46e-01 5.65e-0
2f 1
7 3.0120352e+03 3.43e-02 2.84e+01 -1.0 4.22e+01 - 4.66e-01 5.35e-0
1f 1
8 4.8304165e+03 7.84e-03 1.41e+01 -1.0 2.16e+01 - 6.33e-01 1.00e+0
0h 1
9 3.1436336e+03 5.61e-03 3.45e-01 -1.0 1.83e+01 - 9.68e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.7927316e+03 1.05e-03 4.74e-02 -1.7 5.61e+00 - 8.78e-01 8.81e-0
1f 1
11 2.6624340e+03 1.03e-03 3.41e-01 -2.5 5.47e+00 - 7.76e-01 1.00e+0
0h 1
12 2.5963515e+03 8.58e-03 4.86e-02 -2.5 3.67e+00 - 1.00e+00 1.00e+0
0h 1
13 2.6068715e+03 3.19e-04 6.33e-03 -2.5 5.01e-01 - 1.00e+00 1.00e+0
0h 1
14 2.5817387e+03 2.17e-04 5.21e-02 -3.8 6.99e+00 - 9.85e-01 8.71e-0
1h 1
15 2.5806495e+03 2.20e-06 1.53e-04 -3.8 2.80e-01 - 1.00e+00 1.00e+0
0h 1
16 2.5794666e+03 3.11e-07 2.15e-03 -5.7 2.90e-01 - 1.00e+00 9.77e-0
1h 1
17 2.5794585e+03 3.61e-11 2.15e-08 -5.7 2.88e-03 - 1.00e+00 1.00e+0
0f 1
18 2.5794438e+03 6.30e-11 4.40e-09 -8.6 3.69e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 2.5794437829450154e+00 2.5794437829450153e+0
3
Dual infeasibility......: 4.3996310464287854e-09 4.3996310464287854e-0
6
Constraint violation....: 6.3011415529778958e-11 6.3011415529778958e-1
1
Complementarity.........: 3.3134414963904449e-09 3.3134414963904450e-0
6
Overall NLP error.......: 4.3996310464287854e-09 4.3996310464287854e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0738996e+02 9.17e+02 5.23e+01 -1.0 9.22e+02 - 9.83e-04 9.86e-0
3h 1
2 8.8581642e+02 9.17e+02 5.23e+01 -1.0 8.05e+02 - 7.44e-05 8.09e-0
4h 1
3 2.8446427e+02 8.96e+02 5.24e+01 -1.0 9.17e+02 - 7.85e-04 2.30e-0
2h 1
4 1.3130395e+04 6.60e-02 7.64e+01 -1.0 8.96e+02 - 8.31e-02 1.00e+0
0h 1
5 4.8398771e+03 5.94e-02 3.89e+01 -1.0 3.03e+01 - 4.65e-01 8.97e-0
2f 1
6 3.3515803e+03 2.00e-02 1.60e+01 -1.0 1.56e+01 - 6.10e-01 7.24e-0
1f 1
7 3.4080736e+03 5.23e-03 2.24e-01 -1.0 2.15e+00 - 9.87e-01 1.00e+0
0f 1
8 2.9928456e+03 1.46e-03 1.25e-01 -1.7 6.37e+00 - 1.00e+00 1.00e+0
0f 1
9 2.8424657e+03 1.99e-03 4.33e-01 -2.5 7.29e+00 - 1.00e+00 7.79e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8175519e+03 1.70e-04 5.24e-03 -2.5 1.48e+00 - 1.00e+00 1.00e+0
0h 1
11 2.7930452e+03 4.34e-05 1.52e-01 -3.8 1.35e+01 - 1.00e+00 7.57e-0
1h 1
12 2.7863160e+03 1.44e-07 4.07e-04 -3.8 3.24e+00 - 1.00e+00 1.00e+0
0f 1
13 2.7844966e+03 2.93e-08 8.43e-04 -5.7 7.43e-01 - 1.00e+00 9.86e-0
1f 1
14 2.7844770e+03 1.88e-12 1.47e-08 -5.7 1.00e-02 - 1.00e+00 1.00e+0
0f 1
15 2.7844549e+03 2.63e-12 5.21e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 2.7844548994718754e+00 2.7844548994718753e+0
3
Dual infeasibility......: 5.2053914742627881e-09 5.2053914742627881e-0
6
Constraint violation....: 2.6307706013639631e-12 2.6307706013639631e-1
2
Complementarity.........: 3.7921340146253083e-09 3.7921340146253081e-0
6
Overall NLP error.......: 5.2053914742627881e-09 5.2053914742627881e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254150050e-01 6.4890146254150045e+0
2
Dual infeasibility......: 4.9126604771005421e-09 4.9126604771005421e-0
6
Constraint violation....: 6.2123814981163150e-09 6.2123814981163150e-0
9
Complementarity.........: 4.3646095252240184e-09 4.3646095252240184e-0
6
Overall NLP error.......: 6.2123814981163150e-09 4.9126604771005421e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.040
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031320943161440e-09 2.1031320943161440e-0
6
Constraint violation....: 6.2994193195109460e-11 6.2994193195109460e-1
1
Complementarity.........: 2.8882108896910881e-09 2.8882108896910880e-0
6
Overall NLP error.......: 2.8882108896910881e-09 2.8882108896910880e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254150050e-01 6.4890146254150045e+0
2
Dual infeasibility......: 4.9126604771005421e-09 4.9126604771005421e-0
6
Constraint violation....: 6.2123814981163150e-09 6.2123814981163150e-0
9
Complementarity.........: 4.3646095252240184e-09 4.3646095252240184e-0
6
Overall NLP error.......: 6.2123814981163150e-09 4.9126604771005421e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.06e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.11e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281623866e+00 1.6104063281623867e+0
3
Dual infeasibility......: 2.4577141957304968e-12 2.4577141957304968e-0
9
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5062163910051625e-09 2.5062163910051623e-0
6
Overall NLP error.......: 2.5062163910051625e-09 2.5062163910051623e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2234838e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 3.29e-04 9.86e-0
3h 1
2 8.0851121e+02 9.17e+02 5.24e+01 -1.0 7.37e+02 - 8.13e-05 5.03e-0
4h 1
3 2.4208772e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 4.72e-04 2.11e-0
2f 1
4 1.2483905e+04 5.50e-02 8.24e+01 -1.0 8.98e+02 - 3.81e-02 1.00e+0
0h 1
5 3.8885348e+03 5.25e-02 5.69e+01 -1.0 8.15e+01 - 3.07e-01 4.97e-0
2f 1
6 1.9109594e+03 3.75e-02 3.05e+01 -1.0 3.91e+01 - 4.68e-01 5.05e-0
1f 1
7 4.6824436e+03 1.22e-02 2.71e+01 -1.0 2.06e+01 - 4.00e-01 1.00e+0
0h 1
8 1.8756839e+03 1.20e-02 1.03e+00 -1.0 2.55e+01 - 9.88e-01 8.91e-0
1f 1
9 1.9982537e+03 1.92e-04 4.73e-02 -1.0 3.02e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7319203e+03 2.18e-04 1.23e+00 -2.5 1.85e+01 - 9.37e-01 5.95e-0
1f 1
11 1.5438684e+03 3.77e-03 1.33e-01 -2.5 7.58e+00 - 7.97e-01 1.00e+0
0f 1
12 1.5209376e+03 5.20e-03 3.06e-01 -2.5 1.81e+00 - 1.00e+00 7.69e-0
1h 1
13 1.5332266e+03 2.42e-04 4.66e-03 -2.5 7.13e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5031329e+03 1.70e-04 2.13e-02 -3.8 1.35e+01 - 9.90e-01 9.30e-0
1h 1
15 1.5019710e+03 7.23e-07 6.84e-05 -3.8 9.12e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003147e+03 3.77e-07 1.76e-04 -5.7 7.43e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.79e-11 2.93e-09 -5.7 3.98e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932776819484e+00 1.5002932776819484e+0
3
Dual infeasibility......: 2.1694133548031099e-09 2.1694133548031099e-0
6
Constraint violation....: 6.2995789140707359e-11 6.2995789140707359e-1
1
Complementarity.........: 2.8882170464369477e-09 2.8882170464369478e-0
6
Overall NLP error.......: 2.8882170464369477e-09 2.8882170464369478e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6486917e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 4.93e-04 9.86e-0
3h 1
2 8.4983616e+02 9.17e+02 5.24e+01 -1.0 7.54e+02 - 7.95e-05 5.55e-0
4h 1
3 2.6208567e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 5.24e-04 2.21e-0
2h 1
4 1.2837742e+04 5.95e-02 8.02e+01 -1.0 8.97e+02 - 4.99e-02 1.00e+0
0h 1
5 4.2801283e+03 5.56e-02 5.36e+01 -1.0 7.38e+01 - 3.21e-01 5.97e-0
2f 1
37 1.653701e+04 1.632511e+04 3.700056e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6795632e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.80e-0
3f 1
2 7.6508436e+02 1.57e+04 5.25e+01 -1.0 1.51e+04 - 4.81e-05 1.03e-0
4h 1
3 7.4136527e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 6.06e-06 1.88e-0
3h 1
4 5.3848001e+02 1.54e+04 5.27e+01 -1.0 1.57e+04 - 2.00e-03 1.95e-0
2h 1
5 2.6115125e+04 6.17e-02 8.49e+01 -1.0 1.54e+04 - 3.05e-02 1.00e+0
0h 1
6 1.8237242e+04 5.92e-02 6.41e+01 -1.0 7.34e+01 - 2.49e-01 4.45e-0
2f 1
7 1.6688824e+04 4.55e-02 3.13e+01 -1.0 2.88e+01 - 5.08e-01 4.33e-0
1f 1
8 1.6978210e+04 3.11e-02 1.21e+01 -1.0 1.59e+01 - 4.74e-01 1.25e-0
1f 4
9 1.6782780e+04 5.33e-03 3.16e+00 -1.0 3.85e+00 - 8.10e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6827942e+04 2.89e-04 1.88e+00 -1.0 2.39e+00 - 3.13e-01 1.00e+0
0f 1
11 1.6829095e+04 9.43e-06 5.38e-01 -1.0 2.53e+00 - 6.97e-01 1.00e+0
0f 1
12 1.6532114e+04 2.27e-04 3.61e-01 -1.7 4.85e+00 - 8.90e-01 7.83e-0
1f 1
13 1.6481774e+04 6.03e-04 2.67e-01 -1.7 9.48e+00 - 6.57e-01 1.00e+0
0f 1
14 1.6483600e+04 6.36e-05 2.78e-02 -1.7 1.31e+01 - 8.81e-01 1.00e+0
0h 1
15 1.6365490e+04 9.93e-04 4.55e-02 -2.5 2.13e+01 - 9.27e-01 1.00e+0
0f 1
16 1.6344887e+04 1.07e-03 1.15e-02 -2.5 2.18e+00 - 1.00e+00 1.00e+0
0h 1
17 1.6327915e+04 1.80e-04 8.32e-02 -3.8 5.37e+00 - 1.00e+00 8.55e-0
1h 1
18 1.6326243e+04 5.65e-07 9.85e-05 -3.8 7.71e-01 - 1.00e+00 1.00e+0
0h 1
19 1.6325283e+04 3.70e-07 8.19e-03 -5.7 2.57e-01 - 1.00e+00 8.14e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325119e+04 1.39e-08 4.65e-07 -5.7 6.36e-03 - 1.00e+00 1.00e+0
0f 1
21 1.6325105e+04 1.21e-10 2.63e-06 -8.6 2.32e-03 - 1.00e+00 9.96e-0
1h 1
22 1.6325105e+04 1.08e-15 3.80e-14 -8.6 8.79e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.6325105232526749e+01 1.6325105232526748e+0
4
Dual infeasibility......: 3.7958837168874620e-14 3.7958837168874620e-1
1
Constraint violation....: 1.0824674490095276e-15 1.0824674490095276e-1
5
Complementarity.........: 2.5060227833723736e-09 2.5060227833723734e-0
6
Overall NLP error.......: 2.5060227833723736e-09 2.5060227833723734e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.1743323e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 3.14e-04 9.80e-0
3h 1
2 8.1457104e+02 1.50e+04 5.24e+01 -1.0 1.43e+04 - 4.70e-05 1.03e-0
4h 1
3 8.1341108e+02 1.50e+04 5.24e+01 -1.0 1.48e+04 - 6.55e-06 8.66e-0
5h 1
4 8.1195936e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 9.14e-05 1.10e-0
4h 1
5 5.3819039e+02 1.47e+04 5.26e+01 -1.0 1.50e+04 - 2.04e-04 2.11e-0
2f 1
6 2.6595010e+04 5.46e-02 8.26e+01 -1.0 1.47e+04 - 3.64e-02 1.00e+0
0h 1
7 1.7904971e+04 5.22e-02 5.94e+01 -1.0 8.24e+01 - 2.81e-01 4.81e-0
2f 1
8 1.5967682e+04 3.90e-02 3.16e+01 -1.0 3.78e+01 - 4.70e-01 4.98e-0
1f 1
9 1.6309927e+04 2.32e-02 1.48e+01 -1.0 2.01e+01 - 4.04e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6039032e+04 6.20e-03 3.25e-01 -1.0 5.42e+00 - 9.83e-01 1.00e+0
0h 1
11 1.5743176e+04 1.39e-03 3.61e-01 -1.7 5.10e+00 - 1.00e+00 8.39e-0
1f 1
12 1.5711641e+04 8.71e-04 1.29e-02 -1.7 1.96e+01 - 1.00e+00 1.00e+0
0f 1
13 1.5582616e+04 1.40e-03 9.49e-02 -3.8 2.22e+01 - 7.92e-01 9.30e-0
1f 1
14 1.5559565e+04 1.56e-03 7.55e-02 -3.8 1.70e+00 - 8.44e-01 7.60e-0
1h 1
15 1.5560158e+04 3.11e-06 8.09e-04 -3.8 9.40e-02 - 1.00e+00 1.00e+0
0h 1
16 1.5559221e+04 2.94e-07 6.54e-04 -5.7 1.49e-01 - 1.00e+00 9.88e-0
1h 1
17 1.5559215e+04 3.78e-11 6.51e-09 -5.7 3.27e-01 - 1.00e+00 1.00e+0
0f 1
18 1.5559202e+04 6.30e-11 2.14e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5559202139391605e+01 1.5559202139391604e+0
4
Dual infeasibility......: 2.1392625103079835e-09 2.1392625103079835e-0
6
Constraint violation....: 6.2997634886485798e-11 6.2997634886485798e-1
1
Complementarity.........: 2.8881041258898690e-09 2.8881041258898691e-0
6
Overall NLP error.......: 2.8881041258898690e-09 2.8881041258898691e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9469682e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 7.46e-04 9.80e-0
3h 1
2 8.9180484e+02 1.39e+04 5.24e+01 -1.0 1.24e+04 - 2.67e-05 1.11e-0
4h 1
3 8.9005754e+02 1.39e+04 5.24e+01 -1.0 1.38e+04 - 1.50e-05 1.27e-0
4h 1
4 8.8323297e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 1.40e-04 5.04e-0
4h 1
5 5.8143188e+02 1.36e+04 5.24e+01 -1.0 1.39e+04 - 6.54e-04 2.28e-0
2f 1
6 2.5988440e+04 6.37e-02 7.79e+01 -1.0 1.36e+04 - 6.90e-02 1.00e+0
0h 1
7 1.7594502e+04 5.83e-02 4.87e+01 -1.0 5.00e+01 - 3.57e-01 7.69e-0
2f 1
8 1.6290454e+04 2.68e-02 2.14e+01 -1.0 2.30e+01 - 5.53e-01 4.96e-0
1f 1
9 1.5787446e+04 7.20e-03 1.24e+00 -1.0 8.73e+00 - 9.36e-01 7.37e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6040327e+04 3.33e-04 8.23e-02 -1.0 2.87e+00 - 9.70e-01 1.00e+0
0f 1
11 1.5454805e+04 2.07e-03 9.23e-02 -2.5 4.35e+00 - 8.62e-01 8.24e-0
1f 1
12 1.5277459e+04 2.15e-03 3.68e-01 -2.5 1.46e+00 - 1.00e+00 7.71e-0
1f 1
13 1.5248350e+04 1.78e-04 5.32e-03 -2.5 6.99e-01 - 1.00e+00 1.00e+0
0h 1
14 1.5226346e+04 2.69e-05 4.75e-02 -3.8 5.43e+00 - 1.00e+00 8.73e-0
1h 1
15 1.5224405e+04 6.10e-08 6.15e-04 -3.8 6.55e-01 - 1.00e+00 1.00e+0
0f 1
16 1.5222953e+04 4.17e-08 9.65e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5222940e+04 6.53e-13 3.66e-09 -8.6 3.69e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5222939910887192e+01 1.5222939910887191e+0
4
Dual infeasibility......: 3.6553892294691897e-09 3.6553892294691897e-0
6
Constraint violation....: 6.5258909387466701e-13 6.5258909387466701e-1
3
Complementarity.........: 2.7960042436862809e-09 2.7960042436862807e-0
6
Overall NLP error.......: 3.6553892294691897e-09 3.6553892294691897e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4549022e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.98e-04 9.80e-0
3f 1
2 8.4268289e+02 1.27e+04 5.24e+01 -1.0 1.24e+04 - 9.30e-05 1.01e-0
4h 1
3 8.3185819e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 3.40e-06 7.06e-0
4f 1
4 5.1298182e+02 1.24e+04 5.26e+01 -1.0 1.26e+04 - 7.64e-04 2.15e-0
2h 1
5 2.4253114e+04 5.75e-02 8.12e+01 -1.0 1.24e+04 - 4.59e-02 1.00e+0
0h 1
6 1.5783829e+04 5.39e-02 5.24e+01 -1.0 7.95e+01 - 3.46e-01 5.65e-0
2f 1
7 1.3665691e+04 3.43e-02 2.85e+01 -1.0 4.22e+01 - 4.66e-01 5.35e-0
1f 1
8 1.4122490e+04 1.83e-02 6.66e+00 -1.0 2.17e+01 - 6.31e-01 2.50e-0
1f 3
9 1.3813325e+04 5.37e-03 5.08e-01 -1.0 6.56e+00 - 9.50e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3462116e+04 1.47e-03 5.06e-01 -1.7 6.30e+00 - 1.00e+00 7.87e-0
1f 1
11 1.3408535e+04 6.08e-04 2.59e-02 -1.7 1.83e+01 - 1.00e+00 1.00e+0
0f 1
12 1.3266988e+04 1.38e-03 1.17e-01 -3.8 1.99e+01 - 7.65e-01 9.24e-0
1f 1
13 1.3231850e+04 2.70e-03 2.12e-02 -3.8 2.32e+00 - 8.15e-01 8.20e-0
1h 1
14 1.3233706e+04 3.11e-04 1.34e-01 -3.8 2.70e-01 - 1.00e+00 9.08e-0
1h 1
15 1.3234117e+04 5.09e-07 2.22e-05 -3.8 1.24e-01 - 1.00e+00 1.00e+0
0f 1
16 1.3233074e+04 4.18e-07 2.33e-03 -5.7 1.49e-01 - 1.00e+00 9.77e-0
1h 1
17 1.3233064e+04 4.90e-11 2.26e-08 -5.7 2.76e-02 - 1.00e+00 1.00e+0
0f 1
18 1.3233051e+04 6.30e-11 4.40e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.3233050916691029e+01 1.3233050916691029e+0
4
Dual infeasibility......: 4.4004630892031557e-09 4.4004630892031557e-0
6
Constraint violation....: 6.2987254301205553e-11 6.2987254301205553e-1
1
Complementarity.........: 3.8025353223593654e-09 3.8025353223593652e-0
6
Overall NLP error.......: 4.4004630892031557e-09 4.4004630892031557e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2243452e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.48e-03 9.80e-0
3h 1
2 9.1965916e+02 1.11e+04 5.23e+01 -1.0 1.08e+04 - 7.51e-05 1.02e-0
4h 1
3 9.0282880e+02 1.11e+04 5.23e+01 -1.0 1.11e+04 - 4.35e-06 1.02e-0
3f 1
4 5.3673037e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 1.14e-03 2.30e-0
2h 1
5 2.3289893e+04 6.95e-02 7.66e+01 -1.0 1.09e+04 - 8.00e-02 1.00e+0
0h 1
6 1.5350213e+04 6.28e-02 2.44e+01 -1.0 1.42e+01 - 6.48e-01 8.77e-0
2f 1
7 1.4017847e+04 1.97e-02 1.02e+01 -1.0 1.02e+01 - 6.51e-01 8.87e-0
1f 1
8 1.4124771e+04 1.03e-02 6.21e-01 -1.0 2.89e+00 - 9.94e-01 4.84e-0
1f 2
9 1.3793362e+04 8.67e-03 2.69e-01 -1.7 8.66e+00 - 1.00e+00 8.37e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3762396e+04 2.14e-03 9.03e-01 -1.7 1.24e+01 - 1.00e+00 4.98e-0
1h 2
11 1.3755820e+04 2.01e-04 1.55e-02 -1.7 6.21e+00 - 1.00e+00 1.00e+0
0h 1
12 1.3600001e+04 4.82e-04 2.42e-02 -3.8 1.99e+01 - 8.46e-01 8.30e-0
1f 1
13 1.3581632e+04 1.52e-04 2.07e-01 -3.8 3.35e+00 - 9.89e-01 7.17e-0
1h 1
14 1.3576970e+04 4.00e-07 3.32e-04 -3.8 9.47e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3575781e+04 1.98e-08 4.49e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
16 1.3575768e+04 7.68e-13 4.91e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.3575768014866439e+01 1.3575768014866439e+0
4
Dual infeasibility......: 4.9120923200403620e-10 4.9120923200403620e-0
7
Constraint violation....: 7.6834372197964740e-13 7.6834372197964740e-1
3
Complementarity.........: 2.6158860820724192e-09 2.6158860820724191e-0
6
Overall NLP error.......: 2.6158860820724192e-09 2.6158860820724191e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891839e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0614875e+02 9.19e+03 5.23e+01 -1.0 8.94e+03 - 8.31e-05 1.02e-0
4h 1
3 8.8589053e+02 9.18e+03 5.23e+01 -1.0 9.18e+03 - 4.99e-06 1.11e-0
3f 1
4 4.8290407e+02 8.97e+03 5.24e+01 -1.0 9.18e+03 - 1.26e-03 2.28e-0
2h 1
5 2.1194856e+04 6.67e-02 7.66e+01 -1.0 8.97e+03 - 8.32e-02 1.00e+0
0h 1
6 1.3110859e+04 6.01e-02 3.76e+01 -1.0 2.89e+01 - 4.83e-01 9.02e-0
2f 1
7 1.1611939e+04 1.94e-02 1.53e+01 -1.0 1.53e+01 - 6.18e-01 7.42e-0
1f 1
8 1.1669715e+04 5.64e-03 1.25e+00 -1.0 2.10e+00 - 9.91e-01 5.00e-0
1f 2
9 1.1851856e+04 3.17e-04 6.99e-02 -1.0 2.45e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1303065e+04 2.21e-03 9.19e-02 -2.5 2.21e+01 - 8.56e-01 8.21e-0
1f 1
11 1.1134535e+04 2.12e-03 4.58e-01 -2.5 3.77e+00 - 1.00e+00 7.49e-0
1f 1
12 1.1105283e+04 1.58e-04 4.78e-03 -2.5 9.43e-01 - 1.00e+00 1.00e+0
0h 1
13 1.1088904e+04 4.25e-05 1.63e-01 -3.8 2.68e+00 - 1.00e+00 7.50e-0
1h 1
14 1.1084573e+04 1.45e-07 3.58e-04 -3.8 6.70e-01 - 1.00e+00 1.00e+0
0f 1
15 1.1083348e+04 2.78e-08 9.22e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 1.1083335e+04 1.87e-12 1.33e-08 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
17 1.1083321e+04 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.1083320745292260e+01 1.1083320745292260e+0
4
Dual infeasibility......: 4.4776952128871208e-09 4.4776952128871208e-0
6
Constraint violation....: 2.6307220291066358e-12 2.6307220291066358e-1
2
Complementarity.........: 3.6085004017807245e-09 3.6085004017807246e-0
6
Overall NLP error.......: 4.4776952128871208e-09 4.4776952128871208e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0888295e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0557265e+02 6.71e+03 5.23e+01 -1.0 5.21e+03 - 2.69e-05 1.27e-0
4h 1
3 4.1986899e+02 6.55e+03 5.24e+01 -1.0 6.70e+03 - 3.43e-05 2.35e-0
2f 1
4 1.9285646e+04 6.51e-02 8.06e+01 -1.0 6.55e+03 - 2.96e-02 1.00e+0
0h 1
5 1.0827936e+04 6.21e-02 6.35e+01 -1.0 3.91e+01 - 2.12e-01 4.20e-0
2f 1
6 9.5566169e+03 2.07e-02 3.00e+01 -1.0 1.63e+01 - 5.39e-01 6.15e-0
1f 1
7 9.1167531e+03 6.69e-03 9.63e-01 -1.0 5.59e+00 - 9.55e-01 7.70e-0
1f 1
8 9.3796749e+03 2.25e-04 7.18e-02 -1.0 4.69e+00 - 1.00e+00 1.00e+0
0f 1
9 8.8182908e+03 2.08e-03 8.35e-02 -2.5 3.53e+00 - 8.56e-01 8.42e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.6550320e+03 2.16e-03 4.26e-01 -2.5 9.91e-01 - 1.00e+00 7.59e-0
1f 1
11 8.6281468e+03 1.29e-04 4.69e-03 -2.5 2.21e-01 - 1.00e+00 1.00e+0
0h 1
12 8.6073117e+03 3.44e-05 1.48e-01 -3.8 8.04e+00 - 1.00e+00 7.60e-0
1h 1
13 8.6018722e+03 1.27e-07 3.41e-04 -3.8 1.93e+00 - 1.00e+00 1.00e+0
0f 1
14 8.6003516e+03 2.84e-08 9.78e-04 -5.7 4.46e-01 - 1.00e+00 9.85e-0
1h 1
15 8.6003344e+03 1.90e-12 1.38e-08 -5.7 6.64e-03 - 1.00e+00 1.00e+0
0f 1
16 8.6003159e+03 2.63e-12 4.48e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 8.6003159276721703e+00 8.6003159276721708e+0
3
Dual infeasibility......: 4.4776949593146790e-09 4.4776949593146790e-0
6
Constraint violation....: 2.6308191736212905e-12 2.6308191736212905e-1
2
Complementarity.........: 3.6084981789051618e-09 3.6084981789051616e-0
6
Overall NLP error.......: 4.4776949593146790e-09 4.4776949593146790e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8775283e+02 4.77e+03 5.24e+01 -1.0 4.82e+03 - 6.64e-04 9.80e-0
3f 1
2 8.8490545e+02 4.77e+03 5.24e+01 -1.0 4.54e+03 - 9.09e-05 1.04e-0
4h 1
3 8.3891577e+02 4.76e+03 5.24e+01 -1.0 4.77e+03 - 9.27e-06 2.02e-0
3f 1
4 3.6771363e+02 4.66e+03 5.24e+01 -1.0 4.76e+03 - 2.59e-03 2.19e-0
2h 1
5 1.5982222e+04 6.47e-02 7.88e+01 -1.0 4.66e+03 - 6.69e-02 1.00e+0
0h 1
6 8.2942245e+03 5.93e-02 4.78e+01 -1.0 5.43e+01 - 3.77e-01 7.64e-0
2f 1
7 6.9811110e+03 2.94e-02 2.07e+01 -1.0 2.67e+01 - 5.54e-01 4.62e-0
1f 1
8 6.4193393e+03 6.17e-03 1.02e+00 -1.0 9.91e+00 - 9.28e-01 7.77e-0
1f 1
9 6.6977348e+03 2.38e-04 6.93e-02 -1.0 3.42e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0467842e+03 2.17e-03 8.37e-02 -2.5 5.05e+00 - 8.70e-01 8.75e-0
1f 1
11 5.9396938e+03 1.10e-03 4.47e-01 -2.5 8.28e-01 - 1.00e+00 6.10e-0
1f 1
12 5.9395944e+03 2.61e-06 8.30e-03 -2.5 1.67e-01 - 1.00e+00 1.00e+0
0h 1
13 5.9215589e+03 6.87e-06 1.24e-02 -3.8 2.68e+00 - 9.05e-01 8.92e-0
1f 1
14 5.9183066e+03 4.65e-04 4.13e-04 -3.8 2.89e-01 - 1.00e+00 1.00e+0
0f 1
15 5.9173127e+03 6.28e-05 1.14e-02 -5.7 1.49e-01 - 8.14e-01 1.00e+0
0h 1
16 5.9171977e+03 3.58e-05 4.03e-05 -5.7 9.65e-03 - 1.00e+00 1.00e+0
0h 1
17 5.9171990e+03 1.44e-06 2.56e-05 -5.7 1.50e-03 - 1.00e+00 9.93e-0
1h 1
18 5.9172014e+03 3.51e-08 4.96e-07 -5.7 2.91e-04 - 1.00e+00 1.00e+0
0f 1
19 5.9171868e+03 3.95e-08 7.31e-06 -8.6 1.84e-03 - 9.97e-01 9.81e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 5.9171865e+03 5.37e-13 2.98e-11 -8.6 3.55e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 5.9171865461866915e+00 5.9171865461866910e+0
3
Dual infeasibility......: 2.9758895519910568e-11 2.9758895519910568e-0
8
Constraint violation....: 5.3690385470872570e-13 5.3690385470872570e-1
3
Complementarity.........: 2.5100799351769640e-09 2.5100799351769639e-0
6
Overall NLP error.......: 2.5100799351769640e-09 2.5100799351769639e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9460641e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.82e-0
3h 1
2 8.8800409e+02 3.24e+03 5.24e+01 -1.0 2.00e+03 - 2.99e-05 2.58e-0
4h 1
3 3.3060749e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 1.77e-04 2.30e-0
2f 1
4 1.5630204e+04 6.30e-02 7.96e+01 -1.0 3.17e+03 - 4.56e-02 1.00e+0
0h 1
5 7.0765126e+03 5.91e-02 5.23e+01 -1.0 4.93e+01 - 3.34e-01 5.58e-0
2f 1
6 5.7030812e+03 2.49e-02 2.52e+01 -1.0 2.35e+01 - 5.21e-01 5.35e-0
1f 1
7 5.1298730e+03 7.96e-03 1.17e+00 -1.0 8.67e+00 - 9.36e-01 7.44e-0
1f 1
8 5.4098905e+03 3.10e-04 8.18e-02 -1.0 4.22e+00 - 9.97e-01 1.00e+0
0f 1
9 4.8074930e+03 2.11e-03 8.43e-02 -2.5 7.40e+00 - 8.62e-01 8.42e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.6351300e+03 2.19e-03 3.51e-01 -2.5 3.21e+00 - 1.00e+00 7.78e-0
1f 1
11 4.6082742e+03 1.61e-04 4.95e-03 -2.5 8.43e-01 - 1.00e+00 1.00e+0
0h 1
12 4.5789436e+03 2.35e-05 4.36e-02 -3.8 1.34e+01 - 1.00e+00 8.82e-0
1h 1
13 4.5762302e+03 5.78e-08 6.02e-04 -3.8 1.57e+00 - 1.00e+00 1.00e+0
0f 1
14 4.5743316e+03 4.23e-08 4.38e-05 -5.7 7.43e-01 - 1.00e+00 9.98e-0
1f 1
15 4.5743323e+03 1.88e-12 1.23e-08 -5.7 1.28e-03 - 1.00e+00 1.00e+0
0f 1
16 4.5743102e+03 2.57e-12 3.30e-06 -8.6 9.21e-03 - 1.00e+00 9.99e-0
1f 1
17 4.5743102e+03 7.11e-15 4.87e-14 -8.6 5.33e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 4.5743102007611549e+00 4.5743102007611551e+0
3
Dual infeasibility......: 4.8684100346009180e-14 4.8684100346009180e-1
1
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5663426835275676e-09 2.5663426835275675e-0
6
Overall NLP error.......: 2.5663426835275676e-09 2.5663426835275675e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1576532e+02 2.00e+03 5.23e+01 -1.0 2.01e+03 - 1.20e-03 9.82e-0
3h 1
2 9.1032833e+02 2.00e+03 5.23e+01 -1.0 1.03e+03 - 3.89e-05 2.05e-0
4h 1
3 8.9164023e+02 1.99e+03 5.23e+01 -1.0 1.99e+03 - 1.27e-04 7.35e-0
4h 1
4 3.1452032e+02 1.95e+03 5.24e+01 -1.0 2.00e+03 - 8.53e-04 2.31e-0
2f 1
5 1.4205217e+04 6.77e-02 7.65e+01 -1.0 1.95e+03 - 8.14e-02 1.00e+0
0h 1
6 6.0884316e+03 6.11e-02 3.13e+01 -1.0 2.05e+01 - 5.61e-01 8.86e-0
2f 1
7 4.5607906e+03 1.69e-02 1.34e+01 -1.0 1.27e+01 - 6.30e-01 8.72e-0
1f 1
8 4.8973663e+03 1.32e-03 2.93e-01 -1.0 3.87e+00 - 9.78e-01 1.00e+0
0f 1
9 4.4193835e+03 1.95e-03 4.27e-01 -1.7 6.43e+00 - 7.60e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.3641845e+03 6.21e-04 2.64e-01 -1.7 1.01e+01 - 8.14e-01 1.00e+0
0h 1
11 4.3918957e+03 1.50e-05 4.62e-02 -1.7 2.87e+01 - 8.57e-01 1.00e+0
0h 1
12 4.2161485e+03 4.81e-04 2.20e-02 -2.5 3.52e+01 - 9.73e-01 9.54e-0
1f 1
13 4.1882764e+03 1.61e-04 1.49e-01 -3.8 1.20e+01 - 9.86e-01 7.33e-0
1h 1
14 4.1818199e+03 4.02e-07 6.64e-04 -3.8 3.01e+00 - 1.00e+00 1.00e+0
0h 1
15 4.1805019e+03 2.58e-08 1.40e-05 -5.7 2.56e-01 - 1.00e+00 9.99e-0
1h 1
16 4.1804892e+03 1.69e-12 1.07e-03 -8.6 6.90e-05 - 4.34e-01 1.00e+0
0h 1
17 4.1804892e+03 4.31e-16 2.53e-14 -8.6 4.64e-06 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 4.1804891605810468e+00 4.1804891605810471e+0
3
Dual infeasibility......: 2.5313084961453569e-14 2.5313084961453569e-1
1
Constraint violation....: 4.3116551201310152e-16 4.3116551201310152e-1
6
Complementarity.........: 3.4285409337490464e-09 3.4285409337490465e-0
6
Overall NLP error.......: 3.4285409337490464e-09 3.4285409337490465e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2303872e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 3.31e-04 9.86e-0
3h 1
2 8.0919006e+02 9.17e+02 5.24e+01 -1.0 7.37e+02 - 8.12e-05 5.04e-0
4h 1
3 2.4239398e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 4.72e-04 2.11e-0
2f 1
4 1.2489447e+04 5.50e-02 8.23e+01 -1.0 8.98e+02 - 3.83e-02 1.00e+0
0h 1
5 3.8941148e+03 5.25e-02 5.67e+01 -1.0 8.14e+01 - 3.09e-01 4.98e-0
2f 1
6 1.9112633e+03 3.73e-02 3.04e+01 -1.0 3.92e+01 - 4.68e-01 5.06e-0
1f 1
7 4.6876227e+03 1.23e-02 2.71e+01 -1.0 2.07e+01 - 3.99e-01 1.00e+0
0h 1
8 1.8763004e+03 1.20e-02 1.04e+00 -1.0 2.56e+01 - 9.88e-01 8.91e-0
1f 1
9 1.9981274e+03 1.95e-04 4.76e-02 -1.0 2.98e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7321093e+03 2.19e-04 1.23e+00 -2.5 1.80e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5439398e+03 3.77e-03 1.33e-01 -2.5 7.59e+00 - 7.95e-01 1.00e+0
0f 1
12 1.5209204e+03 5.17e-03 3.09e-01 -2.5 1.82e+00 - 1.00e+00 7.67e-0
1h 1
13 1.5332321e+03 2.41e-04 4.72e-03 -2.5 7.16e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5031438e+03 1.70e-04 2.15e-02 -3.8 1.35e+01 - 9.90e-01 9.29e-0
1h 1
15 1.5019709e+03 7.24e-07 6.84e-05 -3.8 9.19e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003148e+03 3.77e-07 1.78e-04 -5.7 7.43e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.79e-11 2.92e-09 -5.7 4.20e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932776790840e+00 1.5002932776790840e+0
3
Dual infeasibility......: 2.1737232849201033e-09 2.1737232849201033e-0
6
Constraint violation....: 6.2995761385131743e-11 6.2995761385131743e-1
1
Complementarity.........: 2.8882174443529833e-09 2.8882174443529831e-0
6
Overall NLP error.......: 2.8882174443529833e-09 2.8882174443529831e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.27e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9796473e+02 4.09e+01 5.94e+01 -1.0 1.42e+01 - 6.99e-04 4.23e-0
2f 1
2 1.2226497e+04 6.07e-02 7.87e+01 -1.0 1.80e+01 - 7.07e-02 1.00e+0
0h 1
3 3.6201832e+03 5.54e-02 5.15e+01 -1.0 5.45e+01 - 3.33e-01 7.87e-0
2f 1
4 2.3523812e+03 2.93e-02 2.28e+01 -1.0 2.70e+01 - 5.45e-01 4.46e-0
1f 1
5 1.7571767e+03 8.49e-03 1.17e+00 -1.0 9.96e+00 - 9.27e-01 7.68e-0
1f 1
6 2.0298800e+03 3.42e-04 8.15e-02 -1.0 3.35e+00 - 1.00e+00 1.00e+0
0h 1
7 1.4033455e+03 2.08e-03 8.15e-02 -2.5 4.87e+00 - 8.66e-01 8.50e-0
1f 1
8 1.2236679e+03 2.16e-03 2.06e-01 -2.5 1.05e+00 - 1.00e+00 8.33e-0
1f 1
9 1.2066818e+03 8.65e-05 3.81e-03 -2.5 1.49e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1969333e+03 4.60e-05 1.08e+00 -3.8 9.70e-02 - 1.00e+00 4.99e-0
1h 1
11 1.1949894e+03 3.31e-07 1.13e-01 -3.8 3.83e-02 - 9.68e-01 1.00e+0
0f 1
12 1.1939528e+03 1.38e-08 1.76e-03 -3.8 3.31e-02 - 1.00e+00 1.00e+0
0H 1
13 1.1941496e+03 1.10e-05 2.71e-04 -3.8 3.66e-03 - 1.00e+00 1.00e+0
0f 1
14 1.1935294e+03 1.78e-06 6.37e-02 -5.7 1.23e-02 - 7.78e-01 9.68e-0
1h 1
15 1.1933614e+03 1.24e-05 2.14e-04 -5.7 5.02e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1933675e+03 2.91e-08 2.24e-06 -5.7 2.67e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1933542e+03 2.76e-08 9.71e-06 -8.6 2.46e-04 - 9.82e-01 9.89e-0
1h 1
18 1.1933541e+03 2.43e-13 3.27e-11 -8.6 1.97e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1933540960392466e+00 1.1933540960392465e+0
3
Dual infeasibility......: 3.2688512616098479e-11 3.2688512616098479e-0
8
Constraint violation....: 2.4291679778798425e-13 2.4291679778798425e-1
3
Complementarity.........: 2.5120652667504286e-09 2.5120652667504285e-0
6
Overall NLP error.......: 2.5120652667504286e-09 2.5120652667504285e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1584841e+02 1.09e+02 1.13e+02 -1.0 3.76e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1398692e+04 5.38e-02 8.36e+01 -1.0 4.53e+01 - 3.10e-02 1.00e+0
0h 1
3 2.7848916e+03 5.17e-02 6.48e+01 -1.0 8.43e+01 - 2.27e-01 4.32e-0
2f 1
4 9.8155785e+02 4.24e-02 3.38e+01 -1.0 3.41e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5909723e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.21e-01 1.00e+0
0h 1
6 9.4491032e+02 1.01e-02 8.73e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6264865e+02 4.59e-04 6.60e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536469e+02 1.94e-03 1.94e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379741e+02 3.25e-03 6.12e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140235e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388164e+02 1.57e-04 1.69e-02 -3.8 7.57e-01 - 9.93e-01 9.41e-0
1h 1
12 5.8370191e+02 7.28e-07 6.65e-05 -3.8 8.63e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278679e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.06e-09 -5.7 3.41e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148935385e-01 5.8277753148935381e+0
2
Dual infeasibility......: 2.0880540103884580e-09 2.0880540103884580e-0
6
Constraint violation....: 6.2994123806170421e-11 6.2994123806170421e-1
1
Complementarity.........: 2.8882094461377354e-09 2.8882094461377355e-0
6
Overall NLP error.......: 2.8882094461377354e-09 2.8882094461377355e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.77e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5003661e+02 7.50e+01 9.04e+01 -1.0 2.59e+01 - 3.83e-04 3.52e-0
2f 1
2 1.1818872e+04 5.63e-02 8.12e+01 -1.0 2.87e+01 - 4.64e-02 1.00e+0
0h 1
3 3.1585743e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.65e-0
2f 1
4 1.0154810e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8148897e+03 7.28e-03 1.55e+01 -1.0 1.93e+01 - 6.11e-01 1.00e+0
0h 1
6 1.1196673e+03 5.40e-03 4.04e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8244210e+02 9.99e-04 2.10e-01 -1.7 5.71e+00 - 1.00e+00 8.87e-0
1h 1
8 7.2817516e+02 8.46e-04 1.35e-02 -1.7 3.45e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0982259e+02 1.50e-03 1.13e-01 -3.8 4.49e+00 - 7.71e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8216110e+02 2.17e-03 7.23e-02 -3.8 2.11e+00 - 8.07e-01 7.40e-0
1h 1
11 5.8336684e+02 9.52e-05 4.78e-02 -3.8 3.17e-02 - 1.00e+00 9.56e-0
1h 1
12 5.8368716e+02 2.82e-07 1.33e-05 -3.8 3.28e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278928e+02 4.12e-07 5.39e-04 -5.7 3.47e-02 - 1.00e+00 9.91e-0
1h 1
14 5.8278859e+02 4.36e-11 3.52e-09 -5.7 2.10e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.65e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753111572750e-01 5.8277753111572747e+0
2
Dual infeasibility......: 2.6503250686559395e-09 2.6503250686559395e-0
6
Constraint violation....: 6.3002394967703879e-11 6.3002394967703879e-1
1
Complementarity.........: 2.8882681473359852e-09 2.8882681473359851e-0
6
Overall NLP error.......: 2.8882681473359852e-09 2.8882681473359851e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.27e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9796473e+02 4.09e+01 5.94e+01 -1.0 1.42e+01 - 6.99e-04 4.23e-0
2f 1
2 1.2226497e+04 6.07e-02 7.87e+01 -1.0 1.80e+01 - 7.07e-02 1.00e+0
0h 1
3 3.6201832e+03 5.54e-02 5.15e+01 -1.0 5.45e+01 - 3.33e-01 7.87e-0
2f 1
4 2.3523812e+03 2.93e-02 2.28e+01 -1.0 2.70e+01 - 5.45e-01 4.46e-0
1f 1
5 1.7571767e+03 8.49e-03 1.17e+00 -1.0 9.96e+00 - 9.27e-01 7.68e-0
1f 1
6 2.0298800e+03 3.42e-04 8.15e-02 -1.0 3.35e+00 - 1.00e+00 1.00e+0
0h 1
7 1.4033455e+03 2.08e-03 8.15e-02 -2.5 4.87e+00 - 8.66e-01 8.50e-0
1f 1
8 1.2236679e+03 2.16e-03 2.06e-01 -2.5 1.05e+00 - 1.00e+00 8.33e-0
1f 1
9 1.2066818e+03 8.65e-05 3.81e-03 -2.5 1.49e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1969333e+03 4.60e-05 1.08e+00 -3.8 9.70e-02 - 1.00e+00 4.99e-0
1h 1
11 1.1949894e+03 3.31e-07 1.13e-01 -3.8 3.83e-02 - 9.68e-01 1.00e+0
0f 1
12 1.1939528e+03 1.38e-08 1.76e-03 -3.8 3.31e-02 - 1.00e+00 1.00e+0
0H 1
13 1.1941496e+03 1.10e-05 2.71e-04 -3.8 3.66e-03 - 1.00e+00 1.00e+0
0f 1
14 1.1935294e+03 1.78e-06 6.37e-02 -5.7 1.23e-02 - 7.78e-01 9.68e-0
1h 1
15 1.1933614e+03 1.24e-05 2.14e-04 -5.7 5.02e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1933675e+03 2.91e-08 2.24e-06 -5.7 2.67e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1933542e+03 2.76e-08 9.71e-06 -8.6 2.46e-04 - 9.82e-01 9.89e-0
1h 1
18 1.1933541e+03 2.43e-13 3.27e-11 -8.6 1.97e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1933540960392466e+00 1.1933540960392465e+0
3
Dual infeasibility......: 3.2688512616098479e-11 3.2688512616098479e-0
8
Constraint violation....: 2.4291679778798425e-13 2.4291679778798425e-1
3
Complementarity.........: 2.5120652667504286e-09 2.5120652667504285e-0
6
Overall NLP error.......: 2.5120652667504286e-09 2.5120652667504285e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2278116e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 3.31e-04 9.87e-0
3h 1
2 8.0655676e+02 9.17e+02 5.24e+01 -1.0 7.64e+02 - 9.12e-05 5.91e-0
4h 1
3 6.8551274e+02 9.13e+02 5.24e+01 -1.0 9.17e+02 - 5.58e-04 4.52e-0
3h 1
4 2.5424767e+02 8.94e+02 5.24e+01 -1.0 9.13e+02 - 5.37e-03 2.03e-0
2f 1
5 1.0171545e+04 5.97e-02 8.27e+01 -1.0 8.94e+02 - 4.73e-02 1.00e+0
0h 1
6 3.6641626e+03 5.57e-02 4.00e+01 -1.0 6.42e+01 - 5.07e-01 6.19e-0
2f 1
7 1.8848289e+03 3.80e-02 1.82e+01 -1.0 3.83e+01 - 5.39e-01 4.87e-0
1f 1
8 2.8688311e+03 3.43e-03 5.12e+00 -1.0 6.15e+00 - 8.07e-01 1.00e+0
0f 1
9 2.1131669e+03 1.02e-03 8.36e-02 -1.0 6.46e+00 - 9.91e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6961670e+03 7.22e-04 4.22e-01 -2.5 7.50e+00 - 9.09e-01 7.34e-0
1f 1
11 1.5458645e+03 3.09e-03 2.28e-01 -2.5 7.71e+00 - 7.23e-01 1.00e+0
0f 1
12 1.5243442e+03 2.42e-03 2.16e-01 -2.5 1.67e+00 - 1.00e+00 8.40e-0
1h 1
13 1.5335197e+03 1.10e-04 3.95e-03 -2.5 4.58e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5029410e+03 1.62e-04 2.15e-02 -3.8 1.39e+01 - 9.92e-01 9.31e-0
1h 1
15 1.5019708e+03 7.72e-07 7.02e-05 -3.8 7.26e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003141e+03 3.77e-07 1.79e-04 -5.7 7.43e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.80e-11 2.93e-09 -5.7 1.63e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932775672870e+00 1.5002932775672871e+0
3
Dual infeasibility......: 2.1737171972621241e-09 2.1737171972621241e-0
6
Constraint violation....: 6.2996122207614746e-11 6.2996122207614746e-1
1
Complementarity.........: 2.8882173001081015e-09 2.8882173001081015e-0
6
Overall NLP error.......: 2.8882173001081015e-09 2.8882173001081015e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
1 8.6534799e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 4.97e-04 9.87e-0
3h 1
2 8.4756645e+02 9.17e+02 5.24e+01 -1.0 7.79e+02 - 8.94e-05 6.57e-0
4h 1
3 7.0654356e+02 9.12e+02 5.24e+01 -1.0 9.17e+02 - 6.24e-04 5.32e-0
3h 1
4 2.7668058e+02 8.93e+02 5.23e+01 -1.0 9.12e+02 - 6.28e-03 2.08e-0
2f 1
5 1.0297985e+04 6.55e-02 8.03e+01 -1.0 8.93e+02 - 6.71e-02 1.00e+0
0h 1
38 1.575332e+04 1.632511e+04 3.760600e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2433855e+02 1.57e+04 5.24e+01 -1.0 1.59e+04 - 3.31e-04 9.80e-0
3h 1
2 8.2143048e+02 1.57e+04 5.24e+01 -1.0 1.45e+04 - 3.13e-05 1.08e-0
4h 1
3 8.1616535e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 1.13e-05 4.23e-0
4h 1
4 8.0810499e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 4.31e-04 6.67e-0
4h 1
5 5.7248993e+02 1.54e+04 5.26e+01 -1.0 1.57e+04 - 1.18e-03 2.11e-0
2f 1
6 2.6766687e+04 5.60e-02 8.25e+01 -1.0 1.54e+04 - 3.98e-02 1.00e+0
0h 1
7 1.8670501e+04 5.32e-02 5.19e+01 -1.0 7.71e+01 - 3.67e-01 5.19e-0
2f 1
8 1.6727236e+04 3.68e-02 2.73e+01 -1.0 3.95e+01 - 4.77e-01 4.99e-0
1f 1
9 1.7065563e+04 2.31e-02 1.20e+01 -1.0 2.01e+01 - 4.09e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6825929e+04 5.97e-03 3.11e+00 -1.0 4.65e+00 - 8.12e-01 1.00e+0
0h 1
11 1.6853135e+04 1.95e-04 1.75e+00 -1.0 3.54e+00 - 3.11e-01 1.00e+0
0f 1
12 1.6854273e+04 9.40e-06 5.13e-01 -1.0 1.95e+00 - 7.07e-01 1.00e+0
0f 1
13 1.6547889e+04 2.43e-04 3.93e-01 -1.7 5.29e+00 - 8.75e-01 7.50e-0
1f 1
14 1.6487018e+04 5.94e-04 3.58e-01 -1.7 8.10e+00 - 6.18e-01 1.00e+0
0f 1
15 1.6486079e+04 8.59e-05 6.31e-02 -1.7 1.33e+01 - 7.69e-01 1.00e+0
0h 1
16 1.6367209e+04 1.07e-03 6.19e-02 -2.5 1.72e+01 - 9.11e-01 1.00e+0
0f 1
17 1.6344646e+04 1.30e-03 1.47e-02 -2.5 3.70e+00 - 1.00e+00 1.00e+0
0h 1
18 1.6328088e+04 2.33e-04 1.06e-01 -3.8 5.65e+00 - 1.00e+00 8.34e-0
1h 1
19 1.6326247e+04 4.97e-07 1.25e-04 -3.8 8.05e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325270e+04 3.61e-07 8.07e-03 -5.7 2.59e-01 - 1.00e+00 8.28e-0
1h 1
21 1.6325119e+04 1.19e-08 4.21e-07 -5.7 5.84e-03 - 1.00e+00 1.00e+0
0f 1
22 1.6325105e+04 1.14e-10 2.85e-06 -8.6 2.28e-03 - 1.00e+00 9.96e-0
1h 1
23 1.6325105e+04 1.42e-14 4.22e-14 -8.6 3.62e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 23
(scaled) (unscaled)
Objective...............: 1.6325105232526752e+01 1.6325105232526752e+0
4
Dual infeasibility......: 4.2153915541521720e-14 4.2153915541521720e-1
1
Constraint violation....: 1.4210854715202004e-14 1.4210854715202004e-1
4
Complementarity.........: 2.5060245428760610e-09 2.5060245428760609e-0
6
Overall NLP error.......: 2.5060245428760610e-09 2.5060245428760609e-0
6
Number of objective function evaluations = 27
Number of objective gradient evaluations = 24
Number of equality constraint evaluations = 27
Number of inequality constraint evaluations = 27
Number of equality constraint Jacobian evaluations = 24
Number of inequality constraint Jacobian evaluations = 24
Number of Lagrangian Hessian evaluations = 23
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9224816e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.64e-04 9.80e-0
3f 1
2 7.8937413e+02 1.50e+04 5.25e+01 -1.0 1.43e+04 - 4.77e-05 1.03e-0
4h 1
3 7.8779882e+02 1.50e+04 5.25e+01 -1.0 1.48e+04 - 6.46e-06 1.17e-0
4h 1
4 7.8590459e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 1.22e-04 1.43e-0
4h 1
5 5.2024813e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 2.70e-04 2.05e-0
2f 1
6 2.6343470e+04 5.38e-02 8.38e+01 -1.0 1.47e+04 - 3.21e-02 1.00e+0
0h 1
7 1.7699492e+04 5.16e-02 6.44e+01 -1.0 8.19e+01 - 2.34e-01 4.47e-0
2f 1
8 1.5949097e+04 4.28e-02 3.31e+01 -1.0 3.30e+01 - 4.85e-01 4.66e-0
1f 1
9 1.6267890e+04 2.67e-02 1.46e+01 -1.0 1.79e+01 - 4.32e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6014883e+04 6.01e-03 1.76e-01 -1.0 4.98e+00 - 9.91e-01 1.00e+0
0h 1
11 1.5732053e+04 1.19e-03 2.76e-01 -1.7 4.54e+00 - 1.00e+00 8.69e-0
1f 1
12 1.5710504e+04 7.75e-04 1.09e-02 -1.7 1.88e+01 - 1.00e+00 1.00e+0
0f 1
13 1.5582773e+04 1.33e-03 8.92e-02 -3.8 2.31e+01 - 7.99e-01 9.32e-0
1f 1
14 1.5559610e+04 1.47e-03 6.40e-02 -3.8 1.70e+00 - 8.49e-01 7.73e-0
1h 1
15 1.5560166e+04 2.69e-06 7.40e-04 -3.8 2.93e-02 - 1.00e+00 1.00e+0
0h 1
16 1.5559221e+04 3.16e-07 6.10e-04 -5.7 1.49e-01 - 1.00e+00 9.88e-0
1h 1
17 1.5559215e+04 3.95e-11 6.17e-09 -5.7 1.41e-01 - 1.00e+00 1.00e+0
0f 1
18 1.5559202e+04 6.30e-11 2.09e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5559202139421892e+01 1.5559202139421892e+0
4
Dual infeasibility......: 2.0878337501389045e-09 2.0878337501389045e-0
6
Constraint violation....: 6.2996066696463515e-11 6.2996066696463515e-1
1
Complementarity.........: 2.8881089073541244e-09 2.8881089073541243e-0
6
Overall NLP error.......: 2.8881089073541244e-09 2.8881089073541243e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4130465e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.82e-04 9.80e-0
3f 1
2 8.3849786e+02 1.39e+04 5.24e+01 -1.0 1.37e+04 - 9.31e-05 1.01e-0
4h 1
3 8.2945359e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 3.09e-06 6.40e-0
4f 1
4 5.3684217e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 6.88e-04 2.14e-0
2h 1
5 2.5500179e+04 5.69e-02 8.14e+01 -1.0 1.36e+04 - 4.41e-02 1.00e+0
0h 1
6 1.7000376e+04 5.35e-02 5.24e+01 -1.0 8.00e+01 - 3.49e-01 5.49e-0
2f 1
7 1.4904698e+04 3.41e-02 2.85e+01 -1.0 4.20e+01 - 4.65e-01 5.29e-0
1f 1
8 1.5414714e+04 1.86e-02 1.01e+01 -1.0 1.88e+01 - 5.31e-01 2.50e-0
1f 3
9 1.5062409e+04 5.22e-03 5.79e-01 -1.0 5.33e+00 - 9.56e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4707698e+04 1.45e-03 5.03e-01 -1.7 6.89e+00 - 1.00e+00 7.90e-0
1f 1
11 1.4643169e+04 8.54e-04 2.32e-02 -1.7 1.85e+01 - 1.00e+00 1.00e+0
0f 1
12 1.4507924e+04 1.50e-03 1.05e-01 -3.8 1.99e+01 - 7.70e-01 9.15e-0
1f 1
13 1.4479924e+04 2.20e-03 1.07e-01 -3.8 2.07e+00 - 8.23e-01 7.29e-0
1h 1
14 1.4480893e+04 2.83e-05 8.90e-03 -3.8 4.51e-01 - 1.00e+00 9.92e-0
1h 1
15 1.4481112e+04 2.91e-07 3.34e-06 -3.8 4.44e-02 - 1.00e+00 1.00e+0
0f 1
16 1.4480067e+04 4.13e-07 5.16e-04 -5.7 1.49e-01 - 1.00e+00 9.92e-0
1h 1
17 1.4480065e+04 4.35e-11 3.44e-09 -5.7 4.65e-03 - 1.00e+00 1.00e+0
0f 1
18 1.4480052e+04 6.30e-11 2.62e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.4480051766453563e+01 1.4480051766453564e+0
4
Dual infeasibility......: 2.6170671275233060e-09 2.6170671275233060e-0
6
Constraint violation....: 6.3001465155920755e-11 6.3001465155920755e-1
1
Complementarity.........: 2.8882629454877159e-09 2.8882629454877157e-0
6
Overall NLP error.......: 2.8882629454877159e-09 2.8882629454877157e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.7796346e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.75e-04 9.80e-0
3h 1
2 8.7513155e+02 1.27e+04 5.24e+01 -1.0 1.20e+04 - 4.38e-05 1.05e-0
4h 1
3 8.6166082e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 8.14e-06 8.97e-0
4f 1
4 8.3569322e+02 1.26e+04 5.23e+01 -1.0 1.26e+04 - 9.07e-04 1.79e-0
3h 1
5 5.6092209e+02 1.23e+04 5.23e+01 -1.0 1.26e+04 - 4.11e-03 2.19e-0
2f 1
6 2.2838871e+04 6.57e-02 7.97e+01 -1.0 1.23e+04 - 6.71e-02 1.00e+0
0h 1
7 1.5932958e+04 6.01e-02 4.40e+01 -1.0 5.81e+01 - 4.31e-01 7.85e-0
2f 1
8 1.4547644e+04 3.08e-02 1.82e+01 -1.0 3.14e+01 - 5.70e-01 4.45e-0
1f 1
9 1.4005356e+04 6.98e-03 1.22e+00 -1.0 1.05e+01 - 9.24e-01 8.72e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4310764e+04 1.04e-04 1.34e-01 -1.0 4.28e+00 - 9.20e-01 1.00e+0
0f 1
11 1.3748384e+04 9.43e-04 6.08e-01 -1.7 2.02e+01 - 5.67e-01 8.89e-0
1f 1
12 1.3796289e+04 5.87e-05 2.50e-02 -1.7 3.62e+00 - 1.00e+00 1.00e+0
0f 1
13 1.3675671e+04 3.28e-05 1.15e-01 -2.5 2.52e+01 - 1.00e+00 8.97e-0
1f 1
14 1.3672386e+04 1.95e-04 1.62e-03 -2.5 2.49e+00 - 1.00e+00 1.00e+0
0f 1
15 1.3657035e+04 4.17e-04 5.57e-02 -3.8 4.00e+00 - 7.81e-01 9.65e-0
1h 1
16 1.3653872e+04 1.92e-03 1.39e-03 -3.8 1.56e-01 - 9.95e-01 1.00e+0
0h 1
17 1.3653943e+04 8.79e-05 6.55e-05 -3.8 1.28e-02 - 1.00e+00 1.00e+0
0h 1
18 1.3652717e+04 1.33e-04 6.52e-04 -5.7 1.51e-01 - 9.31e-01 1.00e+0
0h 1
19 1.3652678e+04 2.91e-05 5.75e-06 -5.7 7.84e-03 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.3652681e+04 2.21e-07 5.22e-06 -5.7 6.73e-04 - 1.00e+00 1.00e+0
0h 1
21 1.3652669e+04 3.19e-08 1.93e-04 -8.6 1.84e-03 - 1.00e+00 9.04e-0
1h 1
22 1.3652668e+04 2.60e-11 5.15e-10 -8.6 1.77e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.3652668026850995e+01 1.3652668026850994e+0
4
Dual infeasibility......: 5.1504597759651059e-10 5.1504597759651063e-0
7
Constraint violation....: 2.6041391265607672e-11 2.6041391265607672e-1
1
Complementarity.........: 2.5502002072596942e-09 2.5502002072596941e-0
6
Overall NLP error.......: 2.5502002072596942e-09 2.5502002072596941e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9482527e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 7.48e-04 9.80e-0
3h 1
2 8.9206259e+02 1.11e+04 5.24e+01 -1.0 1.09e+04 - 8.69e-05 1.01e-0
4h 1
3 8.7788074e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 4.01e-06 8.67e-0
4f 1
4 5.1726064e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 9.54e-04 2.26e-0
2h 1
5 2.3121559e+04 6.40e-02 7.79e+01 -1.0 1.09e+04 - 6.98e-02 1.00e+0
0h 1
6 1.4812165e+04 5.85e-02 4.83e+01 -1.0 4.95e+01 - 3.63e-01 7.77e-0
2f 1
7 1.3505031e+04 2.67e-02 2.10e+01 -1.0 2.28e+01 - 5.57e-01 5.00e-0
1f 1
8 1.3018007e+04 6.85e-03 1.23e+00 -1.0 8.59e+00 - 9.37e-01 7.36e-0
1f 1
9 1.3268789e+04 3.20e-04 7.93e-02 -1.0 2.91e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2683148e+04 2.08e-03 9.07e-02 -2.5 4.28e+00 - 8.62e-01 8.28e-0
1f 1
11 1.2505092e+04 2.17e-03 3.62e-01 -2.5 1.06e+00 - 1.00e+00 7.74e-0
1f 1
12 1.2476207e+04 1.68e-04 5.11e-03 -2.5 2.15e-01 - 1.00e+00 1.00e+0
0h 1
13 1.2456345e+04 2.44e-05 4.31e-02 -3.8 2.68e+00 - 1.00e+00 8.82e-0
1h 1
14 1.2454881e+04 5.88e-08 6.10e-04 -3.8 3.16e-01 - 1.00e+00 1.00e+0
0f 1
15 1.2453574e+04 4.24e-08 1.39e-05 -5.7 1.49e-01 - 1.00e+00 9.99e-0
1f 1
16 1.2453562e+04 6.84e-13 3.99e-09 -8.6 1.93e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.2453562298742824e+01 1.2453562298742823e+0
4
Dual infeasibility......: 3.9883526938160976e-09 3.9883526938160976e-0
6
Constraint violation....: 6.8425820565209960e-13 6.8425820565209960e-1
3
Complementarity.........: 2.7863203153553057e-09 2.7863203153553058e-0
6
Overall NLP error.......: 3.9883526938160976e-09 3.9883526938160976e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8776327e+02 9.19e+03 5.24e+01 -1.0 9.28e+03 - 6.64e-04 9.80e-0
3h 1
2 8.8487848e+02 9.19e+03 5.24e+01 -1.0 8.49e+03 - 4.35e-05 1.07e-0
4h 1
3 8.1017702e+02 9.15e+03 5.24e+01 -1.0 9.19e+03 - 1.14e-05 4.07e-0
3h 1
4 4.8829986e+02 8.96e+03 5.23e+01 -1.0 9.15e+03 - 4.62e-03 2.12e-0
2h 1
5 1.9624072e+04 6.67e-02 7.88e+01 -1.0 8.96e+03 - 7.36e-02 1.00e+0
0h 1
6 1.2613352e+04 6.06e-02 4.34e+01 -1.0 5.13e+01 - 4.30e-01 8.42e-0
2f 1
7 1.1287964e+04 2.91e-02 1.67e+01 -1.0 2.55e+01 - 6.00e-01 4.84e-0
1f 1
8 1.0844638e+04 5.12e-03 9.75e-01 -1.0 9.16e+00 - 9.34e-01 7.59e-0
1f 1
9 1.1096445e+04 1.87e-04 6.09e-02 -1.0 4.66e+00 - 9.96e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.0465448e+04 2.23e-03 7.97e-02 -2.5 4.77e+00 - 8.70e-01 8.69e-0
1f 1
11 1.0359648e+04 1.08e-03 4.55e-01 -2.5 7.60e-01 - 1.00e+00 6.04e-0
1f 1
12 1.0359697e+04 2.49e-06 8.13e-03 -2.5 1.52e-01 - 1.00e+00 1.00e+0
0h 1
13 1.0339422e+04 6.16e-06 2.40e-02 -3.8 5.36e+00 - 9.14e-01 8.89e-0
1f 1
14 1.0335906e+04 4.60e-04 4.73e-04 -3.8 5.92e-01 - 1.00e+00 1.00e+0
0f 1
15 1.0334764e+04 6.26e-05 1.12e-02 -5.7 2.97e-01 - 8.14e-01 1.00e+0
0h 1
16 1.0334651e+04 3.51e-05 3.93e-05 -5.7 9.55e-03 - 1.00e+00 1.00e+0
0h 1
17 1.0334652e+04 1.18e-06 1.12e-05 -5.7 1.44e-03 - 1.00e+00 9.97e-0
1h 1
18 1.0334638e+04 2.43e-09 9.94e-08 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
19 1.0334638e+04 7.11e-15 3.66e-14 -8.6 6.42e-07 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.0334637956136994e+01 1.0334637956136994e+0
4
Dual infeasibility......: 3.6582623705644632e-14 3.6582623705644632e-1
1
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.6205838220647732e-09 2.6205838220647730e-0
6
Overall NLP error.......: 2.6205838220647732e-09 2.6205838220647730e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3710605e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 3.06e-03 9.80e-0
3h 1
2 9.3410771e+02 6.71e+03 5.23e+01 -1.0 6.33e+03 - 5.53e-05 1.05e-0
4h 1
3 8.7601628e+02 6.69e+03 5.23e+01 -1.0 6.70e+03 - 8.90e-06 2.62e-0
3f 1
4 4.4078555e+02 6.54e+03 5.23e+01 -1.0 6.69e+03 - 3.32e-03 2.17e-0
2h 1
5 1.7952487e+04 7.75e-02 7.79e+01 -1.0 6.54e+03 - 7.84e-02 1.00e+0
0h 1
6 1.1162158e+04 7.00e-02 2.30e+01 -1.0 4.32e+00 - 6.80e-01 8.97e-0
2f 1
7 1.0161093e+04 3.32e-02 7.43e+00 -1.0 4.23e+00 - 7.42e-01 1.00e+0
0f 1
8 1.0283900e+04 1.70e-02 7.27e-01 -1.0 1.10e+00 - 9.96e-01 4.94e-0
1f 2
9 1.0000013e+04 8.27e-03 3.35e-01 -1.7 1.28e+01 - 1.00e+00 8.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.9361941e+03 1.02e-03 1.04e-01 -1.7 8.95e+00 - 1.00e+00 1.00e+0
0f 1
11 9.8169976e+03 2.77e-04 1.12e-01 -2.5 1.73e+01 - 9.89e-01 8.85e-0
1f 1
12 9.8069007e+03 4.94e-06 1.10e-03 -2.5 1.95e+00 - 1.00e+00 1.00e+0
0f 1
13 9.7851225e+03 5.56e-06 7.61e-04 -3.8 2.68e+00 - 1.00e+00 1.00e+0
0f 1
14 9.7842068e+03 3.44e-09 3.52e-06 -5.7 1.48e-01 - 1.00e+00 1.00e+0
0h 1
15 9.7841926e+03 2.34e-12 4.09e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 9.7841925775286622e+00 9.7841925775286618e+0
3
Dual infeasibility......: 4.0868851789393714e-10 4.0868851789393714e-0
7
Constraint violation....: 2.3424734374444256e-12 2.3424734374444256e-1
2
Complementarity.........: 2.5729802584919094e-09 2.5729802584919092e-0
6
Overall NLP error.......: 2.5729802584919094e-09 2.5729802584919092e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3002852e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 2.02e-03 9.81e-0
3h 1
2 9.2665255e+02 4.77e+03 5.23e+01 -1.0 3.78e+03 - 3.07e-05 1.25e-0
4h 1
3 4.3498287e+02 4.67e+03 5.24e+01 -1.0 4.77e+03 - 3.22e-05 2.12e-0
2f 1
4 1.2082351e+04 8.33e-02 7.86e+01 -1.0 4.67e+03 - 3.26e-02 1.00e+0
0h 1
5 9.1245127e+03 7.96e-02 2.66e+01 -1.0 1.08e+01 - 6.13e-01 4.30e-0
2f 1
6 7.9979611e+03 1.30e-02 1.10e+01 -1.0 9.06e+00 - 6.51e-01 8.24e-0
1f 1
7 8.1341085e+03 8.57e-03 1.53e-01 -1.0 2.78e+00 - 9.90e-01 9.38e-0
1f 1
8 7.7591595e+03 2.58e-03 1.21e+00 -1.7 8.20e+00 - 3.77e-01 1.00e+0
0f 1
9 7.7265027e+03 2.50e-04 5.51e-01 -1.7 9.26e+00 - 7.24e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.7385379e+03 1.00e-04 4.65e-02 -1.7 1.33e+01 - 9.43e-01 1.00e+0
0f 1
11 7.5748156e+03 4.13e-04 1.81e-02 -2.5 2.49e+01 - 9.78e-01 9.56e-0
1f 1
12 7.5527041e+03 1.02e-04 1.55e-01 -3.8 7.31e+00 - 9.99e-01 7.76e-0
1h 1
13 7.5478991e+03 1.90e-07 1.22e-04 -3.8 1.64e+00 - 1.00e+00 1.00e+0
0f 1
14 7.5465631e+03 1.77e-08 3.00e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
15 7.5465477e+03 1.29e-12 4.23e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 7.5465477343692982e+00 7.5465477343692983e+0
3
Dual infeasibility......: 4.2332432000686431e-10 4.2332432000686431e-0
7
Constraint violation....: 1.2912310110024805e-12 1.2912310110024805e-1
2
Complementarity.........: 3.9357344080216007e-09 3.9357344080216008e-0
6
Overall NLP error.......: 3.9357344080216007e-09 3.9357344080216008e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2280559e+02 3.24e+03 5.23e+01 -1.0 3.27e+03 - 1.51e-03 9.82e-0
3h 1
2 8.7858780e+02 3.24e+03 5.23e+01 -1.0 3.07e+03 - 2.27e-05 1.80e-0
3h 1
3 3.4987166e+02 3.16e+03 5.24e+01 -1.0 3.24e+03 - 1.77e-03 2.26e-0
2h 1
4 1.5175449e+04 7.03e-02 7.68e+01 -1.0 3.17e+03 - 8.03e-02 1.00e+0
0h 1
5 7.4650659e+03 6.35e-02 2.37e+01 -1.0 1.36e+01 - 6.58e-01 8.85e-0
2f 1
6 6.1538524e+03 2.02e-02 9.68e+00 -1.0 9.91e+00 - 6.60e-01 8.87e-0
1f 1
7 6.3688205e+03 5.76e-03 1.23e-01 -1.0 2.80e+00 - 9.91e-01 9.60e-0
1f 1
8 5.9583428e+03 2.74e-03 2.09e-01 -1.7 1.55e+01 - 8.97e-01 1.00e+0
0f 1
9 5.9480185e+03 8.53e-04 7.96e-01 -1.7 6.16e+01 - 3.46e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.9909120e+03 6.86e-06 3.41e-04 -1.7 2.92e+01 - 1.00e+00 1.00e+0
0h 1
11 5.7580766e+03 4.53e-04 2.10e-02 -3.8 1.07e+02 - 8.48e-01 8.41e-0
1f 1
12 5.7309069e+03 1.39e-04 2.04e-01 -3.8 1.66e+01 - 9.93e-01 7.25e-0
1h 1
13 5.7229554e+03 3.22e-07 2.85e-04 -3.8 4.55e+00 - 1.00e+00 1.00e+0
0h 1
14 5.7210223e+03 1.94e-08 4.48e-06 -5.7 8.91e-01 - 1.00e+00 1.00e+0
0h 1
15 5.7210000e+03 7.74e-13 4.74e-10 -8.6 1.10e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.7210000434309833e+00 5.7210000434309832e+0
3
Dual infeasibility......: 4.7371880417349462e-10 4.7371880417349462e-0
7
Constraint violation....: 7.7364503692223252e-13 7.7364503692223252e-1
3
Complementarity.........: 3.2246465535500931e-09 3.2246465535500931e-0
6
Overall NLP error.......: 3.2246465535500931e-09 3.2246465535500931e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1583257e+02 2.00e+03 5.23e+01 -1.0 2.01e+03 - 1.20e-03 9.81e-0
3h 1
2 9.1195716e+02 2.00e+03 5.23e+01 -1.0 1.37e+03 - 4.87e-05 1.44e-0
4h 1
3 3.1303385e+02 1.95e+03 5.24e+01 -1.0 2.00e+03 - 6.04e-05 2.36e-0
2f 1
4 1.4608110e+04 6.65e-02 7.72e+01 -1.0 1.95e+03 - 6.92e-02 1.00e+0
0h 1
5 6.1485043e+03 6.09e-02 3.60e+01 -1.0 2.22e+01 - 5.08e-01 7.70e-0
2f 1
6 4.6744427e+03 1.15e-02 1.62e+01 -1.0 1.30e+01 - 6.04e-01 8.35e-0
1f 1
7 4.8737737e+03 2.78e-03 1.37e-01 -1.0 3.28e+00 - 9.92e-01 1.00e+0
0f 1
8 4.4144776e+03 1.77e-03 1.46e-01 -1.7 7.23e+00 - 1.00e+00 1.00e+0
0f 1
9 4.2301445e+03 2.01e-03 3.83e-01 -2.5 2.14e+00 - 1.00e+00 7.84e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2032539e+03 1.87e-04 1.95e-02 -2.5 4.46e-01 - 1.00e+00 9.81e-0
1f 1
11 4.1817214e+03 1.90e-06 1.87e-02 -3.8 5.38e+00 - 9.84e-01 1.00e+0
0h 1
12 4.1818471e+03 1.75e-09 4.85e-06 -3.8 6.74e-03 - 1.00e+00 1.00e+0
0h 1
13 4.1805081e+03 1.80e-08 1.81e-04 -5.7 2.97e-01 - 1.00e+00 9.96e-0
1f 1
14 4.1805057e+03 1.80e-12 2.29e-09 -5.7 1.19e-03 - 1.00e+00 1.00e+0
0f 1
15 4.1804892e+03 2.63e-12 1.52e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 4.1804891592068270e+00 4.1804891592068270e+0
3
Dual infeasibility......: 1.5189630651899585e-09 1.5189630651899585e-0
6
Constraint violation....: 2.6291122057209293e-12 2.6291122057209293e-1
2
Complementarity.........: 3.4012226961200556e-09 3.4012226961200554e-0
6
Overall NLP error.......: 3.4012226961200556e-09 3.4012226961200554e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2278116e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 3.31e-04 9.87e-0
3h 1
2 8.0655676e+02 9.17e+02 5.24e+01 -1.0 7.64e+02 - 9.12e-05 5.91e-0
4h 1
3 6.8551274e+02 9.13e+02 5.24e+01 -1.0 9.17e+02 - 5.58e-04 4.52e-0
3h 1
4 2.5424767e+02 8.94e+02 5.24e+01 -1.0 9.13e+02 - 5.37e-03 2.03e-0
2f 1
5 1.0171545e+04 5.97e-02 8.27e+01 -1.0 8.94e+02 - 4.73e-02 1.00e+0
0h 1
6 3.6641626e+03 5.57e-02 4.00e+01 -1.0 6.42e+01 - 5.07e-01 6.19e-0
2f 1
7 1.8848289e+03 3.80e-02 1.82e+01 -1.0 3.83e+01 - 5.39e-01 4.87e-0
1f 1
8 2.8688311e+03 3.43e-03 5.12e+00 -1.0 6.15e+00 - 8.07e-01 1.00e+0
0f 1
9 2.1131669e+03 1.02e-03 8.36e-02 -1.0 6.46e+00 - 9.91e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6961670e+03 7.22e-04 4.22e-01 -2.5 7.50e+00 - 9.09e-01 7.34e-0
1f 1
11 1.5458645e+03 3.09e-03 2.28e-01 -2.5 7.71e+00 - 7.23e-01 1.00e+0
0f 1
12 1.5243442e+03 2.42e-03 2.16e-01 -2.5 1.67e+00 - 1.00e+00 8.40e-0
1h 1
13 1.5335197e+03 1.10e-04 3.95e-03 -2.5 4.58e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5029410e+03 1.62e-04 2.15e-02 -3.8 1.39e+01 - 9.92e-01 9.31e-0
1h 1
15 1.5019708e+03 7.72e-07 7.02e-05 -3.8 7.26e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003141e+03 3.77e-07 1.79e-04 -5.7 7.43e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.80e-11 2.93e-09 -5.7 1.63e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932775672870e+00 1.5002932775672871e+0
3
Dual infeasibility......: 2.1737169752175192e-09 2.1737169752175192e-0
6
Constraint violation....: 6.2995858529646398e-11 6.2995858529646398e-1
1
Complementarity.........: 2.8882173001081015e-09 2.8882173001081015e-0
6
Overall NLP error.......: 2.8882173001081015e-09 2.8882173001081015e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.77e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5002486e+02 7.50e+01 9.04e+01 -1.0 2.59e+01 - 3.83e-04 3.52e-0
2f 1
2 1.1818748e+04 5.63e-02 8.12e+01 -1.0 2.87e+01 - 4.64e-02 1.00e+0
0h 1
3 3.1584760e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.65e-0
2f 1
4 1.0154559e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8154931e+03 7.28e-03 1.55e+01 -1.0 1.93e+01 - 6.10e-01 1.00e+0
0h 1
6 1.1193857e+03 5.40e-03 4.04e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8239835e+02 9.98e-04 2.09e-01 -1.7 5.71e+00 - 1.00e+00 8.88e-0
1h 1
8 7.2813379e+02 8.47e-04 1.34e-02 -1.7 3.45e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0980708e+02 1.50e-03 1.13e-01 -3.8 4.49e+00 - 7.71e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8216323e+02 2.17e-03 7.25e-02 -3.8 2.11e+00 - 8.07e-01 7.40e-0
1h 1
11 5.8336793e+02 9.41e-05 4.73e-02 -3.8 3.16e-02 - 1.00e+00 9.56e-0
1h 1
12 5.8368716e+02 2.82e-07 1.32e-05 -3.8 3.31e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278927e+02 4.12e-07 5.37e-04 -5.7 3.47e-02 - 1.00e+00 9.91e-0
1h 1
14 5.8278859e+02 4.36e-11 3.51e-09 -5.7 2.12e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.65e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753111686348e-01 5.8277753111686343e+0
2
Dual infeasibility......: 2.6486148956955613e-09 2.6486148956955613e-0
6
Constraint violation....: 6.3002103534159914e-11 6.3002103534159914e-1
1
Complementarity.........: 2.8882678876850758e-09 2.8882678876850756e-0
6
Overall NLP error.......: 2.8882678876850758e-09 2.8882678876850756e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1583979e+02 1.09e+02 1.13e+02 -1.0 3.76e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1398569e+04 5.38e-02 8.36e+01 -1.0 4.53e+01 - 3.10e-02 1.00e+0
0h 1
3 2.7847768e+03 5.17e-02 6.48e+01 -1.0 8.43e+01 - 2.27e-01 4.32e-0
2f 1
4 9.8154680e+02 4.24e-02 3.38e+01 -1.0 3.41e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5908602e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.21e-01 1.00e+0
0h 1
6 9.4490807e+02 1.01e-02 8.73e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6264784e+02 4.59e-04 6.60e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536457e+02 1.94e-03 1.94e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379731e+02 3.25e-03 6.12e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140236e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388162e+02 1.57e-04 1.69e-02 -3.8 7.57e-01 - 9.93e-01 9.41e-0
1h 1
12 5.8370191e+02 7.28e-07 6.65e-05 -3.8 8.63e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278679e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.06e-09 -5.7 3.41e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148936495e-01 5.8277753148936495e+0
2
Dual infeasibility......: 2.0880377650186252e-09 2.0880377650186252e-0
6
Constraint violation....: 6.2994387484138770e-11 6.2994387484138770e-1
1
Complementarity.........: 2.8882094445772146e-09 2.8882094445772145e-0
6
Overall NLP error.......: 2.8882094445772146e-09 2.8882094445772145e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.77e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5002486e+02 7.50e+01 9.04e+01 -1.0 2.59e+01 - 3.83e-04 3.52e-0
2f 1
2 1.1818748e+04 5.63e-02 8.12e+01 -1.0 2.87e+01 - 4.64e-02 1.00e+0
0h 1
3 3.1584760e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.65e-0
2f 1
4 1.0154559e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8154931e+03 7.28e-03 1.55e+01 -1.0 1.93e+01 - 6.10e-01 1.00e+0
0h 1
6 1.1193857e+03 5.40e-03 4.04e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8239835e+02 9.98e-04 2.09e-01 -1.7 5.71e+00 - 1.00e+00 8.88e-0
1h 1
8 7.2813379e+02 8.47e-04 1.34e-02 -1.7 3.45e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0980708e+02 1.50e-03 1.13e-01 -3.8 4.49e+00 - 7.71e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8216323e+02 2.17e-03 7.25e-02 -3.8 2.11e+00 - 8.07e-01 7.40e-0
1h 1
11 5.8336793e+02 9.41e-05 4.73e-02 -3.8 3.16e-02 - 1.00e+00 9.56e-0
1h 1
12 5.8368716e+02 2.82e-07 1.32e-05 -3.8 3.31e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278927e+02 4.12e-07 5.37e-04 -5.7 3.47e-02 - 1.00e+00 9.91e-0
1h 1
14 5.8278859e+02 4.36e-11 3.51e-09 -5.7 2.12e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.65e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753111686348e-01 5.8277753111686343e+0
2
Dual infeasibility......: 2.6486148956955613e-09 2.6486148956955613e-0
6
Constraint violation....: 6.3002103534159914e-11 6.3002103534159914e-1
1
Complementarity.........: 2.8882678876850758e-09 2.8882678876850756e-0
6
Overall NLP error.......: 2.8882678876850758e-09 2.8882678876850756e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.27e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9794778e+02 4.09e+01 5.94e+01 -1.0 1.43e+01 - 6.99e-04 4.23e-0
2f 1
2 1.2226387e+04 6.07e-02 7.87e+01 -1.0 1.80e+01 - 7.07e-02 1.00e+0
0h 1
3 3.6200419e+03 5.54e-02 5.15e+01 -1.0 5.46e+01 - 3.33e-01 7.87e-0
2f 1
4 2.3521652e+03 2.93e-02 2.28e+01 -1.0 2.70e+01 - 5.45e-01 4.46e-0
1f 1
5 1.7566464e+03 8.50e-03 1.17e+00 -1.0 9.97e+00 - 9.27e-01 7.68e-0
1f 1
6 2.0294849e+03 3.42e-04 8.15e-02 -1.0 3.36e+00 - 1.00e+00 1.00e+0
0h 1
7 1.4027448e+03 2.08e-03 8.14e-02 -2.5 4.87e+00 - 8.66e-01 8.50e-0
1f 1
8 1.2230779e+03 2.16e-03 2.05e-01 -2.5 1.05e+00 - 1.00e+00 8.33e-0
1f 1
9 1.2062993e+03 8.52e-05 3.86e-03 -2.5 1.48e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1967643e+03 4.57e-05 1.12e+00 -3.8 9.65e-02 - 1.00e+00 4.94e-0
1h 1
11 1.1947754e+03 3.49e-07 1.15e-01 -3.8 3.95e-02 - 9.67e-01 1.00e+0
0f 1
12 1.1937327e+03 1.72e-08 1.86e-03 -3.8 3.32e-02 - 1.00e+00 1.00e+0
0H 1
13 1.1939328e+03 1.19e-05 2.86e-04 -3.8 3.90e-03 - 1.00e+00 1.00e+0
0f 1
14 1.1933096e+03 1.90e-06 6.24e-02 -5.7 1.24e-02 - 7.78e-01 9.69e-0
1h 1
15 1.1931429e+03 1.23e-05 2.09e-04 -5.7 5.02e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1931489e+03 2.62e-08 2.07e-06 -5.7 2.53e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1931356e+03 2.71e-08 6.92e-06 -8.6 2.43e-04 - 9.82e-01 9.88e-0
1h 1
18 1.1931355e+03 3.14e-13 3.35e-11 -8.6 2.20e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1931354860360375e+00 1.1931354860360375e+0
3
Dual infeasibility......: 3.3466037756090638e-11 3.3466037756090638e-0
8
Constraint violation....: 3.1441516057384433e-13 3.1441516057384433e-1
3
Complementarity.........: 2.5121780533993394e-09 2.5121780533993394e-0
6
Overall NLP error.......: 2.5121780533993394e-09 2.5121780533993394e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2252371e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 3.31e-04 9.88e-0
3h 1
2 8.0445960e+02 9.17e+02 5.24e+01 -1.0 7.80e+02 - 1.02e-04 6.58e-0
4h 1
3 7.4449993e+02 9.15e+02 5.24e+01 -1.0 9.17e+02 - 6.37e-04 2.25e-0
3h 1
4 2.4840623e+02 8.96e+02 5.25e+01 -1.0 9.15e+02 - 3.05e-03 2.07e-0
2f 1
5 1.1004290e+04 5.79e-02 8.27e+01 -1.0 8.96e+02 - 4.32e-02 1.00e+0
0h 1
6 3.7548065e+03 5.44e-02 4.55e+01 -1.0 7.01e+01 - 4.43e-01 5.64e-0
2f 1
7 1.8925967e+03 3.73e-02 2.26e+01 -1.0 3.91e+01 - 5.02e-01 4.92e-0
1f 1
8 3.4775478e+03 6.84e-03 1.32e+01 -1.0 1.10e+01 - 6.02e-01 1.00e+0
0h 1
9 2.0261984e+03 3.16e-03 2.34e-01 -1.0 1.21e+01 - 9.88e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6958809e+03 6.81e-04 1.57e-01 -1.7 9.87e+00 - 1.00e+00 9.09e-0
1f 1
11 1.5631128e+03 2.03e-03 2.54e-01 -2.5 6.02e+00 - 7.53e-01 1.00e+0
0f 1
12 1.5239272e+03 3.40e-03 8.98e-02 -2.5 2.39e+00 - 1.00e+00 9.28e-0
1h 1
13 1.5338912e+03 1.59e-04 4.71e-03 -2.5 7.21e-01 - 1.00e+00 1.00e+0
0h 1
14 1.5025307e+03 1.72e-04 1.85e-02 -3.8 1.44e+01 - 9.96e-01 9.39e-0
1h 1
15 1.5019708e+03 6.54e-07 7.00e-05 -3.8 4.18e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003135e+03 3.80e-07 1.83e-04 -5.7 7.45e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.83e-11 2.97e-09 -5.7 6.54e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
1 8.6513656e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 4.97e-04 9.88e-0
3h 1
2 8.4530680e+02 9.17e+02 5.24e+01 -1.0 7.94e+02 - 1.00e-04 7.33e-0
4h 1
3 7.7732348e+02 9.14e+02 5.24e+01 -1.0 9.17e+02 - 7.11e-04 2.57e-0
3h 1
4 2.6899856e+02 8.95e+02 5.24e+01 -1.0 9.15e+02 - 3.47e-03 2.14e-0
2f 1
5 1.1246093e+04 6.32e-02 8.04e+01 -1.0 8.95e+02 - 5.91e-02 1.00e+0
0h 1
39 1.690851e+04 1.632511e+04 3.815480e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1158125e+02 1.57e+04 5.50e+01 -1.0 1.59e+04 - 1.75e-04 9.80e-0
3f 1
2 7.0876261e+02 1.57e+04 5.50e+01 -1.0 1.55e+04 - 9.69e-05 1.00e-0
4h 1
3 7.0208873e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 2.67e-06 5.41e-0
4f 1
4 4.8477462e+02 1.54e+04 5.40e+01 -1.0 1.57e+04 - 5.75e-04 1.88e-0
2h 1
5 2.6430672e+04 7.61e-02 8.69e+01 -1.0 1.54e+04 - 2.52e-02 1.00e+0
0h 1
6 1.7889005e+04 7.33e-02 7.38e+01 -1.0 7.46e+01 - 1.59e-01 3.97e-0
2f 1
7 1.6627388e+04 4.64e-02 3.43e+01 -1.0 1.95e+01 - 5.30e-01 3.77e-0
1f 1
8 1.6878391e+04 4.07e-02 1.02e+01 -1.0 1.34e+01 - 5.66e-01 1.25e-0
1f 4
9 1.6797292e+04 6.81e-03 1.94e-01 -1.0 8.86e-01 - 9.93e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6502007e+04 7.54e-04 2.01e-01 -1.7 5.86e+00 - 1.00e+00 8.96e-0
1f 1
11 1.6471171e+04 7.90e-04 1.14e-02 -1.7 1.44e+01 - 1.00e+00 1.00e+0
0f 1
12 1.6349749e+04 1.26e-03 8.16e-02 -3.8 1.99e+01 - 8.09e-01 9.34e-0
1f 1
13 1.6325868e+04 1.39e-03 6.58e-02 -3.8 1.67e+00 - 8.57e-01 7.76e-0
1h 1
14 1.6326081e+04 2.49e-06 7.03e-04 -3.8 2.89e-01 - 1.00e+00 1.00e+0
0h 1
15 1.6325124e+04 3.28e-07 5.56e-04 -5.7 1.49e-01 - 1.00e+00 9.89e-0
1h 1
16 1.6325118e+04 4.02e-11 5.92e-09 -5.7 3.79e-01 - 1.00e+00 1.00e+0
0f 1
17 1.6325105e+04 6.30e-11 2.05e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.6325105260728780e+01 1.6325105260728780e+0
4
Dual infeasibility......: 2.0519882202995651e-09 2.0519882202995651e-0
6
Constraint violation....: 6.2994817695560812e-11 6.2994817695560812e-1
1
Complementarity.........: 2.8881132355446834e-09 2.8881132355446835e-0
6
Overall NLP error.......: 2.8881132355446834e-09 2.8881132355446835e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9877176e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.75e-04 9.80e-0
3h 1
2 7.9583825e+02 1.50e+04 5.25e+01 -1.0 1.37e+04 - 3.22e-05 1.08e-0
4h 1
3 7.9477282e+02 1.50e+04 5.25e+01 -1.0 1.48e+04 - 1.18e-05 7.89e-0
5h 1
4 7.9402278e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 8.93e-05 5.67e-0
5h 1
5 5.2336209e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 1.47e-04 2.07e-0
2f 1
6 2.6483053e+04 5.37e-02 8.35e+01 -1.0 1.47e+04 - 3.29e-02 1.00e+0
0h 1
7 1.7757137e+04 5.15e-02 6.37e+01 -1.0 8.28e+01 - 2.40e-01 4.52e-0
2f 1
8 1.5954922e+04 4.20e-02 3.31e+01 -1.0 3.42e+01 - 4.80e-01 4.74e-0
1f 1
9 1.6280643e+04 2.57e-02 1.50e+01 -1.0 1.85e+01 - 4.23e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6017180e+04 6.14e-03 1.90e-01 -1.0 5.28e+00 - 9.90e-01 1.00e+0
0h 1
11 1.5732854e+04 1.24e-03 2.90e-01 -1.7 4.59e+00 - 1.00e+00 8.64e-0
1f 1
12 1.5712258e+04 7.91e-04 1.12e-02 -1.7 2.10e+01 - 1.00e+00 1.00e+0
0f 1
13 1.5587546e+04 1.26e-03 6.08e-02 -3.8 2.60e+01 - 7.98e-01 8.88e-0
1f 1
14 1.5560061e+04 1.56e-03 5.21e-02 -3.8 1.88e+00 - 8.45e-01 7.82e-0
1h 1
15 1.5560127e+04 3.16e-06 8.06e-04 -3.8 3.80e-02 - 1.00e+00 1.00e+0
0h 1
16 1.5559222e+04 2.78e-07 7.12e-04 -5.7 1.49e-01 - 1.00e+00 9.87e-0
1h 1
17 1.5559215e+04 3.74e-11 6.54e-09 -5.7 2.24e-01 - 1.00e+00 1.00e+0
0f 1
18 1.5559202e+04 6.30e-11 2.10e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5559202139406693e+01 1.5559202139406692e+0
4
Dual infeasibility......: 2.0959941427983456e-09 2.0959941427983456e-0
6
Constraint violation....: 6.2996760585853906e-11 6.2996760585853906e-1
1
Complementarity.........: 2.8880991128332751e-09 2.8880991128332751e-0
6
Overall NLP error.......: 2.8880991128332751e-09 2.8880991128332751e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4408720e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.92e-04 9.80e-0
3h 1
2 8.4123560e+02 1.39e+04 5.24e+01 -1.0 1.32e+04 - 4.60e-05 1.04e-0
4h 1
3 8.3492096e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 7.12e-06 4.47e-0
4f 1
4 8.2666858e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 4.53e-04 5.98e-0
4h 1
5 5.4591908e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 1.20e-03 2.15e-0
2f 1
6 2.5076546e+04 5.81e-02 8.13e+01 -1.0 1.36e+04 - 4.71e-02 1.00e+0
0h 1
7 1.6977419e+04 5.44e-02 5.07e+01 -1.0 7.68e+01 - 3.68e-01 5.81e-0
2f 1
8 1.4908831e+04 3.51e-02 2.69e+01 -1.0 4.19e+01 - 4.76e-01 5.27e-0
1f 1
9 1.5300769e+04 1.88e-02 4.59e+00 -1.0 1.78e+01 - 6.83e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5049486e+04 5.19e-03 3.86e-01 -1.0 6.56e+00 - 9.51e-01 1.00e+0
0h 1
11 1.4704655e+04 1.40e-03 5.03e-01 -1.7 6.05e+00 - 1.00e+00 7.89e-0
1f 1
12 1.4662317e+04 5.98e-04 2.63e-02 -1.7 2.84e+01 - 1.00e+00 1.00e+0
0f 1
13 1.4515377e+04 1.34e-03 8.51e-02 -3.8 3.40e+01 - 7.63e-01 8.79e-0
1f 1
14 1.4479293e+04 2.59e-03 2.70e-02 -3.8 2.47e+00 - 8.13e-01 7.84e-0
1h 1
15 1.4480647e+04 3.54e-04 1.39e-01 -3.8 5.55e-02 - 1.00e+00 8.93e-0
1h 1
16 1.4481114e+04 5.01e-07 3.17e-05 -3.8 2.54e-02 - 1.00e+00 1.00e+0
0f 1
17 1.4480069e+04 4.17e-07 1.00e-03 -5.7 1.49e-01 - 1.00e+00 9.87e-0
1h 1
18 1.4480065e+04 4.51e-11 4.88e-09 -5.7 2.94e-03 - 1.00e+00 1.00e+0
0f 1
19 1.4480052e+04 6.30e-11 3.21e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.4480051765993673e+01 1.4480051765993672e+0
4
Dual infeasibility......: 3.2075059857077411e-09 3.2075059857077411e-0
6
Constraint violation....: 6.3005753392353370e-11 6.3005753392353370e-1
1
Complementarity.........: 2.9105818873634793e-09 2.9105818873634794e-0
6
Overall NLP error.......: 3.2075059857077411e-09 3.2075059857077411e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4410160e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.92e-04 9.80e-0
3h 1
2 8.4123630e+02 1.27e+04 5.24e+01 -1.0 1.20e+04 - 4.62e-05 1.04e-0
4h 1
3 8.0177192e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 7.81e-06 2.57e-0
3h 1
4 5.2836021e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 2.79e-03 2.08e-0
2h 1
5 2.3324880e+04 5.92e-02 8.14e+01 -1.0 1.24e+04 - 4.95e-02 1.00e+0
0h 1
6 1.5677396e+04 5.53e-02 4.82e+01 -1.0 7.35e+01 - 3.97e-01 6.11e-0
2f 1
7 1.3660000e+04 3.60e-02 2.48e+01 -1.0 4.16e+01 - 4.90e-01 5.21e-0
1f 1
8 1.4301242e+04 1.32e-02 3.01e+00 -1.0 1.52e+01 - 7.81e-01 5.00e-0
1f 2
9 1.3825053e+04 4.15e-03 1.88e-01 -1.0 7.39e+00 - 9.59e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3453886e+04 1.10e-03 3.91e-01 -1.7 5.78e+00 - 1.00e+00 8.15e-0
1f 1
11 1.3427444e+04 5.41e-04 2.44e-02 -1.7 3.51e+01 - 1.00e+00 1.00e+0
0f 1
12 1.3266403e+04 1.46e-03 1.20e-01 -3.8 3.98e+01 - 7.60e-01 9.24e-0
1f 1
13 1.3232710e+04 2.52e-03 3.39e-02 -3.8 2.98e+00 - 8.07e-01 7.72e-0
1h 1
14 1.3233907e+04 2.03e-04 9.78e-02 -3.8 6.79e-01 - 1.00e+00 9.23e-0
1h 1
15 1.3234263e+04 3.99e-07 2.19e-05 -3.8 5.19e-02 - 1.00e+00 1.00e+0
0f 1
16 1.3233072e+04 4.15e-07 1.01e-03 -5.7 2.97e-01 - 1.00e+00 9.87e-0
1h 1
17 1.3233066e+04 4.53e-11 4.89e-09 -5.7 3.99e-03 - 1.00e+00 1.00e+0
0f 1
18 1.3233051e+04 6.30e-11 3.22e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.3233050918790655e+01 1.3233050918790654e+0
4
Dual infeasibility......: 3.2150657608551173e-09 3.2150657608551173e-0
6
Constraint violation....: 6.3006377892804721e-11 6.3006377892804721e-1
1
Complementarity.........: 3.1105898359807813e-09 3.1105898359807811e-0
6
Overall NLP error.......: 3.2150657608551173e-09 3.2150657608551173e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9344508e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 7.30e-04 9.80e-0
3h 1
2 8.9068123e+02 1.11e+04 5.24e+01 -1.0 1.09e+04 - 8.72e-05 1.01e-0
4h 1
3 8.7654496e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 4.00e-06 8.63e-0
4f 1
4 5.1618152e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 9.50e-04 2.26e-0
2h 1
5 2.3109199e+04 6.37e-02 7.81e+01 -1.0 1.09e+04 - 6.80e-02 1.00e+0
0h 1
6 1.4795173e+04 5.84e-02 4.89e+01 -1.0 5.12e+01 - 3.57e-01 7.61e-0
2f 1
7 1.3494086e+04 2.75e-02 2.15e+01 -1.0 2.37e+01 - 5.50e-01 4.86e-0
1f 1
8 1.2967733e+04 7.44e-03 1.23e+00 -1.0 9.07e+00 - 9.33e-01 7.42e-0
1f 1
9 1.3225804e+04 3.34e-04 8.05e-02 -1.0 2.95e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2629578e+04 2.08e-03 8.89e-02 -2.5 4.47e+00 - 8.64e-01 8.33e-0
1f 1
11 1.2450155e+04 2.17e-03 3.22e-01 -2.5 1.07e+00 - 1.00e+00 7.87e-0
1f 1
12 1.2422190e+04 1.64e-04 4.85e-03 -2.5 2.07e-01 - 1.00e+00 1.00e+0
0h 1
13 1.2403436e+04 3.53e-05 8.87e-02 -3.8 2.68e+00 - 1.00e+00 8.10e-0
1h 1
14 1.2400627e+04 1.06e-07 5.87e-04 -3.8 5.07e-01 - 1.00e+00 1.00e+0
0f 1
15 1.2399369e+04 3.65e-08 3.93e-04 -5.7 1.49e-01 - 1.00e+00 9.92e-0
1h 1
16 1.2399365e+04 1.90e-12 1.54e-08 -5.7 1.26e-03 - 1.00e+00 1.00e+0
0f 1
17 1.2399350e+04 2.56e-12 9.08e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.2399350329075679e+01 1.2399350329075678e+0
4
Dual infeasibility......: 9.0804291091483417e-09 9.0804291091483417e-0
6
Constraint violation....: 2.5557125860053986e-12 2.5557125860053986e-1
2
Complementarity.........: 4.6144846596437123e-09 4.6144846596437120e-0
6
Overall NLP error.......: 9.0804291091483417e-09 9.0804291091483417e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0890313e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0580412e+02 9.19e+03 5.23e+01 -1.0 7.60e+03 - 2.53e-05 1.20e-0
4h 1
3 6.0977364e+02 9.04e+03 5.24e+01 -1.0 9.19e+03 - 2.50e-05 1.62e-0
2h 1
4 7.3775220e+02 8.79e+03 5.16e+01 -1.0 9.04e+03 - 1.91e-02 2.80e-0
2h 1
5 1.6473477e+04 8.05e-02 7.71e+01 -1.0 8.79e+03 - 1.08e-01 1.00e+0
0h 1
6 1.2523406e+04 6.93e-02 1.94e+01 -1.0 2.11e+01 - 7.28e-01 1.32e-0
1f 1
7 1.1378990e+04 1.42e-02 9.47e-01 -1.0 1.26e+01 - 9.48e-01 8.00e-0
1f 1
8 1.1688198e+04 1.32e-02 7.52e-01 -1.0 5.96e+00 - 2.05e-01 9.06e-0
1f 1
9 1.1949683e+04 3.53e-03 1.34e+00 -1.0 7.33e+00 - 6.15e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1924758e+04 1.16e-03 1.74e-01 -1.0 1.79e+01 - 6.02e-01 1.00e+0
0f 1
11 1.1348574e+04 2.16e-03 8.44e-02 -1.7 4.16e+00 - 1.00e+00 1.00e+0
0f 1
12 1.1140794e+04 2.04e-03 1.39e-01 -2.5 2.66e+01 - 8.81e-01 7.95e-0
1f 1
13 1.1111115e+04 1.76e-04 5.46e-03 -2.5 5.49e+00 - 1.00e+00 1.00e+0
0h 1
14 1.1090860e+04 4.81e-05 1.78e-01 -3.8 8.04e+00 - 1.00e+00 7.41e-0
1h 1
15 1.1084871e+04 1.74e-07 3.64e-04 -3.8 2.08e+00 - 1.00e+00 1.00e+0
0f 1
16 1.1083356e+04 2.71e-08 9.45e-04 -5.7 4.46e-01 - 1.00e+00 9.85e-0
1h 1
17 1.1083339e+04 1.86e-12 1.33e-08 -5.7 6.46e-03 - 1.00e+00 1.00e+0
0f 1
18 1.1083321e+04 2.63e-12 4.48e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1083320746150621e+01 1.1083320746150621e+0
4
Dual infeasibility......: 4.4777017607808754e-09 4.4777017607808754e-0
6
Constraint violation....: 2.6306734568493084e-12 2.6306734568493084e-1
2
Complementarity.........: 4.1099548232077893e-09 4.1099548232077888e-0
6
Overall NLP error.......: 4.4777017607808754e-09 4.4777017607808754e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2300862e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.80e-0
3h 1
2 9.2018520e+02 6.71e+03 5.23e+01 -1.0 6.43e+03 - 7.59e-05 1.03e-0
4h 1
3 8.8417722e+02 6.69e+03 5.23e+01 -1.0 6.70e+03 - 7.25e-06 1.73e-0
3f 1
4 4.3415243e+02 6.54e+03 5.24e+01 -1.0 6.69e+03 - 2.08e-03 2.26e-0
2h 1
5 1.8486104e+04 7.08e-02 7.69e+01 -1.0 6.54e+03 - 8.04e-02 1.00e+0
0h 1
6 1.0916142e+04 6.40e-02 2.32e+01 -1.0 1.36e+01 - 6.65e-01 8.89e-0
2f 1
7 9.6154376e+03 1.98e-02 9.31e+00 -1.0 9.91e+00 - 6.64e-01 8.81e-0
1f 1
8 9.7199904e+03 1.05e-02 6.35e-01 -1.0 2.75e+00 - 9.95e-01 4.77e-0
1f 2
9 9.3967776e+03 9.36e-03 2.78e-01 -1.7 9.45e+00 - 1.00e+00 8.30e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.3672965e+03 2.18e-03 9.40e-01 -1.7 1.18e+01 - 1.00e+00 4.90e-0
1h 2
11 9.3624199e+03 2.10e-04 1.67e-02 -1.7 6.01e+00 - 1.00e+00 1.00e+0
0h 1
12 9.2069203e+03 4.79e-04 2.44e-02 -3.8 2.00e+01 - 8.46e-01 8.30e-0
1f 1
13 9.1886242e+03 1.49e-04 2.05e-01 -3.8 3.34e+00 - 9.89e-01 7.21e-0
1h 1
14 9.1840024e+03 3.89e-07 3.07e-04 -3.8 9.33e-01 - 1.00e+00 1.00e+0
0h 1
15 9.1828139e+03 1.95e-08 4.40e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
16 9.1828008e+03 7.96e-13 4.82e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 9.1828007767896214e+00 9.1828007767896215e+0
3
Dual infeasibility......: 4.8230733890520692e-10 4.8230733890520692e-0
7
Constraint violation....: 7.9643236450266386e-13 7.9643236450266386e-1
3
Complementarity.........: 2.6134527997869551e-09 2.6134527997869551e-0
6
Overall NLP error.......: 2.6134527997869551e-09 2.6134527997869551e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8769624e+02 4.77e+03 5.24e+01 -1.0 4.82e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8418913e+02 4.77e+03 5.24e+01 -1.0 3.56e+03 - 3.31e-05 1.33e-0
4h 1
3 3.6133643e+02 4.66e+03 5.25e+01 -1.0 4.77e+03 - 4.21e-05 2.30e-0
2f 1
4 1.7154392e+04 6.18e-02 8.10e+01 -1.0 4.66e+03 - 3.09e-02 1.00e+0
0h 1
5 8.5606749e+03 5.89e-02 6.28e+01 -1.0 5.79e+01 - 2.24e-01 4.28e-0
2f 1
6 7.0723371e+03 2.48e-02 3.20e+01 -1.0 2.57e+01 - 4.96e-01 5.40e-0
1f 1
7 6.3632320e+03 1.23e-02 2.18e+00 -1.0 9.60e+00 - 9.29e-01 8.90e-0
1f 1
8 6.7901981e+03 4.37e-04 9.63e-02 -1.0 4.08e+00 - 9.97e-01 1.00e+0
0f 1
9 6.0056896e+03 2.23e-03 2.19e-01 -2.5 5.68e+00 - 8.65e-01 9.64e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.9387713e+03 1.04e-03 6.18e-01 -2.5 1.23e+00 - 1.00e+00 5.72e-0
1h 1
11 5.9432420e+03 3.93e-06 8.27e-03 -2.5 5.70e-01 - 1.00e+00 1.00e+0
0h 1
12 5.9223333e+03 4.94e-06 4.05e-02 -3.8 8.04e+00 - 9.21e-01 8.83e-0
1f 1
13 5.9186052e+03 4.67e-04 5.93e-04 -3.8 9.38e-01 - 1.00e+00 1.00e+0
0f 1
14 5.9173166e+03 6.39e-05 1.15e-02 -5.7 4.46e-01 - 8.12e-01 1.00e+0
0h 1
15 5.9172009e+03 3.63e-05 4.14e-05 -5.7 9.71e-03 - 1.00e+00 1.00e+0
0h 1
16 5.9172026e+03 1.61e-06 4.52e-05 -5.7 1.47e-03 - 1.00e+00 9.88e-0
1h 1
17 5.9172051e+03 3.53e-08 5.15e-07 -5.7 2.92e-04 - 1.00e+00 1.00e+0
0f 1
18 5.9171869e+03 3.96e-08 7.27e-06 -8.6 5.53e-03 - 9.97e-01 9.81e-0
1h 1
19 5.9171865e+03 5.33e-13 2.97e-11 -8.6 1.06e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 5.9171865487489503e+00 5.9171865487489504e+0
3
Dual infeasibility......: 2.9739265267335133e-11 2.9739265267335133e-0
8
Constraint violation....: 5.3312909642500017e-13 5.3312909642500017e-1
3
Complementarity.........: 3.7051747779141046e-09 3.7051747779141044e-0
6
Overall NLP error.......: 3.7051747779141046e-09 3.7051747779141044e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2294726e+02 3.24e+03 5.23e+01 -1.0 3.27e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1945201e+02 3.24e+03 5.23e+01 -1.0 2.47e+03 - 3.93e-05 1.30e-0
4h 1
3 3.4573144e+02 3.17e+03 5.24e+01 -1.0 3.24e+03 - 4.04e-05 2.36e-0
2f 1
4 1.5906615e+04 6.81e-02 7.93e+01 -1.0 3.17e+03 - 4.21e-02 1.00e+0
0h 1
5 7.5933644e+03 6.41e-02 5.66e+01 -1.0 2.00e+01 - 2.81e-01 5.33e-0
2f 1
6 6.3092956e+03 1.54e-02 2.51e+01 -1.0 1.01e+01 - 5.90e-01 8.06e-0
1f 1
7 6.3346293e+03 6.22e-03 2.30e-01 -1.0 1.94e+00 - 9.91e-01 1.00e+0
0f 1
8 5.9359407e+03 1.57e-03 8.95e-02 -1.7 4.62e+00 - 1.00e+00 9.66e-0
1f 1
9 5.7772838e+03 1.82e-03 5.17e-01 -2.5 1.14e+00 - 1.00e+00 7.50e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.7447658e+03 3.25e-04 1.02e-01 -2.5 2.94e-01 - 1.00e+00 8.96e-0
1h 1
11 5.7477659e+03 1.16e-05 4.01e-03 -2.5 2.85e-02 - 1.00e+00 1.00e+0
0f 1
12 5.7228582e+03 1.05e-05 8.02e-03 -3.8 5.36e+00 - 1.00e+00 9.61e-0
1f 1
13 5.7223579e+03 1.57e-08 1.36e-05 -3.8 2.04e-01 - 1.00e+00 1.00e+0
0f 1
14 5.7210148e+03 1.79e-08 5.06e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0f 1
15 5.7210000e+03 6.40e-13 4.11e-10 -8.6 3.67e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.7210000297658565e+00 5.7210000297658562e+0
3
Dual infeasibility......: 4.1141776474310757e-10 4.1141776474310757e-0
7
Constraint violation....: 6.4032112945255903e-13 6.4032112945255903e-1
3
Complementarity.........: 2.6690967366936509e-09 2.6690967366936510e-0
6
Overall NLP error.......: 2.6690967366936509e-09 2.6690967366936510e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8047271e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.82e-0
3h 1
2 8.7571780e+02 2.00e+03 5.24e+01 -1.0 1.11e+03 - 4.57e-05 1.77e-0
4h 1
3 2.9373644e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 9.83e-05 2.27e-0
2f 1
4 1.4280611e+04 6.09e-02 7.92e+01 -1.0 1.95e+03 - 5.49e-02 1.00e+0
0h 1
5 5.5544141e+03 5.66e-02 5.35e+01 -1.0 6.57e+01 - 3.12e-01 6.38e-0
2f 1
6 4.1958834e+03 3.11e-02 2.65e+01 -1.0 3.24e+01 - 4.93e-01 4.18e-0
1f 1
7 3.3759781e+03 1.36e-02 2.17e+00 -1.0 1.11e+01 - 9.19e-01 9.26e-0
1f 1
8 3.8304846e+03 4.15e-04 1.07e-01 -1.0 5.03e+00 - 9.97e-01 1.00e+0
0f 1
9 3.1587952e+03 1.16e-03 2.31e-01 -1.7 4.64e+01 - 8.74e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.1973116e+03 1.33e-05 1.37e-02 -1.7 1.07e+01 - 1.00e+00 1.00e+0
0h 1
11 3.0813154e+03 2.34e-05 6.07e-01 -3.8 6.03e+01 - 9.64e-01 6.99e-0
1f 1
12 3.0448492e+03 4.06e-04 1.50e-01 -3.8 1.76e+01 - 7.02e-01 1.00e+0
0f 1
13 3.0405781e+03 2.37e-03 4.90e-03 -3.8 6.12e-02 - 1.00e+00 1.00e+0
0h 1
14 3.0407892e+03 2.27e-05 8.94e-05 -3.8 6.99e-03 - 1.00e+00 1.00e+0
0h 1
15 3.0392723e+03 1.32e-04 1.14e-03 -5.7 4.46e-01 - 9.18e-01 1.00e+0
0h 1
16 3.0392312e+03 3.17e-05 6.85e-06 -5.7 8.30e-03 - 1.00e+00 1.00e+0
0h 1
17 3.0392359e+03 2.52e-07 3.49e-06 -5.7 7.24e-04 - 1.00e+00 1.00e+0
0h 1
18 3.0392191e+03 3.02e-08 3.42e-05 -8.6 5.53e-03 - 1.00e+00 9.56e-0
1h 1
19 3.0392184e+03 4.57e-12 5.43e-11 -8.6 2.41e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 3.0392183918554299e+00 3.0392183918554297e+0
3
Dual infeasibility......: 5.4299622185446821e-11 5.4299622185446821e-0
8
Constraint violation....: 4.5697889916596068e-12 4.5697889916596068e-1
2
Complementarity.........: 2.9079841067240670e-09 2.9079841067240672e-0
6
Overall NLP error.......: 2.9079841067240670e-09 2.9079841067240672e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6513656e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 4.97e-04 9.88e-0
3h 1
2 8.4530680e+02 9.17e+02 5.24e+01 -1.0 7.94e+02 - 1.00e-04 7.33e-0
4h 1
3 7.7732348e+02 9.14e+02 5.24e+01 -1.0 9.17e+02 - 7.11e-04 2.57e-0
3h 1
4 2.6899856e+02 8.95e+02 5.24e+01 -1.0 9.15e+02 - 3.47e-03 2.14e-0
2f 1
5 1.1246093e+04 6.32e-02 8.04e+01 -1.0 8.95e+02 - 5.91e-02 1.00e+0
0h 1
6 4.1043493e+03 5.84e-02 4.64e+01 -1.0 6.47e+01 - 4.08e-01 7.07e-0
2f 1
7 2.5373840e+03 3.04e-02 2.16e+01 -1.0 3.75e+01 - 5.25e-01 4.45e-0
1f 1
8 2.1261287e+03 1.21e-02 1.93e+00 -1.0 1.04e+01 - 9.23e-01 1.00e+0
0f 1
9 2.3647204e+03 4.01e-04 4.84e-02 -1.0 4.25e+00 - 9.88e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8991120e+03 5.00e-04 7.15e-01 -2.5 6.95e+00 - 8.95e-01 6.20e-0
1f 1
11 1.8215185e+03 2.38e-04 3.87e-01 -2.5 6.37e+00 - 8.90e-01 1.00e+0
0h 1
12 1.7953747e+03 5.81e-03 1.73e-01 -2.5 1.74e+00 - 1.00e+00 6.87e-0
1h 1
13 1.7888753e+03 5.38e-04 4.06e-03 -2.5 3.47e-01 - 1.00e+00 1.00e+0
0f 1
14 1.7613959e+03 1.17e-03 3.01e-02 -3.8 1.44e+01 - 8.04e-01 1.00e+0
0h 1
15 1.7587524e+03 2.39e-03 1.07e-03 -3.8 4.63e-01 - 1.00e+00 1.00e+0
0h 1
16 1.7591149e+03 4.10e-05 1.38e-04 -3.8 1.45e-02 - 1.00e+00 1.00e+0
0h 1
17 1.7572102e+03 1.04e-04 4.01e-04 -5.7 7.46e-01 - 9.51e-01 9.80e-0
1h 1
18 1.7571937e+03 2.19e-05 3.60e-03 -5.7 1.32e-02 - 1.00e+00 7.90e-0
1h 1
19 1.7571952e+03 8.57e-09 1.15e-06 -5.7 2.78e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7571733e+03 8.99e-09 1.93e-05 -8.6 9.21e-03 - 1.00e+00 9.83e-0
1h 1
21 1.7571729e+03 1.37e-12 6.48e-11 -8.6 1.53e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.7571729209977107e+00 1.7571729209977107e+0
3
Dual infeasibility......: 6.4796051346418846e-11 6.4796051346418840e-0
8
Constraint violation....: 1.3737899706711687e-12 1.3737899706711687e-1
2
Complementarity.........: 2.5092134631128560e-09 2.5092134631128560e-0
6
Overall NLP error.......: 2.5092134631128560e-09 2.5092134631128560e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.04e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.57e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235660171e+00 1.6104063235660171e+0
3
Dual infeasibility......: 2.4574009793760635e-12 2.4574009793760635e-0
9
Constraint violation....: 7.5703172614159067e-16 7.5703172614159067e-1
6
Complementarity.........: 2.5062163919681798e-09 2.5062163919681799e-0
6
Overall NLP error.......: 2.5062163919681798e-09 2.5062163919681799e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318724481455e-09 2.1031318724481455e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896894379e-09 2.8882108896894380e-0
6
Overall NLP error.......: 2.8882108896894379e-09 2.8882108896894380e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101521e-01 6.4890146112101525e+0
2
Dual infeasibility......: 4.9126605618489413e-09 4.9126605618489413e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984918224e-09 4.3646094984918221e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605618489413e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.04e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.57e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235660171e+00 1.6104063235660171e+0
3
Dual infeasibility......: 2.4574009793760635e-12 2.4574009793760635e-0
9
Constraint violation....: 7.5703172614159067e-16 7.5703172614159067e-1
6
Complementarity.........: 2.5062163919681798e-09 2.5062163919681799e-0
6
Overall NLP error.......: 2.5062163919681798e-09 2.5062163919681799e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2278083e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 3.31e-04 9.87e-0
3h 1
2 8.0391474e+02 9.17e+02 5.24e+01 -1.0 7.85e+02 - 8.87e-05 6.88e-0
4h 1
3 2.4271271e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 6.68e-04 2.10e-0
2h 1
4 1.2385916e+04 5.52e-02 8.23e+01 -1.0 8.98e+02 - 3.86e-02 1.00e+0
0h 1
5 3.8851959e+03 5.26e-02 5.59e+01 -1.0 8.06e+01 - 3.19e-01 5.02e-0
2f 1
6 1.9099004e+03 3.73e-02 2.99e+01 -1.0 3.93e+01 - 4.69e-01 5.04e-0
1f 1
7 4.6737272e+03 1.22e-02 2.67e+01 -1.0 2.06e+01 - 4.01e-01 1.00e+0
0h 1
8 1.8754601e+03 1.19e-02 1.01e+00 -1.0 2.53e+01 - 9.88e-01 8.94e-0
1f 1
9 2.0005994e+03 1.84e-04 4.66e-02 -1.0 3.18e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7351413e+03 2.16e-04 1.24e+00 -2.5 1.71e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5469297e+03 3.76e-03 1.33e-01 -2.5 7.60e+00 - 7.95e-01 1.00e+0
0f 1
12 1.5237159e+03 5.30e-03 3.11e-01 -2.5 1.84e+00 - 1.00e+00 7.66e-0
1h 1
13 1.5360639e+03 2.44e-04 4.74e-03 -2.5 7.11e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5034784e+03 1.70e-04 2.15e-02 -3.8 1.62e+01 - 9.91e-01 9.29e-0
1h 1
15 1.5021214e+03 7.21e-07 6.83e-05 -3.8 1.10e+00 - 1.00e+00 1.00e+0
0h 1
16 1.5003172e+03 3.77e-07 1.78e-04 -5.7 8.92e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003154e+03 3.79e-11 2.92e-09 -5.7 4.18e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.11e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932798571529e+00 1.5002932798571528e+0
3
Dual infeasibility......: 2.1737235540957390e-09 2.1737235540957390e-0
6
Constraint violation....: 6.2995442196012164e-11 6.2995442196012164e-1
1
Complementarity.........: 2.8882174399866087e-09 2.8882174399866087e-0
6
Overall NLP error.......: 2.8882174399866087e-09 2.8882174399866087e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6534772e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 4.97e-04 9.87e-0
3h 1
2 8.4418057e+02 9.17e+02 5.24e+01 -1.0 8.02e+02 - 8.70e-05 7.83e-0
4h 1
3 2.6276094e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 7.65e-04 2.20e-0
2h 1
4 1.2724514e+04 5.99e-02 8.02e+01 -1.0 8.97e+02 - 5.06e-02 1.00e+0
0h 1
5 4.2755874e+03 5.59e-02 5.32e+01 -1.0 7.28e+01 - 3.26e-01 6.05e-0
2f 1
40 1.509585e+04 1.632511e+04 3.870540e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2434425e+02 1.57e+04 5.24e+01 -1.0 1.59e+04 - 3.31e-04 9.80e-0
3h 1
2 8.2149282e+02 1.57e+04 5.24e+01 -1.0 1.51e+04 - 4.66e-05 1.03e-0
4h 1
3 8.1944459e+02 1.57e+04 5.24e+01 -1.0 1.56e+04 - 6.22e-06 1.64e-0
4h 1
4 8.1704893e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 1.68e-04 1.95e-0
4h 1
5 5.6230009e+02 1.54e+04 5.26e+01 -1.0 1.57e+04 - 3.74e-04 2.12e-0
2f 1
6 2.7289460e+04 5.51e-02 8.23e+01 -1.0 1.54e+04 - 3.84e-02 1.00e+0
0h 1
7 1.8716527e+04 5.25e-02 5.65e+01 -1.0 8.12e+01 - 3.11e-01 4.99e-0
2f 1
8 1.6735661e+04 3.73e-02 3.03e+01 -1.0 3.92e+01 - 4.68e-01 5.05e-0
1f 1
9 1.7082300e+04 2.26e-02 1.42e+01 -1.0 2.06e+01 - 4.00e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6823566e+04 6.02e-03 4.04e-01 -1.0 4.97e+00 - 9.78e-01 1.00e+0
0h 1
11 1.6517649e+04 1.44e-03 4.08e-01 -1.7 5.55e+00 - 1.00e+00 8.24e-0
1f 1
12 1.6479421e+04 9.23e-04 1.44e-02 -1.7 2.10e+01 - 1.00e+00 1.00e+0
0f 1
13 1.6348845e+04 1.42e-03 9.03e-02 -3.8 2.44e+01 - 7.88e-01 9.19e-0
1f 1
14 1.6325376e+04 1.64e-03 8.16e-02 -3.8 1.75e+00 - 8.42e-01 7.54e-0
1h 1
15 1.6326047e+04 3.45e-06 8.71e-04 -3.8 4.30e-02 - 1.00e+00 1.00e+0
0h 1
16 1.6325125e+04 2.71e-07 7.02e-04 -5.7 1.49e-01 - 1.00e+00 9.87e-0
1h 1
17 1.6325118e+04 3.60e-11 6.80e-09 -5.7 2.80e-01 - 1.00e+00 1.00e+0
0f 1
18 1.6325105e+04 6.30e-11 2.17e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.6325105260629122e+01 1.6325105260629121e+0
4
Dual infeasibility......: 2.1734445059454567e-09 2.1734445059454567e-0
6
Constraint violation....: 6.2998786742873847e-11 6.2998786742873847e-1
1
Complementarity.........: 2.8880989688422029e-09 2.8880989688422027e-0
6
Overall NLP error.......: 2.8880989688422029e-09 2.8880989688422027e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9086901e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 6.99e-04 9.80e-0
3h 1
2 8.8800016e+02 1.50e+04 5.24e+01 -1.0 1.35e+04 - 2.70e-05 1.10e-0
4h 1
3 8.8695952e+02 1.50e+04 5.24e+01 -1.0 1.48e+04 - 1.37e-05 8.17e-0
5h 1
4 8.8619259e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 9.39e-05 6.13e-0
5h 1
5 6.0000230e+02 1.46e+04 5.25e+01 -1.0 1.50e+04 - 1.57e-04 2.30e-0
2f 1
6 2.7283458e+04 6.25e-02 7.83e+01 -1.0 1.46e+04 - 6.29e-02 1.00e+0
0h 1
7 1.8652269e+04 5.76e-02 5.12e+01 -1.0 5.56e+01 - 3.32e-01 7.09e-0
2f 1
8 1.7360783e+04 2.90e-02 2.36e+01 -1.0 2.59e+01 - 5.27e-01 4.57e-0
1f 1
9 1.6721631e+04 9.73e-03 1.19e+00 -1.0 1.00e+01 - 9.27e-01 7.70e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7011223e+04 3.39e-04 8.35e-02 -1.0 3.43e+00 - 9.93e-01 1.00e+0
0f 1
11 1.6380014e+04 2.07e-03 8.02e-02 -2.5 4.96e+00 - 8.66e-01 8.52e-0
1f 1
12 1.6200180e+04 2.17e-03 1.97e-01 -2.5 1.05e+00 - 1.00e+00 8.37e-0
1f 1
13 1.6184293e+04 8.01e-05 4.02e-03 -2.5 1.43e-01 - 1.00e+00 1.00e+0
0h 1
14 1.6174101e+04 4.38e-05 1.29e+00 -3.8 2.79e+00 - 1.00e+00 4.80e-0
1h 1
15 1.6170566e+04 4.24e-07 1.15e-01 -3.8 1.40e+00 - 9.63e-01 1.00e+0
0f 1
16 1.6169515e+04 3.25e-08 2.13e-03 -3.8 3.28e-02 - 1.00e+00 1.00e+0
0H 1
17 1.6169724e+04 1.51e-05 3.28e-04 -3.8 4.68e-03 - 1.00e+00 1.00e+0
0f 1
18 1.6168946e+04 2.34e-06 5.82e-02 -5.7 1.49e-01 - 7.79e-01 9.72e-0
1h 1
19 1.6168779e+04 1.23e-05 1.93e-04 -5.7 5.05e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6168784e+04 1.59e-08 1.43e-06 -5.7 1.93e-04 - 1.00e+00 1.00e+0
0h 1
21 1.6168769e+04 2.50e-08 2.26e-06 -8.6 1.84e-03 - 9.84e-01 9.83e-0
1h 1
22 1.6168769e+04 6.60e-13 3.65e-11 -8.6 3.19e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.6168769272821269e+01 1.6168769272821268e+0
4
Dual infeasibility......: 3.6500233896655566e-11 3.6500233896655566e-0
8
Constraint violation....: 6.6036065504704311e-13 6.6036065504704311e-1
3
Complementarity.........: 2.5125326466120095e-09 2.5125326466120094e-0
6
Overall NLP error.......: 2.5125326466120095e-09 2.5125326466120094e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2433988e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.31e-04 9.80e-0
3h 1
2 8.2147236e+02 1.39e+04 5.24e+01 -1.0 1.32e+04 - 4.69e-05 1.04e-0
4h 1
3 8.1090553e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 7.02e-06 7.40e-0
4f 1
4 7.9455962e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 7.49e-04 1.20e-0
3h 1
5 5.4369855e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 2.62e-03 2.10e-0
2f 1
6 2.4136506e+04 5.77e-02 8.27e+01 -1.0 1.36e+04 - 4.23e-02 1.00e+0
0h 1
7 1.6753973e+04 5.42e-02 4.65e+01 -1.0 7.14e+01 - 4.31e-01 5.53e-0
2f 1
8 1.4873612e+04 3.71e-02 2.34e+01 -1.0 3.92e+01 - 4.96e-01 4.93e-0
1f 1
9 1.5320306e+04 2.06e-02 6.97e+00 -1.0 1.26e+01 - 5.55e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5000405e+04 5.49e-03 1.96e-01 -1.0 4.94e+00 - 9.81e-01 1.00e+0
0h 1
11 1.4677095e+04 1.27e-03 3.66e-01 -1.7 5.55e+00 - 9.99e-01 8.32e-0
1f 1
12 1.4637070e+04 7.51e-04 1.67e-02 -1.7 1.92e+01 - 1.00e+00 1.00e+0
0f 1
13 1.4530711e+04 9.46e-04 6.54e-02 -2.5 2.92e+01 - 9.15e-01 8.04e-0
1f 1
14 1.4497766e+04 1.69e-03 1.90e-02 -2.5 5.18e+00 - 1.00e+00 1.00e+0
0f 1
15 1.4483045e+04 3.31e-04 1.33e-01 -3.8 5.14e+00 - 1.00e+00 8.13e-0
1h 1
16 1.4481128e+04 4.31e-07 1.07e-04 -3.8 9.17e-01 - 1.00e+00 1.00e+0
0h 1
17 1.4480063e+04 3.98e-07 1.74e-04 -5.7 1.49e-01 - 1.00e+00 9.96e-0
1h 1
18 1.4480065e+04 3.92e-11 3.03e-09 -5.7 2.86e-02 - 1.00e+00 1.00e+0
0f 1
19 1.4480052e+04 6.30e-11 2.17e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.4480051766613116e+01 1.4480051766613115e+0
4
Dual infeasibility......: 2.1737196793447923e-09 2.1737196793447923e-0
6
Constraint violation....: 6.2995747507343935e-11 6.2995747507343935e-1
1
Complementarity.........: 2.8882181513234025e-09 2.8882181513234023e-0
6
Overall NLP error.......: 2.8882181513234025e-09 2.8882181513234023e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6976385e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.17e-04 9.80e-0
3h 1
2 8.6682885e+02 1.27e+04 5.24e+01 -1.0 1.13e+04 - 2.96e-05 1.11e-0
4h 1
3 8.5516323e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 1.50e-05 7.72e-0
4h 1
4 5.3212099e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 7.81e-04 2.21e-0
2h 1
5 2.4500730e+04 6.02e-02 8.20e+01 -1.0 1.24e+04 - 2.73e-02 1.00e+0
0h 1
6 1.6183676e+04 5.76e-02 6.45e+01 -1.0 6.85e+01 - 2.15e-01 4.01e-0
2f 1
7 1.4335066e+04 2.93e-02 3.45e+01 -1.0 3.12e+01 - 4.77e-01 5.81e-0
1f 1
8 1.3927003e+04 9.82e-03 2.53e+00 -1.0 8.75e+00 - 9.33e-01 1.00e+0
0f 1
9 1.4129848e+04 4.39e-04 9.11e-02 -1.0 2.49e+00 - 9.75e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3637237e+04 5.60e-04 5.89e-01 -2.5 5.99e+00 - 8.95e-01 6.68e-0
1f 1
11 1.3578612e+04 1.01e-04 2.17e-01 -2.5 2.06e+00 - 9.39e-01 1.00e+0
0h 1
12 1.3554769e+04 3.95e-03 3.09e-02 -2.5 1.01e+00 - 1.00e+00 1.00e+0
0h 1
13 1.3557566e+04 4.80e-04 2.21e-03 -2.5 6.84e-02 - 1.00e+00 1.00e+0
0h 1
14 1.3538914e+04 9.67e-04 3.15e-02 -3.8 5.96e+00 - 8.06e-01 1.00e+0
0h 1
15 1.3535901e+04 2.58e-03 1.18e-03 -3.8 2.81e-01 - 1.00e+00 1.00e+0
0h 1
16 1.3536207e+04 5.38e-05 7.70e-05 -3.8 1.39e-02 - 1.00e+00 1.00e+0
0h 1
17 1.3534768e+04 1.10e-04 5.12e-04 -5.7 2.99e-01 - 9.46e-01 9.91e-0
1h 1
18 1.3534754e+04 2.22e-05 1.91e-03 -5.7 2.57e-03 - 1.00e+00 8.07e-0
1h 1
19 1.3534761e+04 1.40e-08 1.87e-06 -5.7 3.05e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.3534744e+04 1.30e-08 2.16e-05 -8.6 3.69e-03 - 1.00e+00 9.80e-0
1h 1
21 1.3534744e+04 1.60e-12 9.30e-11 -8.6 7.40e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.3534743739720174e+01 1.3534743739720174e+0
4
Dual infeasibility......: 9.2970838817316557e-11 9.2970838817316557e-0
8
Constraint violation....: 1.6010526238119382e-12 1.6010526238119382e-1
2
Complementarity.........: 3.0608334244784563e-09 3.0608334244784564e-0
6
Overall NLP error.......: 3.0608334244784563e-09 3.0608334244784564e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9482527e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 7.48e-04 9.80e-0
3h 1
2 8.9206259e+02 1.11e+04 5.24e+01 -1.0 1.09e+04 - 8.69e-05 1.01e-0
4h 1
3 8.7788074e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 4.01e-06 8.67e-0
4f 1
4 5.1726064e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 9.54e-04 2.26e-0
2h 1
5 2.3121559e+04 6.40e-02 7.79e+01 -1.0 1.09e+04 - 6.98e-02 1.00e+0
0h 1
6 1.4812165e+04 5.85e-02 4.83e+01 -1.0 4.95e+01 - 3.63e-01 7.77e-0
2f 1
7 1.3505031e+04 2.67e-02 2.10e+01 -1.0 2.28e+01 - 5.57e-01 5.00e-0
1f 1
8 1.3018007e+04 6.85e-03 1.23e+00 -1.0 8.59e+00 - 9.37e-01 7.36e-0
1f 1
9 1.3268789e+04 3.20e-04 7.93e-02 -1.0 2.91e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2683148e+04 2.08e-03 9.07e-02 -2.5 4.28e+00 - 8.62e-01 8.28e-0
1f 1
11 1.2505092e+04 2.17e-03 3.62e-01 -2.5 1.06e+00 - 1.00e+00 7.74e-0
1f 1
12 1.2476207e+04 1.68e-04 5.11e-03 -2.5 2.15e-01 - 1.00e+00 1.00e+0
0h 1
13 1.2456345e+04 2.44e-05 4.31e-02 -3.8 2.68e+00 - 1.00e+00 8.82e-0
1h 1
14 1.2454881e+04 5.88e-08 6.10e-04 -3.8 3.16e-01 - 1.00e+00 1.00e+0
0f 1
15 1.2453574e+04 4.24e-08 1.39e-05 -5.7 1.49e-01 - 1.00e+00 9.99e-0
1f 1
16 1.2453562e+04 6.85e-13 3.99e-09 -8.6 1.93e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.2453562299586237e+01 1.2453562299586236e+0
4
Dual infeasibility......: 3.9883527778476952e-09 3.9883527778476952e-0
6
Constraint violation....: 6.8459127255948715e-13 6.8459127255948715e-1
3
Complementarity.........: 2.7863203160450176e-09 2.7863203160450176e-0
6
Overall NLP error.......: 3.9883527778476952e-09 3.9883527778476952e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891076e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0602418e+02 9.19e+03 5.23e+01 -1.0 8.41e+03 - 3.92e-05 1.08e-0
4h 1
3 8.1828316e+02 9.14e+03 5.24e+01 -1.0 9.19e+03 - 1.24e-05 4.81e-0
3h 1
4 5.0911016e+02 8.95e+03 5.22e+01 -1.0 9.14e+03 - 5.53e-03 2.13e-0
2h 1
5 1.9574028e+04 7.15e-02 7.74e+01 -1.0 8.95e+03 - 8.67e-02 1.00e+0
0h 1
6 1.2972291e+04 6.39e-02 3.14e+01 -1.0 2.60e+01 - 5.69e-01 9.74e-0
2f 1
7 1.1456842e+04 1.98e-02 1.02e+01 -1.0 1.50e+01 - 6.92e-01 7.89e-0
1f 1
8 1.1617387e+04 7.35e-03 8.73e-01 -1.0 3.38e+00 - 9.92e-01 5.00e-0
1f 2
9 1.1302516e+04 1.11e-02 3.77e-01 -1.7 1.04e+01 - 6.15e-01 8.28e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1277094e+04 8.23e-04 7.37e-01 -1.7 1.49e+01 - 6.33e-01 1.00e+0
0f 1
11 1.1288937e+04 7.07e-05 3.81e-03 -1.7 1.15e+01 - 1.00e+00 1.00e+0
0h 1
12 1.1113951e+04 5.62e-04 2.52e-02 -3.8 3.53e+01 - 8.38e-01 8.36e-0
1f 1
13 1.1087201e+04 1.46e-04 7.91e-02 -3.8 5.74e+00 - 9.92e-01 8.37e-0
1h 1
14 1.1084767e+04 1.86e-07 9.88e-02 -3.8 9.34e-01 - 9.21e-01 1.00e+0
0h 1
15 1.1084687e+04 4.62e-09 2.90e-05 -3.8 1.57e-04 - 1.00e+00 1.00e+0
0h 1
16 1.1083373e+04 1.92e-08 3.89e-03 -5.7 2.97e-01 - 1.00e+00 9.68e-0
1f 1
17 1.1083337e+04 5.76e-12 2.63e-08 -5.7 9.61e-03 - 1.00e+00 1.00e+0
0f 1
18 1.1083321e+04 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1083320746865240e+01 1.1083320746865240e+0
4
Dual infeasibility......: 4.4780435412114826e-09 4.4780435412114826e-0
6
Constraint violation....: 2.6341359649073581e-12 2.6341359649073581e-1
2
Complementarity.........: 3.6085483555677314e-09 3.6085483555677315e-0
6
Overall NLP error.......: 4.4780435412114826e-09 4.4780435412114826e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3710605e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 3.06e-03 9.80e-0
3h 1
2 9.3410771e+02 6.71e+03 5.23e+01 -1.0 6.33e+03 - 5.53e-05 1.05e-0
4h 1
3 8.7601628e+02 6.69e+03 5.23e+01 -1.0 6.70e+03 - 8.90e-06 2.62e-0
3f 1
4 4.4078555e+02 6.54e+03 5.23e+01 -1.0 6.69e+03 - 3.32e-03 2.17e-0
2h 1
5 1.7952487e+04 7.75e-02 7.79e+01 -1.0 6.54e+03 - 7.84e-02 1.00e+0
0h 1
6 1.1162158e+04 7.00e-02 2.30e+01 -1.0 4.32e+00 - 6.80e-01 8.97e-0
2f 1
7 1.0161093e+04 3.32e-02 7.43e+00 -1.0 4.23e+00 - 7.42e-01 1.00e+0
0f 1
8 1.0283900e+04 1.70e-02 7.27e-01 -1.0 1.10e+00 - 9.96e-01 4.94e-0
1f 2
9 1.0000013e+04 8.27e-03 3.35e-01 -1.7 1.28e+01 - 1.00e+00 8.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.9361941e+03 1.02e-03 1.04e-01 -1.7 8.95e+00 - 1.00e+00 1.00e+0
0f 1
11 9.8169976e+03 2.77e-04 1.12e-01 -2.5 1.73e+01 - 9.89e-01 8.85e-0
1f 1
12 9.8069007e+03 4.94e-06 1.10e-03 -2.5 1.95e+00 - 1.00e+00 1.00e+0
0f 1
13 9.7851225e+03 5.56e-06 7.61e-04 -3.8 2.68e+00 - 1.00e+00 1.00e+0
0f 1
14 9.7842068e+03 3.44e-09 3.52e-06 -5.7 1.48e-01 - 1.00e+00 1.00e+0
0h 1
15 9.7841926e+03 2.34e-12 4.09e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 9.7841925842708779e+00 9.7841925842708770e+0
3
Dual infeasibility......: 4.0868829584975573e-10 4.0868829584975573e-0
7
Constraint violation....: 2.3425844597468881e-12 2.3425844597468881e-1
2
Complementarity.........: 2.5729802580422573e-09 2.5729802580422571e-0
6
Overall NLP error.......: 2.5729802580422573e-09 2.5729802580422571e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8766795e+02 4.77e+03 5.24e+01 -1.0 4.81e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8353498e+02 4.77e+03 5.24e+01 -1.0 2.95e+03 - 2.75e-05 1.60e-0
4h 1
3 3.6139295e+02 4.66e+03 5.25e+01 -1.0 4.77e+03 - 7.13e-05 2.29e-0
2f 1
4 1.7143198e+04 6.18e-02 8.09e+01 -1.0 4.66e+03 - 3.19e-02 1.00e+0
0h 1
5 8.5555969e+03 5.88e-02 6.21e+01 -1.0 5.76e+01 - 2.31e-01 4.38e-0
2f 1
6 7.0738960e+03 2.50e-02 3.16e+01 -1.0 2.58e+01 - 4.96e-01 5.36e-0
1f 1
7 6.3640765e+03 1.22e-02 2.14e+00 -1.0 9.64e+00 - 9.28e-01 8.84e-0
1f 1
8 6.7865441e+03 4.25e-04 9.11e-02 -1.0 4.06e+00 - 9.97e-01 1.00e+0
0f 1
9 6.0098660e+03 2.23e-03 2.08e-01 -2.5 5.67e+00 - 8.66e-01 9.60e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.9412846e+03 1.05e-03 6.02e-01 -2.5 2.52e+00 - 1.00e+00 5.77e-0
1h 1
11 5.9461418e+03 3.59e-06 8.21e-03 -2.5 1.21e+00 - 1.00e+00 1.00e+0
0h 1
12 5.9228025e+03 5.05e-06 3.85e-02 -3.8 1.07e+01 - 9.20e-01 8.83e-0
1f 1
13 5.9187561e+03 4.66e-04 5.79e-04 -3.8 1.25e+00 - 1.00e+00 1.00e+0
0f 1
14 5.9173184e+03 6.39e-05 1.15e-02 -5.7 5.94e-01 - 8.12e-01 1.00e+0
0h 1
15 5.9172028e+03 3.63e-05 4.14e-05 -5.7 9.71e-03 - 1.00e+00 1.00e+0
0h 1
16 5.9172045e+03 1.60e-06 4.42e-05 -5.7 1.47e-03 - 1.00e+00 9.88e-0
1h 1
17 5.9172070e+03 3.53e-08 5.14e-07 -5.7 2.92e-04 - 1.00e+00 1.00e+0
0f 1
18 5.9171869e+03 3.96e-08 7.28e-06 -8.6 7.37e-03 - 9.97e-01 9.81e-0
1h 1
19 5.9171865e+03 5.33e-13 2.97e-11 -8.6 1.42e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 5.9171865498706797e+00 5.9171865498706793e+0
3
Dual infeasibility......: 2.9739990041996890e-11 2.9739990041996890e-0
8
Constraint violation....: 5.3312909642500017e-13 5.3312909642500017e-1
3
Complementarity.........: 3.4866335811458819e-09 3.4866335811458819e-0
6
Overall NLP error.......: 3.4866335811458819e-09 3.4866335811458819e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2291184e+02 3.24e+03 5.23e+01 -1.0 3.27e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1824882e+02 3.24e+03 5.23e+01 -1.0 1.80e+03 - 2.80e-05 1.78e-0
4h 1
3 3.4580800e+02 3.17e+03 5.24e+01 -1.0 3.24e+03 - 9.12e-05 2.35e-0
2f 1
4 1.5889383e+04 6.81e-02 7.83e+01 -1.0 3.17e+03 - 5.42e-02 1.00e+0
0h 1
5 7.5694720e+03 6.34e-02 4.88e+01 -1.0 1.73e+01 - 3.65e-01 6.40e-0
2f 1
6 6.2120976e+03 1.27e-02 2.15e+01 -1.0 9.82e+00 - 6.05e-01 8.68e-0
1f 1
7 6.3908340e+03 3.81e-03 1.93e-01 -1.0 2.40e+00 - 9.91e-01 1.00e+0
0f 1
8 5.9353089e+03 1.50e-03 8.74e-02 -1.7 6.27e+00 - 1.00e+00 1.00e+0
0f 1
9 5.7758954e+03 1.91e-03 4.70e-01 -2.5 1.72e+00 - 1.00e+00 7.62e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.7472961e+03 2.95e-04 8.78e-02 -2.5 4.02e-01 - 1.00e+00 9.05e-0
1h 1
11 5.7505453e+03 1.10e-05 3.63e-03 -2.5 3.83e-02 - 1.00e+00 1.00e+0
0f 1
12 5.7231763e+03 1.03e-05 8.91e-03 -3.8 8.05e+00 - 1.00e+00 9.59e-0
1f 1
13 5.7225084e+03 1.56e-08 1.41e-05 -3.8 3.28e-01 - 1.00e+00 1.00e+0
0f 1
14 5.7210166e+03 1.79e-08 5.06e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0f 1
15 5.7210000e+03 6.40e-13 4.11e-10 -8.6 5.51e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.7210000315768541e+00 5.7210000315768539e+0
3
Dual infeasibility......: 4.1136440523894497e-10 4.1136440523894497e-0
7
Constraint violation....: 6.4021010715009652e-13 6.4021010715009652e-1
3
Complementarity.........: 2.9670873399546640e-09 2.9670873399546640e-0
6
Overall NLP error.......: 2.9670873399546640e-09 2.9670873399546640e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4528265e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 3.98e-04 9.81e-0
3f 1
2 8.4160251e+02 2.00e+03 5.24e+01 -1.0 1.48e+03 - 5.90e-05 1.34e-0
4h 1
3 2.7509537e+02 1.95e+03 5.26e+01 -1.0 2.00e+03 - 4.97e-05 2.18e-0
2f 1
4 1.3978763e+04 5.67e-02 8.10e+01 -1.0 1.95e+03 - 4.46e-02 1.00e+0
0h 1
5 5.1663756e+03 5.32e-02 5.38e+01 -1.0 8.22e+01 - 3.29e-01 5.48e-0
2f 1
6 3.0169279e+03 3.33e-02 2.97e+01 -1.0 4.25e+01 - 4.59e-01 5.39e-0
1f 1
7 5.0512416e+03 9.15e-03 1.65e+01 -1.0 2.43e+01 - 5.91e-01 1.00e+0
0h 1
8 3.0927580e+03 7.42e-03 4.15e-01 -1.0 2.10e+01 - 9.67e-01 1.00e+0
0f 1
9 2.7847845e+03 1.00e-03 1.63e-01 -1.7 5.24e+00 - 1.00e+00 9.12e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.6486959e+03 1.59e-03 2.72e-01 -2.5 6.05e+00 - 7.52e-01 1.00e+0
0f 1
11 2.5962169e+03 4.61e-03 3.97e-02 -2.5 2.93e+00 - 1.00e+00 1.00e+0
0h 1
12 2.6062895e+03 2.11e-04 6.40e-03 -2.5 4.76e-01 - 1.00e+00 1.00e+0
0h 1
13 2.5818658e+03 2.58e-04 4.25e-02 -3.8 5.37e+00 - 9.87e-01 8.87e-0
1h 1
14 2.5806677e+03 1.91e-06 1.63e-04 -3.8 6.01e-01 - 1.00e+00 1.00e+0
0h 1
15 2.5794704e+03 3.21e-07 2.10e-03 -5.7 2.97e-01 - 1.00e+00 9.78e-0
1h 1
16 2.5794585e+03 3.73e-11 2.11e-08 -5.7 6.59e-03 - 1.00e+00 1.00e+0
0f 1
17 2.5794438e+03 6.30e-11 4.40e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 2.5794437836559010e+00 2.5794437836559009e+0
3
Dual infeasibility......: 4.3996203309703000e-09 4.3996203309703000e-0
6
Constraint violation....: 6.3009444883910248e-11 6.3009444883910248e-1
1
Complementarity.........: 3.3377576521653359e-09 3.3377576521653359e-0
6
Overall NLP error.......: 4.3996203309703000e-09 4.3996203309703000e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6465241e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 4.93e-04 9.87e-0
3h 1
2 8.4355052e+02 9.17e+02 5.24e+01 -1.0 8.01e+02 - 8.70e-05 7.80e-0
4h 1
3 2.6241304e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 7.62e-04 2.20e-0
2h 1
4 1.2719102e+04 5.98e-02 8.02e+01 -1.0 8.97e+02 - 5.04e-02 1.00e+0
0h 1
5 4.2679694e+03 5.58e-02 5.32e+01 -1.0 7.31e+01 - 3.26e-01 6.03e-0
2f 1
6 2.6653163e+03 3.01e-02 2.77e+01 -1.0 3.90e+01 - 4.75e-01 4.35e-0
1f 1
7 2.1352586e+03 1.43e-02 2.56e+00 -1.0 1.09e+01 - 9.19e-01 1.00e+0
0f 1
8 2.4490171e+03 4.32e-04 8.25e-02 -1.0 4.24e+00 - 9.95e-01 1.00e+0
0f 1
9 1.8815382e+03 6.60e-04 4.05e-01 -2.5 7.90e+00 - 8.84e-01 7.14e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8093091e+03 2.66e-04 3.52e-01 -2.5 7.70e+00 - 8.81e-01 1.00e+0
0h 1
11 1.8033885e+03 6.93e-04 4.72e-01 -2.5 1.49e+00 - 1.00e+00 1.59e-0
1h 2
12 1.7819471e+03 1.27e-03 1.31e-02 -2.5 1.02e+00 - 1.00e+00 1.00e+0
0h 1
13 1.7520965e+03 1.27e-03 3.45e-02 -3.8 1.62e+01 - 7.93e-01 1.00e+0
0h 1
14 1.7490888e+03 2.34e-03 9.04e-04 -3.8 4.24e-02 - 1.00e+00 1.00e+0
0h 1
15 1.7494467e+03 4.25e-05 1.59e-04 -3.8 1.55e-02 - 1.00e+00 1.00e+0
0h 1
16 1.7473925e+03 1.05e-04 3.51e-04 -5.7 8.92e-01 - 9.51e-01 9.76e-0
1h 1
17 1.7473677e+03 2.27e-05 4.03e-03 -5.7 2.13e-02 - 1.00e+00 7.84e-0
1h 1
18 1.7473667e+03 8.07e-09 1.18e-06 -5.7 4.60e-03 - 1.00e+00 1.00e+0
0f 1
19 1.7473429e+03 8.85e-09 2.07e-05 -8.6 1.11e-02 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7473425e+03 1.47e-12 7.02e-11 -8.6 1.85e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.7473425236386444e+00 1.7473425236386443e+0
3
Dual infeasibility......: 7.0210710263672058e-11 7.0210710263672065e-0
8
Constraint violation....: 1.4724887975603451e-12 1.4724887975603451e-1
2
Complementarity.........: 2.7538352301671163e-09 2.7538352301671161e-0
6
Overall NLP error.......: 2.7538352301671163e-09 2.7538352301671161e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.06e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.11e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235598023e+00 1.6104063235598023e+0
3
Dual infeasibility......: 2.4573593916134529e-12 2.4573593916134529e-0
9
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5062163919694822e-09 2.5062163919694822e-0
6
Overall NLP error.......: 2.5062163919694822e-09 2.5062163919694822e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933520e-01 5.8277753147933515e+0
2
Dual infeasibility......: 2.1031320945198554e-09 2.1031320945198554e-0
6
Constraint violation....: 6.2994401361926577e-11 6.2994401361926577e-1
1
Complementarity.........: 2.8882108897061754e-09 2.8882108897061753e-0
6
Overall NLP error.......: 2.8882108897061754e-09 2.8882108897061753e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146111909430e-01 6.4890146111909428e+0
2
Dual infeasibility......: 4.9126605652944596e-09 4.9126605652944596e-0
6
Constraint violation....: 6.2123813870940126e-09 6.2123813870940126e-0
9
Complementarity.........: 4.3646094984486179e-09 4.3646094984486175e-0
6
Overall NLP error.......: 6.2123813870940126e-09 4.9126605652944596e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.06e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.11e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235598023e+00 1.6104063235598023e+0
3
Dual infeasibility......: 2.4573593916134529e-12 2.4573593916134529e-0
9
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5062163919694822e-09 2.5062163919694822e-0
6
Overall NLP error.......: 2.5062163919694822e-09 2.5062163919694822e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2182687e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 3.29e-04 9.88e-0
3h 1
2 7.9676337e+02 9.17e+02 5.24e+01 -1.0 8.18e+02 - 9.72e-05 9.15e-0
4h 1
3 2.4281481e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 9.07e-04 2.09e-0
2h 1
4 1.2255616e+04 5.54e-02 8.24e+01 -1.0 8.98e+02 - 3.87e-02 1.00e+0
0h 1
5 3.8688149e+03 5.28e-02 5.51e+01 -1.0 7.96e+01 - 3.28e-01 5.05e-0
2f 1
6 1.9078230e+03 3.74e-02 2.93e+01 -1.0 3.92e+01 - 4.72e-01 5.02e-0
1f 1
7 4.6514926e+03 1.22e-02 2.62e+01 -1.0 2.04e+01 - 4.04e-01 1.00e+0
0h 1
8 1.8738225e+03 1.17e-02 9.61e-01 -1.0 2.50e+01 - 9.88e-01 8.98e-0
1f 1
9 1.6952042e+03 5.07e-04 6.26e-02 -1.7 6.87e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5627584e+03 1.96e-03 2.18e-01 -2.5 1.24e+01 - 7.44e-01 1.00e+0
0f 1
11 1.5309891e+03 3.66e-03 1.02e-01 -2.5 2.11e+00 - 1.00e+00 9.20e-0
1h 1
12 1.5388592e+03 1.30e-04 3.48e-03 -2.5 1.17e+00 - 1.00e+00 1.00e+0
0h 1
13 1.5037281e+03 1.63e-04 2.14e-02 -3.8 1.88e+01 - 9.93e-01 9.32e-0
1h 1
14 1.5022722e+03 7.63e-07 7.14e-05 -3.8 1.23e+00 - 1.00e+00 1.00e+0
0f 1
15 1.5003195e+03 3.78e-07 1.76e-04 -5.7 1.04e+00 - 1.00e+00 9.96e-0
1h 1
16 1.5003172e+03 3.80e-11 2.94e-09 -5.7 1.08e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.29e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5002932821304920e+00 1.5002932821304919e+0
3
Dual infeasibility......: 2.1693729816337061e-09 2.1693729816337061e-0
6
Constraint violation....: 6.2995358929285317e-11 6.2995358929285317e-1
1
Complementarity.........: 2.8882169845149780e-09 2.8882169845149777e-0
6
Overall NLP error.......: 2.8882169845149780e-09 2.8882169845149777e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6443986e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 4.93e-04 9.88e-0
3h 1
2 8.3543030e+02 9.17e+02 5.24e+01 -1.0 8.33e+02 - 9.54e-05 1.07e-0
3h 1
3 2.6287475e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 1.07e-03 2.19e-0
2h 1
4 1.2568962e+04 6.01e-02 8.03e+01 -1.0 8.97e+02 - 5.11e-02 1.00e+0
0h 1
5 4.2524144e+03 5.61e-02 5.27e+01 -1.0 7.22e+01 - 3.33e-01 6.11e-0
2f 1
6 2.6510561e+03 3.01e-02 2.72e+01 -1.0 3.89e+01 - 4.78e-01 4.36e-0
1f 1
41 1.619311e+04 1.632511e+04 3.926821e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6795632e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.80e-0
3f 1
2 7.6508436e+02 1.57e+04 5.25e+01 -1.0 1.51e+04 - 4.81e-05 1.03e-0
4h 1
3 7.4136250e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 6.06e-06 1.88e-0
3h 1
4 5.3848311e+02 1.54e+04 5.27e+01 -1.0 1.57e+04 - 2.00e-03 1.95e-0
2h 1
5 2.6115014e+04 6.17e-02 8.49e+01 -1.0 1.54e+04 - 3.05e-02 1.00e+0
0h 1
6 1.8237236e+04 5.92e-02 6.41e+01 -1.0 7.34e+01 - 2.49e-01 4.45e-0
2f 1
7 1.6688823e+04 4.55e-02 3.13e+01 -1.0 2.88e+01 - 5.08e-01 4.33e-0
1f 1
8 1.6978208e+04 3.11e-02 1.21e+01 -1.0 1.59e+01 - 4.74e-01 1.25e-0
1f 4
9 1.6782781e+04 5.33e-03 3.14e+00 -1.0 3.85e+00 - 8.12e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6827952e+04 2.89e-04 1.88e+00 -1.0 2.40e+00 - 3.11e-01 1.00e+0
0f 1
11 1.6829127e+04 9.42e-06 5.39e-01 -1.0 2.55e+00 - 6.97e-01 1.00e+0
0f 1
12 1.6532142e+04 2.27e-04 3.62e-01 -1.7 4.85e+00 - 8.90e-01 7.83e-0
1f 1
13 1.6481825e+04 6.04e-04 2.66e-01 -1.7 9.52e+00 - 6.58e-01 1.00e+0
0f 1
14 1.6483682e+04 6.35e-05 2.74e-02 -1.7 1.31e+01 - 8.83e-01 1.00e+0
0h 1
15 1.6365443e+04 9.93e-04 4.54e-02 -2.5 2.14e+01 - 9.27e-01 1.00e+0
0f 1
16 1.6344888e+04 1.07e-03 1.14e-02 -2.5 2.14e+00 - 1.00e+00 1.00e+0
0h 1
17 1.6327914e+04 1.79e-04 8.32e-02 -3.8 5.37e+00 - 1.00e+00 8.55e-0
1h 1
18 1.6326243e+04 5.64e-07 9.84e-05 -3.8 7.71e-01 - 1.00e+00 1.00e+0
0h 1
19 1.6325283e+04 3.70e-07 8.19e-03 -5.7 2.57e-01 - 1.00e+00 8.14e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325119e+04 1.39e-08 4.65e-07 -5.7 6.36e-03 - 1.00e+00 1.00e+0
0f 1
21 1.6325105e+04 1.21e-10 2.64e-06 -8.6 2.32e-03 - 1.00e+00 9.96e-0
1h 1
22 1.6325105e+04 7.11e-15 3.80e-14 -8.6 8.78e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.6325105261433347e+01 1.6325105261433346e+0
4
Dual infeasibility......: 3.7989812422601881e-14 3.7989812422601881e-1
1
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5060244183000494e-09 2.5060244183000492e-0
6
Overall NLP error.......: 2.5060244183000494e-09 2.5060244183000492e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6677301e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 4.98e-04 9.80e-0
3h 1
2 8.6395413e+02 1.50e+04 5.24e+01 -1.0 1.43e+04 - 4.44e-05 1.04e-0
4h 1
3 8.3490716e+02 1.49e+04 5.24e+01 -1.0 1.50e+04 - 6.75e-06 2.27e-0
3h 1
4 5.9651229e+02 1.46e+04 5.25e+01 -1.0 1.49e+04 - 2.43e-03 2.13e-0
2h 1
5 2.6041118e+04 6.16e-02 8.03e+01 -1.0 1.46e+04 - 5.43e-02 1.00e+0
0h 1
6 1.8256778e+04 5.72e-02 5.04e+01 -1.0 6.85e+01 - 3.61e-01 6.49e-0
2f 1
7 1.6679278e+04 3.04e-02 2.50e+01 -1.0 3.82e+01 - 4.95e-01 4.38e-0
1f 1
8 1.6187054e+04 1.34e-02 2.27e+00 -1.0 1.07e+01 - 9.21e-01 1.00e+0
0f 1
9 1.6473942e+04 3.89e-04 8.32e-02 -1.0 4.27e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5950651e+04 5.36e-04 5.48e-01 -2.5 7.36e+00 - 8.90e-01 6.70e-0
1f 1
11 1.5872049e+04 2.33e-04 3.74e-01 -2.5 2.47e+00 - 8.88e-01 1.00e+0
0h 1
12 1.5851371e+04 6.25e-03 2.44e-01 -2.5 1.61e+00 - 1.00e+00 5.51e-0
1h 1
13 1.5840555e+04 8.11e-04 6.63e-03 -2.5 5.30e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5822080e+04 1.12e-03 2.82e-02 -3.8 5.36e+00 - 8.14e-01 1.00e+0
0h 1
15 1.5819170e+04 2.12e-03 1.06e-03 -3.8 4.62e-02 - 1.00e+00 1.00e+0
0h 1
16 1.5819559e+04 4.79e-05 1.52e-04 -3.8 1.55e-02 - 1.00e+00 1.00e+0
0h 1
17 1.5818084e+04 1.07e-04 4.53e-04 -5.7 2.97e-01 - 9.50e-01 9.84e-0
1h 1
18 1.5818077e+04 2.19e-05 3.47e-03 -5.7 4.81e-03 - 1.00e+00 7.95e-0
1h 1
19 1.5818080e+04 8.70e-09 1.10e-06 -5.7 9.84e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5818064e+04 9.01e-09 1.92e-05 -8.6 3.68e-03 - 1.00e+00 9.83e-0
1h 1
21 1.5818064e+04 1.37e-12 6.43e-11 -8.6 6.14e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.5818063692895700e+01 1.5818063692895699e+0
4
Dual infeasibility......: 6.4288134258926467e-11 6.4288134258926467e-0
8
Constraint violation....: 1.3669065879184927e-12 1.3669065879184927e-1
2
Complementarity.........: 2.8125191262639620e-09 2.8125191262639620e-0
6
Overall NLP error.......: 2.8125191262639620e-09 2.8125191262639620e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6662685e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 4.97e-04 9.80e-0
3h 1
2 8.6371906e+02 1.39e+04 5.24e+01 -1.0 1.25e+04 - 2.96e-05 1.10e-0
4h 1
3 8.6099149e+02 1.39e+04 5.24e+01 -1.0 1.38e+04 - 1.36e-05 1.95e-0
4h 1
4 8.5925575e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 2.07e-04 1.26e-0
4h 1
5 5.5613744e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 3.43e-04 2.23e-0
2f 1
6 2.5824991e+04 5.96e-02 8.01e+01 -1.0 1.36e+04 - 5.01e-02 1.00e+0
0h 1
7 1.7267513e+04 5.57e-02 5.36e+01 -1.0 7.35e+01 - 3.21e-01 5.99e-0
2f 1
8 1.5678659e+04 3.02e-02 2.80e+01 -1.0 3.89e+01 - 4.73e-01 4.32e-0
1f 1
9 1.5395912e+04 1.45e-02 2.56e+00 -1.0 1.10e+01 - 9.18e-01 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5230042e+04 7.13e-03 1.75e+00 -1.0 8.05e+00 - 9.60e-01 5.00e-0
1f 2
11 1.5322883e+04 5.61e-04 2.75e-01 -1.0 8.79e+01 - 2.91e-01 1.00e+0
0f 1
12 1.4935844e+04 3.63e-04 6.43e-01 -1.7 1.22e+01 - 1.00e+00 7.33e-0
1f 1
13 1.4875864e+04 1.04e-04 2.72e-02 -1.7 4.31e+01 - 1.00e+00 1.00e+0
0f 1
14 1.4761671e+04 8.60e-05 8.09e-02 -3.8 4.41e+01 - 8.97e-01 8.24e-0
1f 1
15 1.4741074e+04 5.80e-03 7.64e-02 -3.8 5.70e-01 - 5.81e-01 9.74e-0
1h 1
16 1.4738021e+04 3.31e-03 5.68e-03 -3.8 6.16e-02 - 9.21e-01 8.61e-0
1h 1
17 1.4738420e+04 9.82e-05 8.80e-04 -3.8 1.99e-02 - 1.00e+00 1.00e+0
0f 1
18 1.4736935e+04 1.75e-04 9.64e-04 -5.7 1.51e-01 - 9.31e-01 1.00e+0
0h 1
19 1.4736937e+04 5.58e-05 6.25e-03 -5.7 1.30e-03 - 1.00e+00 6.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.4736947e+04 1.17e-08 2.88e-06 -5.7 3.15e-04 - 1.00e+00 1.00e+0
0f 1
21 1.4736932e+04 9.88e-09 2.02e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
22 1.4736931e+04 1.59e-12 7.46e-11 -8.6 3.12e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.4736931409992415e+01 1.4736931409992416e+0
4
Dual infeasibility......: 7.4561843896264834e-11 7.4561843896264834e-0
8
Constraint violation....: 1.5916157281026244e-12 1.5916157281026244e-1
2
Complementarity.........: 2.5099380895222086e-09 2.5099380895222084e-0
6
Overall NLP error.......: 2.5099380895222086e-09 2.5099380895222084e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8072599e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.97e-04 9.80e-0
3h 1
2 8.7789674e+02 1.27e+04 5.24e+01 -1.0 1.20e+04 - 4.34e-05 1.05e-0
4h 1
3 8.3561361e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 8.17e-06 2.82e-0
3h 1
4 5.5734102e+02 1.23e+04 5.24e+01 -1.0 1.26e+04 - 3.08e-03 2.14e-0
2h 1
5 2.3596820e+04 6.41e-02 7.95e+01 -1.0 1.23e+04 - 6.27e-02 1.00e+0
0h 1
6 1.6062798e+04 5.90e-02 4.83e+01 -1.0 5.93e+01 - 3.77e-01 7.30e-0
2f 1
7 1.4705084e+04 3.09e-02 2.18e+01 -1.0 3.10e+01 - 5.36e-01 4.36e-0
1f 1
8 1.4067839e+04 7.81e-03 1.50e+00 -1.0 1.07e+01 - 9.23e-01 8.67e-0
1f 1
9 1.4407710e+04 1.93e-04 5.57e-02 -1.0 4.34e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3755607e+04 1.35e-03 1.22e-01 -2.5 5.99e+00 - 8.78e-01 8.25e-0
1f 1
11 1.3730291e+04 1.47e-05 1.77e-02 -2.5 6.44e-01 - 1.00e+00 1.00e+0
0h 1
12 1.3696042e+04 1.20e-03 3.58e-02 -3.8 5.36e+00 - 6.98e-01 1.00e+0
0f 1
13 1.3694116e+04 9.36e-04 1.70e-03 -3.8 3.36e-02 - 9.46e-01 1.00e+0
0h 1
14 1.3694240e+04 1.23e-04 1.25e-04 -3.8 1.60e-02 - 1.00e+00 1.00e+0
0h 1
15 1.3692881e+04 1.40e-04 1.17e-03 -5.7 2.97e-01 - 9.15e-01 1.00e+0
0h 1
16 1.3692836e+04 3.59e-05 7.65e-06 -5.7 8.83e-03 - 1.00e+00 1.00e+0
0h 1
17 1.3692841e+04 4.56e-07 4.84e-06 -5.7 9.77e-04 - 1.00e+00 1.00e+0
0h 1
18 1.3692826e+04 3.72e-08 4.96e-05 -8.6 3.68e-03 - 1.00e+00 9.48e-0
1h 1
19 1.3692826e+04 6.76e-12 6.77e-11 -8.6 1.92e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.3692825522940836e+01 1.3692825522940837e+0
4
Dual infeasibility......: 6.7734069589156210e-11 6.7734069589156203e-0
8
Constraint violation....: 6.7639227552263037e-12 6.7639227552263037e-1
2
Complementarity.........: 2.9875326663717112e-09 2.9875326663717110e-0
6
Overall NLP error.......: 2.9875326663717112e-09 2.9875326663717110e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6663227e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 4.97e-04 9.80e-0
3h 1
2 8.6384003e+02 1.11e+04 5.24e+01 -1.0 1.09e+04 - 9.14e-05 1.01e-0
4h 1
3 8.5017170e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 3.90e-06 8.21e-0
4f 1
4 4.9538323e+02 1.09e+04 5.25e+01 -1.0 1.11e+04 - 9.01e-04 2.20e-0
2h 1
5 2.2860587e+04 6.00e-02 8.02e+01 -1.0 1.09e+04 - 5.09e-02 1.00e+0
0h 1
6 1.4474022e+04 5.60e-02 5.30e+01 -1.0 7.24e+01 - 3.29e-01 6.09e-0
2f 1
7 1.2886580e+04 3.02e-02 2.74e+01 -1.0 3.88e+01 - 4.77e-01 4.34e-0
1f 1
8 1.2611916e+04 1.45e-02 2.53e+00 -1.0 1.09e+01 - 9.19e-01 5.00e-0
1f 2
9 1.2457830e+04 7.14e-03 1.79e+00 -1.0 7.67e+00 - 1.00e+00 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2560536e+04 5.57e-04 4.23e-02 -1.0 9.96e+01 - 1.00e+00 1.00e+0
0f 1
11 1.2128441e+04 4.45e-04 9.63e-01 -2.5 9.85e+01 - 9.18e-01 5.84e-0
1f 1
12 1.2005875e+04 2.23e-04 2.20e-01 -2.5 4.03e+01 - 9.25e-01 1.00e+0
0f 1
13 1.1979924e+04 3.09e-03 1.97e-02 -2.5 1.15e+00 - 1.00e+00 1.00e+0
0h 1
14 1.1966627e+04 8.07e-04 3.65e-02 -3.8 2.68e+00 - 8.02e-01 1.00e+0
0h 1
15 1.1963692e+04 2.15e-03 1.02e-03 -3.8 4.89e-02 - 1.00e+00 1.00e+0
0h 1
16 1.1963905e+04 4.87e-05 1.38e-04 -3.8 1.22e-02 - 1.00e+00 1.00e+0
0h 1
17 1.1962603e+04 1.01e-04 3.31e-04 -5.7 1.49e-01 - 9.50e-01 9.74e-0
1h 1
18 1.1962589e+04 2.31e-05 3.85e-03 -5.7 3.81e-03 - 1.00e+00 7.72e-0
1h 1
19 1.1962591e+04 9.00e-09 1.28e-06 -5.7 8.67e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.1962577e+04 9.08e-09 1.93e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
21 1.1962576e+04 1.37e-12 6.54e-11 -8.6 3.06e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.1962576494300434e+01 1.1962576494300434e+0
4
Dual infeasibility......: 6.5447236815104549e-11 6.5447236815104543e-0
8
Constraint violation....: 1.3694601008751306e-12 1.3694601008751306e-1
2
Complementarity.........: 2.5092871509232019e-09 2.5092871509232020e-0
6
Overall NLP error.......: 2.5092871509232019e-09 2.5092871509232020e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8776327e+02 9.19e+03 5.24e+01 -1.0 9.28e+03 - 6.64e-04 9.80e-0
3h 1
2 8.8487848e+02 9.19e+03 5.24e+01 -1.0 8.49e+03 - 4.35e-05 1.07e-0
4h 1
3 8.1017699e+02 9.15e+03 5.24e+01 -1.0 9.19e+03 - 1.14e-05 4.07e-0
3h 1
4 4.8829988e+02 8.96e+03 5.23e+01 -1.0 9.15e+03 - 4.62e-03 2.12e-0
2h 1
5 1.9624071e+04 6.67e-02 7.88e+01 -1.0 8.96e+03 - 7.36e-02 1.00e+0
0h 1
6 1.2613352e+04 6.06e-02 4.34e+01 -1.0 5.13e+01 - 4.30e-01 8.42e-0
2f 1
7 1.1287964e+04 2.91e-02 1.67e+01 -1.0 2.55e+01 - 6.00e-01 4.84e-0
1f 1
8 1.0844638e+04 5.12e-03 9.75e-01 -1.0 9.16e+00 - 9.34e-01 7.59e-0
1f 1
9 1.1096445e+04 1.87e-04 6.07e-02 -1.0 4.66e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.0465431e+04 2.23e-03 8.01e-02 -2.5 4.76e+00 - 8.70e-01 8.69e-0
1f 1
11 1.0359674e+04 1.08e-03 4.55e-01 -2.5 7.61e-01 - 1.00e+00 6.04e-0
1f 1
12 1.0359707e+04 2.49e-06 8.14e-03 -2.5 1.53e-01 - 1.00e+00 1.00e+0
0h 1
13 1.0339422e+04 6.17e-06 2.39e-02 -3.8 5.36e+00 - 9.14e-01 8.89e-0
1f 1
14 1.0335906e+04 4.60e-04 4.72e-04 -3.8 5.91e-01 - 1.00e+00 1.00e+0
0f 1
15 1.0334764e+04 6.26e-05 1.12e-02 -5.7 2.97e-01 - 8.14e-01 1.00e+0
0h 1
16 1.0334651e+04 3.51e-05 3.92e-05 -5.7 9.55e-03 - 1.00e+00 1.00e+0
0h 1
17 1.0334652e+04 1.18e-06 1.11e-05 -5.7 1.44e-03 - 1.00e+00 9.97e-0
1h 1
18 1.0334638e+04 2.43e-09 9.98e-08 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
19 1.0334638e+04 7.11e-15 3.66e-14 -8.6 1.06e-07 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.0334637955001780e+01 1.0334637955001779e+0
4
Dual infeasibility......: 3.6599066558198097e-14 3.6599066558198097e-1
1
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5136149604922706e-09 2.5136149604922706e-0
6
Overall NLP error.......: 2.5136149604922706e-09 2.5136149604922706e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891119e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0611351e+02 6.71e+03 5.23e+01 -1.0 6.46e+03 - 8.39e-05 1.03e-0
4h 1
3 8.7440044e+02 6.70e+03 5.23e+01 -1.0 6.70e+03 - 6.84e-06 1.53e-0
3f 1
4 4.2534165e+02 6.54e+03 5.24e+01 -1.0 6.70e+03 - 1.83e-03 2.26e-0
2h 1
5 1.8469067e+04 6.74e-02 7.67e+01 -1.0 6.54e+03 - 8.35e-02 1.00e+0
0h 1
6 1.0609292e+04 6.07e-02 3.68e+01 -1.0 2.85e+01 - 4.94e-01 9.10e-0
2f 1
7 9.1070968e+03 1.97e-02 1.46e+01 -1.0 1.53e+01 - 6.26e-01 7.49e-0
1f 1
8 9.1804482e+03 5.62e-03 1.19e+00 -1.0 2.08e+00 - 9.93e-01 5.00e-0
1f 2
9 9.3751841e+03 2.91e-04 6.67e-02 -1.0 2.88e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.8198147e+03 2.22e-03 9.09e-02 -2.5 2.66e+01 - 8.56e-01 8.23e-0
1f 1
11 8.6513288e+03 2.12e-03 4.55e-01 -2.5 4.37e+00 - 1.00e+00 7.50e-0
1f 1
12 8.6223061e+03 1.56e-04 4.78e-03 -2.5 1.09e+00 - 1.00e+00 1.00e+0
0h 1
13 8.6058823e+03 4.18e-05 1.61e-01 -3.8 2.68e+00 - 1.00e+00 7.51e-0
1h 1
14 8.6015687e+03 1.44e-07 3.57e-04 -3.8 6.67e-01 - 1.00e+00 1.00e+0
0f 1
15 8.6003430e+03 2.79e-08 9.26e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 8.6003307e+03 1.87e-12 1.33e-08 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
17 8.6003159e+03 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 8.6003159219306653e+00 8.6003159219306654e+0
3
Dual infeasibility......: 4.4776954011634867e-09 4.4776954011634867e-0
6
Constraint violation....: 2.6309024403481374e-12 2.6309024403481374e-1
2
Complementarity.........: 3.6085002362251500e-09 3.6085002362251501e-0
6
Overall NLP error.......: 4.4776954011634867e-09 4.4776954011634867e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2998965e+02 4.77e+03 5.23e+01 -1.0 4.81e+03 - 2.02e-03 9.81e-0
3h 1
2 9.2082211e+02 4.77e+03 5.23e+01 -1.0 3.51e+03 - 1.43e-05 3.74e-0
4h 1
3 3.8434101e+02 4.66e+03 5.24e+01 -1.0 4.77e+03 - 2.86e-04 2.33e-0
2h 1
4 1.7339609e+04 7.04e-02 7.65e+01 -1.0 4.66e+03 - 7.76e-02 1.00e+0
0h 1
5 9.1903569e+03 6.38e-02 2.51e+01 -1.0 8.42e+00 - 6.40e-01 8.52e-0
2f 1
6 7.9431385e+03 3.12e-02 1.09e+01 -1.0 7.07e+00 - 6.69e-01 1.00e+0
0f 1
7 8.2254604e+03 9.50e-03 2.48e-01 -1.0 2.33e+00 - 9.91e-01 1.00e+0
0f 1
8 7.7795429e+03 3.47e-03 4.70e-01 -1.7 1.39e+01 - 7.71e-01 1.00e+0
0f 1
9 7.7429641e+03 6.24e-04 5.58e-01 -1.7 3.14e+01 - 5.65e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.7737990e+03 1.37e-05 8.59e-04 -1.7 2.31e+01 - 1.00e+00 1.00e+0
0h 1
11 7.5763574e+03 3.91e-04 2.04e-02 -3.8 6.91e+01 - 8.54e-01 8.42e-0
1f 1
12 7.5530357e+03 8.95e-05 1.38e-01 -3.8 1.07e+01 - 9.99e-01 7.92e-0
1h 1
13 7.5482011e+03 1.56e-07 9.63e-05 -3.8 2.23e+00 - 1.00e+00 1.00e+0
0f 1
14 7.5465668e+03 1.76e-08 3.01e-06 -5.7 5.94e-01 - 1.00e+00 1.00e+0
0f 1
15 7.5465477e+03 1.29e-12 4.23e-10 -8.6 7.36e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 7.5465477370672129e+00 7.5465477370672124e+0
3
Dual infeasibility......: 4.2288558113907085e-10 4.2288558113907085e-0
7
Constraint violation....: 1.2859435738477032e-12 1.2859435738477032e-1
2
Complementarity.........: 3.0028047170710618e-09 3.0028047170710618e-0
6
Overall NLP error.......: 3.0028047170710618e-09 3.0028047170710618e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6647742e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 4.97e-04 9.81e-0
3h 1
2 8.6258607e+02 3.24e+03 5.24e+01 -1.0 2.21e+03 - 3.91e-05 1.45e-0
4h 1
3 3.1400433e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 5.82e-05 2.24e-0
2f 1
4 1.5420372e+04 5.91e-02 8.12e+01 -1.0 3.17e+03 - 3.49e-02 1.00e+0
0h 1
5 6.7290069e+03 5.61e-02 6.00e+01 -1.0 7.11e+01 - 2.59e-01 4.63e-0
2f 1
6 4.9141782e+03 2.50e-02 3.24e+01 -1.0 3.47e+01 - 4.68e-01 5.32e-0
1f 1
7 4.4464852e+03 1.14e-02 2.56e+00 -1.0 9.40e+00 - 9.28e-01 1.00e+0
0f 1
8 4.7445322e+03 5.19e-04 7.23e-02 -1.0 2.72e+00 - 9.99e-01 1.00e+0
0f 1
9 4.1967988e+03 5.77e-04 4.24e-01 -2.5 7.14e+00 - 8.93e-01 7.24e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.1292529e+03 1.97e-04 2.34e-01 -2.5 2.25e+00 - 9.13e-01 1.00e+0
0h 1
11 4.1116442e+03 2.84e-04 9.33e-02 -2.5 9.70e-01 - 1.00e+00 7.64e-0
1H 1
12 4.1091626e+03 3.40e-04 1.77e-03 -2.5 1.24e-01 - 1.00e+00 1.00e+0
0f 1
13 4.0879671e+03 1.22e-03 3.19e-02 -3.8 8.05e+00 - 7.96e-01 1.00e+0
0h 1
14 4.0846007e+03 2.79e-03 1.11e-03 -3.8 4.90e-02 - 1.00e+00 1.00e+0
0h 1
15 4.0849547e+03 3.93e-05 1.31e-04 -3.8 1.35e-02 - 1.00e+00 1.00e+0
0h 1
16 4.0833586e+03 1.01e-04 3.52e-04 -5.7 4.46e-01 - 9.51e-01 9.77e-0
1h 1
17 4.0833414e+03 2.19e-05 3.67e-03 -5.7 1.03e-02 - 1.00e+00 7.83e-0
1h 1
18 4.0833430e+03 8.57e-09 1.21e-06 -5.7 2.23e-03 - 1.00e+00 1.00e+0
0f 1
19 4.0833247e+03 9.02e-09 1.92e-05 -8.6 5.53e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 4.0833244e+03 1.37e-12 6.48e-11 -8.6 9.17e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 4.0833243918474338e+00 4.0833243918474336e+0
3
Dual infeasibility......: 6.4813000947843963e-11 6.4813000947843963e-0
8
Constraint violation....: 1.3687939670603555e-12 1.3687939670603555e-1
2
Complementarity.........: 2.8770578227180748e-09 2.8770578227180748e-0
6
Overall NLP error.......: 2.8770578227180748e-09 2.8770578227180748e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4518010e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 3.98e-04 9.82e-0
3f 1
2 8.4053778e+02 2.00e+03 5.24e+01 -1.0 1.16e+03 - 4.81e-05 1.70e-0
4h 1
3 8.2353959e+02 2.00e+03 5.24e+01 -1.0 1.99e+03 - 9.16e-05 6.55e-0
4h 1
4 2.7656016e+02 1.95e+03 5.26e+01 -1.0 2.00e+03 - 7.38e-04 2.15e-0
2f 1
5 1.3590771e+04 5.75e-02 8.12e+01 -1.0 1.95e+03 - 4.60e-02 1.00e+0
0h 1
6 5.1287561e+03 5.39e-02 5.24e+01 -1.0 7.94e+01 - 3.46e-01 5.65e-0
2f 1
7 3.0120352e+03 3.43e-02 2.84e+01 -1.0 4.22e+01 - 4.66e-01 5.35e-0
1f 1
8 4.8304164e+03 7.84e-03 1.41e+01 -1.0 2.16e+01 - 6.33e-01 1.00e+0
0h 1
9 3.1436336e+03 5.61e-03 3.45e-01 -1.0 1.83e+01 - 9.68e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.7927316e+03 1.05e-03 4.74e-02 -1.7 5.61e+00 - 8.78e-01 8.81e-0
1f 1
11 2.6624340e+03 1.03e-03 3.41e-01 -2.5 5.47e+00 - 7.76e-01 1.00e+0
0h 1
12 2.5963515e+03 8.58e-03 4.86e-02 -2.5 3.67e+00 - 1.00e+00 1.00e+0
0h 1
13 2.6068715e+03 3.19e-04 6.33e-03 -2.5 5.01e-01 - 1.00e+00 1.00e+0
0h 1
14 2.5817387e+03 2.17e-04 5.21e-02 -3.8 6.99e+00 - 9.85e-01 8.71e-0
1h 1
15 2.5806495e+03 2.20e-06 1.53e-04 -3.8 2.80e-01 - 1.00e+00 1.00e+0
0h 1
16 2.5794666e+03 3.11e-07 2.15e-03 -5.7 2.90e-01 - 1.00e+00 9.77e-0
1h 1
17 2.5794585e+03 3.61e-11 2.15e-08 -5.7 2.88e-03 - 1.00e+00 1.00e+0
0f 1
18 2.5794438e+03 6.30e-11 4.40e-09 -8.6 3.69e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 2.5794437831067030e+00 2.5794437831067030e+0
3
Dual infeasibility......: 4.3996306015120243e-09 4.3996306015120243e-0
6
Constraint violation....: 6.3011776352261961e-11 6.3011776352261961e-1
1
Complementarity.........: 3.3134414607705377e-09 3.3134414607705378e-0
6
Overall NLP error.......: 4.3996306015120243e-09 4.3996306015120243e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6444407e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 4.93e-04 9.88e-0
3h 1
2 8.3543382e+02 9.17e+02 5.24e+01 -1.0 8.33e+02 - 9.54e-05 1.07e-0
3h 1
3 2.6287687e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 1.07e-03 2.19e-0
2h 1
4 1.2568991e+04 6.01e-02 8.03e+01 -1.0 8.97e+02 - 5.11e-02 1.00e+0
0h 1
5 4.2524598e+03 5.61e-02 5.27e+01 -1.0 7.22e+01 - 3.33e-01 6.11e-0
2f 1
6 2.6511908e+03 3.01e-02 2.72e+01 -1.0 3.89e+01 - 4.78e-01 4.36e-0
1f 1
7 2.1340895e+03 1.41e-02 2.51e+00 -1.0 1.09e+01 - 9.19e-01 1.00e+0
0f 1
8 2.4373280e+03 4.17e-04 7.92e-02 -1.0 4.28e+00 - 9.94e-01 1.00e+0
0f 1
9 1.8834958e+03 6.25e-04 4.43e-01 -2.5 7.78e+00 - 8.86e-01 7.02e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8124400e+03 2.65e-04 3.57e-01 -2.5 9.69e+00 - 8.81e-01 1.00e+0
0h 1
11 1.8060560e+03 7.04e-04 4.63e-01 -2.5 1.53e+00 - 1.00e+00 1.73e-0
1h 2
12 1.7848603e+03 1.17e-03 1.25e-02 -2.5 1.10e+00 - 1.00e+00 1.00e+0
0h 1
13 1.7523625e+03 1.27e-03 3.45e-02 -3.8 1.88e+01 - 7.93e-01 1.00e+0
0h 1
14 1.7492988e+03 2.43e-03 9.19e-04 -3.8 4.86e-02 - 1.00e+00 1.00e+0
0h 1
15 1.7496529e+03 4.16e-05 1.56e-04 -3.8 1.51e-02 - 1.00e+00 1.00e+0
0h 1
16 1.7474602e+03 1.03e-04 3.31e-04 -5.7 1.04e+00 - 9.51e-01 9.75e-0
1h 1
17 1.7474304e+03 2.27e-05 4.06e-03 -5.7 2.62e-02 - 1.00e+00 7.82e-0
1h 1
18 1.7474281e+03 8.07e-09 1.21e-06 -5.7 5.72e-03 - 1.00e+00 1.00e+0
0f 1
19 1.7474025e+03 8.86e-09 2.07e-05 -8.6 1.29e-02 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7474021e+03 1.47e-12 7.02e-11 -8.6 2.16e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.7474020872527942e+00 1.7474020872527942e+0
3
Dual infeasibility......: 7.0176024737319940e-11 7.0176024737319933e-0
8
Constraint violation....: 1.4698242623012447e-12 1.4698242623012447e-1
2
Complementarity.........: 2.6888913506137389e-09 2.6888913506137389e-0
6
Overall NLP error.......: 2.6888913506137389e-09 2.6888913506137389e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.04e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.11e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235598398e+00 1.6104063235598398e+0
3
Dual infeasibility......: 2.4574010247072154e-12 2.4574010247072154e-0
9
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5062163919694739e-09 2.5062163919694738e-0
6
Overall NLP error.......: 2.5062163919694739e-09 2.5062163919694738e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933531e-01 5.8277753147933527e+0
2
Dual infeasibility......: 2.1031318724752505e-09 2.1031318724752505e-0
6
Constraint violation....: 6.2994068295019190e-11 6.2994068295019190e-1
1
Complementarity.........: 2.8882108897061754e-09 2.8882108897061753e-0
6
Overall NLP error.......: 2.8882108897061754e-09 2.8882108897061753e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146111910574e-01 6.4890146111910576e+0
2
Dual infeasibility......: 4.9126605652906479e-09 4.9126605652906479e-0
6
Constraint violation....: 6.2123813870940126e-09 6.2123813870940126e-0
9
Complementarity.........: 4.3646094984613085e-09 4.3646094984613086e-0
6
Overall NLP error.......: 6.2123813870940126e-09 4.9126605652906479e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.04e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.11e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235598398e+00 1.6104063235598398e+0
3
Dual infeasibility......: 2.4574010247072154e-12 2.4574010247072154e-0
9
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5062163919694739e-09 2.5062163919694738e-0
6
Overall NLP error.......: 2.5062163919694739e-09 2.5062163919694738e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2183109e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 3.29e-04 9.88e-0
3h 1
2 7.9676737e+02 9.17e+02 5.24e+01 -1.0 8.18e+02 - 9.72e-05 9.15e-0
4h 1
3 2.4281667e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 9.07e-04 2.09e-0
2h 1
4 1.2255647e+04 5.54e-02 8.24e+01 -1.0 8.98e+02 - 3.87e-02 1.00e+0
0h 1
5 3.8688482e+03 5.28e-02 5.51e+01 -1.0 7.96e+01 - 3.29e-01 5.05e-0
2f 1
6 1.9078245e+03 3.74e-02 2.93e+01 -1.0 3.92e+01 - 4.72e-01 5.02e-0
1f 1
7 4.6515223e+03 1.22e-02 2.62e+01 -1.0 2.04e+01 - 4.04e-01 1.00e+0
0h 1
8 1.8738261e+03 1.17e-02 9.61e-01 -1.0 2.50e+01 - 9.88e-01 8.98e-0
1f 1
9 1.6952055e+03 5.07e-04 6.26e-02 -1.7 6.87e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5627586e+03 1.96e-03 2.18e-01 -2.5 1.24e+01 - 7.44e-01 1.00e+0
0f 1
11 1.5309890e+03 3.66e-03 1.02e-01 -2.5 2.11e+00 - 1.00e+00 9.20e-0
1h 1
12 1.5388593e+03 1.30e-04 3.48e-03 -2.5 1.17e+00 - 1.00e+00 1.00e+0
0h 1
13 1.5037282e+03 1.63e-04 2.14e-02 -3.8 1.88e+01 - 9.93e-01 9.32e-0
1h 1
14 1.5022722e+03 7.63e-07 7.14e-05 -3.8 1.23e+00 - 1.00e+00 1.00e+0
0f 1
15 1.5003195e+03 3.78e-07 1.76e-04 -5.7 1.04e+00 - 1.00e+00 9.96e-0
1h 1
16 1.5003172e+03 3.80e-11 2.94e-09 -5.7 1.08e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.29e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5002932821304766e+00 1.5002932821304767e+0
3
Dual infeasibility......: 2.1693988061224327e-09 2.1693988061224327e-0
6
Constraint violation....: 6.2995733629556128e-11 6.2995733629556128e-1
1
Complementarity.........: 2.8882169869150640e-09 2.8882169869150638e-0
6
Overall NLP error.......: 2.8882169869150640e-09 2.8882169869150638e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6444407e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 4.93e-04 9.88e-0
3h 1
2 8.3543382e+02 9.17e+02 5.24e+01 -1.0 8.33e+02 - 9.54e-05 1.07e-0
3h 1
3 2.6287687e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 1.07e-03 2.19e-0
2h 1
4 1.2568991e+04 6.01e-02 8.03e+01 -1.0 8.97e+02 - 5.11e-02 1.00e+0
0h 1
5 4.2524598e+03 5.61e-02 5.27e+01 -1.0 7.22e+01 - 3.33e-01 6.11e-0
2f 1
6 2.6511908e+03 3.01e-02 2.72e+01 -1.0 3.89e+01 - 4.78e-01 4.36e-0
1f 1
42 1.382556e+04 1.632511e+04 3.983562e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1155551e+02 1.57e+04 5.50e+01 -1.0 1.59e+04 - 1.75e-04 9.80e-0
3f 1
2 7.0865065e+02 1.57e+04 5.50e+01 -1.0 1.45e+04 - 3.33e-05 1.07e-0
4h 1
3 7.0346355e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 1.08e-05 4.18e-0
4h 1
4 6.9567078e+02 1.57e+04 5.49e+01 -1.0 1.57e+04 - 4.26e-04 6.60e-0
4h 1
5 4.9844018e+02 1.54e+04 5.39e+01 -1.0 1.57e+04 - 1.16e-03 1.90e-0
2f 1
6 2.5928886e+04 7.61e-02 8.68e+01 -1.0 1.54e+04 - 2.58e-02 1.00e+0
0h 1
7 1.7884947e+04 7.32e-02 7.19e+01 -1.0 6.99e+01 - 1.81e-01 4.06e-0
2f 1
8 1.6631010e+04 4.63e-02 3.32e+01 -1.0 1.99e+01 - 5.33e-01 3.77e-0
1f 1
9 1.7129501e+04 3.51e-02 1.11e+01 -1.0 1.34e+01 - 5.66e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6801160e+04 7.39e-03 2.35e+00 -1.0 1.55e+00 - 8.35e-01 1.00e+0
0h 1
11 1.6815768e+04 2.01e-04 1.85e+00 -1.0 2.83e+00 - 2.82e-01 1.00e+0
0f 1
12 1.6823381e+04 5.80e-06 5.87e-01 -1.0 2.50e+00 - 7.00e-01 1.00e+0
0f 1
13 1.6527785e+04 2.25e-04 3.19e-01 -1.7 4.72e+00 - 8.84e-01 7.99e-0
1f 1
14 1.6481103e+04 5.81e-04 2.67e-01 -1.7 9.87e+00 - 6.39e-01 1.00e+0
0f 1
15 1.6484782e+04 6.03e-05 3.46e-02 -1.7 1.46e+01 - 8.33e-01 1.00e+0
0h 1
16 1.6365377e+04 9.63e-04 4.41e-02 -2.5 2.38e+01 - 9.29e-01 1.00e+0
0f 1
17 1.6344992e+04 1.06e-03 1.13e-02 -2.5 1.67e+00 - 1.00e+00 1.00e+0
0h 1
18 1.6327793e+04 1.77e-04 8.13e-02 -3.8 5.61e+00 - 1.00e+00 8.57e-0
1h 1
19 1.6326240e+04 5.91e-07 9.65e-05 -3.8 6.62e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325291e+04 3.75e-07 8.48e-03 -5.7 2.56e-01 - 1.00e+00 8.05e-0
1h 1
21 1.6325119e+04 1.52e-08 5.04e-07 -5.7 1.13e-02 - 1.00e+00 1.00e+0
0f 1
22 1.6325105e+04 1.26e-10 2.59e-06 -8.6 2.34e-03 - 1.00e+00 9.96e-0
1h 1
23 1.6325105e+04 7.11e-15 3.70e-14 -8.6 1.74e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 23
(scaled) (unscaled)
Objective...............: 1.6325105261433347e+01 1.6325105261433346e+0
4
Dual infeasibility......: 3.7039015080572732e-14 3.7039015080572732e-1
1
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5060243588125429e-09 2.5060243588125429e-0
6
Overall NLP error.......: 2.5060243588125429e-09 2.5060243588125429e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 24
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 24
Number of inequality constraint Jacobian evaluations = 24
Number of Lagrangian Hessian evaluations = 23
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.4942965e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.08e-04 9.80e-0
3f 1
2 7.4655362e+02 1.50e+04 5.25e+01 -1.0 1.43e+04 - 4.85e-05 1.03e-0
4h 1
3 7.1996490e+02 1.49e+04 5.25e+01 -1.0 1.50e+04 - 6.34e-06 2.00e-0
3h 1
4 5.1236387e+02 1.47e+04 5.27e+01 -1.0 1.49e+04 - 2.13e-03 1.92e-0
2h 1
5 2.5154338e+04 6.66e-02 8.55e+01 -1.0 1.47e+04 - 2.88e-02 1.00e+0
0h 1
6 1.7345157e+04 6.39e-02 6.64e+01 -1.0 7.13e+01 - 2.30e-01 4.32e-0
2f 1
7 1.5905238e+04 4.64e-02 3.17e+01 -1.0 2.57e+01 - 5.17e-01 4.13e-0
1f 1
8 1.6179900e+04 3.42e-02 1.13e+01 -1.0 1.49e+01 - 5.03e-01 1.25e-0
1f 4
9 1.6020124e+04 5.38e-03 1.66e-01 -1.0 2.80e+00 - 9.92e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5734719e+04 9.34e-04 2.30e-01 -1.7 7.34e+00 - 1.00e+00 8.85e-0
1f 1
11 1.5727162e+04 7.31e-04 9.76e-03 -1.7 3.30e+01 - 1.00e+00 1.00e+0
0f 1
12 1.5585618e+04 1.28e-03 8.50e-02 -3.8 3.98e+01 - 8.04e-01 9.33e-0
1f 1
13 1.5560391e+04 1.42e-03 6.28e-02 -3.8 2.62e+00 - 8.54e-01 7.77e-0
1h 1
14 1.5560324e+04 2.49e-06 7.07e-04 -3.8 5.83e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5559224e+04 3.27e-07 5.68e-04 -5.7 2.97e-01 - 1.00e+00 9.89e-0
1h 1
16 1.5559217e+04 4.00e-11 5.95e-09 -5.7 3.46e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5559202e+04 6.30e-11 2.06e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5559202141420602e+01 1.5559202141420603e+0
4
Dual infeasibility......: 2.0613871604417602e-09 2.0613871604417602e-0
6
Constraint violation....: 6.2995136884680392e-11 6.2995136884680392e-1
1
Complementarity.........: 2.8881126071222185e-09 2.8881126071222184e-0
6
Overall NLP error.......: 2.8881126071222185e-09 2.8881126071222184e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2478506e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.32e-04 9.80e-0
3f 1
2 8.2196472e+02 1.39e+04 5.24e+01 -1.0 1.37e+04 - 9.40e-05 1.01e-0
4h 1
3 8.1293913e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 3.07e-06 6.34e-0
4f 1
4 5.2415557e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 6.80e-04 2.11e-0
2h 1
5 2.5358316e+04 5.52e-02 8.23e+01 -1.0 1.36e+04 - 3.87e-02 1.00e+0
0h 1
6 1.6867466e+04 5.27e-02 5.57e+01 -1.0 8.05e+01 - 3.21e-01 5.03e-0
2f 1
7 1.4889632e+04 3.72e-02 2.98e+01 -1.0 3.94e+01 - 4.69e-01 5.05e-0
1f 1
8 1.5235324e+04 2.27e-02 1.38e+01 -1.0 2.06e+01 - 4.01e-01 1.25e-0
1f 4
9 1.4980372e+04 6.00e-03 4.01e-01 -1.0 4.89e+00 - 9.78e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4673872e+04 1.44e-03 4.10e-01 -1.7 5.58e+00 - 1.00e+00 8.23e-0
1f 1
11 1.4632085e+04 9.20e-04 1.46e-02 -1.7 1.81e+01 - 1.00e+00 1.00e+0
0f 1
12 1.4504051e+04 1.44e-03 9.80e-02 -3.8 1.99e+01 - 7.88e-01 9.29e-0
1f 1
13 1.4480551e+04 1.62e-03 8.62e-02 -3.8 1.71e+00 - 8.43e-01 7.50e-0
1h 1
14 1.4481004e+04 3.35e-06 8.59e-04 -3.8 3.46e-01 - 1.00e+00 1.00e+0
0h 1
15 1.4480071e+04 2.79e-07 6.78e-04 -5.7 1.49e-01 - 1.00e+00 9.87e-0
1h 1
16 1.4480065e+04 3.63e-11 6.72e-09 -5.7 2.71e-01 - 1.00e+00 1.00e+0
0f 1
17 1.4480052e+04 6.30e-11 2.18e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.4480051767115818e+01 1.4480051767115818e+0
4
Dual infeasibility......: 2.1763310635960431e-09 2.1763310635960431e-0
6
Constraint violation....: 6.2999466754476430e-11 6.2999466754476430e-1
1
Complementarity.........: 2.8881013375908863e-09 2.8881013375908864e-0
6
Overall NLP error.......: 2.8881013375908863e-09 2.8881013375908864e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.3468281e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.61e-04 9.80e-0
3h 1
2 8.3180950e+02 1.27e+04 5.24e+01 -1.0 1.20e+04 - 4.67e-05 1.04e-0
4h 1
3 7.9270250e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 7.75e-06 2.53e-0
3h 1
4 5.2154415e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 2.75e-03 2.06e-0
2h 1
5 2.3250370e+04 5.82e-02 8.20e+01 -1.0 1.24e+04 - 4.51e-02 1.00e+0
0h 1
6 1.5609676e+04 5.45e-02 4.81e+01 -1.0 7.34e+01 - 4.05e-01 5.73e-0
2f 1
7 1.3643594e+04 3.60e-02 2.48e+01 -1.0 4.08e+01 - 4.88e-01 5.09e-0
1f 1
8 1.4027377e+04 1.97e-02 5.38e+00 -1.0 1.23e+01 - 6.27e-01 2.50e-0
1f 3
9 1.3783345e+04 5.01e-03 3.05e-01 -1.0 4.34e+00 - 9.65e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3445881e+04 1.31e-03 4.63e-01 -1.7 6.08e+00 - 1.00e+00 8.03e-0
1f 1
11 1.3411007e+04 7.66e-04 2.22e-02 -1.7 3.67e+01 - 1.00e+00 1.00e+0
0f 1
12 1.3259735e+04 1.51e-03 1.04e-01 -3.8 3.98e+01 - 7.74e-01 9.23e-0
1f 1
13 1.3233792e+04 1.86e-03 9.94e-02 -3.8 3.04e+00 - 8.31e-01 7.37e-0
1h 1
14 1.3234131e+04 2.95e-06 1.02e-03 -3.8 8.00e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3233075e+04 2.41e-07 7.69e-04 -5.7 2.97e-01 - 1.00e+00 9.86e-0
1h 1
16 1.3233066e+04 3.24e-11 7.24e-09 -5.7 6.64e-02 - 1.00e+00 1.00e+0
0f 1
17 1.3233051e+04 6.30e-11 2.30e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.3233050920366981e+01 1.3233050920366981e+0
4
Dual infeasibility......: 2.2971232202813009e-09 2.2971232202813009e-0
6
Constraint violation....: 6.3002533745581957e-11 6.3002533745581957e-1
1
Complementarity.........: 2.8880934040939786e-09 2.8880934040939784e-0
6
Overall NLP error.......: 2.8880934040939786e-09 2.8880934040939784e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6059922e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 4.64e-04 9.80e-0
3h 1
2 8.5772839e+02 1.11e+04 5.24e+01 -1.0 1.05e+04 - 4.56e-05 1.05e-0
4h 1
3 8.0702929e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 9.02e-06 3.03e-0
3h 1
4 5.0814926e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 3.34e-03 2.09e-0
2h 1
5 2.1737341e+04 6.17e-02 8.07e+01 -1.0 1.09e+04 - 5.44e-02 1.00e+0
0h 1
6 1.4292276e+04 5.72e-02 4.84e+01 -1.0 6.86e+01 - 3.88e-01 6.58e-0
2f 1
7 1.2581040e+04 3.07e-02 2.39e+01 -1.0 3.98e+01 - 5.01e-01 4.63e-0
1f 1
8 1.2398154e+04 1.04e-02 2.12e+00 -1.0 1.02e+01 - 9.24e-01 1.00e+0
0f 1
9 1.2442479e+04 5.42e-04 5.09e-02 -1.0 5.21e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2050358e+04 3.87e-04 9.17e-01 -2.5 6.88e+00 - 9.08e-01 5.83e-0
1f 1
11 1.1934859e+04 4.63e-04 3.46e-01 -2.5 3.92e+00 - 8.63e-01 1.00e+0
0f 1
12 1.1933633e+04 6.71e-04 4.37e-01 -2.5 1.44e+00 -2.0 1.89e-01 2.83e-0
2h 2
13 1.1897425e+04 6.71e-04 4.38e-02 -2.5 1.98e+00 - 1.00e+00 9.13e-0
1h 1
14 1.1902564e+04 8.39e-05 1.02e-03 -2.5 2.85e-01 - 1.00e+00 1.00e+0
0f 1
15 1.1883011e+04 1.58e-03 5.07e-02 -3.8 5.36e+00 - 7.69e-01 1.00e+0
0h 1
16 1.1878756e+04 4.35e-03 8.20e-04 -3.8 5.81e-02 - 1.00e+00 1.00e+0
0h 1
17 1.1878618e+04 2.14e-05 1.07e-04 -3.8 8.27e-03 - 1.00e+00 1.00e+0
0h 1
18 1.1877569e+04 4.93e-05 1.07e-02 -5.7 2.97e-01 - 9.65e-01 6.81e-0
1h 1
19 1.1877182e+04 6.86e-06 5.67e-04 -5.7 9.47e-02 - 8.80e-01 9.51e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.1877164e+04 2.87e-07 4.72e-04 -5.7 4.63e-03 - 1.00e+00 9.77e-0
1f 1
21 1.1877166e+04 3.67e-09 1.18e-06 -5.7 1.07e-04 - 1.00e+00 1.00e+0
0f 1
22 1.1877150e+04 8.58e-09 2.17e-04 -8.6 3.68e-03 - 1.00e+00 9.53e-0
1h 1
23 1.1877149e+04 3.77e-12 5.34e-10 -8.6 1.73e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 23
(scaled) (unscaled)
Objective...............: 1.1877148992118407e+01 1.1877148992118407e+0
4
Dual infeasibility......: 5.3358874079903888e-10 5.3358874079903888e-0
7
Constraint violation....: 3.7745362391206072e-12 3.7745362391206072e-1
2
Complementarity.........: 3.0433921689808735e-09 3.0433921689808734e-0
6
Overall NLP error.......: 3.0433921689808735e-09 3.0433921689808734e-0
6
Number of objective function evaluations = 27
Number of objective gradient evaluations = 24
Number of equality constraint evaluations = 27
Number of inequality constraint evaluations = 27
Number of equality constraint Jacobian evaluations = 24
Number of inequality constraint Jacobian evaluations = 24
Number of Lagrangian Hessian evaluations = 23
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3005293e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 2.02e-03 9.81e-0
3h 1
2 9.2651210e+02 9.19e+03 5.23e+01 -1.0 6.50e+03 - 1.50e-05 1.40e-0
4h 1
3 4.8735725e+02 8.97e+03 5.24e+01 -1.0 9.19e+03 - 4.50e-05 2.34e-0
2f 1
4 2.1862187e+04 7.01e-02 8.02e+01 -1.0 8.97e+03 - 3.23e-02 1.00e+0
0h 1
5 1.3691797e+04 6.67e-02 6.19e+01 -1.0 1.57e+01 - 2.28e-01 4.50e-0
2f 1
6 1.2506350e+04 1.60e-02 2.67e+01 -1.0 7.64e+00 - 6.04e-01 8.60e-0
1f 1
7 1.2596694e+04 5.65e-03 2.44e-01 -1.0 2.19e+00 - 9.91e-01 1.00e+0
0f 1
8 1.2196508e+04 1.61e-03 1.40e-01 -1.7 5.04e+00 - 1.00e+00 9.30e-0
1f 1
9 1.2024810e+04 1.68e-03 5.13e-01 -2.5 3.38e+00 - 1.00e+00 7.47e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1991288e+04 2.90e-04 1.15e-01 -2.5 8.49e-01 - 1.00e+00 8.88e-0
1h 1
11 1.1993022e+04 8.46e-06 2.09e-03 -2.5 9.55e-02 - 1.00e+00 1.00e+0
0f 1
12 1.1965653e+04 8.02e-06 3.85e-03 -3.8 8.04e+00 - 1.00e+00 9.81e-0
1f 1
13 1.1965506e+04 1.39e-08 6.12e-06 -3.8 1.52e-01 - 1.00e+00 1.00e+0
0f 1
14 1.1964016e+04 1.73e-08 3.04e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0f 1
15 1.1963999e+04 1.28e-12 4.22e-10 -8.6 5.52e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.1963999138874577e+01 1.1963999138874577e+0
4
Dual infeasibility......: 4.2180045897064353e-10 4.2180045897064353e-0
7
Constraint violation....: 1.2798512250000726e-12 1.2798512250000726e-1
2
Complementarity.........: 3.1724243820804500e-09 3.1724243820804500e-0
6
Overall NLP error.......: 3.1724243820804500e-09 3.1724243820804500e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2299660e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1994562e+02 6.71e+03 5.23e+01 -1.0 5.82e+03 - 3.44e-05 1.14e-0
4h 1
3 7.2850968e+02 6.64e+03 5.23e+01 -1.0 6.70e+03 - 1.95e-05 9.17e-0
3f 1
4 4.9339560e+02 6.50e+03 5.19e+01 -1.0 6.64e+03 - 1.16e-02 2.10e-0
2h 1
5 1.5628518e+04 8.10e-02 7.81e+01 -1.0 6.50e+03 - 8.90e-02 1.00e+0
0h 1
6 1.0636045e+04 7.19e-02 2.13e+01 -1.0 1.24e+01 - 7.05e-01 1.06e-0
1f 1
7 9.4596865e+03 2.23e-02 3.10e+00 -1.0 9.08e+00 - 8.57e-01 8.74e-0
1f 1
8 9.7561576e+03 1.77e-02 1.82e-01 -1.0 2.44e+00 - 9.79e-01 9.15e-0
1f 1
9 9.3972521e+03 3.03e-03 1.30e+00 -1.7 1.14e+01 - 3.09e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.3698885e+03 2.39e-04 3.47e-01 -1.7 1.02e+01 - 8.34e-01 1.00e+0
0h 1
11 9.3830428e+03 1.43e-04 3.00e-03 -1.7 1.31e+01 - 1.00e+00 1.00e+0
0f 1
12 9.2081776e+03 5.08e-04 2.06e-02 -3.8 3.63e+01 - 8.41e-01 8.42e-0
1f 1
13 9.1892920e+03 1.61e-04 2.24e-01 -3.8 5.67e+00 - 9.94e-01 7.11e-0
1h 1
14 9.1841539e+03 3.39e-07 3.49e-04 -3.8 1.64e+00 - 1.00e+00 1.00e+0
0h 1
15 9.1828157e+03 1.95e-08 4.30e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
16 9.1828008e+03 8.25e-13 4.92e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 9.1828007806392353e+00 9.1828007806392343e+0
3
Dual infeasibility......: 4.9240164369390111e-10 4.9240164369390111e-0
7
Constraint violation....: 8.2465978490375846e-13 8.2465978490375846e-1
3
Complementarity.........: 3.9179572237557606e-09 3.9179572237557609e-0
6
Overall NLP error.......: 3.9179572237557606e-09 3.9179572237557609e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8769624e+02 4.77e+03 5.24e+01 -1.0 4.82e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8418913e+02 4.77e+03 5.24e+01 -1.0 3.56e+03 - 3.31e-05 1.33e-0
4h 1
3 3.6133643e+02 4.66e+03 5.25e+01 -1.0 4.77e+03 - 4.21e-05 2.30e-0
2f 1
4 1.7154392e+04 6.18e-02 8.10e+01 -1.0 4.66e+03 - 3.09e-02 1.00e+0
0h 1
5 8.5606749e+03 5.89e-02 6.28e+01 -1.0 5.79e+01 - 2.24e-01 4.28e-0
2f 1
6 7.0723371e+03 2.48e-02 3.20e+01 -1.0 2.57e+01 - 4.96e-01 5.40e-0
1f 1
7 6.3632320e+03 1.23e-02 2.18e+00 -1.0 9.60e+00 - 9.29e-01 8.90e-0
1f 1
8 6.7901981e+03 4.37e-04 9.76e-02 -1.0 4.08e+00 - 9.98e-01 1.00e+0
0f 1
9 6.0059974e+03 2.23e-03 2.20e-01 -2.5 5.68e+00 - 8.65e-01 9.65e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.9389132e+03 1.04e-03 6.17e-01 -2.5 9.51e-01 - 1.00e+00 5.72e-0
1h 1
11 5.9432447e+03 3.92e-06 8.28e-03 -2.5 4.29e-01 - 1.00e+00 1.00e+0
0h 1
12 5.9223336e+03 4.94e-06 4.04e-02 -3.8 8.04e+00 - 9.21e-01 8.83e-0
1f 1
13 5.9186052e+03 4.67e-04 5.92e-04 -3.8 9.38e-01 - 1.00e+00 1.00e+0
0f 1
14 5.9173166e+03 6.39e-05 1.15e-02 -5.7 4.46e-01 - 8.12e-01 1.00e+0
0h 1
15 5.9172009e+03 3.63e-05 4.14e-05 -5.7 9.71e-03 - 1.00e+00 1.00e+0
0h 1
16 5.9172026e+03 1.61e-06 4.52e-05 -5.7 1.47e-03 - 1.00e+00 9.88e-0
1h 1
17 5.9172051e+03 3.53e-08 5.15e-07 -5.7 2.92e-04 - 1.00e+00 1.00e+0
0f 1
18 5.9171869e+03 3.96e-08 7.27e-06 -8.6 5.53e-03 - 9.97e-01 9.81e-0
1h 1
19 5.9171865e+03 5.33e-13 2.97e-11 -8.6 1.06e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 5.9171865499612171e+00 5.9171865499612168e+0
3
Dual infeasibility......: 2.9739084338141256e-11 2.9739084338141256e-0
8
Constraint violation....: 5.3312909642500017e-13 5.3312909642500017e-1
3
Complementarity.........: 2.9343756936128114e-09 2.9343756936128114e-0
6
Overall NLP error.......: 2.9343756936128114e-09 2.9343756936128114e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9465052e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3h 1
2 8.8961066e+02 3.24e+03 5.24e+01 -1.0 1.65e+03 - 3.15e-05 1.94e-0
4h 1
3 3.3049321e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 1.10e-04 2.31e-0
2f 1
4 1.5661028e+04 6.29e-02 8.00e+01 -1.0 3.17e+03 - 4.12e-02 1.00e+0
0h 1
5 7.0966213e+03 5.93e-02 5.59e+01 -1.0 4.98e+01 - 2.95e-01 5.19e-0
2f 1
6 5.7201217e+03 2.49e-02 2.72e+01 -1.0 2.33e+01 - 5.16e-01 5.36e-0
1f 1
7 5.1215760e+03 9.32e-03 1.31e+00 -1.0 8.82e+00 - 9.35e-01 7.62e-0
1f 1
8 5.4190355e+03 3.08e-04 8.41e-02 -1.0 3.70e+00 - 9.98e-01 1.00e+0
0f 1
9 4.8035361e+03 2.09e-03 8.11e-02 -2.5 6.10e+00 - 8.62e-01 8.49e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.6320367e+03 2.20e-03 3.43e-01 -2.5 2.05e+00 - 1.00e+00 7.81e-0
1f 1
11 4.6055460e+03 1.52e-04 4.72e-03 -2.5 5.04e-01 - 1.00e+00 1.00e+0
0h 1
12 4.5784262e+03 2.24e-05 4.27e-02 -3.8 1.07e+01 - 1.00e+00 8.84e-0
1h 1
13 4.5760808e+03 5.69e-08 5.99e-04 -3.8 1.23e+00 - 1.00e+00 1.00e+0
0f 1
14 4.5743301e+03 4.25e-08 5.47e-05 -5.7 5.94e-01 - 1.00e+00 9.98e-0
1f 1
15 4.5743305e+03 1.88e-12 1.31e-08 -5.7 1.23e-03 - 1.00e+00 1.00e+0
0f 1
16 4.5743102e+03 2.57e-12 3.30e-06 -8.6 7.37e-03 - 1.00e+00 9.99e-0
1f 1
17 4.5743102e+03 1.65e-15 4.84e-14 -8.6 4.12e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 4.5743101979242624e+00 4.5743101979242620e+0
3
Dual infeasibility......: 4.8365220389319292e-14 4.8365220389319292e-1
1
Constraint violation....: 1.6501645209595451e-15 1.6501645209595451e-1
5
Complementarity.........: 2.6695934679557373e-09 2.6695934679557373e-0
6
Overall NLP error.......: 2.6695934679557373e-09 2.6695934679557373e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8047271e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.82e-0
3h 1
2 8.7572172e+02 2.00e+03 5.24e+01 -1.0 1.12e+03 - 4.57e-05 1.77e-0
4h 1
3 8.5848647e+02 2.00e+03 5.24e+01 -1.0 1.99e+03 - 9.83e-05 6.73e-0
4h 1
4 2.9495823e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 7.63e-04 2.24e-0
2f 1
5 1.3915686e+04 6.17e-02 7.93e+01 -1.0 1.95e+03 - 5.68e-02 1.00e+0
0h 1
6 5.5165622e+03 5.73e-02 5.23e+01 -1.0 6.38e+01 - 3.28e-01 6.60e-0
2f 1
7 4.1580659e+03 3.11e-02 2.54e+01 -1.0 3.21e+01 - 5.03e-01 4.22e-0
1f 1
8 3.3871743e+03 1.13e-02 1.99e+00 -1.0 1.10e+01 - 9.20e-01 9.10e-0
1f 1
9 3.8058980e+03 3.36e-04 1.97e-01 -1.0 4.84e+00 - 9.33e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.1157920e+03 1.20e-03 9.70e-01 -1.7 1.98e+01 - 4.60e-01 9.97e-0
1f 1
11 3.1855634e+03 4.48e-05 2.38e-02 -1.7 6.75e+00 - 1.00e+00 1.00e+0
0f 1
12 3.0668669e+03 4.90e-05 1.81e-01 -2.5 2.58e+01 - 1.00e+00 8.61e-0
1f 1
13 3.0614469e+03 8.55e-05 2.74e-03 -2.5 2.83e-01 - 1.00e+00 1.00e+0
0f 1
14 3.0435601e+03 2.48e-04 6.68e-02 -3.8 6.99e+00 - 7.79e-01 9.52e-0
1h 1
15 3.0406313e+03 1.60e-03 1.53e-03 -3.8 3.27e-01 - 9.82e-01 1.00e+0
0f 1
16 3.0406229e+03 8.25e-05 6.19e-05 -3.8 2.34e-02 - 1.00e+00 1.00e+0
0h 1
17 3.0392663e+03 1.30e-04 1.10e-03 -5.7 3.04e-01 - 9.19e-01 1.00e+0
0h 1
18 3.0392284e+03 3.23e-05 6.59e-06 -5.7 8.38e-03 - 1.00e+00 1.00e+0
0h 1
19 3.0392341e+03 1.71e-07 3.28e-06 -5.7 5.94e-04 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 3.0392190e+03 2.64e-08 3.19e-05 -8.6 3.69e-03 - 1.00e+00 9.58e-0
1h 1
21 3.0392184e+03 4.25e-12 5.09e-11 -8.6 1.55e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 3.0392183900444629e+00 3.0392183900444629e+0
3
Dual infeasibility......: 5.0909587668514740e-11 5.0909587668514740e-0
8
Constraint violation....: 4.2542636080611373e-12 4.2542636080611373e-1
2
Complementarity.........: 3.3122275141652470e-09 3.3122275141652471e-0
6
Overall NLP error.......: 3.3122275141652470e-09 3.3122275141652471e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2252293e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 3.31e-04 9.88e-0
3h 1
2 7.9742303e+02 9.17e+02 5.24e+01 -1.0 8.18e+02 - 9.71e-05 9.16e-0
4h 1
3 2.4312288e+02 8.97e+02 5.26e+01 -1.0 9.17e+02 - 9.08e-04 2.09e-0
2h 1
4 1.2260850e+04 5.54e-02 8.24e+01 -1.0 8.98e+02 - 3.89e-02 1.00e+0
0h 1
5 3.8743081e+03 5.28e-02 5.49e+01 -1.0 7.96e+01 - 3.31e-01 5.07e-0
2f 1
6 1.9080741e+03 3.72e-02 2.92e+01 -1.0 3.93e+01 - 4.71e-01 5.03e-0
1f 1
7 4.6563841e+03 1.22e-02 2.61e+01 -1.0 2.04e+01 - 4.03e-01 1.00e+0
0h 1
8 1.8744334e+03 1.17e-02 9.66e-01 -1.0 2.51e+01 - 9.88e-01 8.98e-0
1f 1
9 1.6954233e+03 5.10e-04 6.26e-02 -1.7 6.76e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5627878e+03 1.96e-03 2.19e-01 -2.5 1.25e+01 - 7.43e-01 1.00e+0
0f 1
11 1.5309769e+03 3.67e-03 1.04e-01 -2.5 2.12e+00 - 1.00e+00 9.19e-0
1h 1
12 1.5388648e+03 1.31e-04 3.49e-03 -2.5 1.16e+00 - 1.00e+00 1.00e+0
0h 1
13 1.5037418e+03 1.63e-04 2.17e-02 -3.8 1.88e+01 - 9.93e-01 9.32e-0
1h 1
14 1.5022722e+03 7.65e-07 7.15e-05 -3.8 1.24e+00 - 1.00e+00 1.00e+0
0f 1
15 1.5003196e+03 3.77e-07 1.78e-04 -5.7 1.04e+00 - 1.00e+00 9.96e-0
1h 1
16 1.5003172e+03 3.80e-11 2.94e-09 -5.7 1.11e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.29e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5002932821276131e+00 1.5002932821276131e+0
3
Dual infeasibility......: 2.1737074159026791e-09 2.1737074159026791e-0
6
Constraint violation....: 6.2995414440436548e-11 6.2995414440436548e-1
1
Complementarity.........: 2.8882173926692563e-09 2.8882173926692561e-0
6
Overall NLP error.......: 2.8882173926692563e-09 2.8882173926692561e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.78e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5000575e+02 7.50e+01 9.04e+01 -1.0 2.59e+01 - 3.83e-04 3.52e-0
2f 1
2 1.1818546e+04 5.63e-02 8.12e+01 -1.0 2.87e+01 - 4.64e-02 1.00e+0
0h 1
3 3.1583161e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.65e-0
2f 1
4 1.0154149e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8164779e+03 7.28e-03 1.55e+01 -1.0 1.92e+01 - 6.10e-01 1.00e+0
0h 1
6 1.1189268e+03 5.40e-03 4.04e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8232674e+02 9.97e-04 2.09e-01 -1.7 5.71e+00 - 1.00e+00 8.88e-0
1h 1
8 7.2806667e+02 8.48e-04 1.34e-02 -1.7 3.45e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0978200e+02 1.50e-03 1.13e-01 -3.8 4.49e+00 - 7.71e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8216668e+02 2.17e-03 7.27e-02 -3.8 2.11e+00 - 8.07e-01 7.39e-0
1h 1
11 5.8336969e+02 9.23e-05 4.64e-02 -3.8 3.15e-02 - 1.00e+00 9.57e-0
1h 1
12 5.8368715e+02 2.81e-07 1.30e-05 -3.8 3.37e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278926e+02 4.12e-07 5.35e-04 -5.7 3.47e-02 - 1.00e+00 9.91e-0
1h 1
14 5.8278859e+02 4.35e-11 3.51e-09 -5.7 2.16e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.65e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753111869779e-01 5.8277753111869777e+0
2
Dual infeasibility......: 2.6458545608102267e-09 2.6458545608102267e-0
6
Constraint violation....: 6.3002311700977032e-11 6.3002311700977032e-1
1
Complementarity.........: 2.8882674692974132e-09 2.8882674692974132e-0
6
Overall NLP error.......: 2.8882674692974132e-09 2.8882674692974132e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1582576e+02 1.09e+02 1.13e+02 -1.0 3.76e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1398370e+04 5.38e-02 8.36e+01 -1.0 4.53e+01 - 3.10e-02 1.00e+0
0h 1
3 2.7845901e+03 5.17e-02 6.49e+01 -1.0 8.43e+01 - 2.27e-01 4.32e-0
2f 1
4 9.8152882e+02 4.24e-02 3.38e+01 -1.0 3.41e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5906778e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.22e-01 1.00e+0
0h 1
6 9.4490441e+02 1.01e-02 8.72e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6264654e+02 4.59e-04 6.60e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536437e+02 1.94e-03 1.94e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379715e+02 3.25e-03 6.12e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140238e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388159e+02 1.57e-04 1.69e-02 -3.8 7.57e-01 - 9.93e-01 9.41e-0
1h 1
12 5.8370191e+02 7.28e-07 6.65e-05 -3.8 8.62e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278679e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.06e-09 -5.7 3.40e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148938205e-01 5.8277753148938200e+0
2
Dual infeasibility......: 2.0880117295534732e-09 2.0880117295534732e-0
6
Constraint violation....: 6.2994137683958229e-11 6.2994137683958229e-1
1
Complementarity.........: 2.8882094420456233e-09 2.8882094420456232e-0
6
Overall NLP error.......: 2.8882094420456233e-09 2.8882094420456232e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.78e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5000575e+02 7.50e+01 9.04e+01 -1.0 2.59e+01 - 3.83e-04 3.52e-0
2f 1
2 1.1818546e+04 5.63e-02 8.12e+01 -1.0 2.87e+01 - 4.64e-02 1.00e+0
0h 1
3 3.1583161e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.65e-0
2f 1
4 1.0154149e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8164779e+03 7.28e-03 1.55e+01 -1.0 1.92e+01 - 6.10e-01 1.00e+0
0h 1
6 1.1189268e+03 5.40e-03 4.04e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8232674e+02 9.97e-04 2.09e-01 -1.7 5.71e+00 - 1.00e+00 8.88e-0
1h 1
8 7.2806667e+02 8.48e-04 1.34e-02 -1.7 3.45e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0978200e+02 1.50e-03 1.13e-01 -3.8 4.49e+00 - 7.71e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8216668e+02 2.17e-03 7.27e-02 -3.8 2.11e+00 - 8.07e-01 7.39e-0
1h 1
11 5.8336969e+02 9.23e-05 4.64e-02 -3.8 3.15e-02 - 1.00e+00 9.57e-0
1h 1
12 5.8368715e+02 2.81e-07 1.30e-05 -3.8 3.37e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278926e+02 4.12e-07 5.35e-04 -5.7 3.47e-02 - 1.00e+00 9.91e-0
1h 1
14 5.8278859e+02 4.35e-11 3.51e-09 -5.7 2.16e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.65e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753111869779e-01 5.8277753111869777e+0
2
Dual infeasibility......: 2.6458545608102267e-09 2.6458545608102267e-0
6
Constraint violation....: 6.3002311700977032e-11 6.3002311700977032e-1
1
Complementarity.........: 2.8882674692974132e-09 2.8882674692974132e-0
6
Overall NLP error.......: 2.8882674692974132e-09 2.8882674692974132e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.28e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9792022e+02 4.09e+01 5.94e+01 -1.0 1.43e+01 - 6.99e-04 4.23e-0
2f 1
2 1.2226208e+04 6.07e-02 7.87e+01 -1.0 1.80e+01 - 7.07e-02 1.00e+0
0h 1
3 3.6198120e+03 5.54e-02 5.15e+01 -1.0 5.46e+01 - 3.33e-01 7.86e-0
2f 1
4 2.3518136e+03 2.93e-02 2.28e+01 -1.0 2.71e+01 - 5.45e-01 4.46e-0
1f 1
5 1.7557842e+03 8.50e-03 1.17e+00 -1.0 9.97e+00 - 9.27e-01 7.68e-0
1f 1
6 2.0288429e+03 3.41e-04 8.15e-02 -1.0 3.36e+00 - 1.00e+00 1.00e+0
0h 1
7 1.4017677e+03 2.08e-03 8.13e-02 -2.5 4.88e+00 - 8.66e-01 8.50e-0
1f 1
8 1.2221186e+03 2.16e-03 2.04e-01 -2.5 1.05e+00 - 1.00e+00 8.34e-0
1f 1
9 1.2056881e+03 8.29e-05 3.94e-03 -2.5 1.47e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1964862e+03 4.50e-05 1.20e+00 -3.8 9.56e-02 - 1.00e+00 4.86e-0
1h 1
11 1.1944260e+03 3.81e-07 1.16e-01 -3.8 4.16e-02 - 9.65e-01 1.00e+0
0f 1
12 1.1933751e+03 2.37e-08 2.01e-03 -3.8 3.32e-02 - 1.00e+00 1.00e+0
0H 1
13 1.1935802e+03 1.35e-05 3.08e-04 -3.8 4.28e-03 - 1.00e+00 1.00e+0
0f 1
14 1.1929524e+03 2.10e-06 6.04e-02 -5.7 1.24e-02 - 7.79e-01 9.70e-0
1h 1
15 1.1927877e+03 1.23e-05 2.01e-04 -5.7 5.02e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1927934e+03 2.14e-08 1.78e-06 -5.7 2.27e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1927802e+03 2.61e-08 2.54e-06 -8.6 2.38e-04 - 9.83e-01 9.85e-0
1h 1
18 1.1927801e+03 4.57e-13 3.48e-11 -8.6 2.60e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1927800689111827e+00 1.1927800689111828e+0
3
Dual infeasibility......: 3.4834173230817482e-11 3.4834173230817482e-0
8
Constraint violation....: 4.5685677463325192e-13 4.5685677463325192e-1
3
Complementarity.........: 2.5123551817531918e-09 2.5123551817531917e-0
6
Overall NLP error.......: 2.5123551817531918e-09 2.5123551817531917e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 40
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 20
inequality constraints with only lower bounds: 11
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2226548e+02 9.17e+02 5.24e+01 -1.0 9.19e+02 - 3.31e-04 9.89e-0
3h 1
2 7.9567419e+02 9.17e+02 5.24e+01 -1.0 8.24e+02 - 1.08e-04 9.71e-0
4h 1
3 2.4325600e+02 8.97e+02 5.26e+01 -1.0 9.17e+02 - 9.56e-04 2.09e-0
2h 1
4 1.2231736e+04 5.55e-02 8.38e+01 -1.0 8.98e+02 - 2.32e-02 1.00e+0
0h 1
5 3.9591307e+03 5.36e-02 6.86e+01 -1.0 8.19e+01 - 1.86e-01 3.68e-0
2f 1
6 1.9812308e+03 4.37e-02 3.67e+01 -1.0 3.39e+01 - 4.72e-01 5.47e-0
1f 1
7 2.6523735e+03 1.86e-02 2.12e+01 -1.0 1.93e+01 - 3.72e-01 2.50e-0
1f 3
8 1.9462783e+03 7.68e-03 4.04e-01 -1.0 1.01e+01 - 9.83e-01 1.00e+0
0f 1
9 1.6820695e+03 1.34e-03 2.81e-01 -1.7 4.79e+00 - 1.00e+00 8.75e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7931170e+03 9.77e-04 8.17e-02 -1.7 1.58e+02 - 7.91e-01 1.00e+0
0f 1
11 1.5481450e+03 1.17e-03 5.34e-02 -2.5 1.44e+02 - 9.17e-01 1.00e+0
0f 1
12 1.5344629e+03 1.25e-03 1.57e-02 -2.5 2.88e+00 - 1.00e+00 1.00e+0
0h 1
13 1.5062942e+03 2.21e-04 1.06e-01 -3.8 1.95e+01 - 1.00e+00 8.34e-0
1h 1
14 1.5022677e+03 5.56e-07 1.36e-04 -3.8 2.93e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5003178e+03 4.00e-07 1.64e-04 -5.7 1.04e+00 - 1.00e+00 9.97e-0
1h 1
16 1.5003172e+03 3.89e-11 2.95e-09 -5.7 4.62e-02 - 1.00e+00 1.00e+0
0f 1
17 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.29e-02 - 1.00e+00 1.00e+0
0h 1
1 8.6492449e+02 9.17e+02 5.24e+01 -1.0 9.19e+02 - 4.97e-04 9.89e-0
3h 1
2 8.3429719e+02 9.16e+02 5.24e+01 -1.0 8.37e+02 - 1.07e-04 1.13e-0
3h 1
3 2.6334808e+02 8.96e+02 5.25e+01 -1.0 9.16e+02 - 1.12e-03 2.18e-0
2h 1
4 1.2547951e+04 6.03e-02 8.25e+01 -1.0 8.97e+02 - 2.44e-02 1.00e+0
0h 1
5 4.4093479e+03 5.78e-02 6.61e+01 -1.0 6.99e+01 - 2.02e-01 3.77e-0
2f 1
6 2.4528855e+03 3.38e-02 3.55e+01 -1.0 3.12e+01 - 4.78e-01 6.14e-0
1f 1
43 1.302313e+04 1.632511e+04 4.039577e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6793774e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.80e-0
3h 1
2 7.6493631e+02 1.57e+04 5.25e+01 -1.0 1.38e+04 - 2.51e-05 1.13e-0
4h 1
3 7.6201559e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 1.75e-05 2.31e-0
4h 1
4 7.5913953e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 2.46e-04 2.33e-0
4h 1
5 5.2270445e+02 1.54e+04 8.06e+01 -1.0 1.57e+04 - 5.00e-04 2.00e-0
2f 1
6 2.6744706e+04 6.09e-02 8.48e+01 -1.0 1.54e+04 - 2.95e-02 1.00e+0
0h 1
7 1.8271059e+04 5.85e-02 6.73e+01 -1.0 7.91e+01 - 2.11e-01 4.28e-0
2f 1
8 1.6691729e+04 4.49e-02 3.34e+01 -1.0 2.87e+01 - 5.00e-01 4.36e-0
1f 1
9 1.6987434e+04 3.07e-02 1.34e+01 -1.0 1.62e+01 - 4.67e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6780505e+04 5.30e-03 3.69e+00 -1.0 3.74e+00 - 7.96e-01 1.00e+0
0h 1
11 1.6827276e+04 3.00e-04 2.05e+00 -1.0 1.52e+00 - 3.06e-01 1.00e+0
0f 1
12 1.6826831e+04 1.13e-05 5.39e-01 -1.0 1.31e+00 - 7.32e-01 1.00e+0
0f 1
13 1.6529866e+04 2.25e-04 2.99e-01 -1.7 4.85e+00 - 8.63e-01 7.80e-0
1f 1
14 1.6477834e+04 5.58e-04 3.56e-01 -1.7 6.19e+00 - 5.97e-01 1.00e+0
0f 1
15 1.6476673e+04 7.37e-05 7.66e-02 -1.7 1.18e+01 - 6.91e-01 1.00e+0
0h 1
16 1.6369390e+04 9.61e-04 5.28e-02 -2.5 1.08e+01 - 9.22e-01 1.00e+0
0f 1
17 1.6345101e+04 1.15e-03 1.24e-02 -2.5 5.04e+00 - 1.00e+00 1.00e+0
0h 1
18 1.6327854e+04 1.95e-04 8.80e-02 -3.8 5.93e+00 - 1.00e+00 8.51e-0
1h 1
19 1.6326251e+04 6.27e-07 1.05e-04 -3.8 6.60e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325264e+04 3.82e-07 7.29e-03 -5.7 2.61e-01 - 1.00e+00 8.35e-0
1h 1
21 1.6325119e+04 1.09e-08 3.69e-07 -5.7 5.61e-03 - 1.00e+00 1.00e+0
0f 1
22 1.6325105e+04 1.11e-10 2.78e-06 -8.6 2.26e-03 - 1.00e+00 9.96e-0
1h 1
23 1.6325105e+04 3.55e-15 4.21e-14 -8.6 1.04e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 23
(scaled) (unscaled)
Objective...............: 1.6325105261433347e+01 1.6325105261433346e+0
4
Dual infeasibility......: 4.2088510463131381e-14 4.2088510463131381e-1
1
Constraint violation....: 3.5527136788005009e-15 3.5527136788005009e-1
5
Complementarity.........: 2.5060261427973119e-09 2.5060261427973117e-0
6
Overall NLP error.......: 2.5060261427973119e-09 2.5060261427973117e-0
6
Number of objective function evaluations = 27
Number of objective gradient evaluations = 24
Number of equality constraint evaluations = 27
Number of inequality constraint evaluations = 27
Number of equality constraint Jacobian evaluations = 24
Number of inequality constraint Jacobian evaluations = 24
Number of Lagrangian Hessian evaluations = 23
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6808319e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.29e-04 9.80e-0
3f 1
2 7.6514459e+02 1.50e+04 5.25e+01 -1.0 1.37e+04 - 3.27e-05 1.08e-0
4h 1
3 7.6348756e+02 1.50e+04 5.25e+01 -1.0 1.49e+04 - 1.16e-05 1.23e-0
4h 1
4 7.5792522e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 1.32e-04 4.21e-0
4h 1
5 5.0668660e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 5.60e-04 1.99e-0
2f 1
6 2.6009628e+04 6.08e-02 8.48e+01 -1.0 1.47e+04 - 2.95e-02 1.00e+0
0h 1
7 1.7507562e+04 5.84e-02 6.74e+01 -1.0 7.94e+01 - 2.10e-01 4.28e-0
2f 1
8 1.5926024e+04 4.49e-02 3.34e+01 -1.0 2.87e+01 - 5.00e-01 4.36e-0
1f 1
9 1.6222111e+04 3.06e-02 1.35e+01 -1.0 1.62e+01 - 4.67e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6014669e+04 5.30e-03 1.65e-01 -1.0 3.74e+00 - 9.91e-01 1.00e+0
0h 1
11 1.5731816e+04 1.04e-03 2.43e-01 -1.7 4.85e+00 - 1.00e+00 8.80e-0
1f 1
12 1.5729623e+04 7.55e-04 5.51e-02 -1.7 3.73e+01 - 7.87e-01 1.00e+0
0f 1
13 1.5594930e+04 1.08e-03 4.62e-02 -2.5 3.75e+01 - 9.26e-01 1.00e+0
0f 1
14 1.5579108e+04 1.09e-03 1.31e-02 -2.5 1.30e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5562217e+04 1.85e-04 8.91e-02 -3.8 5.44e+00 - 1.00e+00 8.50e-0
1h 1
16 1.5560429e+04 7.74e-07 1.13e-04 -3.8 7.83e-01 - 1.00e+00 1.00e+0
0h 1
17 1.5559215e+04 3.97e-07 1.14e-04 -5.7 2.97e-01 - 1.00e+00 9.97e-0
1h 1
18 1.5559217e+04 3.84e-11 3.03e-09 -5.7 9.23e-03 - 1.00e+00 1.00e+0
0f 1
19 1.5559202e+04 6.30e-11 2.07e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.5559202141405686e+01 1.5559202141405685e+0
4
Dual infeasibility......: 2.0695850591153241e-09 2.0695850591153241e-0
6
Constraint violation....: 6.2993457672355646e-11 6.2993457672355646e-1
1
Complementarity.........: 2.8882111549582491e-09 2.8882111549582490e-0
6
Overall NLP error.......: 2.8882111549582491e-09 2.8882111549582490e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.7387317e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 5.44e-04 9.80e-0
3h 1
2 8.7105145e+02 1.39e+04 5.24e+01 -1.0 1.32e+04 - 4.40e-05 1.04e-0
4h 1
3 8.6912348e+02 1.39e+04 5.24e+01 -1.0 1.38e+04 - 7.40e-06 1.39e-0
4h 1
4 8.6676010e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 1.44e-04 1.72e-0
4h 1
5 5.6175987e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 3.25e-04 2.25e-0
2f 1
6 2.5930848e+04 6.04e-02 7.97e+01 -1.0 1.36e+04 - 5.25e-02 1.00e+0
0h 1
7 1.7354355e+04 5.63e-02 5.35e+01 -1.0 6.97e+01 - 3.17e-01 6.19e-0
2f 1
8 1.5900515e+04 3.11e-02 2.72e+01 -1.0 3.59e+01 - 4.83e-01 4.18e-0
1f 1
9 1.5515693e+04 1.48e-02 2.68e+00 -1.0 1.11e+01 - 9.18e-01 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5363662e+04 7.79e-03 1.70e+00 -1.0 6.90e+00 - 9.96e-01 4.67e-0
1f 2
11 1.5500890e+04 5.43e-04 6.11e-02 -1.0 1.21e+02 - 1.00e+00 1.00e+0
0f 1
12 1.4962355e+04 6.62e-04 6.66e-01 -2.5 1.34e+02 - 9.02e-01 6.54e-0
1f 1
13 1.4876437e+04 5.99e-05 1.22e-01 -2.5 3.33e+01 - 9.71e-01 1.00e+0
0h 1
14 1.4857840e+04 1.70e-03 7.45e-03 -2.5 2.60e+00 - 1.00e+00 1.00e+0
0f 1
15 1.4844213e+04 4.11e-04 3.50e-02 -3.8 2.80e+00 - 8.51e-01 1.00e+0
0h 1
16 1.4841680e+04 1.57e-03 9.27e-04 -3.8 3.72e-02 - 1.00e+00 1.00e+0
0h 1
17 1.4841853e+04 4.98e-05 4.93e-05 -3.8 1.13e-02 - 1.00e+00 1.00e+0
0h 1
18 1.4840591e+04 1.23e-04 5.59e-04 -5.7 1.49e-01 - 9.38e-01 1.00e+0
0h 1
19 1.4840559e+04 1.49e-05 2.48e-05 -5.7 5.53e-03 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.4840563e+04 1.06e-09 7.19e-07 -5.7 7.67e-05 - 1.00e+00 1.00e+0
0h 1
21 1.4840549e+04 1.66e-08 3.18e-04 -8.6 1.84e-03 - 1.00e+00 8.99e-0
1h 1
22 1.4840548e+04 3.26e-11 4.62e-09 -8.6 1.87e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.4840548042172863e+01 1.4840548042172863e+0
4
Dual infeasibility......: 4.6187454456323753e-09 4.6187454456323752e-0
6
Constraint violation....: 3.2629232649128426e-11 3.2629232649128426e-1
1
Complementarity.........: 2.8208194330214153e-09 2.8208194330214154e-0
6
Overall NLP error.......: 4.6187454456323753e-09 4.6187454456323752e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8072093e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.97e-04 9.80e-0
3h 1
2 8.7779316e+02 1.27e+04 5.24e+01 -1.0 1.12e+04 - 2.87e-05 1.11e-0
4h 1
3 8.7415405e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 1.55e-05 2.42e-0
4h 1
4 8.6012945e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 2.54e-04 9.44e-0
4h 1
5 5.4533198e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 1.25e-03 2.22e-0
2f 1
6 2.4272962e+04 6.24e-02 7.94e+01 -1.0 1.24e+04 - 5.85e-02 1.00e+0
0h 1
7 1.6138570e+04 5.78e-02 5.12e+01 -1.0 6.24e+01 - 3.42e-01 6.80e-0
2f 1
8 1.4780216e+04 3.11e-02 2.44e+01 -1.0 3.17e+01 - 5.12e-01 4.26e-0
1f 1
9 1.4049515e+04 1.02e-02 1.85e+00 -1.0 1.09e+01 - 9.21e-01 8.97e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4441950e+04 2.84e-04 5.77e-02 -1.0 4.69e+00 - 9.79e-01 1.00e+0
0f 1
11 1.3752154e+04 1.37e-03 7.96e-02 -2.5 6.38e+00 - 8.73e-01 8.41e-0
1f 1
12 1.3729632e+04 1.41e-05 1.70e-02 -2.5 1.90e+00 - 1.00e+00 1.00e+0
0h 1
13 1.3696040e+04 1.24e-03 3.79e-02 -3.8 5.16e+00 - 7.04e-01 1.00e+0
0f 1
14 1.3694097e+04 9.92e-04 1.67e-03 -3.8 7.39e-02 - 9.47e-01 1.00e+0
0h 1
15 1.3694240e+04 1.22e-04 1.30e-04 -3.8 1.59e-02 - 1.00e+00 1.00e+0
0h 1
16 1.3692881e+04 1.40e-04 1.17e-03 -5.7 2.98e-01 - 9.15e-01 1.00e+0
0h 1
17 1.3692837e+04 3.59e-05 7.68e-06 -5.7 8.83e-03 - 1.00e+00 1.00e+0
0h 1
18 1.3692841e+04 4.68e-07 4.85e-06 -5.7 9.89e-04 - 1.00e+00 1.00e+0
0h 1
19 1.3692826e+04 3.80e-08 4.98e-05 -8.6 3.68e-03 - 1.00e+00 9.48e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.3692826e+04 6.79e-12 6.83e-11 -8.6 1.93e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.3692825523726087e+01 1.3692825523726087e+0
4
Dual infeasibility......: 6.8264955573520898e-11 6.8264955573520905e-0
8
Constraint violation....: 6.7936767322862579e-12 6.7936767322862579e-1
2
Complementarity.........: 2.6154780613423212e-09 2.6154780613423213e-0
6
Overall NLP error.......: 2.6154780613423212e-09 2.6154780613423213e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2301164e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.51e-03 9.80e-0
3h 1
2 9.1989531e+02 1.11e+04 5.23e+01 -1.0 9.02e+03 - 1.92e-05 1.22e-0
4h 1
3 5.4989497e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 2.65e-05 2.25e-0
2h 1
4 2.1102445e+04 7.45e-02 7.98e+01 -1.0 1.09e+04 - 2.67e-02 1.00e+0
0h 1
5 1.5432121e+04 7.15e-02 5.55e+01 -1.0 2.13e+01 - 2.97e-01 3.84e-0
2f 1
6 1.4303811e+04 1.35e-02 2.41e+01 -1.0 1.11e+01 - 5.91e-01 7.46e-0
1f 1
7 1.4153595e+04 8.15e-03 2.49e-01 -1.0 1.97e+00 - 9.90e-01 1.00e+0
0f 1
8 1.3803441e+04 1.55e-03 4.72e-01 -1.7 4.96e+00 - 7.38e-01 1.00e+0
0f 1
9 1.3791151e+04 5.26e-04 8.98e-01 -1.7 1.40e+01 - 5.12e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3797125e+04 1.40e-05 1.70e-01 -1.7 1.68e+01 - 7.53e-01 1.00e+0
0h 1
11 1.3640522e+04 4.26e-04 2.08e-02 -2.5 2.06e+01 - 9.66e-01 9.39e-0
1f 1
12 1.3610641e+04 1.41e-04 1.97e-01 -3.8 1.63e+01 - 9.85e-01 7.19e-0
1h 1
13 1.3601754e+04 4.20e-07 3.21e-04 -3.8 4.76e+00 - 1.00e+00 1.00e+0
0h 1
14 1.3600269e+04 2.00e-08 4.30e-06 -5.7 4.47e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3600252e+04 8.22e-13 4.91e-10 -8.6 5.52e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.3600252138225267e+01 1.3600252138225267e+0
4
Dual infeasibility......: 4.9132480220257538e-10 4.9132480220257538e-0
7
Constraint violation....: 8.2205076079588935e-13 8.2205076079588935e-1
3
Complementarity.........: 4.0446631266305166e-09 4.0446631266305168e-0
6
Overall NLP error.......: 4.0446631266305166e-09 4.0446631266305168e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891076e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0602418e+02 9.19e+03 5.23e+01 -1.0 8.41e+03 - 3.92e-05 1.08e-0
4h 1
3 8.1828314e+02 9.14e+03 5.24e+01 -1.0 9.19e+03 - 1.24e-05 4.81e-0
3h 1
4 5.0911018e+02 8.95e+03 5.22e+01 -1.0 9.14e+03 - 5.53e-03 2.13e-0
2h 1
5 1.9574027e+04 7.15e-02 7.74e+01 -1.0 8.95e+03 - 8.67e-02 1.00e+0
0h 1
6 1.2972291e+04 6.39e-02 3.14e+01 -1.0 2.60e+01 - 5.69e-01 9.74e-0
2f 1
7 1.1456842e+04 1.98e-02 1.02e+01 -1.0 1.50e+01 - 6.92e-01 7.89e-0
1f 1
8 1.1617387e+04 7.35e-03 8.73e-01 -1.0 3.38e+00 - 9.93e-01 5.00e-0
1f 2
9 1.1302779e+04 1.11e-02 1.99e-01 -1.7 1.07e+01 - 9.43e-01 8.28e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1138659e+04 4.06e-03 2.89e-01 -2.5 3.23e+00 - 8.36e-01 7.16e-0
1h 1
11 1.1106841e+04 5.95e-04 1.16e-02 -2.5 1.38e+00 - 1.00e+00 1.00e+0
0h 1
12 1.1090529e+04 1.79e-04 2.37e-01 -3.8 5.39e+00 - 1.00e+00 7.01e-0
1h 1
13 1.1084707e+04 3.93e-07 7.51e-04 -3.8 1.61e+00 - 1.00e+00 1.00e+0
0f 1
14 1.1083335e+04 2.49e-08 4.89e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
15 1.1083321e+04 6.81e-13 2.06e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.1083320748092566e+01 1.1083320748092567e+0
4
Dual infeasibility......: 2.0579054404220109e-09 2.0579054404220109e-0
6
Constraint violation....: 6.8087202542699288e-13 6.8087202542699288e-1
3
Complementarity.........: 3.0108726187744327e-09 3.0108726187744327e-0
6
Overall NLP error.......: 3.0108726187744327e-09 3.0108726187744327e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891119e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0611351e+02 6.71e+03 5.23e+01 -1.0 6.46e+03 - 8.39e-05 1.03e-0
4h 1
3 8.7440044e+02 6.70e+03 5.23e+01 -1.0 6.70e+03 - 6.84e-06 1.53e-0
3f 1
4 4.2534165e+02 6.54e+03 5.24e+01 -1.0 6.70e+03 - 1.83e-03 2.26e-0
2h 1
5 1.8469067e+04 6.74e-02 7.67e+01 -1.0 6.54e+03 - 8.35e-02 1.00e+0
0h 1
6 1.0609292e+04 6.07e-02 3.68e+01 -1.0 2.85e+01 - 4.94e-01 9.10e-0
2f 1
7 9.1070968e+03 1.97e-02 1.46e+01 -1.0 1.53e+01 - 6.26e-01 7.49e-0
1f 1
8 9.1804482e+03 5.62e-03 1.19e+00 -1.0 2.08e+00 - 9.93e-01 5.00e-0
1f 2
9 9.3751841e+03 2.91e-04 6.67e-02 -1.0 2.88e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.8198147e+03 2.22e-03 9.09e-02 -2.5 2.66e+01 - 8.56e-01 8.23e-0
1f 1
11 8.6513288e+03 2.12e-03 4.55e-01 -2.5 4.37e+00 - 1.00e+00 7.50e-0
1f 1
12 8.6223061e+03 1.56e-04 4.78e-03 -2.5 1.09e+00 - 1.00e+00 1.00e+0
0h 1
13 8.6058823e+03 4.18e-05 1.61e-01 -3.8 2.68e+00 - 1.00e+00 7.51e-0
1h 1
14 8.6015687e+03 1.44e-07 3.57e-04 -3.8 6.67e-01 - 1.00e+00 1.00e+0
0f 1
15 8.6003430e+03 2.79e-08 9.26e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 8.6003307e+03 1.87e-12 1.33e-08 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
17 8.6003159e+03 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 8.6003159271626899e+00 8.6003159271626901e+0
3
Dual infeasibility......: 4.4776951234137600e-09 4.4776951234137600e-0
6
Constraint violation....: 2.6306803957432123e-12 2.6306803957432123e-1
2
Complementarity.........: 3.6085002105663805e-09 3.6085002105663804e-0
6
Overall NLP error.......: 4.4776951234137600e-09 4.4776951234137600e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0882880e+02 4.77e+03 5.23e+01 -1.0 4.81e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0434947e+02 4.77e+03 5.23e+01 -1.0 2.68e+03 - 2.39e-05 1.77e-0
4h 1
3 3.7454299e+02 4.66e+03 5.24e+01 -1.0 4.77e+03 - 8.76e-05 2.34e-0
2f 1
4 1.7328207e+04 6.52e-02 8.01e+01 -1.0 4.66e+03 - 3.59e-02 1.00e+0
0h 1
5 8.8756218e+03 6.18e-02 5.99e+01 -1.0 3.67e+01 - 2.49e-01 4.75e-0
2f 1
6 7.5823595e+03 1.99e-02 2.80e+01 -1.0 1.63e+01 - 5.44e-01 6.25e-0
1f 1
7 7.1823255e+03 5.26e-03 8.31e-01 -1.0 5.07e+00 - 9.59e-01 7.94e-0
1f 1
8 7.4507207e+03 1.50e-04 6.10e-02 -1.0 5.80e+00 - 1.00e+00 1.00e+0
0f 1
9 6.8804600e+03 2.15e-03 8.62e-02 -2.5 5.25e+00 - 8.55e-01 8.54e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.7212292e+03 2.16e-03 4.08e-01 -2.5 9.22e-01 - 1.00e+00 7.65e-0
1f 1
11 6.6966339e+03 1.20e-04 4.68e-03 -2.5 2.02e-01 - 1.00e+00 1.00e+0
0h 1
12 6.6735647e+03 3.19e-05 1.43e-01 -3.8 1.07e+01 - 1.00e+00 7.63e-0
1h 1
13 6.6675769e+03 1.22e-07 3.35e-04 -3.8 2.53e+00 - 1.00e+00 1.00e+0
0f 1
14 6.6659095e+03 2.86e-08 1.00e-03 -5.7 5.94e-01 - 1.00e+00 9.85e-0
1f 1
15 6.6658896e+03 1.94e-12 1.40e-08 -5.7 8.99e-03 - 1.00e+00 1.00e+0
0f 1
16 6.6658693e+03 2.63e-12 4.48e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.6658693411771859e+00 6.6658693411771856e+0
3
Dual infeasibility......: 4.4776955398007574e-09 4.4776955398007574e-0
6
Constraint violation....: 2.6309093792420413e-12 2.6309093792420413e-1
2
Complementarity.........: 3.7464293971233567e-09 3.7464293971233564e-0
6
Overall NLP error.......: 4.4776955398007574e-09 4.4776955398007574e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6647742e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 4.97e-04 9.81e-0
3h 1
2 8.6258607e+02 3.24e+03 5.24e+01 -1.0 2.21e+03 - 3.91e-05 1.45e-0
4h 1
3 3.1400433e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 5.82e-05 2.24e-0
2f 1
4 1.5420372e+04 5.91e-02 8.12e+01 -1.0 3.17e+03 - 3.49e-02 1.00e+0
0h 1
5 6.7290069e+03 5.61e-02 6.00e+01 -1.0 7.11e+01 - 2.59e-01 4.63e-0
2f 1
6 4.9141782e+03 2.50e-02 3.24e+01 -1.0 3.47e+01 - 4.68e-01 5.32e-0
1f 1
7 4.4464852e+03 1.14e-02 2.56e+00 -1.0 9.40e+00 - 9.28e-01 1.00e+0
0f 1
8 4.7445322e+03 5.19e-04 7.24e-02 -1.0 2.72e+00 - 9.99e-01 1.00e+0
0f 1
9 4.1968145e+03 5.77e-04 4.24e-01 -2.5 7.14e+00 - 8.93e-01 7.24e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.1292536e+03 1.97e-04 2.34e-01 -2.5 2.25e+00 - 9.13e-01 1.00e+0
0h 1
11 4.1116445e+03 2.84e-04 9.33e-02 -2.5 9.70e-01 - 1.00e+00 7.64e-0
1H 1
12 4.1091625e+03 3.40e-04 1.77e-03 -2.5 1.24e-01 - 1.00e+00 1.00e+0
0f 1
13 4.0879671e+03 1.22e-03 3.19e-02 -3.8 8.05e+00 - 7.96e-01 1.00e+0
0h 1
14 4.0846007e+03 2.79e-03 1.11e-03 -3.8 4.90e-02 - 1.00e+00 1.00e+0
0h 1
15 4.0849547e+03 3.93e-05 1.31e-04 -3.8 1.35e-02 - 1.00e+00 1.00e+0
0h 1
16 4.0833586e+03 1.01e-04 3.52e-04 -5.7 4.46e-01 - 9.51e-01 9.77e-0
1h 1
17 4.0833414e+03 2.19e-05 3.67e-03 -5.7 1.03e-02 - 1.00e+00 7.83e-0
1h 1
18 4.0833430e+03 8.57e-09 1.21e-06 -5.7 2.23e-03 - 1.00e+00 1.00e+0
0f 1
19 4.0833247e+03 9.02e-09 1.92e-05 -8.6 5.53e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 4.0833244e+03 1.37e-12 6.48e-11 -8.6 9.17e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 4.0833243920575972e+00 4.0833243920575969e+0
3
Dual infeasibility......: 6.4813001593738018e-11 6.4813001593738018e-0
8
Constraint violation....: 1.3686829447578930e-12 1.3686829447578930e-1
2
Complementarity.........: 2.7257987120774816e-09 2.7257987120774817e-0
6
Overall NLP error.......: 2.7257987120774816e-09 2.7257987120774817e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8055761e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.81e-0
3f 1
2 8.7686981e+02 2.00e+03 5.24e+01 -1.0 1.46e+03 - 5.63e-05 1.36e-0
4h 1
3 2.9368501e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 5.20e-05 2.28e-0
2f 1
4 1.4297701e+04 6.09e-02 7.94e+01 -1.0 1.95e+03 - 5.25e-02 1.00e+0
0h 1
5 5.5715643e+03 5.67e-02 5.36e+01 -1.0 6.49e+01 - 3.13e-01 6.17e-0
2f 1
6 4.1854190e+03 3.04e-02 2.68e+01 -1.0 3.22e+01 - 4.92e-01 4.30e-0
1f 1
7 3.3694030e+03 1.34e-02 2.18e+00 -1.0 1.10e+01 - 9.20e-01 9.27e-0
1f 1
8 3.8356226e+03 4.21e-04 1.12e-01 -1.0 4.99e+00 - 1.00e+00 1.00e+0
0f 1
9 3.1540976e+03 1.17e-03 1.90e-01 -1.7 3.91e+01 - 8.96e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.1039979e+03 6.68e-04 2.39e+00 -2.5 3.66e+01 - 1.00e+00 4.32e-0
1h 1
11 3.0629871e+03 6.81e-05 1.87e-02 -2.5 2.04e+01 - 1.00e+00 1.00e+0
0f 1
12 3.0434419e+03 3.77e-04 8.59e-02 -3.8 5.37e+00 - 7.33e-01 1.00e+0
0h 1
13 3.0405582e+03 1.70e-03 2.23e-03 -3.8 3.80e-02 - 9.17e-01 1.00e+0
0h 1
14 3.0406292e+03 1.01e-04 8.20e-05 -3.8 1.33e-02 - 1.00e+00 1.00e+0
0h 1
15 3.0392726e+03 1.38e-04 1.16e-03 -5.7 2.97e-01 - 9.16e-01 1.00e+0
0h 1
16 3.0392287e+03 3.55e-05 7.59e-06 -5.7 8.78e-03 - 1.00e+00 1.00e+0
0h 1
17 3.0392338e+03 3.39e-07 4.46e-06 -5.7 8.41e-04 - 1.00e+00 1.00e+0
0h 1
18 3.0392191e+03 3.01e-08 4.42e-05 -8.6 3.68e-03 - 1.00e+00 9.51e-0
1h 1
19 3.0392184e+03 6.04e-12 6.09e-11 -8.6 1.82e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 3.0392183894780715e+00 3.0392183894780715e+0
3
Dual infeasibility......: 6.0876345417096781e-11 6.0876345417096787e-0
8
Constraint violation....: 6.0390581424485390e-12 6.0390581424485390e-1
2
Complementarity.........: 2.7879094807001909e-09 2.7879094807001910e-0
6
Overall NLP error.......: 2.7879094807001909e-09 2.7879094807001910e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 40
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 20
inequality constraints with only lower bounds: 11
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0758349e+02 9.17e+02 5.23e+01 -1.0 9.19e+02 - 1.00e-03 9.89e-0
3h 1
2 8.4617295e+02 9.15e+02 5.23e+01 -1.0 8.78e+02 - 1.02e-04 2.31e-0
3h 1
3 2.8751312e+02 8.95e+02 5.24e+01 -1.0 9.15e+02 - 2.28e-03 2.22e-0
2h 1
4 1.2486634e+04 6.79e-02 8.17e+01 -1.0 8.95e+02 - 2.60e-02 1.00e+0
0h 1
5 4.9765295e+03 6.50e-02 6.33e+01 -1.0 3.72e+01 - 2.27e-01 4.01e-0
2f 1
6 3.7336080e+03 2.08e-02 2.89e+01 -1.0 1.61e+01 - 5.52e-01 6.24e-0
1f 1
7 3.3250774e+03 5.40e-03 9.21e-01 -1.0 5.10e+00 - 9.59e-01 7.92e-0
1f 1
8 3.5944327e+03 1.44e-04 6.23e-02 -1.0 5.57e+00 - 9.90e-01 1.00e+0
0f 1
9 3.0323538e+03 2.13e-03 8.16e-02 -2.5 9.34e+00 - 8.55e-01 8.49e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8756363e+03 2.16e-03 4.16e-01 -2.5 5.72e+00 - 1.00e+00 7.62e-0
1f 1
11 2.8519411e+03 1.25e-04 4.71e-03 -2.5 1.99e+00 - 1.00e+00 1.00e+0
0h 1
12 2.8223355e+03 3.34e-05 1.46e-01 -3.8 1.94e+01 - 1.00e+00 7.61e-0
1h 1
13 2.8145157e+03 1.25e-07 3.39e-04 -3.8 4.33e+00 - 1.00e+00 1.00e+0
0f 1
14 2.8124146e+03 2.85e-08 9.87e-04 -5.7 1.03e+00 - 1.00e+00 9.85e-0
1f 1
15 2.8123895e+03 1.92e-12 1.39e-08 -5.7 1.43e-02 - 1.00e+00 1.00e+0
0f 1
16 2.8123637e+03 2.63e-12 4.48e-09 -8.6 1.29e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 2.8123637146526654e+00 2.8123637146526653e+0
3
Dual infeasibility......: 4.4776952428818280e-09 4.4776952428818280e-0
6
Constraint violation....: 2.6311175460591585e-12 2.6311175460591585e-1
2
Complementarity.........: 3.6084978995962125e-09 3.6084978995962125e-0
6
Overall NLP error.......: 4.4776952428818280e-09 4.4776952428818280e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254210146e-01 6.4890146254210140e+0
2
Dual infeasibility......: 4.9126604805803652e-09 4.9126604805803652e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646095252488380e-09 4.3646095252488382e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126604805803652e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031320943025915e-09 2.1031320943025915e-0
6
Constraint violation....: 6.2994179317321652e-11 6.2994179317321652e-1
1
Complementarity.........: 2.8882108896920311e-09 2.8882108896920312e-0
6
Overall NLP error.......: 2.8882108896920311e-09 2.8882108896920312e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254210146e-01 6.4890146254210140e+0
2
Dual infeasibility......: 4.9126604805803652e-09 4.9126604805803652e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646095252488380e-09 4.3646095252488382e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126604805803652e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.03e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 6.36e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643333e+00 1.6104063281643332e+0
3
Dual infeasibility......: 2.4574921368567062e-12 2.4574921368567062e-0
9
Constraint violation....: 6.3603173025546602e-15 6.3603173025546602e-1
5
Complementarity.........: 2.5062163910047551e-09 2.5062163910047549e-0
6
Overall NLP error.......: 2.5062163910047551e-09 2.5062163910047549e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2303872e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 3.31e-04 9.86e-0
3h 1
2 8.0919006e+02 9.17e+02 5.24e+01 -1.0 7.37e+02 - 8.12e-05 5.04e-0
4h 1
3 2.4239398e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 4.72e-04 2.11e-0
2f 1
4 1.2489447e+04 5.50e-02 8.23e+01 -1.0 8.98e+02 - 3.83e-02 1.00e+0
0h 1
5 3.8941148e+03 5.25e-02 5.67e+01 -1.0 8.14e+01 - 3.09e-01 4.98e-0
2f 1
6 1.9112633e+03 3.73e-02 3.04e+01 -1.0 3.92e+01 - 4.68e-01 5.06e-0
1f 1
7 4.6876227e+03 1.23e-02 2.71e+01 -1.0 2.07e+01 - 3.99e-01 1.00e+0
0h 1
8 1.8763004e+03 1.20e-02 1.04e+00 -1.0 2.56e+01 - 9.88e-01 8.91e-0
1f 1
9 1.9981274e+03 1.95e-04 4.76e-02 -1.0 2.98e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7321093e+03 2.19e-04 1.23e+00 -2.5 1.80e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5439398e+03 3.77e-03 1.33e-01 -2.5 7.59e+00 - 7.95e-01 1.00e+0
0f 1
12 1.5209204e+03 5.17e-03 3.09e-01 -2.5 1.82e+00 - 1.00e+00 7.67e-0
1h 1
13 1.5332321e+03 2.41e-04 4.72e-03 -2.5 7.16e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5031438e+03 1.70e-04 2.15e-02 -3.8 1.35e+01 - 9.90e-01 9.29e-0
1h 1
15 1.5019709e+03 7.24e-07 6.84e-05 -3.8 9.19e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003148e+03 3.77e-07 1.78e-04 -5.7 7.43e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.79e-11 2.92e-09 -5.7 4.20e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
1 8.6555952e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 4.97e-04 9.86e-0
3h 1
2 8.5049278e+02 9.17e+02 5.24e+01 -1.0 7.54e+02 - 7.94e-05 5.56e-0
4h 1
3 2.6243053e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 5.25e-04 2.21e-0
2h 1
4 1.2843590e+04 5.96e-02 8.01e+01 -1.0 8.97e+02 - 5.01e-02 1.00e+0
0h 1
5 4.2877637e+03 5.57e-02 5.36e+01 -1.0 7.35e+01 - 3.21e-01 5.99e-0
2f 1
44 1.573923e+04 1.632511e+04 4.099293e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6793774e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.80e-0
3h 1
2 7.6493627e+02 1.57e+04 5.25e+01 -1.0 1.38e+04 - 2.51e-05 1.13e-0
4h 1
3 7.6112920e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 1.74e-05 3.01e-0
4h 1
4 7.5768827e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 3.17e-04 2.81e-0
4h 1
5 5.2507101e+02 1.54e+04 6.10e+01 -1.0 1.57e+04 - 6.43e-04 2.00e-0
2f 1
6 2.6631790e+04 6.10e-02 8.48e+01 -1.0 1.54e+04 - 2.97e-02 1.00e+0
0h 1
7 1.8265306e+04 5.86e-02 6.69e+01 -1.0 7.81e+01 - 2.17e-01 4.31e-0
2f 1
8 1.6691510e+04 4.50e-02 3.30e+01 -1.0 2.87e+01 - 5.02e-01 4.35e-0
1f 1
9 1.6986144e+04 3.07e-02 1.32e+01 -1.0 1.61e+01 - 4.69e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6780778e+04 5.31e-03 3.64e+00 -1.0 3.76e+00 - 7.97e-01 1.00e+0
0h 1
11 1.6827230e+04 2.98e-04 2.01e+00 -1.0 1.54e+00 - 3.06e-01 1.00e+0
0f 1
12 1.6826857e+04 1.10e-05 5.35e-01 -1.0 1.34e+00 - 7.29e-01 1.00e+0
0f 1
13 1.6529880e+04 2.25e-04 2.96e-01 -1.7 4.85e+00 - 8.62e-01 7.80e-0
1f 1
14 1.6478082e+04 5.57e-04 3.60e-01 -1.7 6.33e+00 - 5.93e-01 1.00e+0
0f 1
15 1.6477273e+04 7.39e-05 7.95e-02 -1.7 1.21e+01 - 6.85e-01 1.00e+0
0h 1
16 1.6369576e+04 9.59e-04 5.32e-02 -2.5 1.13e+01 - 9.22e-01 1.00e+0
0f 1
17 1.6345120e+04 1.16e-03 1.25e-02 -2.5 5.16e+00 - 1.00e+00 1.00e+0
0h 1
18 1.6327811e+04 1.96e-04 8.82e-02 -3.8 6.01e+00 - 1.00e+00 8.50e-0
1h 1
19 1.6326251e+04 6.31e-07 1.05e-04 -3.8 6.15e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325264e+04 3.83e-07 7.30e-03 -5.7 2.61e-01 - 1.00e+00 8.34e-0
1h 1
21 1.6325119e+04 1.10e-08 3.70e-07 -5.7 5.62e-03 - 1.00e+00 1.00e+0
0f 1
22 1.6325105e+04 1.11e-10 2.79e-06 -8.6 2.26e-03 - 1.00e+00 9.96e-0
1h 1
23 1.6325105e+04 1.42e-14 4.25e-14 -8.6 1.79e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 23
(scaled) (unscaled)
Objective...............: 1.6325105261433350e+01 1.6325105261433349e+0
4
Dual infeasibility......: 4.2547000874211102e-14 4.2547000874211102e-1
1
Constraint violation....: 1.4210854715202004e-14 1.4210854715202004e-1
4
Complementarity.........: 2.5060279373012924e-09 2.5060279373012924e-0
6
Overall NLP error.......: 2.5060279373012924e-09 2.5060279373012924e-0
6
Number of objective function evaluations = 27
Number of objective gradient evaluations = 24
Number of equality constraint evaluations = 27
Number of inequality constraint evaluations = 27
Number of equality constraint Jacobian evaluations = 24
Number of inequality constraint Jacobian evaluations = 24
Number of Lagrangian Hessian evaluations = 23
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.1742626e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 3.14e-04 9.80e-0
3h 1
2 8.1450134e+02 1.50e+04 5.24e+01 -1.0 1.37e+04 - 3.17e-05 1.08e-0
4h 1
3 8.1274903e+02 1.50e+04 5.24e+01 -1.0 1.49e+04 - 1.19e-05 1.31e-0
4h 1
4 8.0686939e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 1.41e-04 4.48e-0
4h 1
5 5.4230685e+02 1.47e+04 5.26e+01 -1.0 1.50e+04 - 5.98e-04 2.09e-0
2f 1
6 2.6371073e+04 5.49e-02 8.27e+01 -1.0 1.47e+04 - 3.70e-02 1.00e+0
0h 1
7 1.7886512e+04 5.24e-02 5.79e+01 -1.0 8.06e+01 - 2.99e-01 4.88e-0
2f 1
8 1.5965302e+04 3.89e-02 3.07e+01 -1.0 3.79e+01 - 4.73e-01 4.95e-0
1f 1
9 1.6304397e+04 2.34e-02 1.41e+01 -1.0 1.99e+01 - 4.07e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6040021e+04 6.19e-03 3.04e-01 -1.0 5.31e+00 - 9.84e-01 1.00e+0
0h 1
11 1.5744253e+04 1.38e-03 3.59e-01 -1.7 5.09e+00 - 1.00e+00 8.40e-0
1f 1
12 1.5732640e+04 8.55e-04 1.31e-02 -1.7 3.94e+01 - 1.00e+00 1.00e+0
0f 1
13 1.5583598e+04 1.40e-03 9.51e-02 -3.8 4.36e+01 - 7.92e-01 9.30e-0
1f 1
14 1.5559899e+04 1.56e-03 7.52e-02 -3.8 1.70e+00 - 8.44e-01 7.60e-0
1h 1
15 1.5560308e+04 3.10e-06 8.08e-04 -3.8 2.83e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5559225e+04 2.95e-07 6.52e-04 -5.7 2.97e-01 - 1.00e+00 9.88e-0
1h 1
17 1.5559217e+04 3.77e-11 6.51e-09 -5.7 3.12e-01 - 1.00e+00 1.00e+0
0f 1
18 1.5559202e+04 6.30e-11 2.14e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5559202141401395e+01 1.5559202141401394e+0
4
Dual infeasibility......: 2.1392634903060452e-09 2.1392634903060452e-0
6
Constraint violation....: 6.2997440597456489e-11 6.2997440597456489e-1
1
Complementarity.........: 2.8881043152324277e-09 2.8881043152324276e-0
6
Overall NLP error.......: 2.8881043152324277e-09 2.8881043152324276e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9470199e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 7.46e-04 9.80e-0
3h 1
2 8.9189890e+02 1.39e+04 5.24e+01 -1.0 1.32e+04 - 4.13e-05 1.05e-0
4h 1
3 8.5451176e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 7.70e-06 2.75e-0
3h 1
4 5.9772233e+02 1.36e+04 5.24e+01 -1.0 1.39e+04 - 2.98e-03 2.17e-0
2h 1
5 2.5045310e+04 6.61e-02 7.79e+01 -1.0 1.36e+04 - 7.66e-02 1.00e+0
0h 1
6 1.7488640e+04 5.99e-02 4.43e+01 -1.0 4.66e+01 - 4.12e-01 8.55e-0
2f 1
7 1.6156900e+04 2.72e-02 1.74e+01 -1.0 2.19e+01 - 5.97e-01 5.28e-0
1f 1
8 1.5788286e+04 4.84e-03 1.02e+00 -1.0 7.52e+00 - 9.44e-01 7.47e-0
1f 1
9 1.6033476e+04 1.94e-04 6.58e-02 -1.0 5.30e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5447626e+04 2.15e-03 8.63e-02 -2.5 4.06e+00 - 8.62e-01 8.38e-0
1f 1
11 1.5275079e+04 2.15e-03 3.50e-01 -2.5 9.33e-01 - 1.00e+00 7.78e-0
1f 1
12 1.5248680e+04 1.60e-04 4.87e-03 -2.5 1.89e-01 - 1.00e+00 1.00e+0
0h 1
13 1.5226370e+04 2.42e-05 4.40e-02 -3.8 5.36e+00 - 1.00e+00 8.79e-0
1h 1
14 1.5224504e+04 5.83e-08 6.02e-04 -3.8 6.49e-01 - 1.00e+00 1.00e+0
0f 1
15 1.5223052e+04 4.20e-08 5.15e-05 -5.7 2.97e-01 - 1.00e+00 9.98e-0
1f 1
16 1.5223053e+04 1.88e-12 1.21e-08 -5.7 5.93e-04 - 1.00e+00 1.00e+0
0f 1
17 1.5223036e+04 2.57e-12 2.65e-06 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
18 1.5223036e+04 2.81e-15 4.27e-14 -8.6 1.71e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5223036415620191e+01 1.5223036415620190e+0
4
Dual infeasibility......: 4.2745998519969621e-14 4.2745998519969621e-1
1
Constraint violation....: 2.8077711906939279e-15 2.8077711906939279e-1
5
Complementarity.........: 2.6121394972153303e-09 2.6121394972153301e-0
6
Overall NLP error.......: 2.6121394972153303e-09 2.6121394972153301e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4549022e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.98e-04 9.80e-0
3f 1
2 8.4268289e+02 1.27e+04 5.24e+01 -1.0 1.24e+04 - 9.30e-05 1.01e-0
4h 1
3 8.3185819e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 3.40e-06 7.06e-0
4f 1
4 5.1298182e+02 1.24e+04 5.26e+01 -1.0 1.26e+04 - 7.64e-04 2.15e-0
2h 1
5 2.4253114e+04 5.75e-02 8.12e+01 -1.0 1.24e+04 - 4.59e-02 1.00e+0
0h 1
6 1.5783829e+04 5.39e-02 5.24e+01 -1.0 7.95e+01 - 3.46e-01 5.65e-0
2f 1
7 1.3665691e+04 3.43e-02 2.85e+01 -1.0 4.22e+01 - 4.66e-01 5.35e-0
1f 1
8 1.4122490e+04 1.83e-02 6.66e+00 -1.0 2.17e+01 - 6.31e-01 2.50e-0
1f 3
9 1.3813325e+04 5.37e-03 5.08e-01 -1.0 6.56e+00 - 9.50e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3462116e+04 1.47e-03 5.06e-01 -1.7 6.30e+00 - 1.00e+00 7.87e-0
1f 1
11 1.3408535e+04 6.08e-04 2.59e-02 -1.7 1.83e+01 - 1.00e+00 1.00e+0
0f 1
12 1.3266988e+04 1.38e-03 1.17e-01 -3.8 1.99e+01 - 7.65e-01 9.24e-0
1f 1
13 1.3231850e+04 2.70e-03 2.12e-02 -3.8 2.32e+00 - 8.15e-01 8.20e-0
1h 1
14 1.3233706e+04 3.11e-04 1.34e-01 -3.8 2.70e-01 - 1.00e+00 9.08e-0
1h 1
15 1.3234117e+04 5.09e-07 2.22e-05 -3.8 1.24e-01 - 1.00e+00 1.00e+0
0f 1
16 1.3233074e+04 4.18e-07 2.33e-03 -5.7 1.49e-01 - 1.00e+00 9.77e-0
1h 1
17 1.3233064e+04 4.90e-11 2.26e-08 -5.7 2.76e-02 - 1.00e+00 1.00e+0
0f 1
18 1.3233051e+04 6.30e-11 4.40e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.3233050917267901e+01 1.3233050917267901e+0
4
Dual infeasibility......: 4.4004630888914475e-09 4.4004630888914475e-0
6
Constraint violation....: 6.2986921234298165e-11 6.2986921234298165e-1
1
Complementarity.........: 3.8025353226300032e-09 3.8025353226300032e-0
6
Overall NLP error.......: 4.4004630888914475e-09 4.4004630888914475e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2243115e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.48e-03 9.80e-0
3h 1
2 9.1954916e+02 1.11e+04 5.23e+01 -1.0 1.02e+04 - 3.30e-05 1.08e-0
4h 1
3 8.3532790e+02 1.11e+04 5.23e+01 -1.0 1.11e+04 - 1.16e-05 5.12e-0
3h 1
4 5.7144971e+02 1.08e+04 5.22e+01 -1.0 1.11e+04 - 5.83e-03 2.13e-0
2h 1
5 2.1564483e+04 7.50e-02 7.76e+01 -1.0 1.08e+04 - 8.36e-02 1.00e+0
0h 1
6 1.5205616e+04 6.73e-02 2.24e+01 -1.0 1.35e+01 - 6.83e-01 9.53e-0
2f 1
7 1.3939164e+04 1.95e-02 7.10e+00 -1.0 9.84e+00 - 7.18e-01 8.65e-0
1f 1
8 1.4065918e+04 1.05e-02 6.34e-01 -1.0 2.65e+00 - 9.94e-01 4.67e-0
1f 2
9 1.3783440e+04 1.12e-02 4.12e-01 -1.7 1.54e+01 - 6.09e-01 8.14e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3775518e+04 2.61e-03 4.94e-01 -1.7 1.67e+01 - 7.53e-01 5.00e-0
1h 2
11 1.3774020e+04 3.37e-04 1.81e-02 -1.7 1.61e+01 - 1.00e+00 1.00e+0
0h 1
12 1.3604748e+04 5.07e-04 2.14e-02 -2.5 3.20e+01 - 9.69e-01 9.53e-0
1f 1
13 1.3583136e+04 1.64e-04 2.15e-01 -3.8 6.82e+00 - 9.88e-01 7.10e-0
1h 1
14 1.3577119e+04 4.44e-07 3.80e-04 -3.8 1.97e+00 - 1.00e+00 1.00e+0
0h 1
15 1.3575783e+04 2.00e-08 4.31e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
16 1.3575768e+04 8.20e-13 5.12e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.3575768018740597e+01 1.3575768018740597e+0
4
Dual infeasibility......: 5.1152724293310211e-10 5.1152724293310211e-0
7
Constraint violation....: 8.2038542625895161e-13 8.2038542625895161e-1
3
Complementarity.........: 4.0355366028750888e-09 4.0355366028750885e-0
6
Overall NLP error.......: 4.0355366028750888e-09 4.0355366028750885e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891839e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0614875e+02 9.19e+03 5.23e+01 -1.0 8.94e+03 - 8.31e-05 1.02e-0
4h 1
3 8.8589053e+02 9.18e+03 5.23e+01 -1.0 9.18e+03 - 4.99e-06 1.11e-0
3f 1
4 4.8290407e+02 8.97e+03 5.24e+01 -1.0 9.18e+03 - 1.26e-03 2.28e-0
2h 1
5 2.1194856e+04 6.67e-02 7.66e+01 -1.0 8.97e+03 - 8.32e-02 1.00e+0
0h 1
6 1.3110859e+04 6.01e-02 3.76e+01 -1.0 2.89e+01 - 4.83e-01 9.02e-0
2f 1
7 1.1611939e+04 1.94e-02 1.53e+01 -1.0 1.53e+01 - 6.18e-01 7.42e-0
1f 1
8 1.1669715e+04 5.64e-03 1.25e+00 -1.0 2.10e+00 - 9.91e-01 5.00e-0
1f 2
9 1.1851856e+04 3.17e-04 6.99e-02 -1.0 2.45e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1303065e+04 2.21e-03 9.19e-02 -2.5 2.21e+01 - 8.56e-01 8.21e-0
1f 1
11 1.1134535e+04 2.12e-03 4.58e-01 -2.5 3.77e+00 - 1.00e+00 7.49e-0
1f 1
12 1.1105283e+04 1.58e-04 4.78e-03 -2.5 9.43e-01 - 1.00e+00 1.00e+0
0h 1
13 1.1088904e+04 4.25e-05 1.63e-01 -3.8 2.68e+00 - 1.00e+00 7.50e-0
1h 1
14 1.1084573e+04 1.45e-07 3.58e-04 -3.8 6.70e-01 - 1.00e+00 1.00e+0
0f 1
15 1.1083348e+04 2.78e-08 9.22e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 1.1083335e+04 1.87e-12 1.33e-08 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
17 1.1083321e+04 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.1083320746449255e+01 1.1083320746449255e+0
4
Dual infeasibility......: 4.4776956694446556e-09 4.4776956694446556e-0
6
Constraint violation....: 2.6306665179554045e-12 2.6306665179554045e-1
2
Complementarity.........: 3.6085004018046238e-09 3.6085004018046236e-0
6
Overall NLP error.......: 4.4776956694446556e-09 4.4776956694446556e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2299660e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1994562e+02 6.71e+03 5.23e+01 -1.0 5.82e+03 - 3.44e-05 1.14e-0
4h 1
3 7.2850978e+02 6.64e+03 5.23e+01 -1.0 6.70e+03 - 1.95e-05 9.17e-0
3f 1
4 4.9339554e+02 6.50e+03 5.19e+01 -1.0 6.64e+03 - 1.16e-02 2.10e-0
2h 1
5 1.5628519e+04 8.10e-02 7.81e+01 -1.0 6.50e+03 - 8.90e-02 1.00e+0
0h 1
6 1.0636045e+04 7.19e-02 2.13e+01 -1.0 1.24e+01 - 7.05e-01 1.06e-0
1f 1
7 9.4596866e+03 2.23e-02 3.10e+00 -1.0 9.08e+00 - 8.57e-01 8.74e-0
1f 1
8 9.7561577e+03 1.77e-02 1.81e-01 -1.0 2.44e+00 - 9.48e-01 9.15e-0
1f 1
9 9.3900173e+03 3.06e-03 1.04e+00 -1.7 5.49e+00 - 4.42e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.3592739e+03 3.00e-04 5.52e-01 -1.7 7.56e+00 - 7.14e-01 1.00e+0
0h 1
11 9.3753646e+03 9.48e-05 1.14e-01 -1.7 1.29e+01 - 8.54e-01 1.00e+0
0h 1
12 9.2157621e+03 4.62e-04 1.84e-02 -2.5 1.95e+01 - 9.64e-01 9.44e-0
1f 1
13 9.1909283e+03 1.53e-04 2.04e-01 -3.8 9.08e+00 - 9.90e-01 7.18e-0
1h 1
14 9.1841526e+03 3.99e-07 3.57e-04 -3.8 2.60e+00 - 1.00e+00 1.00e+0
0h 1
15 9.1828158e+03 2.01e-08 4.17e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
16 9.1828008e+03 8.62e-13 5.05e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 9.1828007807331673e+00 9.1828007807331669e+0
3
Dual infeasibility......: 5.0545015080268344e-10 5.0545015080268344e-0
7
Constraint violation....: 8.6190776737993247e-13 8.6190776737993247e-1
3
Complementarity.........: 4.3374356306847505e-09 4.3374356306847508e-0
6
Overall NLP error.......: 4.3374356306847505e-09 4.3374356306847508e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3000909e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 2.02e-03 9.81e-0
3h 1
2 9.2540939e+02 4.77e+03 5.23e+01 -1.0 2.66e+03 - 1.91e-05 1.78e-0
4h 1
3 3.8379504e+02 4.66e+03 5.24e+01 -1.0 4.77e+03 - 8.68e-05 2.34e-0
2f 1
4 1.7424477e+04 7.01e-02 7.87e+01 -1.0 4.66e+03 - 5.08e-02 1.00e+0
0h 1
5 9.2441130e+03 6.55e-02 5.13e+01 -1.0 1.16e+01 - 3.39e-01 6.13e-0
2f 1
6 7.9204820e+03 2.27e-02 2.21e+01 -1.0 7.02e+00 - 6.27e-01 9.88e-0
1f 1
7 8.2927286e+03 2.17e-03 1.89e-01 -1.0 2.55e+00 - 9.91e-01 1.00e+0
0f 1
8 7.7707471e+03 1.76e-03 6.99e-02 -1.7 6.35e+00 - 1.00e+00 9.92e-0
1f 1
9 7.5980727e+03 1.95e-03 3.69e-01 -2.5 1.67e+00 - 1.00e+00 7.91e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.5727496e+03 1.82e-04 4.79e-02 -2.5 3.44e-01 - 1.00e+00 9.36e-0
1h 1
11 7.5754877e+03 7.05e-06 1.34e-03 -2.5 2.20e-02 - 1.00e+00 1.00e+0
0f 1
12 7.5482488e+03 7.66e-06 4.23e-03 -3.8 8.04e+00 - 1.00e+00 9.79e-0
1f 1
13 7.5480543e+03 1.37e-08 6.27e-06 -3.8 1.66e-01 - 1.00e+00 1.00e+0
0f 1
14 7.5465649e+03 1.73e-08 3.04e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0f 1
15 7.5465477e+03 1.28e-12 4.22e-10 -8.6 5.52e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 7.5465477358447783e+00 7.5465477358447779e+0
3
Dual infeasibility......: 4.2179927612894324e-10 4.2179927612894324e-0
7
Constraint violation....: 1.2797540804854179e-12 1.2797540804854179e-1
2
Complementarity.........: 2.8995999990476833e-09 2.8995999990476831e-0
6
Overall NLP error.......: 2.8995999990476833e-09 2.8995999990476831e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2287642e+02 3.24e+03 5.23e+01 -1.0 3.27e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1570379e+02 3.24e+03 5.23e+01 -1.0 2.10e+03 - 2.38e-05 2.81e-0
4h 1
3 3.4600376e+02 3.17e+03 5.24e+01 -1.0 3.24e+03 - 1.97e-04 2.35e-0
2f 1
4 1.5844512e+04 6.83e-02 7.63e+01 -1.0 3.17e+03 - 7.93e-02 1.00e+0
0h 1
5 7.5150435e+03 6.18e-02 2.59e+01 -1.0 1.38e+01 - 6.27e-01 8.62e-0
2f 1
6 6.1543860e+03 2.18e-02 1.14e+01 -1.0 9.93e+00 - 6.43e-01 9.14e-0
1f 1
7 6.3961781e+03 2.56e-03 1.09e-01 -1.0 3.02e+00 - 9.91e-01 9.87e-0
1f 1
8 5.9626851e+03 2.64e-03 1.93e-01 -1.7 1.28e+01 - 9.34e-01 1.00e+0
0f 1
9 5.7850480e+03 1.68e-03 8.02e-02 -2.5 1.77e+00 - 8.03e-01 7.50e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.7498364e+03 4.12e-04 1.11e-01 -2.5 9.81e-01 - 1.00e+00 9.05e-0
1h 1
11 5.7535778e+03 1.34e-05 4.97e-03 -2.5 1.59e-01 - 1.00e+00 1.00e+0
0f 1
12 5.7231686e+03 1.12e-05 6.55e-03 -3.8 1.07e+01 - 1.00e+00 9.68e-0
1f 1
13 5.7226587e+03 1.60e-08 1.24e-05 -3.8 3.33e-01 - 1.00e+00 1.00e+0
0f 1
14 5.7210185e+03 1.79e-08 5.06e-06 -5.7 5.94e-01 - 1.00e+00 1.00e+0
0f 1
15 5.7210000e+03 6.40e-13 4.12e-10 -8.6 7.35e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.7210000385593398e+00 5.7210000385593394e+0
3
Dual infeasibility......: 4.1156165726827793e-10 4.1156165726827793e-0
7
Constraint violation....: 6.4043215175502155e-13 6.4043215175502155e-1
3
Complementarity.........: 2.8596633132014385e-09 2.8596633132014385e-0
6
Overall NLP error.......: 2.8596633132014385e-09 2.8596633132014385e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1576532e+02 2.00e+03 5.23e+01 -1.0 2.01e+03 - 1.20e-03 9.82e-0
3h 1
2 9.1032142e+02 2.00e+03 5.23e+01 -1.0 1.04e+03 - 3.89e-05 2.06e-0
4h 1
3 3.1311212e+02 1.95e+03 5.24e+01 -1.0 2.00e+03 - 1.27e-04 2.35e-0
2f 1
4 1.4582884e+04 6.66e-02 7.62e+01 -1.0 1.95e+03 - 8.09e-02 1.00e+0
0h 1
5 6.1165383e+03 6.02e-02 3.22e+01 -1.0 2.09e+01 - 5.47e-01 8.74e-0
2f 1
6 4.5880149e+03 1.60e-02 1.42e+01 -1.0 1.27e+01 - 6.20e-01 8.67e-0
1f 1
7 4.8954300e+03 1.60e-03 1.24e-01 -1.0 3.70e+00 - 9.91e-01 1.00e+0
0f 1
8 4.4216223e+03 1.88e-03 1.47e-01 -1.7 9.30e+00 - 1.00e+00 1.00e+0
0f 1
9 4.2329428e+03 2.04e-03 3.71e-01 -2.5 1.53e+00 - 1.00e+00 7.85e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2060801e+03 1.91e-04 1.99e-02 -2.5 3.18e-01 - 1.00e+00 9.80e-0
1h 1
11 4.1818692e+03 1.86e-06 1.85e-02 -3.8 8.06e+00 - 9.84e-01 1.00e+0
0h 1
12 4.1819975e+03 1.74e-09 4.82e-06 -3.8 9.86e-03 - 1.00e+00 1.00e+0
0h 1
13 4.1805106e+03 1.80e-08 1.81e-04 -5.7 4.46e-01 - 1.00e+00 9.96e-0
1f 1
14 4.1805076e+03 1.80e-12 2.29e-09 -5.7 1.79e-03 - 1.00e+00 1.00e+0
0f 1
15 4.1804892e+03 2.63e-12 1.52e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 4.1804891612826358e+00 4.1804891612826359e+0
3
Dual infeasibility......: 1.5189628473326610e-09 1.5189628473326610e-0
6
Constraint violation....: 2.6291746557660645e-12 2.6291746557660645e-1
2
Complementarity.........: 3.5988200889394328e-09 3.5988200889394326e-0
6
Overall NLP error.......: 3.5988200889394328e-09 3.5988200889394326e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6555952e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 4.97e-04 9.86e-0
3h 1
2 8.5049278e+02 9.17e+02 5.24e+01 -1.0 7.54e+02 - 7.94e-05 5.56e-0
4h 1
3 2.6243053e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 5.25e-04 2.21e-0
2h 1
4 1.2843590e+04 5.96e-02 8.01e+01 -1.0 8.97e+02 - 5.01e-02 1.00e+0
0h 1
5 4.2877638e+03 5.57e-02 5.36e+01 -1.0 7.35e+01 - 3.21e-01 5.99e-0
2f 1
6 2.6987533e+03 3.02e-02 2.80e+01 -1.0 3.89e+01 - 4.73e-01 4.32e-0
1f 1
7 2.1338104e+03 1.47e-02 2.60e+00 -1.0 1.10e+01 - 9.18e-01 1.00e+0
0f 1
8 2.4784985e+03 4.35e-04 8.91e-02 -1.0 4.11e+00 - 9.95e-01 1.00e+0
0f 1
9 1.8850092e+03 7.20e-04 3.48e-01 -2.5 8.02e+00 - 8.81e-01 7.34e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8153168e+03 2.43e-04 3.44e-01 -2.5 5.63e+00 - 8.84e-01 1.00e+0
0h 1
11 1.8084641e+03 7.31e-04 4.28e-01 -2.5 1.40e+00 - 1.00e+00 1.97e-0
1h 2
12 1.7887640e+03 1.00e-03 1.17e-02 -2.5 9.26e-01 - 1.00e+00 1.00e+0
0h 1
13 1.7618411e+03 1.22e-03 3.34e-02 -3.8 1.35e+01 - 7.93e-01 1.00e+0
0h 1
14 1.7587835e+03 2.37e-03 9.33e-04 -3.8 3.99e-02 - 1.00e+00 1.00e+0
0h 1
15 1.7591123e+03 4.69e-05 1.25e-04 -3.8 1.50e-02 - 1.00e+00 1.00e+0
0h 1
16 1.7572173e+03 1.03e-04 3.65e-04 -5.7 7.43e-01 - 9.51e-01 9.77e-0
1h 1
17 1.7571949e+03 2.27e-05 3.68e-03 -5.7 1.67e-02 - 1.00e+00 7.82e-0
1h 1
18 1.7571952e+03 8.72e-09 1.23e-06 -5.7 3.66e-03 - 1.00e+00 1.00e+0
0f 1
19 1.7571733e+03 9.04e-09 1.92e-05 -8.6 9.21e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7571729e+03 1.37e-12 6.49e-11 -8.6 1.53e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.7571729225845782e+00 1.7571729225845781e+0
3
Dual infeasibility......: 6.4905802012798273e-11 6.4905802012798279e-0
8
Constraint violation....: 1.3680168109431179e-12 1.3680168109431179e-1
2
Complementarity.........: 2.5092410556756698e-09 2.5092410556756697e-0
6
Overall NLP error.......: 2.5092410556756698e-09 2.5092410556756697e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101521e-01 6.4890146112101525e+0
2
Dual infeasibility......: 4.9126605618489413e-09 4.9126605618489413e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984918224e-09 4.3646094984918221e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605618489413e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318724481455e-09 2.1031318724481455e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896894379e-09 2.8882108896894380e-0
6
Overall NLP error.......: 2.8882108896894379e-09 2.8882108896894380e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101521e-01 6.4890146112101525e+0
2
Dual infeasibility......: 4.9126605618489413e-09 4.9126605618489413e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984918224e-09 4.3646094984918221e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605618489413e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.04e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.57e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235660171e+00 1.6104063235660171e+0
3
Dual infeasibility......: 2.4574009793760635e-12 2.4574009793760635e-0
9
Constraint violation....: 7.5703172614159067e-16 7.5703172614159067e-1
6
Complementarity.........: 2.5062163919681798e-09 2.5062163919681799e-0
6
Overall NLP error.......: 2.5062163919681798e-09 2.5062163919681799e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2278083e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 3.31e-04 9.87e-0
3h 1
2 8.0391474e+02 9.17e+02 5.24e+01 -1.0 7.85e+02 - 8.87e-05 6.88e-0
4h 1
3 2.4271271e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 6.68e-04 2.10e-0
2h 1
4 1.2385916e+04 5.52e-02 8.23e+01 -1.0 8.98e+02 - 3.86e-02 1.00e+0
0h 1
5 3.8851959e+03 5.26e-02 5.59e+01 -1.0 8.06e+01 - 3.19e-01 5.02e-0
2f 1
6 1.9099004e+03 3.73e-02 2.99e+01 -1.0 3.93e+01 - 4.69e-01 5.04e-0
1f 1
7 4.6737272e+03 1.22e-02 2.67e+01 -1.0 2.06e+01 - 4.01e-01 1.00e+0
0h 1
8 1.8754601e+03 1.19e-02 1.01e+00 -1.0 2.53e+01 - 9.88e-01 8.94e-0
1f 1
9 2.0005994e+03 1.84e-04 4.66e-02 -1.0 3.18e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7351413e+03 2.16e-04 1.24e+00 -2.5 1.71e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5469297e+03 3.76e-03 1.33e-01 -2.5 7.60e+00 - 7.95e-01 1.00e+0
0f 1
12 1.5237159e+03 5.30e-03 3.11e-01 -2.5 1.84e+00 - 1.00e+00 7.66e-0
1h 1
13 1.5360639e+03 2.44e-04 4.74e-03 -2.5 7.11e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5034784e+03 1.70e-04 2.15e-02 -3.8 1.62e+01 - 9.91e-01 9.29e-0
1h 1
15 1.5021214e+03 7.21e-07 6.83e-05 -3.8 1.10e+00 - 1.00e+00 1.00e+0
0h 1
16 1.5003172e+03 3.77e-07 1.78e-04 -5.7 8.92e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003154e+03 3.79e-11 2.92e-09 -5.7 4.18e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.11e-02 - 1.00e+00 1.00e+0
0h 1
1 8.6534772e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 4.97e-04 9.87e-0
3h 1
2 8.4418057e+02 9.17e+02 5.24e+01 -1.0 8.02e+02 - 8.70e-05 7.83e-0
4h 1
3 2.6276094e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 7.65e-04 2.20e-0
2h 1
4 1.2724514e+04 5.99e-02 8.02e+01 -1.0 8.97e+02 - 5.06e-02 1.00e+0
0h 1
5 4.2755874e+03 5.59e-02 5.32e+01 -1.0 7.28e+01 - 3.26e-01 6.05e-0
2f 1
45 1.882438e+04 1.632511e+04 4.155824e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6793774e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.80e-0
3h 1
2 7.6493627e+02 1.57e+04 5.25e+01 -1.0 1.38e+04 - 2.51e-05 1.13e-0
4h 1
3 7.6112920e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 1.74e-05 3.01e-0
4h 1
4 7.5768827e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 3.17e-04 2.81e-0
4h 1
5 5.2507101e+02 1.54e+04 6.10e+01 -1.0 1.57e+04 - 6.43e-04 2.00e-0
2f 1
6 2.6631790e+04 6.10e-02 8.48e+01 -1.0 1.54e+04 - 2.97e-02 1.00e+0
0h 1
7 1.8265306e+04 5.86e-02 6.69e+01 -1.0 7.81e+01 - 2.17e-01 4.31e-0
2f 1
8 1.6691510e+04 4.50e-02 3.30e+01 -1.0 2.87e+01 - 5.02e-01 4.35e-0
1f 1
9 1.6986144e+04 3.07e-02 1.32e+01 -1.0 1.61e+01 - 4.69e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6780778e+04 5.31e-03 3.64e+00 -1.0 3.76e+00 - 7.97e-01 1.00e+0
0h 1
11 1.6827230e+04 2.98e-04 2.01e+00 -1.0 1.54e+00 - 3.06e-01 1.00e+0
0f 1
12 1.6826857e+04 1.10e-05 5.35e-01 -1.0 1.34e+00 - 7.29e-01 1.00e+0
0f 1
13 1.6529880e+04 2.25e-04 2.96e-01 -1.7 4.85e+00 - 8.62e-01 7.80e-0
1f 1
14 1.6478082e+04 5.57e-04 3.60e-01 -1.7 6.33e+00 - 5.93e-01 1.00e+0
0f 1
15 1.6477273e+04 7.39e-05 7.95e-02 -1.7 1.21e+01 - 6.85e-01 1.00e+0
0h 1
16 1.6369576e+04 9.59e-04 5.32e-02 -2.5 1.13e+01 - 9.22e-01 1.00e+0
0f 1
17 1.6345120e+04 1.16e-03 1.25e-02 -2.5 5.16e+00 - 1.00e+00 1.00e+0
0h 1
18 1.6327811e+04 1.96e-04 8.82e-02 -3.8 6.01e+00 - 1.00e+00 8.50e-0
1h 1
19 1.6326251e+04 6.31e-07 1.05e-04 -3.8 6.15e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325264e+04 3.83e-07 7.30e-03 -5.7 2.61e-01 - 1.00e+00 8.34e-0
1h 1
21 1.6325119e+04 1.10e-08 3.70e-07 -5.7 5.62e-03 - 1.00e+00 1.00e+0
0f 1
22 1.6325105e+04 1.11e-10 2.79e-06 -8.6 2.26e-03 - 1.00e+00 9.96e-0
1h 1
23 1.6325105e+04 3.55e-15 4.25e-14 -8.6 1.79e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 23
(scaled) (unscaled)
Objective...............: 1.6325105261433350e+01 1.6325105261433349e+0
4
Dual infeasibility......: 4.2547000927150661e-14 4.2547000927150661e-1
1
Constraint violation....: 3.5527136788005009e-15 3.5527136788005009e-1
5
Complementarity.........: 2.5060279373012924e-09 2.5060279373012924e-0
6
Overall NLP error.......: 2.5060279373012924e-09 2.5060279373012924e-0
6
Number of objective function evaluations = 27
Number of objective gradient evaluations = 24
Number of equality constraint evaluations = 27
Number of inequality constraint evaluations = 27
Number of equality constraint Jacobian evaluations = 24
Number of inequality constraint Jacobian evaluations = 24
Number of Lagrangian Hessian evaluations = 23
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.1742626e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 3.14e-04 9.80e-0
3h 1
2 8.1450130e+02 1.50e+04 5.24e+01 -1.0 1.37e+04 - 3.16e-05 1.08e-0
4h 1
3 8.1194154e+02 1.50e+04 5.24e+01 -1.0 1.49e+04 - 1.19e-05 1.92e-0
4h 1
4 8.0372184e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 2.02e-04 6.29e-0
4h 1
5 5.4534916e+02 1.47e+04 5.26e+01 -1.0 1.50e+04 - 8.53e-04 2.09e-0
2f 1
6 2.6211748e+04 5.52e-02 8.27e+01 -1.0 1.47e+04 - 3.74e-02 1.00e+0
0h 1
7 1.7873232e+04 5.26e-02 5.67e+01 -1.0 7.93e+01 - 3.13e-01 4.94e-0
2f 1
8 1.5963243e+04 3.89e-02 2.99e+01 -1.0 3.79e+01 - 4.75e-01 4.93e-0
1f 1
9 1.6300030e+04 2.36e-02 1.36e+01 -1.0 1.98e+01 - 4.09e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6040807e+04 6.18e-03 2.88e-01 -1.0 5.22e+00 - 9.84e-01 1.00e+0
0h 1
11 1.5744497e+04 1.37e-03 3.58e-01 -1.7 5.09e+00 - 1.00e+00 8.40e-0
1f 1
12 1.5733892e+04 8.44e-04 1.33e-02 -1.7 4.05e+01 - 1.00e+00 1.00e+0
0f 1
13 1.5593624e+04 1.18e-03 4.64e-02 -2.5 3.95e+01 - 9.21e-01 1.00e+0
0f 1
14 1.5578873e+04 1.21e-03 1.43e-02 -2.5 1.96e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5562285e+04 2.09e-04 9.93e-02 -3.8 5.50e+00 - 1.00e+00 8.40e-0
1h 1
16 1.5560429e+04 4.72e-07 1.27e-04 -3.8 8.26e-01 - 1.00e+00 1.00e+0
0h 1
17 1.5559216e+04 4.02e-07 1.46e-04 -5.7 2.97e-01 - 1.00e+00 9.97e-0
1h 1
18 1.5559217e+04 3.87e-11 2.98e-09 -5.7 4.05e-02 - 1.00e+00 1.00e+0
0f 1
19 1.5559202e+04 6.30e-11 2.14e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.5559202141341869e+01 1.5559202141341868e+0
4
Dual infeasibility......: 2.1395197417313400e-09 2.1395197417313400e-0
6
Constraint violation....: 6.2995234029195046e-11 6.2995234029195046e-1
1
Complementarity.........: 2.8882171513459441e-09 2.8882171513459441e-0
6
Overall NLP error.......: 2.8882171513459441e-09 2.8882171513459441e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9474651e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 7.47e-04 9.80e-0
3h 1
2 8.9199565e+02 1.39e+04 5.24e+01 -1.0 1.37e+04 - 8.66e-05 1.01e-0
4h 1
3 8.8257841e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 3.21e-06 6.93e-0
4f 1
4 5.8123616e+02 1.36e+04 5.24e+01 -1.0 1.39e+04 - 7.46e-04 2.27e-0
2h 1
5 2.5990172e+04 6.37e-02 7.79e+01 -1.0 1.36e+04 - 6.91e-02 1.00e+0
0h 1
6 1.7595448e+04 5.83e-02 4.87e+01 -1.0 5.00e+01 - 3.58e-01 7.69e-0
2f 1
7 1.6291297e+04 2.68e-02 2.14e+01 -1.0 2.30e+01 - 5.53e-01 4.96e-0
1f 1
8 1.5789039e+04 7.20e-03 1.25e+00 -1.0 8.72e+00 - 9.36e-01 7.37e-0
1f 1
9 1.6041708e+04 3.33e-04 8.06e-02 -1.0 2.82e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5454921e+04 2.08e-03 9.08e-02 -2.5 4.31e+00 - 8.63e-01 8.28e-0
1f 1
11 1.5276348e+04 2.17e-03 3.60e-01 -2.5 1.07e+00 - 1.00e+00 7.75e-0
1f 1
12 1.5247312e+04 1.68e-04 5.12e-03 -2.5 2.17e-01 - 1.00e+00 1.00e+0
0h 1
13 1.5227545e+04 2.51e-05 4.54e-02 -3.8 2.68e+00 - 1.00e+00 8.77e-0
1h 1
14 1.5225998e+04 5.93e-08 6.08e-04 -3.8 3.28e-01 - 1.00e+00 1.00e+0
0f 1
15 1.5224694e+04 4.20e-08 2.65e-05 -5.7 1.49e-01 - 1.00e+00 9.99e-0
1f 1
16 1.5224696e+04 1.87e-12 1.04e-08 -5.7 1.66e-04 - 1.00e+00 1.00e+0
0f 1
17 1.5224681e+04 2.57e-12 2.86e-06 -8.6 1.84e-03 - 1.00e+00 9.99e-0
1f 1
18 1.5224681e+04 7.11e-15 4.47e-14 -8.6 9.63e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5224681131418064e+01 1.5224681131418063e+0
4
Dual infeasibility......: 4.4731427505815193e-14 4.4731427505815193e-1
1
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5059120117608104e-09 2.5059120117608106e-0
6
Overall NLP error.......: 2.5059120117608104e-09 2.5059120117608106e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8072599e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.97e-04 9.80e-0
3h 1
2 8.7789674e+02 1.27e+04 5.24e+01 -1.0 1.20e+04 - 4.35e-05 1.05e-0
4h 1
3 8.6440686e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 8.18e-06 9.00e-0
4f 1
4 8.3830261e+02 1.26e+04 5.23e+01 -1.0 1.26e+04 - 9.10e-04 1.80e-0
3h 1
5 5.6311358e+02 1.23e+04 5.23e+01 -1.0 1.26e+04 - 4.13e-03 2.19e-0
2f 1
6 2.2863631e+04 6.61e-02 7.94e+01 -1.0 1.23e+04 - 6.92e-02 1.00e+0
0h 1
7 1.5964872e+04 6.03e-02 4.35e+01 -1.0 5.63e+01 - 4.34e-01 8.05e-0
2f 1
8 1.4604605e+04 3.03e-02 1.75e+01 -1.0 2.97e+01 - 5.81e-01 4.53e-0
1f 1
9 1.4084519e+04 5.54e-03 9.97e-01 -1.0 1.03e+01 - 9.26e-01 8.28e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4368918e+04 1.13e-04 1.25e-01 -1.0 3.87e+00 - 9.16e-01 1.00e+0
0f 1
11 1.3770960e+04 1.23e-03 7.52e-01 -1.7 2.03e+01 - 5.67e-01 9.71e-0
1f 1
12 1.3839811e+04 4.32e-05 2.33e-02 -1.7 3.13e+00 - 1.00e+00 1.00e+0
0f 1
13 1.3715687e+04 5.59e-05 1.60e-01 -2.5 2.64e+01 - 1.00e+00 8.69e-0
1f 1
14 1.3711854e+04 7.11e-05 2.36e-03 -2.5 1.04e+00 - 1.00e+00 1.00e+0
0f 1
15 1.3697170e+04 2.47e-04 6.51e-02 -3.8 3.65e+00 - 7.81e-01 9.50e-0
1h 1
16 1.3694065e+04 1.59e-03 1.47e-03 -3.8 1.57e-01 - 9.86e-01 1.00e+0
0f 1
17 1.3694077e+04 8.23e-05 6.12e-05 -3.8 1.26e-02 - 1.00e+00 1.00e+0
0h 1
18 1.3692874e+04 1.29e-04 1.10e-03 -5.7 1.51e-01 - 9.19e-01 1.00e+0
0h 1
19 1.3692834e+04 3.22e-05 6.55e-06 -5.7 8.36e-03 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.3692839e+04 1.65e-07 3.23e-06 -5.7 5.84e-04 - 1.00e+00 1.00e+0
0h 1
21 1.3692826e+04 2.64e-08 3.14e-05 -8.6 1.84e-03 - 1.00e+00 9.58e-0
1h 1
22 1.3692826e+04 4.19e-12 5.06e-11 -8.6 7.69e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.3692825523635815e+01 1.3692825523635815e+0
4
Dual infeasibility......: 5.0587342726106128e-11 5.0587342726106128e-0
8
Constraint violation....: 4.1865400035590028e-12 4.1865400035590028e-1
2
Complementarity.........: 2.5095635752662823e-09 2.5095635752662824e-0
6
Overall NLP error.......: 2.5095635752662823e-09 2.5095635752662824e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9482527e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 7.48e-04 9.80e-0
3h 1
2 8.9206259e+02 1.11e+04 5.24e+01 -1.0 1.09e+04 - 8.69e-05 1.01e-0
4h 1
3 8.7788074e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 4.01e-06 8.67e-0
4f 1
4 5.1726064e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 9.54e-04 2.26e-0
2h 1
5 2.3121559e+04 6.40e-02 7.79e+01 -1.0 1.09e+04 - 6.98e-02 1.00e+0
0h 1
6 1.4812165e+04 5.85e-02 4.83e+01 -1.0 4.95e+01 - 3.63e-01 7.77e-0
2f 1
7 1.3505031e+04 2.67e-02 2.10e+01 -1.0 2.28e+01 - 5.57e-01 5.00e-0
1f 1
8 1.3018007e+04 6.85e-03 1.23e+00 -1.0 8.59e+00 - 9.37e-01 7.36e-0
1f 1
9 1.3268789e+04 3.20e-04 7.93e-02 -1.0 2.91e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2683148e+04 2.08e-03 9.07e-02 -2.5 4.28e+00 - 8.62e-01 8.28e-0
1f 1
11 1.2505092e+04 2.17e-03 3.62e-01 -2.5 1.06e+00 - 1.00e+00 7.74e-0
1f 1
12 1.2476207e+04 1.68e-04 5.11e-03 -2.5 2.15e-01 - 1.00e+00 1.00e+0
0h 1
13 1.2456345e+04 2.44e-05 4.31e-02 -3.8 2.68e+00 - 1.00e+00 8.82e-0
1h 1
14 1.2454881e+04 5.88e-08 6.10e-04 -3.8 3.16e-01 - 1.00e+00 1.00e+0
0f 1
15 1.2453574e+04 4.24e-08 1.39e-05 -5.7 1.49e-01 - 1.00e+00 9.99e-0
1f 1
16 1.2453562e+04 6.84e-13 3.99e-09 -8.6 1.93e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.2453562300924954e+01 1.2453562300924954e+0
4
Dual infeasibility......: 3.9883528045605733e-09 3.9883528045605733e-0
6
Constraint violation....: 6.8445249468140901e-13 6.8445249468140901e-1
3
Complementarity.........: 2.7863203150875941e-09 2.7863203150875942e-0
6
Overall NLP error.......: 3.9883528045605733e-09 3.9883528045605733e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891076e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0602418e+02 9.19e+03 5.23e+01 -1.0 8.41e+03 - 3.92e-05 1.08e-0
4h 1
3 8.1828316e+02 9.14e+03 5.24e+01 -1.0 9.19e+03 - 1.24e-05 4.81e-0
3h 1
4 5.0911016e+02 8.95e+03 5.22e+01 -1.0 9.14e+03 - 5.53e-03 2.13e-0
2h 1
5 1.9574028e+04 7.15e-02 7.74e+01 -1.0 8.95e+03 - 8.67e-02 1.00e+0
0h 1
6 1.2972291e+04 6.39e-02 3.14e+01 -1.0 2.60e+01 - 5.69e-01 9.74e-0
2f 1
7 1.1456842e+04 1.98e-02 1.02e+01 -1.0 1.50e+01 - 6.92e-01 7.89e-0
1f 1
8 1.1617387e+04 7.35e-03 8.73e-01 -1.0 3.38e+00 - 9.92e-01 5.00e-0
1f 2
9 1.1302480e+04 1.11e-02 4.17e-01 -1.7 1.04e+01 - 5.88e-01 8.28e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1278048e+04 8.05e-04 7.34e-01 -1.7 1.44e+01 - 6.40e-01 1.00e+0
0f 1
11 1.1288608e+04 6.43e-05 3.49e-03 -1.7 1.17e+01 - 1.00e+00 1.00e+0
0h 1
12 1.1114023e+04 5.65e-04 2.52e-02 -3.8 3.49e+01 - 8.37e-01 8.35e-0
1f 1
13 1.1087196e+04 1.47e-04 7.89e-02 -3.8 5.71e+00 - 9.91e-01 8.37e-0
1h 1
14 1.1084767e+04 1.88e-07 1.01e-01 -3.8 9.28e-01 - 9.20e-01 1.00e+0
0h 1
15 1.1084687e+04 4.65e-09 2.94e-05 -3.8 1.58e-04 - 1.00e+00 1.00e+0
0h 1
16 1.1083373e+04 1.92e-08 3.89e-03 -5.7 2.97e-01 - 1.00e+00 9.68e-0
1f 1
17 1.1083337e+04 5.76e-12 2.63e-08 -5.7 9.61e-03 - 1.00e+00 1.00e+0
0f 1
18 1.1083321e+04 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1083320747950930e+01 1.1083320747950929e+0
4
Dual infeasibility......: 4.4780431670384897e-09 4.4780431670384897e-0
6
Constraint violation....: 2.6339416758780487e-12 2.6339416758780487e-1
2
Complementarity.........: 3.6085483410387117e-09 3.6085483410387117e-0
6
Overall NLP error.......: 4.4780431670384897e-09 4.4780431670384897e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3710605e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 3.06e-03 9.80e-0
3h 1
2 9.3410771e+02 6.71e+03 5.23e+01 -1.0 6.33e+03 - 5.53e-05 1.05e-0
4h 1
3 8.7601628e+02 6.69e+03 5.23e+01 -1.0 6.70e+03 - 8.90e-06 2.62e-0
3f 1
4 4.4078555e+02 6.54e+03 5.23e+01 -1.0 6.69e+03 - 3.32e-03 2.17e-0
2h 1
5 1.7952487e+04 7.75e-02 7.79e+01 -1.0 6.54e+03 - 7.84e-02 1.00e+0
0h 1
6 1.1162158e+04 7.00e-02 2.30e+01 -1.0 4.32e+00 - 6.80e-01 8.97e-0
2f 1
7 1.0161093e+04 3.32e-02 7.43e+00 -1.0 4.23e+00 - 7.42e-01 1.00e+0
0f 1
8 1.0283900e+04 1.70e-02 7.27e-01 -1.0 1.10e+00 - 9.96e-01 4.94e-0
1f 2
9 1.0000013e+04 8.27e-03 3.35e-01 -1.7 1.28e+01 - 1.00e+00 8.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.9361941e+03 1.02e-03 1.04e-01 -1.7 8.95e+00 - 1.00e+00 1.00e+0
0f 1
11 9.8169976e+03 2.77e-04 1.12e-01 -2.5 1.73e+01 - 9.89e-01 8.85e-0
1f 1
12 9.8069007e+03 4.94e-06 1.10e-03 -2.5 1.95e+00 - 1.00e+00 1.00e+0
0f 1
13 9.7851225e+03 5.56e-06 7.61e-04 -3.8 2.68e+00 - 1.00e+00 1.00e+0
0f 1
14 9.7842068e+03 3.44e-09 3.52e-06 -5.7 1.48e-01 - 1.00e+00 1.00e+0
0h 1
15 9.7841926e+03 2.34e-12 4.09e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 9.7841925852849894e+00 9.7841925852849890e+0
3
Dual infeasibility......: 4.0868851789266659e-10 4.0868851789266659e-0
7
Constraint violation....: 2.3425705819590803e-12 2.3425705819590803e-1
2
Complementarity.........: 2.5729802580412635e-09 2.5729802580412636e-0
6
Overall NLP error.......: 2.5729802580412635e-09 2.5729802580412636e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2998965e+02 4.77e+03 5.23e+01 -1.0 4.81e+03 - 2.02e-03 9.81e-0
3h 1
2 9.2082211e+02 4.77e+03 5.23e+01 -1.0 3.51e+03 - 1.43e-05 3.74e-0
4h 1
3 3.8434101e+02 4.66e+03 5.24e+01 -1.0 4.77e+03 - 2.86e-04 2.33e-0
2h 1
4 1.7339609e+04 7.04e-02 7.65e+01 -1.0 4.66e+03 - 7.76e-02 1.00e+0
0h 1
5 9.1903569e+03 6.38e-02 2.51e+01 -1.0 8.42e+00 - 6.40e-01 8.52e-0
2f 1
6 7.9431385e+03 3.12e-02 1.09e+01 -1.0 7.07e+00 - 6.69e-01 1.00e+0
0f 1
7 8.2254604e+03 9.50e-03 2.48e-01 -1.0 2.33e+00 - 9.92e-01 1.00e+0
0f 1
8 7.7796871e+03 3.47e-03 5.69e-01 -1.7 1.40e+01 - 7.23e-01 1.00e+0
0f 1
9 7.7425247e+03 5.61e-04 3.86e-01 -1.7 2.85e+01 - 7.11e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.7743007e+03 1.78e-05 6.36e-02 -1.7 2.67e+01 - 8.86e-01 1.00e+0
0h 1
11 7.5831276e+03 3.74e-04 2.20e-02 -2.5 5.67e+01 - 9.83e-01 9.56e-0
1f 1
12 7.5544579e+03 8.98e-05 1.38e-01 -3.8 1.55e+01 - 9.94e-01 7.88e-0
1h 1
13 7.5482002e+03 1.92e-07 1.01e-04 -3.8 3.28e+00 - 1.00e+00 1.00e+0
0f 1
14 7.5465668e+03 1.77e-08 3.01e-06 -5.7 5.94e-01 - 1.00e+00 1.00e+0
0h 1
15 7.5465477e+03 1.29e-12 4.23e-10 -8.6 7.36e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 7.5465477379384991e+00 7.5465477379384993e+0
3
Dual infeasibility......: 4.2305013959907580e-10 4.2305013959907580e-0
7
Constraint violation....: 1.2875950305968331e-12 1.2875950305968331e-1
2
Complementarity.........: 2.9037519028645126e-09 2.9037519028645126e-0
6
Overall NLP error.......: 2.9037519028645126e-09 2.9037519028645126e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9478285e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3f 1
2 8.9187540e+02 3.24e+03 5.24e+01 -1.0 3.02e+03 - 9.14e-05 1.06e-0
4h 1
3 8.1655199e+02 3.23e+03 5.24e+01 -1.0 3.24e+03 - 1.38e-05 3.11e-0
3f 1
4 3.3910587e+02 3.16e+03 5.23e+01 -1.0 3.23e+03 - 4.64e-03 2.16e-0
2h 1
5 1.3760479e+04 6.81e-02 7.78e+01 -1.0 3.16e+03 - 8.37e-02 1.00e+0
0h 1
6 6.7546785e+03 6.11e-02 3.98e+01 -1.0 4.44e+01 - 4.66e-01 9.34e-0
2f 1
7 5.3864148e+03 2.95e-02 1.35e+01 -1.0 2.09e+01 - 6.49e-01 5.65e-0
1f 1
8 5.1381255e+03 3.48e-03 7.14e-01 -1.0 6.07e+00 - 9.54e-01 7.93e-0
1h 1
9 4.8058915e+03 9.07e-03 2.89e-01 -1.7 1.90e+00 - 1.00e+00 8.12e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.7469494e+03 1.26e-03 1.39e-01 -1.7 1.88e+01 - 1.00e+00 9.70e-0
1f 1
11 4.6212428e+03 4.91e-04 1.73e-01 -2.5 1.68e+01 - 9.48e-01 8.28e-0
1h 1
12 4.5986044e+03 6.65e-05 4.46e-03 -2.5 2.80e+00 - 1.00e+00 1.00e+0
0f 1
13 4.5763010e+03 1.58e-05 2.73e-02 -3.8 2.68e+00 - 1.00e+00 9.25e-0
1h 1
14 4.5756329e+03 4.87e-08 5.45e-04 -3.8 1.99e-01 - 1.00e+00 1.00e+0
0f 1
15 4.5743308e+03 4.26e-08 4.12e-04 -5.7 1.49e-01 - 1.00e+00 9.91e-0
1f 1
16 4.5743249e+03 1.95e-12 3.00e-08 -5.7 1.33e-03 - 1.00e+00 1.00e+0
0f 1
17 4.5743102e+03 2.58e-12 3.28e-06 -8.6 1.84e-03 - 1.00e+00 9.99e-0
1f 1
18 4.5743102e+03 1.64e-15 4.85e-14 -8.6 1.07e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 4.5743101972457971e+00 4.5743101972457971e+0
3
Dual infeasibility......: 4.8519866396515661e-14 4.8519866396515661e-1
1
Constraint violation....: 1.6357795390873376e-15 1.6357795390873376e-1
5
Complementarity.........: 2.5059125764796103e-09 2.5059125764796103e-0
6
Overall NLP error.......: 2.5059125764796103e-09 2.5059125764796103e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8047271e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.82e-0
3h 1
2 8.7571780e+02 2.00e+03 5.24e+01 -1.0 1.11e+03 - 4.57e-05 1.77e-0
4h 1
3 2.9373644e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 9.83e-05 2.27e-0
2f 1
4 1.4280611e+04 6.09e-02 7.92e+01 -1.0 1.95e+03 - 5.49e-02 1.00e+0
0h 1
5 5.5544141e+03 5.66e-02 5.35e+01 -1.0 6.57e+01 - 3.12e-01 6.38e-0
2f 1
6 4.1958834e+03 3.11e-02 2.65e+01 -1.0 3.24e+01 - 4.93e-01 4.18e-0
1f 1
7 3.3759781e+03 1.36e-02 2.17e+00 -1.0 1.11e+01 - 9.19e-01 9.26e-0
1f 1
8 3.8304846e+03 4.15e-04 1.09e-01 -1.0 5.03e+00 - 9.98e-01 1.00e+0
0f 1
9 3.1630981e+03 1.16e-03 7.20e-02 -1.7 5.05e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.1124442e+03 6.66e-04 2.53e+00 -2.5 4.54e+01 - 1.00e+00 4.28e-0
1h 1
11 3.0653166e+03 7.86e-05 1.90e-02 -2.5 2.57e+01 - 1.00e+00 1.00e+0
0f 1
12 3.0435954e+03 3.48e-04 8.59e-02 -3.8 8.05e+00 - 7.42e-01 1.00e+0
0h 1
13 3.0406902e+03 1.74e-03 2.30e-03 -3.8 3.85e-02 - 9.23e-01 1.00e+0
0h 1
14 3.0407787e+03 9.59e-05 7.87e-05 -3.8 1.29e-02 - 1.00e+00 1.00e+0
0h 1
15 3.0392740e+03 1.37e-04 1.15e-03 -5.7 4.46e-01 - 9.17e-01 1.00e+0
0h 1
16 3.0392305e+03 3.50e-05 7.44e-06 -5.7 8.71e-03 - 1.00e+00 1.00e+0
0h 1
17 3.0392357e+03 3.10e-07 4.28e-06 -5.7 8.03e-04 - 1.00e+00 1.00e+0
0h 1
18 3.0392192e+03 2.90e-08 4.21e-05 -8.6 5.53e-03 - 1.00e+00 9.52e-0
1h 1
19 3.0392184e+03 5.74e-12 5.91e-11 -8.6 2.66e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 3.0392183933661920e+00 3.0392183933661918e+0
3
Dual infeasibility......: 5.9055297810198304e-11 5.9055297810198304e-0
8
Constraint violation....: 5.7432947286883973e-12 5.7432947286883973e-1
2
Complementarity.........: 2.6707043172929188e-09 2.6707043172929188e-0
6
Overall NLP error.......: 2.6707043172929188e-09 2.6707043172929188e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6534772e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 4.97e-04 9.87e-0
3h 1
2 8.4418057e+02 9.17e+02 5.24e+01 -1.0 8.02e+02 - 8.70e-05 7.83e-0
4h 1
3 2.6276094e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 7.65e-04 2.20e-0
2h 1
4 1.2724514e+04 5.99e-02 8.02e+01 -1.0 8.97e+02 - 5.06e-02 1.00e+0
0h 1
5 4.2755874e+03 5.59e-02 5.32e+01 -1.0 7.28e+01 - 3.26e-01 6.05e-0
2f 1
6 2.6875117e+03 3.02e-02 2.76e+01 -1.0 3.88e+01 - 4.76e-01 4.33e-0
1f 1
7 2.1327114e+03 1.45e-02 2.55e+00 -1.0 1.10e+01 - 9.18e-01 1.00e+0
0f 1
8 2.4685414e+03 4.14e-04 8.58e-02 -1.0 4.14e+00 - 9.95e-01 1.00e+0
0f 1
9 1.8868395e+03 6.88e-04 3.79e-01 -2.5 7.92e+00 - 8.83e-01 7.24e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8184105e+03 2.42e-04 3.49e-01 -2.5 7.63e+00 - 8.84e-01 1.00e+0
0h 1
11 1.8111824e+03 7.43e-04 4.23e-01 -2.5 1.43e+00 - 1.00e+00 2.08e-0
1h 2
12 1.7916207e+03 9.44e-04 1.12e-02 -2.5 9.38e-01 - 1.00e+00 1.00e+0
0h 1
13 1.7620205e+03 1.22e-03 3.34e-02 -3.8 1.62e+01 - 7.94e-01 1.00e+0
0h 1
14 1.7589318e+03 2.43e-03 9.44e-04 -3.8 4.24e-02 - 1.00e+00 1.00e+0
0h 1
15 1.7592614e+03 4.62e-05 1.24e-04 -3.8 1.49e-02 - 1.00e+00 1.00e+0
0h 1
16 1.7572231e+03 1.03e-04 3.60e-04 -5.7 8.92e-01 - 9.51e-01 9.77e-0
1h 1
17 1.7571976e+03 2.27e-05 3.68e-03 -5.7 2.04e-02 - 1.00e+00 7.81e-0
1h 1
18 1.7571971e+03 8.71e-09 1.23e-06 -5.7 4.46e-03 - 1.00e+00 1.00e+0
0f 1
19 1.7571733e+03 9.04e-09 1.92e-05 -8.6 1.11e-02 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7571729e+03 1.37e-12 6.49e-11 -8.6 1.83e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.7571729231818969e+00 1.7571729231818967e+0
3
Dual infeasibility......: 6.4904741548784518e-11 6.4904741548784518e-0
8
Constraint violation....: 1.3677947663381929e-12 1.3677947663381929e-1
2
Complementarity.........: 2.7536474340694447e-09 2.7536474340694445e-0
6
Overall NLP error.......: 2.7536474340694447e-09 2.7536474340694445e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101521e-01 6.4890146112101525e+0
2
Dual infeasibility......: 4.9126605618489413e-09 4.9126605618489413e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984918224e-09 4.3646094984918221e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605618489413e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318724481455e-09 2.1031318724481455e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896894379e-09 2.8882108896894380e-0
6
Overall NLP error.......: 2.8882108896894379e-09 2.8882108896894380e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101521e-01 6.4890146112101525e+0
2
Dual infeasibility......: 4.9126605618489413e-09 4.9126605618489413e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984918224e-09 4.3646094984918221e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605618489413e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.04e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.57e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235660171e+00 1.6104063235660171e+0
3
Dual infeasibility......: 2.4574009793760635e-12 2.4574009793760635e-0
9
Constraint violation....: 7.5703172614159067e-16 7.5703172614159067e-1
6
Complementarity.........: 2.5062163919681798e-09 2.5062163919681799e-0
6
Overall NLP error.......: 2.5062163919681798e-09 2.5062163919681799e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2252293e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 3.31e-04 9.88e-0
3h 1
2 7.9742303e+02 9.17e+02 5.24e+01 -1.0 8.18e+02 - 9.71e-05 9.16e-0
4h 1
3 2.4312288e+02 8.97e+02 5.26e+01 -1.0 9.17e+02 - 9.08e-04 2.09e-0
2h 1
4 1.2260850e+04 5.54e-02 8.24e+01 -1.0 8.98e+02 - 3.89e-02 1.00e+0
0h 1
5 3.8743081e+03 5.28e-02 5.49e+01 -1.0 7.96e+01 - 3.31e-01 5.07e-0
2f 1
6 1.9080741e+03 3.72e-02 2.92e+01 -1.0 3.93e+01 - 4.71e-01 5.03e-0
1f 1
7 4.6563841e+03 1.22e-02 2.61e+01 -1.0 2.04e+01 - 4.03e-01 1.00e+0
0h 1
8 1.8744334e+03 1.17e-02 9.66e-01 -1.0 2.51e+01 - 9.88e-01 8.98e-0
1f 1
9 1.6954233e+03 5.10e-04 6.26e-02 -1.7 6.76e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5627878e+03 1.96e-03 2.19e-01 -2.5 1.25e+01 - 7.43e-01 1.00e+0
0f 1
11 1.5309769e+03 3.67e-03 1.04e-01 -2.5 2.12e+00 - 1.00e+00 9.19e-0
1h 1
12 1.5388648e+03 1.31e-04 3.49e-03 -2.5 1.16e+00 - 1.00e+00 1.00e+0
0h 1
13 1.5037418e+03 1.63e-04 2.17e-02 -3.8 1.88e+01 - 9.93e-01 9.32e-0
1h 1
14 1.5022722e+03 7.65e-07 7.15e-05 -3.8 1.24e+00 - 1.00e+00 1.00e+0
0f 1
15 1.5003196e+03 3.77e-07 1.78e-04 -5.7 1.04e+00 - 1.00e+00 9.96e-0
1h 1
16 1.5003172e+03 3.80e-11 2.94e-09 -5.7 1.11e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.29e-02 - 1.00e+00 1.00e+0
0h 1
1 8.6513592e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 4.97e-04 9.88e-0
3h 1
2 8.3600930e+02 9.17e+02 5.24e+01 -1.0 8.33e+02 - 9.54e-05 1.08e-0
3h 1
3 2.6322504e+02 8.96e+02 5.25e+01 -1.0 9.17e+02 - 1.07e-03 2.19e-0
2h 1
4 1.2573574e+04 6.02e-02 8.02e+01 -1.0 8.97e+02 - 5.13e-02 1.00e+0
0h 1
5 4.2599275e+03 5.61e-02 5.27e+01 -1.0 7.19e+01 - 3.32e-01 6.13e-0
2f 1
6 2.6731519e+03 3.02e-02 2.71e+01 -1.0 3.87e+01 - 4.79e-01 4.34e-0
1f 1
46 1.647702e+04 1.632511e+04 4.212128e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1152978e+02 1.57e+04 5.50e+01 -1.0 1.59e+04 - 1.75e-04 9.81e-0
3h 1
2 7.0846243e+02 1.57e+04 5.50e+01 -1.0 1.30e+04 - 2.16e-05 1.20e-0
4h 1
3 7.0526345e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 2.49e-05 2.57e-0
4h 1
4 7.0311262e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 2.82e-04 1.79e-0
4h 1
5 4.8691860e+02 1.54e+04 9.27e+01 -1.0 1.57e+04 - 4.91e-04 1.90e-0
2f 1
6 2.6347957e+04 7.61e-02 8.69e+01 -1.0 1.54e+04 - 2.53e-02 1.00e+0
0h 1
7 1.7888436e+04 7.33e-02 7.35e+01 -1.0 7.39e+01 - 1.62e-01 3.98e-0
2f 1
8 1.6628115e+04 4.64e-02 3.41e+01 -1.0 1.96e+01 - 5.30e-01 3.77e-0
1f 1
9 1.6878829e+04 4.07e-02 1.01e+01 -1.0 1.34e+01 - 5.66e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6796921e+04 6.79e-03 3.07e+00 -1.0 8.49e-01 - 7.89e-01 1.00e+0
0h 1
11 1.6814563e+04 2.69e-04 1.89e+00 -1.0 1.93e+00 - 2.99e-01 1.00e+0
0f 1
12 1.6821084e+04 7.29e-06 5.44e-01 -1.0 1.73e+00 - 7.31e-01 1.00e+0
0f 1
13 1.6525996e+04 2.23e-04 2.69e-01 -1.7 4.73e+00 - 8.58e-01 7.93e-0
1f 1
14 1.6476900e+04 5.39e-04 3.55e-01 -1.7 6.37e+00 - 5.84e-01 1.00e+0
0f 1
15 1.6477050e+04 7.03e-05 8.58e-02 -1.7 1.28e+01 - 6.59e-01 1.00e+0
0h 1
16 1.6370320e+04 9.29e-04 5.12e-02 -2.5 1.15e+01 - 9.25e-01 1.00e+0
0f 1
17 1.6345235e+04 1.14e-03 1.22e-02 -2.5 5.48e+00 - 1.00e+00 1.00e+0
0h 1
18 1.6327660e+04 1.92e-04 8.59e-02 -3.8 6.27e+00 - 1.00e+00 8.53e-0
1h 1
19 1.6326251e+04 6.56e-07 1.02e-04 -3.8 4.78e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325265e+04 3.87e-07 7.26e-03 -5.7 2.62e-01 - 1.00e+00 8.34e-0
1h 1
21 1.6325119e+04 1.11e-08 3.70e-07 -5.7 1.28e-02 - 1.00e+00 1.00e+0
0f 1
22 1.6325105e+04 1.12e-10 2.78e-06 -8.6 2.26e-03 - 1.00e+00 9.95e-0
1h 1
23 1.6325105e+04 1.39e-15 4.28e-14 -8.6 2.21e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 23
(scaled) (unscaled)
Objective...............: 1.6325105261433350e+01 1.6325105261433349e+0
4
Dual infeasibility......: 4.2798763762439448e-14 4.2798763762439448e-1
1
Constraint violation....: 1.3877787807814457e-15 1.3877787807814457e-1
5
Complementarity.........: 2.5060278778205503e-09 2.5060278778205501e-0
6
Overall NLP error.......: 2.5060278778205503e-09 2.5060278778205501e-0
6
Number of objective function evaluations = 27
Number of objective gradient evaluations = 24
Number of equality constraint evaluations = 27
Number of inequality constraint evaluations = 27
Number of equality constraint Jacobian evaluations = 24
Number of inequality constraint Jacobian evaluations = 24
Number of Lagrangian Hessian evaluations = 23
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.4941815e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.08e-04 9.80e-0
3f 1
2 7.4648223e+02 1.50e+04 5.25e+01 -1.0 1.38e+04 - 3.30e-05 1.08e-0
4h 1
3 7.4391355e+02 1.50e+04 5.25e+01 -1.0 1.49e+04 - 1.15e-05 1.92e-0
4h 1
4 7.3579771e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 2.00e-04 6.20e-0
4h 1
5 4.9875218e+02 1.47e+04 5.28e+01 -1.0 1.50e+04 - 8.42e-04 1.95e-0
2f 1
6 2.5693365e+04 6.61e-02 8.55e+01 -1.0 1.47e+04 - 2.81e-02 1.00e+0
0h 1
7 1.7367219e+04 6.36e-02 6.90e+01 -1.0 7.63e+01 - 1.99e-01 4.19e-0
2f 1
8 1.5906450e+04 4.58e-02 3.33e+01 -1.0 2.56e+01 - 5.12e-01 4.15e-0
1f 1
9 1.6185532e+04 3.39e-02 1.23e+01 -1.0 1.51e+01 - 4.98e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6018914e+04 5.43e-03 1.64e-01 -1.0 2.59e+00 - 9.91e-01 1.00e+0
0h 1
11 1.5732552e+04 9.26e-04 2.27e-01 -1.7 5.19e+00 - 1.00e+00 8.86e-0
1f 1
12 1.5730076e+04 7.53e-04 1.81e-01 -1.7 3.82e+01 - 3.59e-01 1.00e+0
0f 1
13 1.5594177e+04 1.05e-03 5.86e-02 -2.5 3.94e+01 - 9.19e-01 1.00e+0
0f 1
14 1.5579304e+04 1.10e-03 1.46e-02 -2.5 2.07e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5562369e+04 1.93e-04 9.51e-02 -3.8 5.50e+00 - 1.00e+00 8.44e-0
1h 1
16 1.5560425e+04 1.41e-06 1.23e-04 -3.8 8.00e-01 - 1.00e+00 1.00e+0
0h 1
17 1.5559215e+04 3.89e-07 1.13e-04 -5.7 2.97e-01 - 1.00e+00 9.97e-0
1h 1
18 1.5559217e+04 3.84e-11 3.07e-09 -5.7 1.57e-02 - 1.00e+00 1.00e+0
0f 1
19 1.5559202e+04 6.30e-11 2.06e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.5559202141390299e+01 1.5559202141390298e+0
4
Dual infeasibility......: 2.0615876389673965e-09 2.0615876389673965e-0
6
Constraint violation....: 6.2993596450233724e-11 6.2993596450233724e-1
1
Complementarity.........: 2.8882101088775525e-09 2.8882101088775524e-0
6
Overall NLP error.......: 2.8882101088775525e-09 2.8882101088775524e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6705925e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 5.00e-04 9.80e-0
3h 1
2 8.6427892e+02 1.39e+04 5.24e+01 -1.0 1.37e+04 - 9.09e-05 1.01e-0
4h 1
3 8.5516598e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 3.12e-06 6.57e-0
4f 1
4 5.5771582e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 7.06e-04 2.21e-0
2h 1
5 2.5732924e+04 5.99e-02 8.01e+01 -1.0 1.36e+04 - 5.07e-02 1.00e+0
0h 1
6 1.7262578e+04 5.59e-02 5.33e+01 -1.0 7.27e+01 - 3.24e-01 6.05e-0
2f 1
7 1.5683198e+04 3.03e-02 2.76e+01 -1.0 3.87e+01 - 4.75e-01 4.32e-0
1f 1
8 1.5397221e+04 1.45e-02 2.54e+00 -1.0 1.10e+01 - 9.18e-01 5.00e-0
1f 2
9 1.5237084e+04 7.15e-03 1.80e+00 -1.0 7.81e+00 - 1.00e+00 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5341887e+04 5.52e-04 4.31e-02 -1.0 9.95e+01 - 1.00e+00 1.00e+0
0f 1
11 1.4906631e+04 4.46e-04 9.52e-01 -2.5 9.82e+01 - 9.17e-01 5.86e-0
1f 1
12 1.4786193e+04 2.10e-04 2.19e-01 -2.5 4.01e+01 - 9.27e-01 1.00e+0
0f 1
13 1.4760324e+04 3.02e-03 1.87e-02 -2.5 1.15e+00 - 1.00e+00 1.00e+0
0h 1
14 1.4746977e+04 7.85e-04 3.47e-02 -3.8 2.68e+00 - 8.07e-01 1.00e+0
0h 1
15 1.4744065e+04 2.11e-03 1.02e-03 -3.8 4.73e-02 - 1.00e+00 1.00e+0
0h 1
16 1.4744280e+04 5.00e-05 1.18e-04 -3.8 1.23e-02 - 1.00e+00 1.00e+0
0h 1
17 1.4742979e+04 1.02e-04 3.64e-04 -5.7 1.49e-01 - 9.50e-01 9.77e-0
1h 1
18 1.4742966e+04 2.32e-05 3.60e-03 -5.7 3.42e-03 - 1.00e+00 7.74e-0
1h 1
19 1.4742970e+04 9.44e-09 1.30e-06 -5.7 7.71e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.4742955e+04 9.21e-09 1.89e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
21 1.4742955e+04 1.34e-12 6.44e-11 -8.6 3.08e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.4742954569083699e+01 1.4742954569083699e+0
4
Dual infeasibility......: 6.4389291747558799e-11 6.4389291747558806e-0
8
Constraint violation....: 1.3418155475619642e-12 1.3418155475619642e-1
2
Complementarity.........: 2.5093248055366727e-09 2.5093248055366728e-0
6
Overall NLP error.......: 2.5093248055366727e-09 2.5093248055366728e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4548237e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.98e-04 9.80e-0
3h 1
2 8.4261832e+02 1.27e+04 5.24e+01 -1.0 1.20e+04 - 4.62e-05 1.04e-0
4h 1
3 8.0309466e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 7.81e-06 2.58e-0
3h 1
4 5.2937834e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 2.80e-03 2.08e-0
2h 1
5 2.3335798e+04 5.94e-02 8.14e+01 -1.0 1.24e+04 - 4.97e-02 1.00e+0
0h 1
6 1.5690537e+04 5.54e-02 4.84e+01 -1.0 7.33e+01 - 3.95e-01 6.13e-0
2f 1
7 1.3663628e+04 3.60e-02 2.49e+01 -1.0 4.16e+01 - 4.90e-01 5.24e-0
1f 1
8 1.4305428e+04 1.31e-02 2.79e+00 -1.0 1.59e+01 - 7.96e-01 5.00e-0
1f 2
9 1.3827023e+04 4.20e-03 1.76e-01 -1.0 7.73e+00 - 9.59e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3455833e+04 1.11e-03 3.89e-01 -1.7 5.64e+00 - 1.00e+00 8.15e-0
1f 1
11 1.3431557e+04 4.90e-04 2.48e-02 -1.7 3.49e+01 - 1.00e+00 1.00e+0
0f 1
12 1.3269592e+04 1.39e-03 1.20e-01 -3.8 3.98e+01 - 7.60e-01 9.23e-0
1f 1
13 1.3232163e+04 2.74e-03 2.16e-02 -3.8 3.01e+00 - 8.07e-01 8.28e-0
1h 1
14 1.3233886e+04 3.09e-04 1.34e-01 -3.8 5.17e-01 - 1.00e+00 9.07e-0
1h 1
15 1.3234267e+04 4.98e-07 2.20e-05 -3.8 2.38e-01 - 1.00e+00 1.00e+0
0f 1
16 1.3233079e+04 4.18e-07 2.33e-03 -5.7 2.97e-01 - 1.00e+00 9.77e-0
1h 1
17 1.3233066e+04 4.90e-11 2.26e-08 -5.7 5.81e-02 - 1.00e+00 1.00e+0
0f 1
18 1.3233051e+04 6.30e-11 4.40e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.3233050919175101e+01 1.3233050919175101e+0
4
Dual infeasibility......: 4.3985739769238861e-09 4.3985739769238861e-0
6
Constraint violation....: 6.2986837967571319e-11 6.2986837967571319e-1
1
Complementarity.........: 4.3669669910479633e-09 4.3669669910479633e-0
6
Overall NLP error.......: 4.3985739769238861e-09 4.3985739769238861e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9390925e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 7.36e-04 9.80e-0
3h 1
2 8.9114580e+02 1.11e+04 5.24e+01 -1.0 1.09e+04 - 8.71e-05 1.01e-0
4h 1
3 8.7699458e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 4.00e-06 8.64e-0
4f 1
4 5.1654462e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 9.51e-04 2.26e-0
2h 1
5 2.3113368e+04 6.38e-02 7.80e+01 -1.0 1.09e+04 - 6.86e-02 1.00e+0
0h 1
6 1.4800903e+04 5.84e-02 4.87e+01 -1.0 5.06e+01 - 3.59e-01 7.66e-0
2f 1
7 1.3498114e+04 2.72e-02 2.14e+01 -1.0 2.34e+01 - 5.52e-01 4.91e-0
1f 1
8 1.2984685e+04 7.25e-03 1.23e+00 -1.0 8.92e+00 - 9.34e-01 7.40e-0
1f 1
9 1.3240019e+04 3.31e-04 8.02e-02 -1.0 2.89e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2647722e+04 2.08e-03 8.97e-02 -2.5 4.40e+00 - 8.63e-01 8.31e-0
1f 1
11 1.2468673e+04 2.17e-03 3.37e-01 -2.5 1.07e+00 - 1.00e+00 7.82e-0
1f 1
12 1.2440257e+04 1.67e-04 5.00e-03 -2.5 2.11e-01 - 1.00e+00 1.00e+0
0h 1
13 1.2421226e+04 3.20e-05 7.06e-02 -3.8 2.68e+00 - 1.00e+00 8.33e-0
1h 1
14 1.2418854e+04 8.62e-08 5.92e-04 -3.8 4.47e-01 - 1.00e+00 1.00e+0
0f 1
15 1.2417578e+04 3.83e-08 2.36e-04 -5.7 1.49e-01 - 1.00e+00 9.94e-0
1f 1
16 1.2417576e+04 1.89e-12 1.48e-08 -5.7 9.02e-04 - 1.00e+00 1.00e+0
0f 1
17 1.2417561e+04 2.56e-12 1.76e-07 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
18 1.2417561e+04 4.71e-15 2.53e-14 -8.6 7.92e-08 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.2417560892756274e+01 1.2417560892756273e+0
4
Dual infeasibility......: 2.5313084961453569e-14 2.5313084961453569e-1
1
Constraint violation....: 4.7090514931798967e-15 4.7090514931798967e-1
5
Complementarity.........: 2.5059081041156594e-09 2.5059081041156591e-0
6
Overall NLP error.......: 2.5059081041156594e-09 2.5059081041156591e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3005826e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 2.02e-03 9.80e-0
3h 1
2 9.2703232e+02 9.19e+03 5.23e+01 -1.0 8.09e+03 - 2.76e-05 1.12e-0
4h 1
3 7.5783090e+02 9.11e+03 5.23e+01 -1.0 9.19e+03 - 1.67e-05 9.02e-0
3f 1
4 5.7019959e+02 8.91e+03 5.19e+01 -1.0 9.11e+03 - 1.10e-02 2.10e-0
2h 1
5 1.8305219e+04 8.28e-02 7.82e+01 -1.0 8.91e+03 - 8.71e-02 1.00e+0
0h 1
6 1.3289624e+04 7.37e-02 2.12e+01 -1.0 7.99e+00 - 7.08e-01 1.04e-0
1f 1
7 1.2190257e+04 3.47e-02 3.50e+00 -1.0 6.47e+00 - 8.56e-01 9.70e-0
1f 1
8 1.2545395e+04 3.12e-02 3.83e-01 -1.0 2.06e+00 - 9.66e-01 9.51e-0
1f 1
9 1.2159940e+04 4.33e-03 1.32e+00 -1.7 7.76e+00 - 3.83e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2137430e+04 3.25e-04 5.08e-01 -1.7 8.89e+00 - 7.60e-01 1.00e+0
0h 1
11 1.2156302e+04 1.27e-04 2.59e-02 -1.7 1.36e+01 - 9.58e-01 1.00e+0
0f 1
12 1.1991430e+04 4.15e-04 1.87e-02 -2.5 2.60e+01 - 9.80e-01 9.60e-0
1f 1
13 1.1969949e+04 1.01e-04 1.54e-01 -3.8 6.98e+00 - 1.00e+00 7.79e-0
1h 1
14 1.1965351e+04 1.79e-07 1.18e-04 -3.8 1.55e+00 - 1.00e+00 1.00e+0
0f 1
15 1.1964015e+04 1.77e-08 3.00e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
16 1.1963999e+04 1.29e-12 4.23e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.1963999143073591e+01 1.1963999143073592e+0
4
Dual infeasibility......: 4.2327334259482455e-10 4.2327334259482455e-0
7
Constraint violation....: 1.2900513990388163e-12 1.2900513990388163e-1
2
Complementarity.........: 4.2901319668912851e-09 4.2901319668912853e-0
6
Overall NLP error.......: 4.2901319668912851e-09 4.2901319668912853e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3710605e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 3.06e-03 9.80e-0
3h 1
2 9.3410771e+02 6.71e+03 5.23e+01 -1.0 6.33e+03 - 5.53e-05 1.05e-0
4h 1
3 8.7601628e+02 6.69e+03 5.23e+01 -1.0 6.70e+03 - 8.90e-06 2.62e-0
3f 1
4 4.4078555e+02 6.54e+03 5.23e+01 -1.0 6.69e+03 - 3.32e-03 2.17e-0
2h 1
5 1.7952487e+04 7.75e-02 7.79e+01 -1.0 6.54e+03 - 7.84e-02 1.00e+0
0h 1
6 1.1162158e+04 7.00e-02 2.30e+01 -1.0 4.32e+00 - 6.80e-01 8.97e-0
2f 1
7 1.0161093e+04 3.32e-02 7.43e+00 -1.0 4.23e+00 - 7.42e-01 1.00e+0
0f 1
8 1.0283900e+04 1.70e-02 7.27e-01 -1.0 1.10e+00 - 9.96e-01 4.94e-0
1f 2
9 1.0000013e+04 8.27e-03 3.35e-01 -1.7 1.28e+01 - 1.00e+00 8.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.9361941e+03 1.02e-03 1.04e-01 -1.7 8.95e+00 - 1.00e+00 1.00e+0
0f 1
11 9.8169976e+03 2.77e-04 1.12e-01 -2.5 1.73e+01 - 9.89e-01 8.85e-0
1f 1
12 9.8069007e+03 4.94e-06 1.10e-03 -2.5 1.95e+00 - 1.00e+00 1.00e+0
0f 1
13 9.7851225e+03 5.56e-06 7.61e-04 -3.8 2.68e+00 - 1.00e+00 1.00e+0
0f 1
14 9.7842068e+03 3.44e-09 3.52e-06 -5.7 1.48e-01 - 1.00e+00 1.00e+0
0h 1
15 9.7841926e+03 2.34e-12 4.09e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 9.7841925857627174e+00 9.7841925857627175e+0
3
Dual infeasibility......: 4.0868851789181956e-10 4.0868851789181956e-0
7
Constraint violation....: 2.3423346595663475e-12 2.3423346595663475e-1
2
Complementarity.........: 2.5729802580314622e-09 2.5729802580314621e-0
6
Overall NLP error.......: 2.5729802580314622e-09 2.5729802580314621e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0882880e+02 4.77e+03 5.23e+01 -1.0 4.81e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0434947e+02 4.77e+03 5.23e+01 -1.0 2.68e+03 - 2.39e-05 1.77e-0
4h 1
3 3.7454299e+02 4.66e+03 5.24e+01 -1.0 4.77e+03 - 8.76e-05 2.34e-0
2f 1
4 1.7328207e+04 6.52e-02 8.01e+01 -1.0 4.66e+03 - 3.59e-02 1.00e+0
0h 1
5 8.8756218e+03 6.18e-02 5.99e+01 -1.0 3.67e+01 - 2.49e-01 4.75e-0
2f 1
6 7.5823595e+03 1.99e-02 2.80e+01 -1.0 1.63e+01 - 5.44e-01 6.25e-0
1f 1
7 7.1823255e+03 5.26e-03 8.31e-01 -1.0 5.07e+00 - 9.59e-01 7.94e-0
1f 1
8 7.4507207e+03 1.50e-04 6.10e-02 -1.0 5.80e+00 - 1.00e+00 1.00e+0
0f 1
9 6.8804600e+03 2.15e-03 8.62e-02 -2.5 5.25e+00 - 8.55e-01 8.54e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.7212292e+03 2.16e-03 4.08e-01 -2.5 9.22e-01 - 1.00e+00 7.65e-0
1f 1
11 6.6966339e+03 1.20e-04 4.68e-03 -2.5 2.02e-01 - 1.00e+00 1.00e+0
0h 1
12 6.6735647e+03 3.19e-05 1.43e-01 -3.8 1.07e+01 - 1.00e+00 7.63e-0
1h 1
13 6.6675769e+03 1.22e-07 3.35e-04 -3.8 2.53e+00 - 1.00e+00 1.00e+0
0f 1
14 6.6659095e+03 2.86e-08 1.00e-03 -5.7 5.94e-01 - 1.00e+00 9.85e-0
1f 1
15 6.6658896e+03 1.94e-12 1.40e-08 -5.7 8.99e-03 - 1.00e+00 1.00e+0
0f 1
16 6.6658693e+03 2.63e-12 4.48e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.6658693417840809e+00 6.6658693417840805e+0
3
Dual infeasibility......: 4.4776954081637905e-09 4.4776954081637905e-0
6
Constraint violation....: 2.6309301959237530e-12 2.6309301959237530e-1
2
Complementarity.........: 3.6084974564613722e-09 3.6084974564613720e-0
6
Overall NLP error.......: 4.4776954081637905e-09 4.4776954081637905e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2294726e+02 3.24e+03 5.23e+01 -1.0 3.27e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1945201e+02 3.24e+03 5.23e+01 -1.0 2.47e+03 - 3.93e-05 1.30e-0
4h 1
3 3.4573144e+02 3.17e+03 5.24e+01 -1.0 3.24e+03 - 4.04e-05 2.36e-0
2f 1
4 1.5906615e+04 6.81e-02 7.93e+01 -1.0 3.17e+03 - 4.21e-02 1.00e+0
0h 1
5 7.5933644e+03 6.41e-02 5.66e+01 -1.0 2.00e+01 - 2.81e-01 5.33e-0
2f 1
6 6.3092956e+03 1.54e-02 2.51e+01 -1.0 1.01e+01 - 5.90e-01 8.06e-0
1f 1
7 6.3346293e+03 6.22e-03 2.30e-01 -1.0 1.94e+00 - 9.91e-01 1.00e+0
0f 1
8 5.9359407e+03 1.57e-03 8.91e-02 -1.7 4.62e+00 - 9.95e-01 9.66e-0
1f 1
9 5.7777772e+03 1.79e-03 5.16e-01 -2.5 1.14e+00 - 1.00e+00 7.50e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.7447823e+03 3.35e-04 1.05e-01 -2.5 2.95e-01 - 1.00e+00 8.93e-0
1h 1
11 5.7477770e+03 1.18e-05 4.11e-03 -2.5 2.93e-02 - 1.00e+00 1.00e+0
0f 1
12 5.7228430e+03 1.06e-05 7.82e-03 -3.8 5.36e+00 - 1.00e+00 9.62e-0
1f 1
13 5.7223579e+03 1.57e-08 1.35e-05 -3.8 2.01e-01 - 1.00e+00 1.00e+0
0f 1
14 5.7210148e+03 1.79e-08 5.06e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0f 1
15 5.7210000e+03 6.40e-13 4.11e-10 -8.6 3.67e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.7210000343937732e+00 5.7210000343937727e+0
3
Dual infeasibility......: 4.1143068708749176e-10 4.1143068708749176e-0
7
Constraint violation....: 6.4032112945255903e-13 6.4032112945255903e-1
3
Complementarity.........: 3.0734889167473993e-09 3.0734889167473993e-0
6
Overall NLP error.......: 3.0734889167473993e-09 3.0734889167473993e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1583257e+02 2.00e+03 5.23e+01 -1.0 2.01e+03 - 1.20e-03 9.81e-0
3h 1
2 9.1195716e+02 2.00e+03 5.23e+01 -1.0 1.37e+03 - 4.87e-05 1.44e-0
4h 1
3 3.1303385e+02 1.95e+03 5.24e+01 -1.0 2.00e+03 - 6.04e-05 2.36e-0
2f 1
4 1.4608110e+04 6.65e-02 7.72e+01 -1.0 1.95e+03 - 6.92e-02 1.00e+0
0h 1
5 6.1485043e+03 6.09e-02 3.60e+01 -1.0 2.22e+01 - 5.08e-01 7.70e-0
2f 1
6 4.6744427e+03 1.15e-02 1.62e+01 -1.0 1.30e+01 - 6.04e-01 8.35e-0
1f 1
7 4.8737737e+03 2.78e-03 1.37e-01 -1.0 3.28e+00 - 9.92e-01 1.00e+0
0f 1
8 4.4144923e+03 1.77e-03 1.46e-01 -1.7 7.24e+00 - 1.00e+00 1.00e+0
0f 1
9 4.2301474e+03 2.01e-03 3.83e-01 -2.5 2.16e+00 - 1.00e+00 7.84e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2032539e+03 1.87e-04 1.95e-02 -2.5 4.49e-01 - 1.00e+00 9.81e-0
1f 1
11 4.1817214e+03 1.90e-06 1.87e-02 -3.8 5.38e+00 - 9.84e-01 1.00e+0
0h 1
12 4.1818471e+03 1.75e-09 4.85e-06 -3.8 6.74e-03 - 1.00e+00 1.00e+0
0h 1
13 4.1805081e+03 1.80e-08 1.81e-04 -5.7 2.97e-01 - 1.00e+00 9.96e-0
1f 1
14 4.1805057e+03 1.80e-12 2.29e-09 -5.7 1.19e-03 - 1.00e+00 1.00e+0
0f 1
15 4.1804892e+03 2.63e-12 1.52e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 4.1804891604710717e+00 4.1804891604710720e+0
3
Dual infeasibility......: 1.5189630656236394e-09 1.5189630656236394e-0
6
Constraint violation....: 2.6291052668270254e-12 2.6291052668270254e-1
2
Complementarity.........: 2.8635057178476845e-09 2.8635057178476844e-0
6
Overall NLP error.......: 2.8635057178476845e-09 2.8635057178476844e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0774891e+02 9.17e+02 5.23e+01 -1.0 9.20e+02 - 1.00e-03 9.88e-0
3h 1
2 8.4540605e+02 9.15e+02 5.23e+01 -1.0 8.79e+02 - 9.05e-05 2.34e-0
3h 1
3 2.8754281e+02 8.95e+02 5.24e+01 -1.0 9.15e+02 - 2.40e-03 2.22e-0
2h 1
4 1.2444230e+04 6.81e-02 7.68e+01 -1.0 8.95e+02 - 8.41e-02 1.00e+0
0h 1
5 4.8011316e+03 6.12e-02 3.59e+01 -1.0 2.80e+01 - 5.07e-01 9.21e-0
2f 1
6 3.2963791e+03 1.99e-02 1.39e+01 -1.0 1.52e+01 - 6.35e-01 7.55e-0
1f 1
7 3.4752862e+03 3.85e-03 1.40e-01 -1.0 2.22e+00 - 9.91e-01 1.00e+0
0f 1
8 3.0360691e+03 1.49e-03 1.32e-01 -1.7 1.06e+01 - 1.00e+00 1.00e+0
0f 1
9 2.8726135e+03 2.09e-03 3.80e-01 -2.5 8.64e+00 - 1.00e+00 7.98e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8512491e+03 1.42e-04 5.20e-03 -2.5 1.61e+00 - 1.00e+00 1.00e+0
0h 1
11 2.8231372e+03 3.90e-05 1.76e-01 -3.8 1.88e+01 - 1.00e+00 7.42e-0
1h 1
12 2.8145167e+03 1.54e-07 3.47e-04 -3.8 4.81e+00 - 1.00e+00 1.00e+0
0f 1
13 2.8124164e+03 2.74e-08 1.03e-03 -5.7 1.04e+00 - 1.00e+00 9.85e-0
1f 1
14 2.8123895e+03 1.97e-12 1.40e-08 -5.7 1.58e-02 - 1.00e+00 1.00e+0
0f 1
15 2.8123637e+03 2.63e-12 4.48e-09 -8.6 1.29e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 2.8123637193407984e+00 2.8123637193407985e+0
3
Dual infeasibility......: 4.4777065368727102e-09 4.4777065368727102e-0
6
Constraint violation....: 2.6308677458786178e-12 2.6308677458786178e-1
2
Complementarity.........: 3.6085007503719537e-09 3.6085007503719536e-0
6
Overall NLP error.......: 4.4777065368727102e-09 4.4777065368727102e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.03e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.45e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643326e+00 1.6104063281643325e+0
3
Dual infeasibility......: 2.4577488759278421e-12 2.4577488759278421e-0
9
Constraint violation....: 7.4511016092546002e-16 7.4511016092546002e-1
6
Complementarity.........: 2.5062163910047563e-09 2.5062163910047562e-0
6
Overall NLP error.......: 2.5062163910047563e-09 2.5062163910047562e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031320943025915e-09 2.1031320943025915e-0
6
Constraint violation....: 6.2994179317321652e-11 6.2994179317321652e-1
1
Complementarity.........: 2.8882108896920311e-09 2.8882108896920312e-0
6
Overall NLP error.......: 2.8882108896920311e-09 2.8882108896920312e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254210124e-01 6.4890146254210117e+0
2
Dual infeasibility......: 4.9126604805733771e-09 4.9126604805733771e-0
6
Constraint violation....: 6.2123813870940126e-09 6.2123813870940126e-0
9
Complementarity.........: 4.3646095252459305e-09 4.3646095252459303e-0
6
Overall NLP error.......: 6.2123813870940126e-09 4.9126604805733771e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.03e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.45e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643326e+00 1.6104063281643325e+0
3
Dual infeasibility......: 2.4577488759278421e-12 2.4577488759278421e-0
9
Constraint violation....: 7.4511016092546002e-16 7.4511016092546002e-1
6
Complementarity.........: 2.5062163910047563e-09 2.5062163910047562e-0
6
Overall NLP error.......: 2.5062163910047563e-09 2.5062163910047562e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2278083e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 3.31e-04 9.87e-0
3h 1
2 8.0391474e+02 9.17e+02 5.24e+01 -1.0 7.85e+02 - 8.87e-05 6.88e-0
4h 1
3 2.4271271e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 6.68e-04 2.10e-0
2h 1
4 1.2385916e+04 5.52e-02 8.23e+01 -1.0 8.98e+02 - 3.86e-02 1.00e+0
0h 1
5 3.8851959e+03 5.26e-02 5.59e+01 -1.0 8.06e+01 - 3.19e-01 5.02e-0
2f 1
6 1.9099004e+03 3.73e-02 2.99e+01 -1.0 3.93e+01 - 4.69e-01 5.04e-0
1f 1
7 4.6737272e+03 1.22e-02 2.67e+01 -1.0 2.06e+01 - 4.01e-01 1.00e+0
0h 1
8 1.8754601e+03 1.19e-02 1.01e+00 -1.0 2.53e+01 - 9.88e-01 8.94e-0
1f 1
9 2.0005994e+03 1.84e-04 4.66e-02 -1.0 3.18e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7351413e+03 2.16e-04 1.24e+00 -2.5 1.71e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5469297e+03 3.76e-03 1.33e-01 -2.5 7.60e+00 - 7.95e-01 1.00e+0
0f 1
12 1.5237159e+03 5.30e-03 3.11e-01 -2.5 1.84e+00 - 1.00e+00 7.66e-0
1h 1
13 1.5360639e+03 2.44e-04 4.74e-03 -2.5 7.11e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5034784e+03 1.70e-04 2.15e-02 -3.8 1.62e+01 - 9.91e-01 9.29e-0
1h 1
15 1.5021214e+03 7.21e-07 6.83e-05 -3.8 1.10e+00 - 1.00e+00 1.00e+0
0h 1
16 1.5003172e+03 3.77e-07 1.78e-04 -5.7 8.92e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003154e+03 3.79e-11 2.92e-09 -5.7 4.18e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.11e-02 - 1.00e+00 1.00e+0
0h 1
1 8.6534772e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 4.97e-04 9.87e-0
3h 1
2 8.4418057e+02 9.17e+02 5.24e+01 -1.0 8.02e+02 - 8.70e-05 7.83e-0
4h 1
3 2.6276094e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 7.65e-04 2.20e-0
2h 1
4 1.2724514e+04 5.99e-02 8.02e+01 -1.0 8.97e+02 - 5.06e-02 1.00e+0
0h 1
5 4.2755874e+03 5.59e-02 5.32e+01 -1.0 7.28e+01 - 3.26e-01 6.05e-0
2f 1
47 1.980418e+04 1.632511e+04 4.267805e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6791917e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.81e-0
3h 1
2 7.6469952e+02 1.57e+04 5.25e+01 -1.0 1.19e+04 - 1.83e-05 1.30e-0
4h 1
3 7.6208450e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 3.58e-05 2.07e-0
4h 1
4 7.6048635e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 2.41e-04 1.30e-0
4h 1
5 5.2143025e+02 1.54e+04 1.47e+02 -1.0 1.57e+04 - 3.86e-04 2.00e-0
2f 1
6 2.6801050e+04 6.08e-02 8.48e+01 -1.0 1.54e+04 - 2.94e-02 1.00e+0
0h 1
7 1.8274004e+04 5.84e-02 6.76e+01 -1.0 7.97e+01 - 2.09e-01 4.27e-0
2f 1
8 1.6691799e+04 4.49e-02 3.35e+01 -1.0 2.87e+01 - 5.00e-01 4.36e-0
1f 1
9 1.6988051e+04 3.06e-02 1.35e+01 -1.0 1.62e+01 - 4.67e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6780308e+04 5.30e-03 3.36e+00 -1.0 3.73e+00 - 8.16e-01 1.00e+0
0h 1
11 1.6827047e+04 3.00e-04 2.01e+00 -1.0 1.40e+00 - 2.75e-01 1.00e+0
0f 1
12 1.6826333e+04 1.15e-05 4.57e-01 -1.0 1.00e+00 - 7.59e-01 1.00e+0
0f 1
13 1.6529607e+04 2.25e-04 2.69e-01 -1.7 4.84e+00 - 8.51e-01 7.79e-0
1f 1
14 1.6477478e+04 5.40e-04 3.89e-01 -1.7 5.49e+00 - 5.74e-01 1.00e+0
0f 1
15 1.6475497e+04 7.78e-05 1.03e-01 -1.7 1.17e+01 - 6.30e-01 1.00e+0
0h 1
16 1.6370724e+04 9.43e-04 5.62e-02 -2.5 8.57e+00 - 9.20e-01 1.00e+0
0f 1
17 1.6345392e+04 1.19e-03 1.29e-02 -2.5 5.61e+00 - 1.00e+00 1.00e+0
0h 1
18 1.6327650e+04 2.03e-04 9.01e-02 -3.8 6.61e+00 - 1.00e+00 8.49e-0
1h 1
19 1.6326251e+04 6.61e-07 1.08e-04 -3.8 4.39e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325267e+04 3.88e-07 7.42e-03 -5.7 2.62e-01 - 1.00e+00 8.32e-0
1h 1
21 1.6325119e+04 1.13e-08 3.82e-07 -5.7 5.72e-03 - 1.00e+00 1.00e+0
0f 1
22 1.6325105e+04 1.13e-10 2.80e-06 -8.6 2.26e-03 - 1.00e+00 9.95e-0
1h 1
23 1.6325105e+04 1.42e-14 4.30e-14 -8.6 2.53e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 23
(scaled) (unscaled)
Objective...............: 1.6325105261433350e+01 1.6325105261433349e+0
4
Dual infeasibility......: 4.3017094313179226e-14 4.3017094313179226e-1
1
Constraint violation....: 1.4210854715202004e-14 1.4210854715202004e-1
4
Complementarity.........: 2.5060278428063754e-09 2.5060278428063756e-0
6
Overall NLP error.......: 2.5060278428063754e-09 2.5060278428063756e-0
6
Number of objective function evaluations = 27
Number of objective gradient evaluations = 24
Number of equality constraint evaluations = 27
Number of inequality constraint evaluations = 27
Number of equality constraint Jacobian evaluations = 24
Number of inequality constraint Jacobian evaluations = 24
Number of Lagrangian Hessian evaluations = 23
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6676567e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 4.98e-04 9.80e-0
3h 1
2 8.6378204e+02 1.50e+04 5.24e+01 -1.0 1.27e+04 - 2.22e-05 1.17e-0
4h 1
3 8.6236899e+02 1.50e+04 5.24e+01 -1.0 1.48e+04 - 2.09e-05 1.09e-0
4h 1
4 8.5975912e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 1.28e-04 2.05e-0
4h 1
5 5.8011116e+02 1.46e+04 5.25e+01 -1.0 1.50e+04 - 3.39e-04 2.23e-0
2f 1
6 2.6948199e+04 5.95e-02 8.01e+01 -1.0 1.46e+04 - 5.00e-02 1.00e+0
0h 1
7 1.8352459e+04 5.56e-02 5.37e+01 -1.0 7.37e+01 - 3.19e-01 5.97e-0
2f 1
8 1.6766202e+04 3.02e-02 2.81e+01 -1.0 3.89e+01 - 4.72e-01 4.32e-0
1f 1
9 1.6192421e+04 1.48e-02 2.61e+00 -1.0 1.10e+01 - 9.18e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6543629e+04 4.45e-04 7.89e-02 -1.0 4.07e+00 - 9.90e-01 1.00e+0
0f 1
11 1.5939860e+04 7.38e-04 3.34e-01 -2.5 8.07e+00 - 8.80e-01 7.38e-0
1f 1
12 1.5867687e+04 2.39e-04 3.42e-01 -2.5 2.57e+00 - 8.85e-01 1.00e+0
0h 1
13 1.5860680e+04 7.37e-04 4.21e-01 -2.5 1.38e+00 - 1.00e+00 2.04e-0
1h 2
14 1.5841201e+04 9.61e-04 1.15e-02 -2.5 9.06e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5822230e+04 1.21e-03 3.32e-02 -3.8 5.55e+00 - 7.93e-01 1.00e+0
0h 1
16 1.5819226e+04 2.37e-03 9.38e-04 -3.8 9.27e-02 - 1.00e+00 1.00e+0
0h 1
17 1.5819550e+04 4.78e-05 1.22e-04 -3.8 1.50e-02 - 1.00e+00 1.00e+0
0h 1
18 1.5818092e+04 1.03e-04 3.70e-04 -5.7 2.98e-01 - 9.51e-01 9.78e-0
1h 1
19 1.5818078e+04 2.28e-05 3.61e-03 -5.7 6.32e-03 - 1.00e+00 7.81e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5818080e+04 8.87e-09 1.24e-06 -5.7 1.38e-03 - 1.00e+00 1.00e+0
0f 1
21 1.5818064e+04 9.08e-09 1.91e-05 -8.6 3.68e-03 - 1.00e+00 9.83e-0
1h 1
22 1.5818064e+04 1.36e-12 6.44e-11 -8.6 6.11e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.5818063683945024e+01 1.5818063683945024e+0
4
Dual infeasibility......: 6.4428041138809234e-11 6.4428041138809234e-0
8
Constraint violation....: 1.3559153799747037e-12 1.3559153799747037e-1
2
Complementarity.........: 2.7448739264825391e-09 2.7448739264825393e-0
6
Overall NLP error.......: 2.7448739264825391e-09 2.7448739264825393e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6663159e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 4.97e-04 9.80e-0
3h 1
2 8.6380228e+02 1.39e+04 5.24e+01 -1.0 1.32e+04 - 4.46e-05 1.04e-0
4h 1
3 8.2981809e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 7.27e-06 2.45e-0
3h 1
4 5.7278541e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 2.64e-03 2.13e-0
2h 1
5 2.4870492e+04 6.18e-02 8.04e+01 -1.0 1.36e+04 - 5.47e-02 1.00e+0
0h 1
6 1.7166036e+04 5.73e-02 5.00e+01 -1.0 6.81e+01 - 3.66e-01 6.55e-0
2f 1
7 1.5586788e+04 3.04e-02 2.47e+01 -1.0 3.82e+01 - 4.98e-01 4.39e-0
1f 1
8 1.5108141e+04 1.32e-02 2.24e+00 -1.0 1.07e+01 - 9.21e-01 1.00e+0
0f 1
9 1.5385167e+04 3.90e-04 8.04e-02 -1.0 4.29e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4871095e+04 5.17e-04 5.73e-01 -2.5 7.30e+00 - 8.91e-01 6.62e-0
1f 1
11 1.4791323e+04 2.37e-04 3.76e-01 -2.5 2.48e+00 - 8.87e-01 1.00e+0
0h 1
12 1.4770540e+04 6.21e-03 2.47e-01 -2.5 1.64e+00 - 1.00e+00 5.48e-0
1h 1
13 1.4759458e+04 8.25e-04 6.71e-03 -2.5 5.43e-01 - 1.00e+00 1.00e+0
0f 1
14 1.4740960e+04 1.13e-03 2.85e-02 -3.8 5.36e+00 - 8.14e-01 1.00e+0
0h 1
15 1.4738037e+04 2.14e-03 1.05e-03 -3.8 4.67e-02 - 1.00e+00 1.00e+0
0h 1
16 1.4738429e+04 4.79e-05 1.56e-04 -3.8 1.54e-02 - 1.00e+00 1.00e+0
0h 1
17 1.4736951e+04 1.07e-04 4.46e-04 -5.7 2.97e-01 - 9.51e-01 9.83e-0
1h 1
18 1.4736945e+04 2.17e-05 3.52e-03 -5.7 4.97e-03 - 1.00e+00 7.97e-0
1h 1
19 1.4736948e+04 8.51e-09 1.09e-06 -5.7 1.01e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.4736932e+04 8.96e-09 1.93e-05 -8.6 3.68e-03 - 1.00e+00 9.83e-0
1h 1
21 1.4736931e+04 1.38e-12 6.47e-11 -8.6 6.13e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.4736931414017418e+01 1.4736931414017417e+0
4
Dual infeasibility......: 6.4720552774881103e-11 6.4720552774881096e-0
8
Constraint violation....: 1.3780088181647443e-12 1.3780088181647443e-1
2
Complementarity.........: 3.0087435484844211e-09 3.0087435484844212e-0
6
Overall NLP error.......: 3.0087435484844211e-09 3.0087435484844212e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8072093e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.97e-04 9.80e-0
3h 1
2 8.7779306e+02 1.27e+04 5.24e+01 -1.0 1.12e+04 - 2.87e-05 1.11e-0
4h 1
3 8.6122950e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 1.55e-05 1.10e-0
3h 1
4 5.4318243e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 1.11e-03 2.22e-0
2h 1
5 2.4454251e+04 6.20e-02 8.15e+01 -1.0 1.24e+04 - 3.10e-02 1.00e+0
0h 1
6 1.6299322e+04 5.91e-02 6.14e+01 -1.0 6.05e+01 - 2.46e-01 4.35e-0
2f 1
7 1.4711302e+04 2.50e-02 3.16e+01 -1.0 2.85e+01 - 4.92e-01 5.40e-0
1f 1
8 1.4357401e+04 1.22e-02 2.17e+00 -1.0 9.69e+00 - 9.28e-01 4.97e-0
1f 2
9 1.4163698e+04 3.04e-03 1.20e-01 -1.0 4.79e+00 - 9.69e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3742079e+04 1.37e-03 3.73e-01 -2.5 2.81e+00 - 9.08e-01 7.62e-0
1f 1
11 1.3720048e+04 9.77e-06 9.00e-03 -2.5 1.50e+00 - 1.00e+00 1.00e+0
0h 1
12 1.3697657e+04 2.78e-04 8.33e-02 -3.8 5.76e+00 - 7.68e-01 9.71e-0
1f 1
13 1.3694169e+04 2.13e-03 2.86e-03 -3.8 1.94e-01 - 8.99e-01 1.00e+0
0h 1
14 1.3694246e+04 1.11e-04 1.07e-04 -3.8 1.51e-02 - 1.00e+00 1.00e+0
0h 1
15 1.3692880e+04 1.43e-04 1.18e-03 -5.7 3.00e-01 - 9.15e-01 1.00e+0
0h 1
16 1.3692836e+04 3.73e-05 8.20e-06 -5.7 9.00e-03 - 1.00e+00 1.00e+0
0h 1
17 1.3692841e+04 4.86e-07 5.11e-06 -5.7 1.01e-03 - 1.00e+00 1.00e+0
0h 1
18 1.3692826e+04 3.84e-08 5.24e-05 -8.6 3.69e-03 - 1.00e+00 9.47e-0
1h 1
19 1.3692826e+04 7.12e-12 6.95e-11 -8.6 1.97e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.3692825523906933e+01 1.3692825523906933e+0
4
Dual infeasibility......: 6.9470356434479039e-11 6.9470356434479032e-0
8
Constraint violation....: 7.1238570598097795e-12 7.1238570598097795e-1
2
Complementarity.........: 2.7968907984149033e-09 2.7968907984149031e-0
6
Overall NLP error.......: 2.7968907984149033e-09 2.7968907984149031e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9481942e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 7.48e-04 9.80e-0
3h 1
2 8.9197823e+02 1.11e+04 5.24e+01 -1.0 1.04e+04 - 4.18e-05 1.06e-0
4h 1
3 8.3527077e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 9.63e-06 3.46e-0
3h 1
4 5.3623938e+02 1.08e+04 5.23e+01 -1.0 1.11e+04 - 3.85e-03 2.15e-0
2h 1
5 2.1933099e+04 6.71e-02 7.79e+01 -1.0 1.08e+04 - 8.01e-02 1.00e+0
0h 1
6 1.4673675e+04 6.05e-02 4.23e+01 -1.0 4.53e+01 - 4.37e-01 8.94e-0
2f 1
7 1.3327687e+04 2.86e-02 1.56e+01 -1.0 2.13e+01 - 6.21e-01 5.45e-0
1f 1
8 1.3017486e+04 4.21e-03 8.87e-01 -1.0 6.85e+00 - 9.49e-01 7.63e-0
1f 1
9 1.3264412e+04 1.26e-04 5.69e-02 -1.0 6.42e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2672550e+04 2.20e-03 8.22e-02 -2.5 3.95e+00 - 8.61e-01 8.47e-0
1f 1
11 1.2504071e+04 2.15e-03 3.45e-01 -2.5 8.59e-01 - 1.00e+00 7.80e-0
1f 1
12 1.2479357e+04 1.51e-04 4.63e-03 -2.5 1.73e-01 - 1.00e+00 1.00e+0
0h 1
13 1.2456714e+04 2.21e-05 3.94e-02 -3.8 5.36e+00 - 1.00e+00 8.88e-0
1h 1
14 1.2455033e+04 5.68e-08 6.01e-04 -3.8 5.99e-01 - 1.00e+00 1.00e+0
0f 1
15 1.2453577e+04 4.28e-08 3.91e-05 -5.7 2.97e-01 - 1.00e+00 9.98e-0
1f 1
16 1.2453579e+04 1.88e-12 1.19e-08 -5.7 4.73e-04 - 1.00e+00 1.00e+0
0f 1
17 1.2453562e+04 2.57e-12 3.30e-06 -8.6 3.68e-03 - 1.00e+00 9.99e-0
1f 1
18 1.2453562e+04 1.65e-15 4.83e-14 -8.6 2.07e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.2453562303094429e+01 1.2453562303094430e+0
4
Dual infeasibility......: 4.8325495586340638e-14 4.8325495586340638e-1
1
Constraint violation....: 1.6506469988672350e-15 1.6506469988672350e-1
5
Complementarity.........: 2.6166245458743277e-09 2.6166245458743278e-0
6
Overall NLP error.......: 2.6166245458743277e-09 2.6166245458743278e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891839e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0614875e+02 9.19e+03 5.23e+01 -1.0 8.94e+03 - 8.31e-05 1.02e-0
4h 1
3 8.8589053e+02 9.18e+03 5.23e+01 -1.0 9.18e+03 - 4.99e-06 1.11e-0
3f 1
4 4.8290407e+02 8.97e+03 5.24e+01 -1.0 9.18e+03 - 1.26e-03 2.28e-0
2h 1
5 2.1194856e+04 6.67e-02 7.66e+01 -1.0 8.97e+03 - 8.32e-02 1.00e+0
0h 1
6 1.3110859e+04 6.01e-02 3.76e+01 -1.0 2.89e+01 - 4.83e-01 9.02e-0
2f 1
7 1.1611939e+04 1.94e-02 1.53e+01 -1.0 1.53e+01 - 6.18e-01 7.42e-0
1f 1
8 1.1669715e+04 5.64e-03 1.25e+00 -1.0 2.10e+00 - 9.91e-01 5.00e-0
1f 2
9 1.1851856e+04 3.17e-04 6.99e-02 -1.0 2.45e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1303065e+04 2.21e-03 9.19e-02 -2.5 2.21e+01 - 8.56e-01 8.21e-0
1f 1
11 1.1134535e+04 2.12e-03 4.58e-01 -2.5 3.77e+00 - 1.00e+00 7.49e-0
1f 1
12 1.1105283e+04 1.58e-04 4.78e-03 -2.5 9.43e-01 - 1.00e+00 1.00e+0
0h 1
13 1.1088904e+04 4.25e-05 1.63e-01 -3.8 2.68e+00 - 1.00e+00 7.50e-0
1h 1
14 1.1084573e+04 1.45e-07 3.58e-04 -3.8 6.70e-01 - 1.00e+00 1.00e+0
0f 1
15 1.1083348e+04 2.78e-08 9.22e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 1.1083335e+04 1.87e-12 1.33e-08 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
17 1.1083321e+04 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.1083320746509258e+01 1.1083320746509258e+0
4
Dual infeasibility......: 4.4776955452145684e-09 4.4776955452145684e-0
6
Constraint violation....: 2.6306387623797889e-12 2.6306387623797889e-1
2
Complementarity.........: 3.6085004027641549e-09 3.6085004027641548e-0
6
Overall NLP error.......: 4.4776955452145684e-09 4.4776955452145684e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3710605e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 3.06e-03 9.80e-0
3h 1
2 9.3410771e+02 6.71e+03 5.23e+01 -1.0 6.33e+03 - 5.53e-05 1.05e-0
4h 1
3 8.7601628e+02 6.69e+03 5.23e+01 -1.0 6.70e+03 - 8.90e-06 2.62e-0
3f 1
4 4.4078555e+02 6.54e+03 5.23e+01 -1.0 6.69e+03 - 3.32e-03 2.17e-0
2h 1
5 1.7952487e+04 7.75e-02 7.79e+01 -1.0 6.54e+03 - 7.84e-02 1.00e+0
0h 1
6 1.1162158e+04 7.00e-02 2.30e+01 -1.0 4.32e+00 - 6.80e-01 8.97e-0
2f 1
7 1.0161093e+04 3.32e-02 7.43e+00 -1.0 4.23e+00 - 7.42e-01 1.00e+0
0f 1
8 1.0283900e+04 1.70e-02 7.27e-01 -1.0 1.10e+00 - 9.96e-01 4.94e-0
1f 2
9 1.0000013e+04 8.27e-03 3.35e-01 -1.7 1.28e+01 - 1.00e+00 8.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.9361941e+03 1.02e-03 1.04e-01 -1.7 8.95e+00 - 1.00e+00 1.00e+0
0f 1
11 9.8169976e+03 2.77e-04 1.12e-01 -2.5 1.73e+01 - 9.89e-01 8.85e-0
1f 1
12 9.8069007e+03 4.94e-06 1.10e-03 -2.5 1.95e+00 - 1.00e+00 1.00e+0
0f 1
13 9.7851225e+03 5.56e-06 7.61e-04 -3.8 2.68e+00 - 1.00e+00 1.00e+0
0f 1
14 9.7842068e+03 3.44e-09 3.52e-06 -5.7 1.48e-01 - 1.00e+00 1.00e+0
0h 1
15 9.7841926e+03 2.34e-12 4.09e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 9.7841925870743029e+00 9.7841925870743034e+0
3
Dual infeasibility......: 4.0868873994150668e-10 4.0868873994150668e-0
7
Constraint violation....: 2.3423762929297709e-12 2.3423762929297709e-1
2
Complementarity.........: 2.5729802580423119e-09 2.5729802580423118e-0
6
Overall NLP error.......: 2.5729802580423119e-09 2.5729802580423118e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0880494e+02 4.77e+03 5.23e+01 -1.0 4.81e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0291924e+02 4.77e+03 5.23e+01 -1.0 2.79e+03 - 2.15e-05 2.38e-0
4h 1
3 3.7467532e+02 4.66e+03 5.24e+01 -1.0 4.77e+03 - 1.51e-04 2.34e-0
2f 1
4 1.7300257e+04 6.53e-02 7.97e+01 -1.0 4.66e+03 - 4.04e-02 1.00e+0
0h 1
5 8.8617124e+03 6.16e-02 5.71e+01 -1.0 3.53e+01 - 2.79e-01 5.15e-0
2f 1
6 7.5509801e+03 1.93e-02 2.65e+01 -1.0 1.63e+01 - 5.49e-01 6.34e-0
1f 1
7 7.1819282e+03 5.83e-03 7.45e-01 -1.0 4.62e+00 - 9.62e-01 8.21e-0
1f 1
8 7.4584045e+03 1.60e-04 6.05e-02 -1.0 6.90e+00 - 9.98e-01 1.00e+0
0f 1
9 6.8761694e+03 2.23e-03 9.85e-02 -2.5 6.28e+00 - 8.54e-01 8.68e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.7216934e+03 2.17e-03 3.89e-01 -2.5 1.40e+00 - 1.00e+00 7.71e-0
1f 1
11 6.6995741e+03 1.09e-04 4.63e-03 -2.5 3.39e-01 - 1.00e+00 1.00e+0
0h 1
12 6.6742305e+03 2.92e-05 1.37e-01 -3.8 1.34e+01 - 1.00e+00 7.68e-0
1h 1
13 6.6677283e+03 1.17e-07 3.28e-04 -3.8 3.11e+00 - 1.00e+00 1.00e+0
0f 1
14 6.6659139e+03 2.88e-08 1.03e-03 -5.7 7.43e-01 - 1.00e+00 9.85e-0
1f 1
15 6.6658915e+03 1.98e-12 1.42e-08 -5.7 1.14e-02 - 1.00e+00 1.00e+0
0f 1
16 6.6658693e+03 2.63e-12 4.48e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.6658693435141663e+00 6.6658693435141658e+0
3
Dual infeasibility......: 4.4776956501712680e-09 4.4776956501712680e-0
6
Constraint violation....: 2.6309232570298491e-12 2.6309232570298491e-1
2
Complementarity.........: 3.6084966497980450e-09 3.6084966497980451e-0
6
Overall NLP error.......: 4.4776956501712680e-09 4.4776956501712680e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2294726e+02 3.24e+03 5.23e+01 -1.0 3.27e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1945201e+02 3.24e+03 5.23e+01 -1.0 2.47e+03 - 3.93e-05 1.30e-0
4h 1
3 3.4573144e+02 3.17e+03 5.24e+01 -1.0 3.24e+03 - 4.04e-05 2.36e-0
2f 1
4 1.5906615e+04 6.81e-02 7.93e+01 -1.0 3.17e+03 - 4.21e-02 1.00e+0
0h 1
5 7.5933644e+03 6.41e-02 5.66e+01 -1.0 2.00e+01 - 2.81e-01 5.33e-0
2f 1
6 6.3092956e+03 1.54e-02 2.51e+01 -1.0 1.01e+01 - 5.90e-01 8.06e-0
1f 1
7 6.3346293e+03 6.22e-03 2.30e-01 -1.0 1.94e+00 - 9.91e-01 1.00e+0
0f 1
8 5.9359407e+03 1.57e-03 8.95e-02 -1.7 4.62e+00 - 1.00e+00 9.66e-0
1f 1
9 5.7773050e+03 1.82e-03 5.16e-01 -2.5 1.14e+00 - 1.00e+00 7.50e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.7447665e+03 3.26e-04 1.02e-01 -2.5 2.94e-01 - 1.00e+00 8.96e-0
1h 1
11 5.7477664e+03 1.17e-05 4.01e-03 -2.5 2.85e-02 - 1.00e+00 1.00e+0
0f 1
12 5.7228575e+03 1.05e-05 8.01e-03 -3.8 5.36e+00 - 1.00e+00 9.61e-0
1f 1
13 5.7223579e+03 1.57e-08 1.36e-05 -3.8 2.04e-01 - 1.00e+00 1.00e+0
0f 1
14 5.7210148e+03 1.79e-08 5.06e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0f 1
15 5.7210000e+03 6.40e-13 4.11e-10 -8.6 3.67e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.7210000344424659e+00 5.7210000344424661e+0
3
Dual infeasibility......: 4.1141827663179913e-10 4.1141827663179913e-0
7
Constraint violation....: 6.4048766290625281e-13 6.4048766290625281e-1
3
Complementarity.........: 3.0491650841898374e-09 3.0491650841898374e-0
6
Overall NLP error.......: 3.0491650841898374e-09 3.0491650841898374e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8055761e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.81e-0
3f 1
2 8.7686982e+02 2.00e+03 5.24e+01 -1.0 1.46e+03 - 5.63e-05 1.36e-0
4h 1
3 2.9368501e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 5.20e-05 2.28e-0
2f 1
4 1.4297701e+04 6.09e-02 7.94e+01 -1.0 1.95e+03 - 5.25e-02 1.00e+0
0h 1
5 5.5715643e+03 5.67e-02 5.36e+01 -1.0 6.49e+01 - 3.13e-01 6.17e-0
2f 1
6 4.1854190e+03 3.04e-02 2.68e+01 -1.0 3.22e+01 - 4.92e-01 4.30e-0
1f 1
7 3.3694030e+03 1.34e-02 2.18e+00 -1.0 1.10e+01 - 9.20e-01 9.27e-0
1f 1
8 3.8356226e+03 4.21e-04 1.12e-01 -1.0 4.99e+00 - 1.00e+00 1.00e+0
0f 1
9 3.1540976e+03 1.17e-03 7.19e-02 -1.7 3.91e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.1041354e+03 6.69e-04 2.43e+00 -2.5 3.64e+01 - 1.00e+00 4.31e-0
1h 1
11 3.0628088e+03 7.09e-05 1.87e-02 -2.5 2.05e+01 - 1.00e+00 1.00e+0
0f 1
12 3.0434480e+03 3.65e-04 8.62e-02 -3.8 5.37e+00 - 7.36e-01 1.00e+0
0h 1
13 3.0405527e+03 1.72e-03 2.25e-03 -3.8 3.82e-02 - 9.20e-01 1.00e+0
0h 1
14 3.0406287e+03 9.88e-05 8.07e-05 -3.8 1.31e-02 - 1.00e+00 1.00e+0
0h 1
15 3.0392724e+03 1.37e-04 1.15e-03 -5.7 2.97e-01 - 9.16e-01 1.00e+0
0h 1
16 3.0392287e+03 3.53e-05 7.52e-06 -5.7 8.75e-03 - 1.00e+00 1.00e+0
0h 1
17 3.0392338e+03 3.25e-07 4.37e-06 -5.7 8.23e-04 - 1.00e+00 1.00e+0
0h 1
18 3.0392191e+03 2.96e-08 4.32e-05 -8.6 3.68e-03 - 1.00e+00 9.51e-0
1h 1
19 3.0392184e+03 5.90e-12 6.00e-11 -8.6 1.80e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 3.0392183912455684e+00 3.0392183912455685e+0
3
Dual infeasibility......: 6.0013334175603420e-11 6.0013334175603420e-0
8
Constraint violation....: 5.9011684427900946e-12 5.9011684427900946e-1
2
Complementarity.........: 2.7537045470178161e-09 2.7537045470178161e-0
6
Overall NLP error.......: 2.7537045470178161e-09 2.7537045470178161e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0791461e+02 9.17e+02 5.23e+01 -1.0 9.21e+02 - 1.00e-03 9.87e-0
3h 1
2 8.7165159e+02 9.16e+02 5.23e+01 -1.0 8.51e+02 - 8.19e-05 1.36e-0
3h 1
3 2.8567501e+02 8.96e+02 5.24e+01 -1.0 9.16e+02 - 1.36e-03 2.27e-0
2h 1
4 1.2880567e+04 6.68e-02 7.66e+01 -1.0 8.96e+02 - 8.33e-02 1.00e+0
0h 1
5 4.8360571e+03 6.02e-02 3.75e+01 -1.0 2.88e+01 - 4.85e-01 9.04e-0
2f 1
6 3.3367023e+03 1.95e-02 1.51e+01 -1.0 1.53e+01 - 6.20e-01 7.44e-0
1f 1
7 3.4587663e+03 4.48e-03 1.52e-01 -1.0 2.09e+00 - 9.91e-01 1.00e+0
0f 1
8 3.0299126e+03 1.48e-03 1.28e-01 -1.7 9.50e+00 - 1.00e+00 1.00e+0
0f 1
9 2.8718164e+03 2.04e-03 4.07e-01 -2.5 6.92e+00 - 1.00e+00 7.88e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8482474e+03 1.55e-04 5.37e-03 -2.5 1.35e+00 - 1.00e+00 1.00e+0
0h 1
11 2.8224001e+03 4.29e-05 1.82e-01 -3.8 1.62e+01 - 1.00e+00 7.38e-0
1h 1
12 2.8143652e+03 1.60e-07 3.60e-04 -3.8 4.19e+00 - 1.00e+00 1.00e+0
0f 1
13 2.8124113e+03 2.72e-08 9.78e-04 -5.7 8.92e-01 - 1.00e+00 9.85e-0
1f 1
14 2.8123877e+03 1.88e-12 1.35e-08 -5.7 1.31e-02 - 1.00e+00 1.00e+0
0f 1
15 2.8123637e+03 2.63e-12 4.48e-09 -8.6 1.11e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 2.8123637128565240e+00 2.8123637128565238e+0
3
Dual infeasibility......: 4.4777042060654677e-09 4.4777042060654677e-0
6
Constraint violation....: 2.6306457012736928e-12 2.6306457012736928e-1
2
Complementarity.........: 3.6085017796935744e-09 3.6085017796935743e-0
6
Overall NLP error.......: 4.4777042060654677e-09 4.4777042060654677e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254210179e-01 6.4890146254210174e+0
2
Dual infeasibility......: 4.9126604771119770e-09 4.9126604771119770e-0
6
Constraint violation....: 6.2123813870940126e-09 6.2123813870940126e-0
9
Complementarity.........: 4.3646095252481117e-09 4.3646095252481114e-0
6
Overall NLP error.......: 6.2123813870940126e-09 4.9126604771119770e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031320944927504e-09 2.1031320944927504e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896925026e-09 2.8882108896925025e-0
6
Overall NLP error.......: 2.8882108896925026e-09 2.8882108896925025e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254210179e-01 6.4890146254210174e+0
2
Dual infeasibility......: 4.9126604771119770e-09 4.9126604771119770e-0
6
Constraint violation....: 6.2123813870940126e-09 6.2123813870940126e-0
9
Complementarity.........: 4.3646095252481117e-09 4.3646095252481114e-0
6
Overall NLP error.......: 6.2123813870940126e-09 4.9126604771119770e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.03e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.11e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643339e+00 1.6104063281643339e+0
3
Dual infeasibility......: 2.4575962202569930e-12 2.4575962202569930e-0
9
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5062163910047551e-09 2.5062163910047549e-0
6
Overall NLP error.......: 2.5062163910047551e-09 2.5062163910047549e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2355451e+02 9.17e+02 5.24e+01 -1.0 9.24e+02 - 3.31e-04 9.84e-0
3f 1
2 8.1662500e+02 9.17e+02 5.24e+01 -1.0 5.55e+02 - 7.26e-05 2.50e-0
4h 1
3 2.4196991e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 1.96e-04 2.12e-0
2f 1
4 1.2636833e+04 5.48e-02 8.23e+01 -1.0 8.98e+02 - 3.79e-02 1.00e+0
0h 1
5 3.9066543e+03 5.23e-02 5.77e+01 -1.0 8.26e+01 - 2.96e-01 4.93e-0
2f 1
6 1.9129688e+03 3.74e-02 3.11e+01 -1.0 3.92e+01 - 4.66e-01 5.08e-0
1f 1
7 4.7067283e+03 1.23e-02 2.76e+01 -1.0 2.08e+01 - 3.97e-01 1.00e+0
0h 1
8 1.8774461e+03 1.23e-02 1.09e+00 -1.0 2.59e+01 - 9.87e-01 8.86e-0
1f 1
9 1.9927655e+03 2.09e-04 4.90e-02 -1.0 2.51e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7260747e+03 2.23e-04 1.23e+00 -2.5 1.90e+01 - 9.37e-01 5.95e-0
1f 1
11 1.5380610e+03 3.77e-03 1.32e-01 -2.5 7.57e+00 - 7.96e-01 1.00e+0
0f 1
12 1.5153061e+03 4.98e-03 3.07e-01 -2.5 1.80e+00 - 1.00e+00 7.69e-0
1h 1
13 1.5275650e+03 2.35e-04 4.67e-03 -2.5 7.22e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5024753e+03 1.70e-04 2.15e-02 -3.8 8.08e+00 - 9.90e-01 9.29e-0
1h 1
15 1.5016701e+03 7.28e-07 6.85e-05 -3.8 5.51e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003100e+03 3.77e-07 1.78e-04 -5.7 4.46e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003099e+03 3.79e-11 2.92e-09 -5.7 4.21e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0h 1
1 8.6598311e+02 9.17e+02 5.24e+01 -1.0 9.24e+02 - 4.97e-04 9.84e-0
3h 1
2 8.5884059e+02 9.17e+02 5.24e+01 -1.0 5.71e+02 - 7.06e-05 2.62e-0
4h 1
3 2.6203260e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 2.08e-04 2.23e-0
2f 1
4 1.3003571e+04 5.93e-02 8.01e+01 -1.0 8.97e+02 - 4.95e-02 1.00e+0
0h 1
5 4.3038712e+03 5.54e-02 5.41e+01 -1.0 7.44e+01 - 3.14e-01 5.91e-0
2f 1
48 1.756934e+04 1.632511e+04 4.323106e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6793774e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.80e-0
3h 1
2 7.6493627e+02 1.57e+04 5.25e+01 -1.0 1.38e+04 - 2.51e-05 1.13e-0
4h 1
3 7.6112920e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 1.74e-05 3.01e-0
4h 1
4 7.5768827e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 3.17e-04 2.81e-0
4h 1
5 5.2507101e+02 1.54e+04 6.10e+01 -1.0 1.57e+04 - 6.43e-04 2.00e-0
2f 1
6 2.6631790e+04 6.10e-02 8.48e+01 -1.0 1.54e+04 - 2.97e-02 1.00e+0
0h 1
7 1.8265306e+04 5.86e-02 6.69e+01 -1.0 7.81e+01 - 2.17e-01 4.31e-0
2f 1
8 1.6691510e+04 4.50e-02 3.30e+01 -1.0 2.87e+01 - 5.02e-01 4.35e-0
1f 1
9 1.6986144e+04 3.07e-02 1.32e+01 -1.0 1.61e+01 - 4.69e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6780778e+04 5.31e-03 3.64e+00 -1.0 3.76e+00 - 7.97e-01 1.00e+0
0h 1
11 1.6827230e+04 2.98e-04 2.01e+00 -1.0 1.54e+00 - 3.06e-01 1.00e+0
0f 1
12 1.6826857e+04 1.10e-05 5.35e-01 -1.0 1.34e+00 - 7.29e-01 1.00e+0
0f 1
13 1.6529880e+04 2.25e-04 2.96e-01 -1.7 4.85e+00 - 8.62e-01 7.80e-0
1f 1
14 1.6478082e+04 5.57e-04 3.60e-01 -1.7 6.33e+00 - 5.93e-01 1.00e+0
0f 1
15 1.6477273e+04 7.39e-05 7.95e-02 -1.7 1.21e+01 - 6.85e-01 1.00e+0
0h 1
16 1.6369576e+04 9.59e-04 5.32e-02 -2.5 1.13e+01 - 9.22e-01 1.00e+0
0f 1
17 1.6345120e+04 1.16e-03 1.25e-02 -2.5 5.16e+00 - 1.00e+00 1.00e+0
0h 1
18 1.6327811e+04 1.96e-04 8.82e-02 -3.8 6.01e+00 - 1.00e+00 8.50e-0
1h 1
19 1.6326251e+04 6.31e-07 1.05e-04 -3.8 6.15e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325264e+04 3.83e-07 7.30e-03 -5.7 2.61e-01 - 1.00e+00 8.34e-0
1h 1
21 1.6325119e+04 1.10e-08 3.70e-07 -5.7 5.62e-03 - 1.00e+00 1.00e+0
0f 1
22 1.6325105e+04 1.11e-10 2.79e-06 -8.6 2.26e-03 - 1.00e+00 9.96e-0
1h 1
23 1.6325105e+04 1.36e-15 4.25e-14 -8.6 1.79e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 23
(scaled) (unscaled)
Objective...............: 1.6325105261433350e+01 1.6325105261433349e+0
4
Dual infeasibility......: 4.2547001085969338e-14 4.2547001085969338e-1
1
Constraint violation....: 1.3600232051658168e-15 1.3600232051658168e-1
5
Complementarity.........: 2.5060279373012924e-09 2.5060279373012924e-0
6
Overall NLP error.......: 2.5060279373012924e-09 2.5060279373012924e-0
6
Number of objective function evaluations = 27
Number of objective gradient evaluations = 24
Number of equality constraint evaluations = 27
Number of inequality constraint evaluations = 27
Number of equality constraint Jacobian evaluations = 24
Number of inequality constraint Jacobian evaluations = 24
Number of Lagrangian Hessian evaluations = 23
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.1744019e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 3.14e-04 9.80e-0
3f 1
2 8.1461807e+02 1.50e+04 5.24e+01 -1.0 1.48e+04 - 9.43e-05 1.00e-0
4h 1
3 8.0688156e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 2.84e-06 5.86e-0
4f 1
4 5.4143358e+02 1.47e+04 5.26e+01 -1.0 1.50e+04 - 6.25e-04 2.09e-0
2h 1
5 2.6403382e+04 5.49e-02 8.27e+01 -1.0 1.47e+04 - 3.69e-02 1.00e+0
0h 1
6 1.7889479e+04 5.24e-02 5.82e+01 -1.0 8.09e+01 - 2.96e-01 4.87e-0
2f 1
7 1.5965723e+04 3.89e-02 3.08e+01 -1.0 3.79e+01 - 4.73e-01 4.96e-0
1f 1
8 1.6305323e+04 2.34e-02 1.42e+01 -1.0 1.99e+01 - 4.06e-01 1.25e-0
1f 4
9 1.6039872e+04 6.20e-03 3.07e-01 -1.0 5.33e+00 - 9.84e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5744013e+04 1.38e-03 3.59e-01 -1.7 5.10e+00 - 1.00e+00 8.40e-0
1f 1
11 1.5710539e+04 8.58e-04 1.31e-02 -1.7 1.76e+01 - 1.00e+00 1.00e+0
0f 1
12 1.5583592e+04 1.40e-03 9.51e-02 -3.8 1.99e+01 - 7.92e-01 9.30e-0
1f 1
13 1.5559797e+04 1.56e-03 7.52e-02 -3.8 1.70e+00 - 8.44e-01 7.60e-0
1h 1
14 1.5560158e+04 3.10e-06 8.08e-04 -3.8 3.30e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5559221e+04 2.95e-07 6.52e-04 -5.7 1.49e-01 - 1.00e+00 9.88e-0
1h 1
16 1.5559215e+04 3.77e-11 6.51e-09 -5.7 3.14e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5559202e+04 6.30e-11 2.14e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5559202142112991e+01 1.5559202142112990e+0
4
Dual infeasibility......: 2.1392634632725652e-09 2.1392634632725652e-0
6
Constraint violation....: 6.2997482230819912e-11 6.2997482230819912e-1
1
Complementarity.........: 2.8881042858289851e-09 2.8881042858289849e-0
6
Overall NLP error.......: 2.8881042858289851e-09 2.8881042858289849e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.5240988e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 4.26e-04 9.80e-0
3h 1
2 8.4956611e+02 1.39e+04 5.24e+01 -1.0 1.32e+04 - 4.56e-05 1.04e-0
4h 1
3 8.1632541e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 7.16e-06 2.37e-0
3h 1
4 5.6126914e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 2.55e-03 2.10e-0
2h 1
5 2.4759392e+04 5.99e-02 8.11e+01 -1.0 1.36e+04 - 5.06e-02 1.00e+0
0h 1
6 1.7018192e+04 5.59e-02 4.95e+01 -1.0 7.26e+01 - 3.78e-01 6.18e-0
2f 1
7 1.5082414e+04 3.33e-02 2.55e+01 -1.0 4.14e+01 - 4.87e-01 5.05e-0
1f 1
8 1.5530780e+04 4.79e-03 2.19e+00 -1.0 1.52e+01 - 9.28e-01 1.00e+0
0f 1
9 1.5075378e+04 1.27e-03 1.22e-01 -1.0 9.30e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4758130e+04 6.83e-04 1.17e+00 -2.5 6.25e+00 - 9.25e-01 5.76e-0
1f 1
11 1.4600769e+04 9.53e-04 3.33e-01 -2.5 6.10e+00 - 7.77e-01 1.00e+0
0f 1
12 1.4563141e+04 1.24e-03 8.20e-02 -2.5 2.39e+00 - 1.00e+00 8.38e-0
1h 1
13 1.4568144e+04 3.08e-04 2.18e-03 -2.5 2.83e-01 - 1.00e+00 1.00e+0
0f 1
14 1.4549246e+04 4.34e-04 5.91e-02 -3.8 5.36e+00 - 8.00e-01 9.22e-0
1h 1
15 1.4545821e+04 1.32e-03 1.48e-03 -3.8 4.15e-01 - 1.00e+00 1.00e+0
0h 1
16 1.4544681e+04 6.76e-05 7.56e-05 -5.7 2.97e-01 - 9.67e-01 9.70e-0
1h 1
17 1.4544654e+04 2.40e-07 3.60e-07 -5.7 9.04e-03 - 1.00e+00 1.00e+0
0f 1
18 1.4544637e+04 5.68e-09 4.03e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.4544637422533397e+01 1.4544637422533397e+0
4
Dual infeasibility......: 4.0292302671027638e-09 4.0292302671027638e-0
6
Constraint violation....: 5.6755445898559742e-09 5.6755445898559742e-0
9
Complementarity.........: 4.3431436965979342e-09 4.3431436965979342e-0
6
Overall NLP error.......: 5.6755445898559742e-09 4.3431436965979342e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1596960e+02 1.27e+04 5.23e+01 -1.0 1.28e+04 - 1.20e-03 9.80e-0
3h 1
2 9.1314143e+02 1.27e+04 5.23e+01 -1.0 1.18e+04 - 3.58e-05 1.06e-0
4h 1
3 8.5649602e+02 1.26e+04 5.23e+01 -1.0 1.26e+04 - 9.49e-06 3.83e-0
3h 1
4 5.9316555e+02 1.23e+04 5.23e+01 -1.0 1.26e+04 - 4.24e-03 2.17e-0
2h 1
5 2.3565112e+04 7.16e-02 7.72e+01 -1.0 1.23e+04 - 8.38e-02 1.00e+0
0h 1
6 1.6636753e+04 6.43e-02 2.76e+01 -1.0 1.93e+01 - 6.15e-01 9.37e-0
2f 1
7 1.5174707e+04 1.67e-02 1.00e+01 -1.0 1.25e+01 - 6.76e-01 8.56e-0
1f 1
8 1.5349422e+04 8.66e-03 6.64e-01 -1.0 3.75e+00 - 9.93e-01 4.95e-0
1f 2
9 1.5053058e+04 9.42e-03 2.17e-01 -1.7 1.14e+01 - 9.60e-01 8.32e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5016336e+04 1.12e-03 7.30e-01 -1.7 2.74e+01 - 5.25e-01 1.00e+0
0f 1
11 1.5040960e+04 1.38e-04 5.37e-03 -1.7 2.56e+00 - 1.00e+00 1.00e+0
0f 1
12 1.4861919e+04 5.18e-04 2.40e-02 -3.8 3.97e+01 - 8.45e-01 8.44e-0
1f 1
13 1.4840235e+04 1.69e-04 1.67e-01 -3.8 6.15e+00 - 9.98e-01 7.28e-0
1h 1
14 1.4835475e+04 3.31e-07 6.62e-04 -3.8 1.67e+00 - 1.00e+00 1.00e+0
0h 1
15 1.4834111e+04 2.53e-08 3.15e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
16 1.4834096e+04 1.17e-12 1.09e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.4834096289217456e+01 1.4834096289217456e+0
4
Dual infeasibility......: 1.0895181032687386e-09 1.0895181032687386e-0
6
Constraint violation....: 1.1705705849074377e-12 1.1705705849074377e-1
2
Complementarity.........: 2.9004401306435051e-09 2.9004401306435052e-0
6
Overall NLP error.......: 2.9004401306435051e-09 2.9004401306435052e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9482527e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 7.48e-04 9.80e-0
3h 1
2 8.9206259e+02 1.11e+04 5.24e+01 -1.0 1.09e+04 - 8.69e-05 1.01e-0
4h 1
3 8.7788074e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 4.01e-06 8.67e-0
4f 1
4 5.1726064e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 9.54e-04 2.26e-0
2h 1
5 2.3121559e+04 6.40e-02 7.79e+01 -1.0 1.09e+04 - 6.98e-02 1.00e+0
0h 1
6 1.4812165e+04 5.85e-02 4.83e+01 -1.0 4.95e+01 - 3.63e-01 7.77e-0
2f 1
7 1.3505031e+04 2.67e-02 2.10e+01 -1.0 2.28e+01 - 5.57e-01 5.00e-0
1f 1
8 1.3018007e+04 6.85e-03 1.23e+00 -1.0 8.59e+00 - 9.37e-01 7.36e-0
1f 1
9 1.3268789e+04 3.20e-04 7.93e-02 -1.0 2.91e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2683148e+04 2.08e-03 9.07e-02 -2.5 4.28e+00 - 8.62e-01 8.28e-0
1f 1
11 1.2505092e+04 2.17e-03 3.62e-01 -2.5 1.06e+00 - 1.00e+00 7.74e-0
1f 1
12 1.2476207e+04 1.68e-04 5.11e-03 -2.5 2.15e-01 - 1.00e+00 1.00e+0
0h 1
13 1.2456345e+04 2.44e-05 4.31e-02 -3.8 2.68e+00 - 1.00e+00 8.82e-0
1h 1
14 1.2454881e+04 5.88e-08 6.10e-04 -3.8 3.16e-01 - 1.00e+00 1.00e+0
0f 1
15 1.2453574e+04 4.24e-08 1.39e-05 -5.7 1.49e-01 - 1.00e+00 9.99e-0
1f 1
16 1.2453562e+04 6.84e-13 3.99e-09 -8.6 1.93e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.2453562305551555e+01 1.2453562305551555e+0
4
Dual infeasibility......: 3.9883524369533564e-09 3.9883524369533564e-0
6
Constraint violation....: 6.8439698353017775e-13 6.8439698353017775e-1
3
Complementarity.........: 2.7863202818999445e-09 2.7863202818999442e-0
6
Overall NLP error.......: 3.9883524369533564e-09 3.9883524369533564e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8777320e+02 9.19e+03 5.24e+01 -1.0 9.28e+03 - 6.64e-04 9.80e-0
3h 1
2 8.8499164e+02 9.19e+03 5.24e+01 -1.0 8.96e+03 - 8.88e-05 1.02e-0
4h 1
3 8.6604553e+02 9.18e+03 5.24e+01 -1.0 9.18e+03 - 4.81e-06 1.03e-0
3f 1
4 4.6753384e+02 8.97e+03 5.24e+01 -1.0 9.18e+03 - 1.16e-03 2.24e-0
2h 1
5 2.1019834e+04 6.31e-02 7.87e+01 -1.0 8.97e+03 - 6.27e-02 1.00e+0
0h 1
6 1.2779542e+04 5.82e-02 5.04e+01 -1.0 5.68e+01 - 3.45e-01 7.15e-0
2f 1
7 1.1474093e+04 2.98e-02 2.31e+01 -1.0 2.74e+01 - 5.30e-01 4.48e-0
1f 1
8 1.0826912e+04 8.86e-03 1.29e+00 -1.0 1.03e+01 - 9.25e-01 7.95e-0
1f 1
9 1.1132672e+04 2.56e-04 7.50e-02 -1.0 3.69e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.0462579e+04 2.14e-03 9.04e-02 -2.5 5.27e+00 - 8.69e-01 8.83e-0
1f 1
11 1.0356962e+04 1.11e-03 4.48e-01 -2.5 8.53e-01 - 1.00e+00 6.12e-0
1f 1
12 1.0357041e+04 2.64e-06 8.39e-03 -2.5 1.73e-01 - 1.00e+00 1.00e+0
0h 1
13 1.0339021e+04 7.22e-06 6.55e-03 -3.8 2.68e+00 - 9.00e-01 8.93e-0
1f 1
14 1.0335760e+04 4.68e-04 3.83e-04 -3.8 2.86e-01 - 1.00e+00 1.00e+0
0f 1
15 1.0334765e+04 6.30e-05 1.15e-02 -5.7 1.49e-01 - 8.13e-01 1.00e+0
0h 1
16 1.0334649e+04 3.63e-05 4.09e-05 -5.7 9.71e-03 - 1.00e+00 1.00e+0
0h 1
17 1.0334650e+04 1.61e-06 3.43e-05 -5.7 1.54e-03 - 1.00e+00 9.90e-0
1h 1
18 1.0334653e+04 3.53e-08 5.13e-07 -5.7 2.92e-04 - 1.00e+00 1.00e+0
0f 1
19 1.0334638e+04 3.96e-08 7.26e-06 -8.6 1.84e-03 - 9.97e-01 9.81e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.0334638e+04 5.32e-13 2.97e-11 -8.6 3.54e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.0334637957871605e+01 1.0334637957871604e+0
4
Dual infeasibility......: 2.9731379496217234e-11 2.9731379496217234e-0
8
Constraint violation....: 5.3168580649298747e-13 5.3168580649298747e-1
3
Complementarity.........: 2.5100786379405385e-09 2.5100786379405384e-0
6
Overall NLP error.......: 2.5100786379405385e-09 2.5100786379405384e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3709613e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 3.06e-03 9.81e-0
3h 1
2 9.3353198e+02 6.71e+03 5.23e+01 -1.0 5.10e+03 - 1.89e-05 1.30e-0
4h 1
3 4.2613385e+02 6.55e+03 5.24e+01 -1.0 6.71e+03 - 3.56e-05 2.29e-0
2f 1
4 1.9281092e+04 7.30e-02 8.02e+01 -1.0 6.55e+03 - 3.74e-02 1.00e+0
0h 1
5 1.1339331e+04 6.91e-02 5.90e+01 -1.0 8.02e+00 - 2.64e-01 5.00e-0
2f 1
6 1.0190236e+04 2.14e-02 2.42e+01 -1.0 5.08e+00 - 6.39e-01 1.00e+0
0f 1
7 1.0517954e+04 2.95e-03 2.00e-01 -1.0 2.03e+00 - 9.91e-01 1.00e+0
0f 1
8 1.0004064e+04 1.59e-03 6.62e-02 -1.7 5.16e+00 - 1.00e+00 9.87e-0
1f 1
9 9.8321723e+03 1.66e-03 3.42e-01 -2.5 1.25e+00 - 1.00e+00 8.01e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.8071756e+03 3.62e-05 7.24e-03 -2.5 2.80e-01 - 1.00e+00 1.00e+0
0h 1
11 9.7854015e+03 2.15e-06 7.23e-04 -3.8 5.36e+00 - 1.00e+00 1.00e+0
0h 1
12 9.7842083e+03 1.50e-08 3.75e-06 -5.7 2.95e-01 - 1.00e+00 1.00e+0
0h 1
13 9.7841926e+03 1.71e-12 4.05e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 13
(scaled) (unscaled)
Objective...............: 9.7841925843574469e+00 9.7841925843574463e+0
3
Dual infeasibility......: 4.0517096494071826e-10 4.0517096494071826e-0
7
Constraint violation....: 1.7059825774268234e-12 1.7059825774268234e-1
2
Complementarity.........: 2.7823131176252765e-09 2.7823131176252764e-0
6
Overall NLP error.......: 2.7823131176252765e-09 2.7823131176252764e-0
6
Number of objective function evaluations = 14
Number of objective gradient evaluations = 14
Number of equality constraint evaluations = 14
Number of inequality constraint evaluations = 14
Number of equality constraint Jacobian evaluations = 14
Number of inequality constraint Jacobian evaluations = 14
Number of Lagrangian Hessian evaluations = 13
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2998965e+02 4.77e+03 5.23e+01 -1.0 4.81e+03 - 2.02e-03 9.81e-0
3h 1
2 9.2082211e+02 4.77e+03 5.23e+01 -1.0 3.51e+03 - 1.43e-05 3.74e-0
4h 1
3 3.8434101e+02 4.66e+03 5.24e+01 -1.0 4.77e+03 - 2.86e-04 2.33e-0
2h 1
4 1.7339609e+04 7.04e-02 7.65e+01 -1.0 4.66e+03 - 7.76e-02 1.00e+0
0h 1
5 9.1903569e+03 6.38e-02 2.51e+01 -1.0 8.42e+00 - 6.40e-01 8.52e-0
2f 1
6 7.9431385e+03 3.12e-02 1.09e+01 -1.0 7.07e+00 - 6.69e-01 1.00e+0
0f 1
7 8.2254604e+03 9.50e-03 2.48e-01 -1.0 2.33e+00 - 9.92e-01 1.00e+0
0f 1
8 7.7798003e+03 3.47e-03 2.53e-01 -1.7 1.41e+01 - 8.77e-01 1.00e+0
0f 1
9 7.7469627e+03 8.09e-04 5.08e-01 -1.7 4.15e+01 - 5.67e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.7796961e+03 1.52e-05 4.71e-04 -1.7 1.89e+01 - 1.00e+00 1.00e+0
0h 1
11 7.5775462e+03 3.83e-04 2.06e-02 -3.8 7.52e+01 - 8.55e-01 8.41e-0
1f 1
12 7.5531529e+03 8.65e-05 1.32e-01 -3.8 1.18e+01 - 9.98e-01 7.96e-0
1h 1
13 7.5482013e+03 1.53e-07 9.15e-05 -3.8 2.39e+00 - 1.00e+00 1.00e+0
0f 1
14 7.5465668e+03 1.76e-08 3.02e-06 -5.7 5.94e-01 - 1.00e+00 1.00e+0
0f 1
15 7.5465477e+03 1.29e-12 4.23e-10 -8.6 7.36e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 7.5465477380354447e+00 7.5465477380354441e+0
3
Dual infeasibility......: 4.2283782744930153e-10 4.2283782744930153e-0
7
Constraint violation....: 1.2852080510938890e-12 1.2852080510938890e-1
2
Complementarity.........: 2.7575590094045545e-09 2.7575590094045543e-0
6
Overall NLP error.......: 2.7575590094045545e-09 2.7575590094045543e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2291184e+02 3.24e+03 5.23e+01 -1.0 3.27e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1824882e+02 3.24e+03 5.23e+01 -1.0 1.80e+03 - 2.80e-05 1.78e-0
4h 1
3 3.4580800e+02 3.17e+03 5.24e+01 -1.0 3.24e+03 - 9.12e-05 2.35e-0
2f 1
4 1.5889383e+04 6.81e-02 7.83e+01 -1.0 3.17e+03 - 5.42e-02 1.00e+0
0h 1
5 7.5694720e+03 6.34e-02 4.88e+01 -1.0 1.73e+01 - 3.65e-01 6.40e-0
2f 1
6 6.2120976e+03 1.27e-02 2.15e+01 -1.0 9.82e+00 - 6.05e-01 8.68e-0
1f 1
7 6.3908340e+03 3.81e-03 1.93e-01 -1.0 2.40e+00 - 9.91e-01 1.00e+0
0f 1
8 5.9353145e+03 1.50e-03 8.74e-02 -1.7 6.27e+00 - 1.00e+00 1.00e+0
0f 1
9 5.7758965e+03 1.91e-03 4.70e-01 -2.5 1.72e+00 - 1.00e+00 7.62e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.7472962e+03 2.95e-04 8.78e-02 -2.5 4.01e-01 - 1.00e+00 9.05e-0
1h 1
11 5.7505453e+03 1.10e-05 3.63e-03 -2.5 3.82e-02 - 1.00e+00 1.00e+0
0f 1
12 5.7231763e+03 1.03e-05 8.91e-03 -3.8 8.05e+00 - 1.00e+00 9.59e-0
1f 1
13 5.7225084e+03 1.56e-08 1.41e-05 -3.8 3.28e-01 - 1.00e+00 1.00e+0
0f 1
14 5.7210166e+03 1.79e-08 5.06e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0f 1
15 5.7210000e+03 6.40e-13 4.11e-10 -8.6 5.51e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.7210000366472959e+00 5.7210000366472959e+0
3
Dual infeasibility......: 4.1136442810078773e-10 4.1136442810078773e-0
7
Constraint violation....: 6.4004357369640275e-13 6.4004357369640275e-1
3
Complementarity.........: 2.7705363640940272e-09 2.7705363640940272e-0
6
Overall NLP error.......: 2.7705363640940272e-09 2.7705363640940272e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8047271e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.82e-0
3h 1
2 8.7571780e+02 2.00e+03 5.24e+01 -1.0 1.11e+03 - 4.57e-05 1.77e-0
4h 1
3 2.9373644e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 9.83e-05 2.27e-0
2f 1
4 1.4280611e+04 6.09e-02 7.92e+01 -1.0 1.95e+03 - 5.49e-02 1.00e+0
0h 1
5 5.5544141e+03 5.66e-02 5.35e+01 -1.0 6.57e+01 - 3.12e-01 6.38e-0
2f 1
6 4.1958834e+03 3.11e-02 2.65e+01 -1.0 3.24e+01 - 4.93e-01 4.18e-0
1f 1
7 3.3759781e+03 1.36e-02 2.17e+00 -1.0 1.11e+01 - 9.19e-01 9.26e-0
1f 1
8 3.8304846e+03 4.15e-04 1.05e-01 -1.0 5.03e+00 - 9.97e-01 1.00e+0
0f 1
9 3.1554551e+03 1.16e-03 1.35e+00 -1.7 4.32e+01 - 2.62e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.1967267e+03 8.77e-06 1.31e-02 -1.7 1.14e+01 - 1.00e+00 1.00e+0
0h 1
11 3.0824306e+03 2.98e-05 3.97e-01 -2.5 4.96e+01 - 1.00e+00 7.89e-0
1f 1
12 3.0635205e+03 1.07e-04 4.90e-03 -2.5 1.01e+01 - 1.00e+00 1.00e+0
0f 1
13 3.0434837e+03 2.78e-04 8.69e-02 -3.8 8.05e+00 - 7.71e-01 1.00e+0
0h 1
14 3.0407337e+03 1.61e-03 2.08e-03 -3.8 3.65e-02 - 9.71e-01 1.00e+0
0h 1
15 3.0407737e+03 7.56e-05 6.62e-05 -3.8 1.18e-02 - 1.00e+00 1.00e+0
0h 1
16 3.0392720e+03 1.31e-04 1.11e-03 -5.7 4.46e-01 - 9.18e-01 1.00e+0
0h 1
17 3.0392303e+03 3.28e-05 6.75e-06 -5.7 8.43e-03 - 1.00e+00 1.00e+0
0h 1
18 3.0392359e+03 1.94e-07 3.47e-06 -5.7 6.34e-04 - 1.00e+00 1.00e+0
0h 1
19 3.0392191e+03 2.64e-08 3.37e-05 -8.6 5.53e-03 - 1.00e+00 9.57e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 3.0392184e+03 4.52e-12 5.23e-11 -8.6 2.39e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 3.0392183905091921e+00 3.0392183905091920e+0
3
Dual infeasibility......: 5.2253806432243372e-11 5.2253806432243372e-0
8
Constraint violation....: 4.5200510001563998e-12 4.5200510001563998e-1
2
Complementarity.........: 4.6262384097757961e-09 4.6262384097757964e-0
6
Overall NLP error.......: 4.6262384097757961e-09 4.6262384097757964e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0841171e+02 9.17e+02 5.23e+01 -1.0 9.24e+02 - 1.00e-03 9.84e-0
3h 1
2 9.0017350e+02 9.17e+02 5.23e+01 -1.0 6.22e+02 - 6.48e-05 3.07e-0
4h 1
3 2.8418413e+02 8.96e+02 5.24e+01 -1.0 9.17e+02 - 2.54e-04 2.33e-0
2f 1
4 1.3379258e+04 6.54e-02 7.63e+01 -1.0 8.96e+02 - 8.26e-02 1.00e+0
0h 1
5 4.8738581e+03 5.90e-02 3.91e+01 -1.0 2.98e+01 - 4.61e-01 8.88e-0
2f 1
6 3.3817827e+03 1.88e-02 1.64e+01 -1.0 1.54e+01 - 6.04e-01 7.30e-0
1f 1
7 3.4376624e+03 5.20e-03 2.21e-01 -1.0 2.14e+00 - 9.88e-01 1.00e+0
0f 1
8 3.0205909e+03 1.48e-03 1.25e-01 -1.7 5.63e+00 - 1.00e+00 1.00e+0
0f 1
9 2.8655043e+03 1.98e-03 4.31e-01 -2.5 2.34e+00 - 1.00e+00 7.80e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8396070e+03 1.68e-04 5.50e-03 -2.5 4.74e-01 - 1.00e+00 1.00e+0
0h 1
11 2.8199124e+03 4.64e-05 1.88e-01 -3.8 8.08e+00 - 1.00e+00 7.34e-0
1h 1
12 2.8139131e+03 1.65e-07 3.72e-04 -3.8 2.12e+00 - 1.00e+00 1.00e+0
0f 1
13 2.8123986e+03 2.70e-08 9.27e-04 -5.7 4.46e-01 - 1.00e+00 9.86e-0
1h 1
14 2.8123821e+03 1.86e-12 1.31e-08 -5.7 6.32e-03 - 1.00e+00 1.00e+0
0f 1
15 2.8123637e+03 2.63e-12 4.48e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 2.8123637053488943e+00 2.8123637053488942e+0
3
Dual infeasibility......: 4.4777018156495521e-09 4.4777018156495521e-0
6
Constraint violation....: 2.6306595790615006e-12 2.6306595790615006e-1
2
Complementarity.........: 3.6085026779241522e-09 3.6085026779241520e-0
6
Overall NLP error.......: 4.4777018156495521e-09 4.4777018156495521e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254210179e-01 6.4890146254210174e+0
2
Dual infeasibility......: 4.9126604771073183e-09 4.9126604771073183e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646095252524453e-09 4.3646095252524449e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126604771073183e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933498e-01 5.8277753147933493e+0
2
Dual infeasibility......: 2.1031320946147231e-09 2.1031320946147231e-0
6
Constraint violation....: 6.2994318095199731e-11 6.2994318095199731e-1
1
Complementarity.........: 2.8882108896903808e-09 2.8882108896903807e-0
6
Overall NLP error.......: 2.8882108896903808e-09 2.8882108896903807e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254210179e-01 6.4890146254210174e+0
2
Dual infeasibility......: 4.9126604771073183e-09 4.9126604771073183e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646095252524453e-09 4.3646095252524449e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126604771073183e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.02e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 6.36e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643330e+00 1.6104063281643330e+0
3
Dual infeasibility......: 2.4573533589620844e-12 2.4573533589620844e-0
9
Constraint violation....: 6.3603173025546602e-15 6.3603173025546602e-1
5
Complementarity.........: 2.5062163910047551e-09 2.5062163910047549e-0
6
Overall NLP error.......: 2.5062163910047551e-09 2.5062163910047549e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2329662e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 3.31e-04 9.85e-0
3h 1
2 8.1338739e+02 9.17e+02 5.24e+01 -1.0 6.65e+02 - 7.53e-05 3.59e-0
4h 1
3 2.4215012e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 3.16e-04 2.12e-0
2f 1
4 1.2572829e+04 5.49e-02 8.23e+01 -1.0 8.98e+02 - 3.81e-02 1.00e+0
0h 1
5 3.9012337e+03 5.24e-02 5.73e+01 -1.0 8.21e+01 - 3.02e-01 4.95e-0
2f 1
6 1.9122630e+03 3.74e-02 3.08e+01 -1.0 3.92e+01 - 4.67e-01 5.07e-0
1f 1
7 4.6985285e+03 1.23e-02 2.74e+01 -1.0 2.08e+01 - 3.98e-01 1.00e+0
0h 1
8 1.8769618e+03 1.22e-02 1.07e+00 -1.0 2.57e+01 - 9.87e-01 8.88e-0
1f 1
9 1.9956227e+03 2.03e-04 4.84e-02 -1.0 2.76e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7291248e+03 2.21e-04 1.23e+00 -2.5 1.88e+01 - 9.37e-01 5.95e-0
1f 1
11 1.5409848e+03 3.77e-03 1.32e-01 -2.5 7.58e+00 - 7.96e-01 1.00e+0
0f 1
12 1.5181170e+03 5.06e-03 3.08e-01 -2.5 1.81e+00 - 1.00e+00 7.68e-0
1h 1
13 1.5303991e+03 2.38e-04 4.69e-03 -2.5 7.19e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5028095e+03 1.70e-04 2.15e-02 -3.8 1.08e+01 - 9.90e-01 9.29e-0
1h 1
15 1.5018205e+03 7.26e-07 6.85e-05 -3.8 7.35e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003124e+03 3.77e-07 1.78e-04 -5.7 5.94e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003117e+03 3.79e-11 2.92e-09 -5.7 4.21e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0h 1
1 8.6577131e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 4.97e-04 9.85e-0
3h 1
2 8.5529111e+02 9.17e+02 5.24e+01 -1.0 6.82e+02 - 7.34e-05 3.86e-0
4h 1
3 2.6219590e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 3.43e-04 2.22e-0
2f 1
4 1.2935511e+04 5.94e-02 8.01e+01 -1.0 8.97e+02 - 4.97e-02 1.00e+0
0h 1
5 4.2970559e+03 5.55e-02 5.39e+01 -1.0 7.40e+01 - 3.17e-01 5.94e-0
2f 1
49 1.839145e+04 1.632511e+04 4.378902e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2433284e+02 1.57e+04 5.24e+01 -1.0 1.59e+04 - 3.31e-04 9.80e-0
3h 1
2 8.2134525e+02 1.57e+04 5.24e+01 -1.0 1.37e+04 - 2.39e-05 1.14e-0
4h 1
3 8.1757003e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 1.83e-05 3.03e-0
4h 1
4 8.1411460e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 3.20e-04 2.84e-0
4h 1
5 5.6607746e+02 1.54e+04 6.40e+01 -1.0 1.57e+04 - 6.49e-04 2.12e-0
2f 1
6 2.7077261e+04 5.54e-02 8.24e+01 -1.0 1.54e+04 - 3.89e-02 1.00e+0
0h 1
7 1.8698357e+04 5.28e-02 5.48e+01 -1.0 7.96e+01 - 3.31e-01 5.06e-0
2f 1
8 1.6732682e+04 3.72e-02 2.92e+01 -1.0 3.93e+01 - 4.71e-01 5.03e-0
1f 1
9 1.7076111e+04 2.28e-02 1.34e+01 -1.0 2.04e+01 - 4.03e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6824281e+04 6.01e-03 3.45e+00 -1.0 4.86e+00 - 8.07e-01 1.00e+0
0h 1
11 1.6852980e+04 2.05e-04 1.93e+00 -1.0 3.77e+00 - 3.07e-01 1.00e+0
0f 1
12 1.6853243e+04 1.11e-05 5.29e-01 -1.0 1.41e+00 - 7.26e-01 1.00e+0
0f 1
13 1.6546928e+04 2.42e-04 3.66e-01 -1.7 5.30e+00 - 8.63e-01 7.49e-0
1f 1
14 1.6485338e+04 5.73e-04 4.04e-01 -1.7 6.54e+00 - 5.92e-01 1.00e+0
0f 1
15 1.6482576e+04 9.08e-05 8.49e-02 -1.7 1.24e+01 - 6.89e-01 1.00e+0
0h 1
16 1.6369166e+04 1.05e-03 6.63e-02 -2.5 1.19e+01 - 9.09e-01 1.00e+0
0f 1
17 1.6344802e+04 1.35e-03 1.53e-02 -2.5 5.06e+00 - 1.00e+00 1.00e+0
0h 1
18 1.6328042e+04 2.44e-04 1.09e-01 -3.8 6.02e+00 - 1.00e+00 8.31e-0
1h 1
19 1.6326250e+04 5.31e-07 1.29e-04 -3.8 7.33e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325264e+04 3.68e-07 7.77e-03 -5.7 2.61e-01 - 1.00e+00 8.34e-0
1h 1
21 1.6325119e+04 1.09e-08 3.89e-07 -5.7 5.59e-03 - 1.00e+00 1.00e+0
0f 1
22 1.6325105e+04 1.11e-10 2.93e-06 -8.6 2.26e-03 - 1.00e+00 9.96e-0
1h 1
23 1.6325105e+04 1.24e-14 4.43e-14 -8.6 4.55e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 23
(scaled) (unscaled)
Objective...............: 1.6325105261433350e+01 1.6325105261433349e+0
4
Dual infeasibility......: 4.4312552034893890e-14 4.4312552034893890e-1
1
Constraint violation....: 1.2434497875801753e-14 1.2434497875801753e-1
4
Complementarity.........: 2.5060279373014335e-09 2.5060279373014334e-0
6
Overall NLP error.......: 2.5060279373014335e-09 2.5060279373014334e-0
6
Number of objective function evaluations = 27
Number of objective gradient evaluations = 24
Number of equality constraint evaluations = 27
Number of inequality constraint evaluations = 27
Number of equality constraint Jacobian evaluations = 24
Number of inequality constraint Jacobian evaluations = 24
Number of Lagrangian Hessian evaluations = 23
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.036
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4158794e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 3.83e-04 9.80e-0
3h 1
2 8.3874413e+02 1.50e+04 5.24e+01 -1.0 1.43e+04 - 4.60e-05 1.04e-0
4h 1
3 8.3719424e+02 1.50e+04 5.24e+01 -1.0 1.49e+04 - 6.63e-06 1.18e-0
4h 1
4 8.3531906e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 1.23e-04 1.45e-0
4h 1
5 5.5833154e+02 1.46e+04 5.26e+01 -1.0 1.50e+04 - 2.72e-04 2.17e-0
2f 1
6 2.6748858e+04 5.66e-02 8.13e+01 -1.0 1.46e+04 - 4.36e-02 1.00e+0
0h 1
7 1.8097679e+04 5.32e-02 5.30e+01 -1.0 8.12e+01 - 3.41e-01 5.42e-0
2f 1
8 1.5984426e+04 3.38e-02 2.90e+01 -1.0 4.21e+01 - 4.62e-01 5.32e-0
1f 1
9 1.6533780e+04 1.85e-02 1.14e+01 -1.0 2.01e+01 - 5.02e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6143899e+04 5.32e-03 6.30e-01 -1.0 5.23e+00 - 9.57e-01 1.00e+0
0h 1
11 1.5788014e+04 1.47e-03 5.03e-01 -1.7 7.05e+00 - 1.00e+00 7.91e-0
1f 1
12 1.5723637e+04 8.94e-04 2.23e-02 -1.7 2.08e+01 - 1.00e+00 1.00e+0
0f 1
13 1.5586116e+04 1.49e-03 1.03e-01 -3.8 2.32e+01 - 7.71e-01 9.14e-0
1f 1
14 1.5558750e+04 2.21e-03 1.08e-01 -3.8 2.08e+00 - 8.24e-01 7.29e-0
1h 1
15 1.5560022e+04 5.17e-05 1.62e-02 -3.8 1.08e-01 - 1.00e+00 9.86e-0
1h 1
16 1.5560262e+04 3.06e-07 3.83e-06 -3.8 4.44e-02 - 1.00e+00 1.00e+0
0f 1
17 1.5559217e+04 4.13e-07 5.39e-04 -5.7 1.49e-01 - 1.00e+00 9.91e-0
1h 1
18 1.5559215e+04 4.36e-11 3.50e-09 -5.7 4.66e-03 - 1.00e+00 1.00e+0
0f 1
19 1.5559202e+04 6.30e-11 2.65e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.5559202141760586e+01 1.5559202141760587e+0
4
Dual infeasibility......: 2.6490967325183183e-09 2.6490967325183183e-0
6
Constraint violation....: 6.3001825978403758e-11 6.3001825978403758e-1
1
Complementarity.........: 2.8882677673664792e-09 2.8882677673664790e-0
6
Overall NLP error.......: 2.8882677673664792e-09 2.8882677673664790e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6401607e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 4.82e-04 9.80e-0
3h 1
2 8.6123236e+02 1.39e+04 5.24e+01 -1.0 1.37e+04 - 9.13e-05 1.01e-0
4h 1
3 8.5213281e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 3.12e-06 6.54e-0
4f 1
4 5.5518326e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 7.03e-04 2.20e-0
2h 1
5 2.5704787e+04 5.95e-02 8.03e+01 -1.0 1.36e+04 - 4.97e-02 1.00e+0
0h 1
6 1.7228696e+04 5.56e-02 5.33e+01 -1.0 7.41e+01 - 3.26e-01 5.97e-0
2f 1
7 1.5583819e+04 2.97e-02 2.79e+01 -1.0 3.97e+01 - 4.72e-01 4.41e-0
1f 1
8 1.5126719e+04 1.37e-02 2.58e+00 -1.0 1.09e+01 - 9.18e-01 1.00e+0
0f 1
9 1.5371917e+04 5.27e-04 8.47e-02 -1.0 4.58e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4841490e+04 5.84e-04 4.78e-01 -2.5 7.80e+00 - 8.88e-01 6.88e-0
1f 1
11 1.4750425e+04 3.37e-04 3.56e-01 -2.5 3.18e+00 - 8.71e-01 1.00e+0
0h 1
12 1.4749119e+04 6.38e-04 3.86e-01 -2.5 9.52e+00 - 1.65e-02 4.43e-0
3h 2
13 1.4718057e+04 1.09e-03 1.67e-02 -2.5 1.52e+00 - 1.00e+00 1.00e+0
0h 1
14 1.4704824e+04 1.77e-03 6.31e-02 -3.8 2.68e+00 - 7.25e-01 1.00e+0
0h 1
15 1.4700755e+04 3.98e-03 1.31e-03 -3.8 5.30e-02 - 1.00e+00 1.00e+0
0h 1
16 1.4701000e+04 4.98e-05 2.49e-04 -3.8 1.07e-02 - 1.00e+00 1.00e+0
0h 1
17 1.4699778e+04 8.11e-05 5.12e-04 -5.7 1.49e-01 - 9.54e-01 9.22e-0
1h 1
18 1.4699711e+04 2.12e-05 4.61e-03 -5.7 1.15e-02 - 1.00e+00 7.46e-0
1h 1
19 1.4699702e+04 6.80e-09 3.01e-06 -5.7 2.93e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.4699687e+04 9.41e-09 3.09e-05 -8.6 1.84e-03 - 1.00e+00 9.81e-0
1h 1
21 1.4699687e+04 2.23e-12 1.38e-10 -8.6 3.52e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.4699687075548773e+01 1.4699687075548773e+0
4
Dual infeasibility......: 1.3792041122074843e-10 1.3792041122074845e-0
7
Constraint violation....: 2.2287727219350018e-12 2.2287727219350018e-1
2
Complementarity.........: 2.5129172095173234e-09 2.5129172095173234e-0
6
Overall NLP error.......: 2.5129172095173234e-09 2.5129172095173234e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8073105e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.97e-04 9.80e-0
3h 1
2 8.7796146e+02 1.27e+04 5.24e+01 -1.0 1.24e+04 - 8.93e-05 1.01e-0
4h 1
3 8.6692458e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 3.47e-06 7.37e-0
4f 1
4 5.4092019e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 7.99e-04 2.24e-0
2h 1
5 2.4576710e+04 6.17e-02 7.93e+01 -1.0 1.24e+04 - 5.67e-02 1.00e+0
0h 1
6 1.6171478e+04 5.73e-02 5.23e+01 -1.0 6.39e+01 - 3.28e-01 6.59e-0
2f 1
7 1.4812866e+04 3.11e-02 2.54e+01 -1.0 3.21e+01 - 5.03e-01 4.22e-0
1f 1
8 1.4040427e+04 1.14e-02 2.00e+00 -1.0 1.10e+01 - 9.20e-01 9.11e-0
1f 1
9 1.4460004e+04 3.38e-04 9.28e-02 -1.0 4.85e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3750291e+04 1.39e-03 7.06e-02 -2.5 6.50e+00 - 8.71e-01 8.55e-0
1f 1
11 1.3727058e+04 1.41e-05 1.70e-02 -2.5 6.60e-01 - 1.00e+00 1.00e+0
0h 1
12 1.3695913e+04 1.35e-03 3.69e-02 -3.8 2.68e+00 - 7.12e-01 1.00e+0
0f 1
13 1.3693938e+04 9.56e-04 1.56e-03 -3.8 3.41e-02 - 9.61e-01 1.00e+0
0h 1
14 1.3694087e+04 1.22e-04 1.32e-04 -3.8 1.60e-02 - 1.00e+00 1.00e+0
0h 1
15 1.3692879e+04 1.38e-04 1.17e-03 -5.7 1.49e-01 - 9.16e-01 1.00e+0
0h 1
16 1.3692835e+04 3.55e-05 7.55e-06 -5.7 8.77e-03 - 1.00e+00 1.00e+0
0h 1
17 1.3692839e+04 4.36e-07 4.70e-06 -5.7 9.55e-04 - 1.00e+00 1.00e+0
0h 1
18 1.3692826e+04 3.62e-08 4.80e-05 -8.6 1.84e-03 - 1.00e+00 9.49e-0
1h 1
19 1.3692826e+04 6.54e-12 6.63e-11 -8.6 9.47e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.3692825526978261e+01 1.3692825526978260e+0
4
Dual infeasibility......: 6.6307838530363349e-11 6.6307838530363349e-0
8
Constraint violation....: 6.5408789495791098e-12 6.5408789495791098e-1
2
Complementarity.........: 2.5095397414806563e-09 2.5095397414806564e-0
6
Overall NLP error.......: 2.5095397414806563e-09 2.5095397414806564e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2301496e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.51e-03 9.80e-0
3h 1
2 9.2012933e+02 1.11e+04 5.23e+01 -1.0 1.02e+04 - 3.26e-05 1.08e-0
4h 1
3 8.3424138e+02 1.11e+04 5.23e+01 -1.0 1.11e+04 - 1.17e-05 5.22e-0
3h 1
4 5.7283738e+02 1.08e+04 5.22e+01 -1.0 1.11e+04 - 5.95e-03 2.13e-0
2h 1
5 2.1532474e+04 7.53e-02 7.76e+01 -1.0 1.08e+04 - 8.36e-02 1.00e+0
0h 1
6 1.5215064e+04 6.76e-02 2.23e+01 -1.0 1.30e+01 - 6.84e-01 9.54e-0
2f 1
7 1.3955436e+04 2.05e-02 7.03e+00 -1.0 9.59e+00 - 7.22e-01 8.73e-0
1f 1
8 1.4214931e+04 1.09e-02 1.48e-01 -1.0 2.63e+00 - 9.93e-01 9.34e-0
1f 1
9 1.3828274e+04 2.88e-03 5.86e-01 -1.7 1.52e+01 - 6.88e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3790977e+04 4.90e-04 2.08e-01 -1.7 1.60e+01 - 8.63e-01 1.00e+0
0h 1
11 1.3801288e+04 3.42e-05 1.48e-03 -1.7 7.31e+00 - 1.00e+00 1.00e+0
0h 1
12 1.3626724e+04 4.58e-04 2.14e-02 -3.8 3.93e+01 - 8.47e-01 8.37e-0
1f 1
13 1.3606894e+04 1.42e-04 2.09e-01 -3.8 6.35e+00 - 9.92e-01 7.20e-0
1h 1
14 1.3601605e+04 3.42e-07 2.96e-04 -3.8 1.78e+00 - 1.00e+00 1.00e+0
0h 1
15 1.3600267e+04 1.95e-08 4.45e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
16 1.3600252e+04 7.82e-13 4.77e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.3600252139245079e+01 1.3600252139245078e+0
4
Dual infeasibility......: 4.7670879535931631e-10 4.7670879535931631e-0
7
Constraint violation....: 7.8173578721418835e-13 7.8173578721418835e-1
3
Complementarity.........: 3.0880454023520700e-09 3.0880454023520697e-0
6
Overall NLP error.......: 3.0880454023520700e-09 3.0880454023520697e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8776327e+02 9.19e+03 5.24e+01 -1.0 9.28e+03 - 6.64e-04 9.80e-0
3h 1
2 8.8487848e+02 9.19e+03 5.24e+01 -1.0 8.49e+03 - 4.35e-05 1.07e-0
4h 1
3 8.1017706e+02 9.15e+03 5.24e+01 -1.0 9.19e+03 - 1.14e-05 4.07e-0
3h 1
4 4.8829984e+02 8.96e+03 5.23e+01 -1.0 9.15e+03 - 4.62e-03 2.12e-0
2h 1
5 1.9624073e+04 6.67e-02 7.88e+01 -1.0 8.96e+03 - 7.36e-02 1.00e+0
0h 1
6 1.2613352e+04 6.06e-02 4.34e+01 -1.0 5.13e+01 - 4.30e-01 8.42e-0
2f 1
7 1.1287964e+04 2.91e-02 1.67e+01 -1.0 2.55e+01 - 6.00e-01 4.84e-0
1f 1
8 1.0844638e+04 5.12e-03 9.75e-01 -1.0 9.16e+00 - 9.34e-01 7.59e-0
1f 1
9 1.1096445e+04 1.87e-04 6.14e-02 -1.0 4.66e+00 - 9.86e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.0465581e+04 2.22e-03 7.86e-02 -2.5 4.78e+00 - 8.70e-01 8.68e-0
1f 1
11 1.0359598e+04 1.08e-03 4.55e-01 -2.5 7.58e-01 - 1.00e+00 6.04e-0
1f 1
12 1.0359670e+04 2.49e-06 8.10e-03 -2.5 1.52e-01 - 1.00e+00 1.00e+0
0h 1
13 1.0339422e+04 6.13e-06 2.44e-02 -3.8 5.36e+00 - 9.14e-01 8.89e-0
1f 1
14 1.0335905e+04 4.62e-04 4.75e-04 -3.8 5.93e-01 - 1.00e+00 1.00e+0
0f 1
15 1.0334764e+04 6.25e-05 1.12e-02 -5.7 2.97e-01 - 8.14e-01 1.00e+0
0h 1
16 1.0334651e+04 3.52e-05 3.93e-05 -5.7 9.55e-03 - 1.00e+00 1.00e+0
0h 1
17 1.0334652e+04 1.18e-06 1.12e-05 -5.7 1.43e-03 - 1.00e+00 9.97e-0
1h 1
18 1.0334638e+04 2.43e-09 9.85e-08 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
19 1.0334638e+04 3.42e-15 3.65e-14 -8.6 1.73e-06 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.0334637959221507e+01 1.0334637959221507e+0
4
Dual infeasibility......: 3.6541575522873734e-14 3.6541575522873734e-1
1
Constraint violation....: 3.4248329722330115e-15 3.4248329722330115e-1
5
Complementarity.........: 3.0121603089844824e-09 3.0121603089844824e-0
6
Overall NLP error.......: 3.0121603089844824e-09 3.0121603089844824e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3710605e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 3.06e-03 9.80e-0
3h 1
2 9.3410771e+02 6.71e+03 5.23e+01 -1.0 6.33e+03 - 5.53e-05 1.05e-0
4h 1
3 8.7601628e+02 6.69e+03 5.23e+01 -1.0 6.70e+03 - 8.90e-06 2.62e-0
3f 1
4 4.4078555e+02 6.54e+03 5.23e+01 -1.0 6.69e+03 - 3.32e-03 2.17e-0
2h 1
5 1.7952488e+04 7.75e-02 7.79e+01 -1.0 6.54e+03 - 7.84e-02 1.00e+0
0h 1
6 1.1162158e+04 7.00e-02 2.30e+01 -1.0 4.32e+00 - 6.80e-01 8.97e-0
2f 1
7 1.0161093e+04 3.32e-02 7.43e+00 -1.0 4.23e+00 - 7.42e-01 1.00e+0
0f 1
8 1.0283900e+04 1.70e-02 7.27e-01 -1.0 1.10e+00 - 9.96e-01 4.94e-0
1f 2
9 1.0000013e+04 8.27e-03 3.35e-01 -1.7 1.28e+01 - 1.00e+00 8.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.9361941e+03 1.02e-03 1.04e-01 -1.7 8.95e+00 - 1.00e+00 1.00e+0
0f 1
11 9.8169976e+03 2.77e-04 1.12e-01 -2.5 1.73e+01 - 9.89e-01 8.85e-0
1f 1
12 9.8069007e+03 4.94e-06 1.10e-03 -2.5 1.95e+00 - 1.00e+00 1.00e+0
0f 1
13 9.7851225e+03 5.56e-06 7.61e-04 -3.8 2.68e+00 - 1.00e+00 1.00e+0
0f 1
14 9.7842068e+03 3.44e-09 3.52e-06 -5.7 1.48e-01 - 1.00e+00 1.00e+0
0h 1
15 9.7841926e+03 2.34e-12 4.09e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 9.7841925828283820e+00 9.7841925828283820e+0
3
Dual infeasibility......: 4.0868829584806167e-10 4.0868829584806167e-0
7
Constraint violation....: 2.3425705819590803e-12 2.3425705819590803e-1
2
Complementarity.........: 2.5729802584946399e-09 2.5729802584946401e-0
6
Overall NLP error.......: 2.5729802584946399e-09 2.5729802584946401e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0880494e+02 4.77e+03 5.23e+01 -1.0 4.81e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0291924e+02 4.77e+03 5.23e+01 -1.0 2.79e+03 - 2.15e-05 2.38e-0
4h 1
3 3.7467532e+02 4.66e+03 5.24e+01 -1.0 4.77e+03 - 1.51e-04 2.34e-0
2f 1
4 1.7300257e+04 6.53e-02 7.97e+01 -1.0 4.66e+03 - 4.04e-02 1.00e+0
0h 1
5 8.8617124e+03 6.16e-02 5.71e+01 -1.0 3.53e+01 - 2.79e-01 5.15e-0
2f 1
6 7.5509801e+03 1.93e-02 2.65e+01 -1.0 1.63e+01 - 5.49e-01 6.34e-0
1f 1
7 7.1819282e+03 5.83e-03 7.45e-01 -1.0 4.62e+00 - 9.62e-01 8.21e-0
1f 1
8 7.4584045e+03 1.60e-04 6.14e-02 -1.0 6.90e+00 - 9.99e-01 1.00e+0
0f 1
9 6.8763917e+03 2.23e-03 9.86e-02 -2.5 6.57e+00 - 8.54e-01 8.68e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.7217380e+03 2.17e-03 3.89e-01 -2.5 1.15e+00 - 1.00e+00 7.71e-0
1f 1
11 6.6995759e+03 1.09e-04 4.63e-03 -2.5 2.72e-01 - 1.00e+00 1.00e+0
0h 1
12 6.6742283e+03 2.92e-05 1.37e-01 -3.8 1.34e+01 - 1.00e+00 7.68e-0
1h 1
13 6.6677284e+03 1.17e-07 3.28e-04 -3.8 3.11e+00 - 1.00e+00 1.00e+0
0f 1
14 6.6659140e+03 2.88e-08 1.03e-03 -5.7 7.43e-01 - 1.00e+00 9.85e-0
1f 1
15 6.6658915e+03 1.98e-12 1.42e-08 -5.7 1.14e-02 - 1.00e+00 1.00e+0
0f 1
16 6.6658693e+03 2.63e-12 4.48e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.6658693439409777e+00 6.6658693439409772e+0
3
Dual infeasibility......: 4.4776960992423021e-09 4.4776960992423021e-0
6
Constraint violation....: 2.6311869349981976e-12 2.6311869349981976e-1
2
Complementarity.........: 3.6084966351123713e-09 3.6084966351123712e-0
6
Overall NLP error.......: 4.4776960992423021e-09 4.4776960992423021e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6653022e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 4.97e-04 9.81e-0
3f 1
2 8.6323248e+02 3.24e+03 5.24e+01 -1.0 2.66e+03 - 5.18e-05 1.21e-0
4h 1
3 5.3831860e+02 3.20e+03 5.25e+01 -1.0 3.24e+03 - 3.12e-05 1.32e-0
2f 1
4 3.9903813e+02 3.13e+03 5.15e+01 -1.0 3.20e+03 - 2.00e-02 2.32e-0
2f 1
5 9.8503273e+03 7.36e-02 7.80e+01 -1.0 3.13e+03 - 1.07e-01 1.00e+0
0h 1
6 5.7440245e+03 6.32e-02 2.21e+01 -1.0 4.61e+01 - 6.97e-01 1.31e-0
1f 1
7 4.3233476e+03 3.42e-02 1.97e+00 -1.0 2.67e+01 - 8.81e-01 6.15e-0
1f 1
8 4.6962643e+03 3.54e-03 2.33e+00 -1.0 4.17e+00 - 5.72e-01 1.00e+0
0f 1
9 4.5977383e+03 2.99e-04 4.76e-01 -1.0 4.75e+00 - 4.95e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2060879e+03 3.33e-04 4.58e-01 -1.7 4.85e+00 - 9.14e-01 7.39e-0
1f 1
11 4.2053425e+03 4.01e-05 6.05e-01 -1.7 1.16e+01 - 6.82e-01 1.00e+0
0f 1
12 4.2064010e+03 5.65e-06 4.15e-03 -1.7 1.31e+01 - 9.90e-01 1.00e+0
0h 1
13 4.1106446e+03 6.16e-05 1.78e-02 -2.5 2.72e+01 - 1.00e+00 9.84e-0
1f 1
14 4.0890496e+03 2.91e-03 7.57e-02 -3.8 5.83e+00 - 6.50e-01 9.93e-0
1h 1
15 4.0843252e+03 5.65e-03 1.12e-02 -3.8 6.64e-02 - 8.51e-01 1.00e+0
0h 1
16 4.0848557e+03 7.04e-05 5.13e-04 -3.8 1.66e-02 - 1.00e+00 1.00e+0
0h 1
17 4.0833267e+03 1.38e-04 8.92e-04 -5.7 2.97e-01 - 9.38e-01 1.00e+0
0h 1
18 4.0833300e+03 4.08e-05 5.43e-03 -5.7 1.50e-03 - 1.00e+00 7.05e-0
1h 1
19 4.0833413e+03 1.37e-08 1.67e-06 -5.7 1.06e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 4.0833247e+03 9.50e-09 2.21e-05 -8.6 3.68e-03 - 1.00e+00 9.82e-0
1h 1
21 4.0833244e+03 1.60e-12 8.08e-11 -8.6 6.57e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 4.0833243900968093e+00 4.0833243900968091e+0
3
Dual infeasibility......: 8.0752436711056956e-11 8.0752436711056949e-0
8
Constraint violation....: 1.6006085346020882e-12 1.6006085346020882e-1
2
Complementarity.........: 3.0051209025813974e-09 3.0051209025813971e-0
6
Overall NLP error.......: 3.0051209025813974e-09 3.0051209025813971e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1576532e+02 2.00e+03 5.23e+01 -1.0 2.01e+03 - 1.20e-03 9.82e-0
3h 1
2 9.1032142e+02 2.00e+03 5.23e+01 -1.0 1.04e+03 - 3.89e-05 2.06e-0
4h 1
3 3.1311212e+02 1.95e+03 5.24e+01 -1.0 2.00e+03 - 1.27e-04 2.35e-0
2f 1
4 1.4582884e+04 6.66e-02 7.62e+01 -1.0 1.95e+03 - 8.09e-02 1.00e+0
0h 1
5 6.1165383e+03 6.02e-02 3.22e+01 -1.0 2.09e+01 - 5.47e-01 8.74e-0
2f 1
6 4.5880149e+03 1.60e-02 1.42e+01 -1.0 1.27e+01 - 6.20e-01 8.67e-0
1f 1
7 4.8954300e+03 1.60e-03 1.24e-01 -1.0 3.70e+00 - 9.91e-01 1.00e+0
0f 1
8 4.4215955e+03 1.88e-03 1.38e-01 -1.7 9.28e+00 - 9.38e-01 1.00e+0
0f 1
9 4.2430585e+03 1.67e-03 7.11e-02 -2.5 1.19e+00 - 8.17e-01 7.73e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2058677e+03 3.35e-04 2.51e-02 -2.5 5.91e-01 - 1.00e+00 9.77e-0
1f 1
11 4.1818537e+03 2.02e-06 7.33e-02 -3.8 8.10e+00 - 9.42e-01 1.00e+0
0h 1
12 4.1819973e+03 1.24e-09 7.38e-06 -3.8 9.91e-03 - 1.00e+00 1.00e+0
0h 1
13 4.1805106e+03 1.79e-08 1.81e-04 -5.7 4.46e-01 - 1.00e+00 9.96e-0
1f 1
14 4.1805076e+03 1.80e-12 2.29e-09 -5.7 1.79e-03 - 1.00e+00 1.00e+0
0f 1
15 4.1804892e+03 2.63e-12 1.52e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 4.1804891556850361e+00 4.1804891556850362e+0
3
Dual infeasibility......: 1.5189628070558208e-09 1.5189628070558208e-0
6
Constraint violation....: 2.6288138332830613e-12 2.6288138332830613e-1
2
Complementarity.........: 4.1690533712673095e-09 4.1690533712673092e-0
6
Overall NLP error.......: 4.1690533712673095e-09 4.1690533712673092e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2329662e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 3.31e-04 9.85e-0
3h 1
2 8.1338739e+02 9.17e+02 5.24e+01 -1.0 6.65e+02 - 7.53e-05 3.59e-0
4h 1
3 2.4215012e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 3.16e-04 2.12e-0
2f 1
4 1.2572829e+04 5.49e-02 8.23e+01 -1.0 8.98e+02 - 3.81e-02 1.00e+0
0h 1
5 3.9012337e+03 5.24e-02 5.73e+01 -1.0 8.21e+01 - 3.02e-01 4.95e-0
2f 1
6 1.9122630e+03 3.74e-02 3.08e+01 -1.0 3.92e+01 - 4.67e-01 5.07e-0
1f 1
7 4.6985285e+03 1.23e-02 2.74e+01 -1.0 2.08e+01 - 3.98e-01 1.00e+0
0h 1
8 1.8769618e+03 1.22e-02 1.07e+00 -1.0 2.57e+01 - 9.87e-01 8.88e-0
1f 1
9 1.9956227e+03 2.03e-04 4.84e-02 -1.0 2.76e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7291248e+03 2.21e-04 1.23e+00 -2.5 1.88e+01 - 9.37e-01 5.95e-0
1f 1
11 1.5409848e+03 3.77e-03 1.32e-01 -2.5 7.58e+00 - 7.96e-01 1.00e+0
0f 1
12 1.5181170e+03 5.06e-03 3.08e-01 -2.5 1.81e+00 - 1.00e+00 7.68e-0
1h 1
13 1.5303991e+03 2.38e-04 4.69e-03 -2.5 7.19e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5028095e+03 1.70e-04 2.15e-02 -3.8 1.08e+01 - 9.90e-01 9.29e-0
1h 1
15 1.5018205e+03 7.26e-07 6.85e-05 -3.8 7.35e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003124e+03 3.77e-07 1.78e-04 -5.7 5.94e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003117e+03 3.79e-11 2.92e-09 -5.7 4.21e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932751767057e+00 1.5002932751767057e+0
3
Dual infeasibility......: 2.1737234189016573e-09 2.1737234189016573e-0
6
Constraint violation....: 6.2995636485041473e-11 6.2995636485041473e-1
1
Complementarity.........: 2.8882174480559516e-09 2.8882174480559515e-0
6
Overall NLP error.......: 2.8882174480559516e-09 2.8882174480559515e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.77e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5003663e+02 7.50e+01 9.04e+01 -1.0 2.59e+01 - 3.83e-04 3.52e-0
2f 1
2 1.1818872e+04 5.63e-02 8.12e+01 -1.0 2.87e+01 - 4.64e-02 1.00e+0
0h 1
3 3.1585745e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.65e-0
2f 1
4 1.0154811e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8148885e+03 7.28e-03 1.55e+01 -1.0 1.93e+01 - 6.11e-01 1.00e+0
0h 1
6 1.1196678e+03 5.40e-03 4.04e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8244219e+02 9.99e-04 2.10e-01 -1.7 5.71e+00 - 1.00e+00 8.87e-0
1h 1
8 7.2817524e+02 8.46e-04 1.35e-02 -1.7 3.45e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0982262e+02 1.50e-03 1.13e-01 -3.8 4.49e+00 - 7.71e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8216109e+02 2.17e-03 7.23e-02 -3.8 2.11e+00 - 8.07e-01 7.40e-0
1h 1
11 5.8336684e+02 9.52e-05 4.78e-02 -3.8 3.17e-02 - 1.00e+00 9.56e-0
1h 1
12 5.8368716e+02 2.82e-07 1.33e-05 -3.8 3.28e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278928e+02 4.12e-07 5.39e-04 -5.7 3.47e-02 - 1.00e+00 9.91e-0
1h 1
14 5.8278859e+02 4.36e-11 3.52e-09 -5.7 2.10e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.65e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753111572506e-01 5.8277753111572508e+0
2
Dual infeasibility......: 2.6503284108692254e-09 2.6503284108692254e-0
6
Constraint violation....: 6.3002117411947722e-11 6.3002117411947722e-1
1
Complementarity.........: 2.8882681478407354e-09 2.8882681478407354e-0
6
Overall NLP error.......: 2.8882681478407354e-09 2.8882681478407354e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1584843e+02 1.09e+02 1.13e+02 -1.0 3.76e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1398692e+04 5.38e-02 8.36e+01 -1.0 4.53e+01 - 3.10e-02 1.00e+0
0h 1
3 2.7848918e+03 5.17e-02 6.48e+01 -1.0 8.43e+01 - 2.27e-01 4.32e-0
2f 1
4 9.8155788e+02 4.24e-02 3.38e+01 -1.0 3.41e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5909726e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.21e-01 1.00e+0
0h 1
6 9.4491032e+02 1.01e-02 8.73e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6264865e+02 4.59e-04 6.60e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536469e+02 1.94e-03 1.94e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379741e+02 3.25e-03 6.12e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140235e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388164e+02 1.57e-04 1.69e-02 -3.8 7.57e-01 - 9.93e-01 9.41e-0
1h 1
12 5.8370191e+02 7.28e-07 6.65e-05 -3.8 8.63e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278679e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.06e-09 -5.7 3.41e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148935363e-01 5.8277753148935358e+0
2
Dual infeasibility......: 2.0880542322971141e-09 2.0880542322971141e-0
6
Constraint violation....: 6.2994193195109460e-11 6.2994193195109460e-1
1
Complementarity.........: 2.8882094461417431e-09 2.8882094461417432e-0
6
Overall NLP error.......: 2.8882094461417431e-09 2.8882094461417432e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.77e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5003663e+02 7.50e+01 9.04e+01 -1.0 2.59e+01 - 3.83e-04 3.52e-0
2f 1
2 1.1818872e+04 5.63e-02 8.12e+01 -1.0 2.87e+01 - 4.64e-02 1.00e+0
0h 1
3 3.1585745e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.65e-0
2f 1
4 1.0154811e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8148885e+03 7.28e-03 1.55e+01 -1.0 1.93e+01 - 6.11e-01 1.00e+0
0h 1
6 1.1196678e+03 5.40e-03 4.04e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8244219e+02 9.99e-04 2.10e-01 -1.7 5.71e+00 - 1.00e+00 8.87e-0
1h 1
8 7.2817524e+02 8.46e-04 1.35e-02 -1.7 3.45e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0982262e+02 1.50e-03 1.13e-01 -3.8 4.49e+00 - 7.71e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8216109e+02 2.17e-03 7.23e-02 -3.8 2.11e+00 - 8.07e-01 7.40e-0
1h 1
11 5.8336684e+02 9.52e-05 4.78e-02 -3.8 3.17e-02 - 1.00e+00 9.56e-0
1h 1
12 5.8368716e+02 2.82e-07 1.33e-05 -3.8 3.28e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278928e+02 4.12e-07 5.39e-04 -5.7 3.47e-02 - 1.00e+00 9.91e-0
1h 1
14 5.8278859e+02 4.36e-11 3.52e-09 -5.7 2.10e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.65e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753111572506e-01 5.8277753111572508e+0
2
Dual infeasibility......: 2.6503284108692254e-09 2.6503284108692254e-0
6
Constraint violation....: 6.3002117411947722e-11 6.3002117411947722e-1
1
Complementarity.........: 2.8882681478407354e-09 2.8882681478407354e-0
6
Overall NLP error.......: 2.8882681478407354e-09 2.8882681478407354e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.27e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9796476e+02 4.09e+01 5.94e+01 -1.0 1.42e+01 - 6.99e-04 4.23e-0
2f 1
2 1.2226497e+04 6.07e-02 7.87e+01 -1.0 1.80e+01 - 7.07e-02 1.00e+0
0h 1
3 3.6201835e+03 5.54e-02 5.15e+01 -1.0 5.45e+01 - 3.33e-01 7.87e-0
2f 1
4 2.3523816e+03 2.93e-02 2.28e+01 -1.0 2.70e+01 - 5.45e-01 4.46e-0
1f 1
5 1.7571777e+03 8.49e-03 1.17e+00 -1.0 9.96e+00 - 9.27e-01 7.68e-0
1f 1
6 2.0298807e+03 3.42e-04 8.15e-02 -1.0 3.35e+00 - 1.00e+00 1.00e+0
0h 1
7 1.4033467e+03 2.08e-03 8.15e-02 -2.5 4.87e+00 - 8.66e-01 8.50e-0
1f 1
8 1.2236690e+03 2.16e-03 2.06e-01 -2.5 1.05e+00 - 1.00e+00 8.33e-0
1f 1
9 1.2066826e+03 8.65e-05 3.81e-03 -2.5 1.49e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1969337e+03 4.61e-05 1.08e+00 -3.8 9.70e-02 - 1.00e+00 4.99e-0
1h 1
11 1.1949898e+03 3.31e-07 1.13e-01 -3.8 3.83e-02 - 9.68e-01 1.00e+0
0f 1
12 1.1939532e+03 1.38e-08 1.76e-03 -3.8 3.31e-02 - 1.00e+00 1.00e+0
0H 1
13 1.1941500e+03 1.10e-05 2.71e-04 -3.8 3.66e-03 - 1.00e+00 1.00e+0
0f 1
14 1.1935298e+03 1.78e-06 6.37e-02 -5.7 1.23e-02 - 7.78e-01 9.68e-0
1h 1
15 1.1933618e+03 1.24e-05 2.14e-04 -5.7 5.02e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1933679e+03 2.91e-08 2.24e-06 -5.7 2.67e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1933546e+03 2.76e-08 9.72e-06 -8.6 2.46e-04 - 9.82e-01 9.89e-0
1h 1
18 1.1933545e+03 2.43e-13 3.27e-11 -8.6 1.97e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1933545111870880e+00 1.1933545111870881e+0
3
Dual infeasibility......: 3.2687084037103822e-11 3.2687084037103822e-0
8
Constraint violation....: 2.4291679778798425e-13 2.4291679778798425e-1
3
Complementarity.........: 2.5120650507063664e-09 2.5120650507063663e-0
6
Overall NLP error.......: 2.5120650507063664e-09 2.5120650507063663e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2303900e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 3.31e-04 9.86e-0
3h 1
2 8.1078909e+02 9.17e+02 5.24e+01 -1.0 7.14e+02 - 8.39e-05 4.45e-0
4h 1
3 7.5268194e+02 9.15e+02 5.24e+01 -1.0 9.17e+02 - 4.04e-04 2.16e-0
3h 1
4 2.4713900e+02 8.96e+02 5.25e+01 -1.0 9.15e+02 - 2.70e-03 2.06e-0
2f 1
5 1.1254750e+04 5.74e-02 8.26e+01 -1.0 8.96e+02 - 4.22e-02 1.00e+0
0h 1
6 3.7806374e+03 5.41e-02 4.69e+01 -1.0 7.19e+01 - 4.26e-01 5.51e-0
2f 1
7 1.8945181e+03 3.70e-02 2.37e+01 -1.0 3.93e+01 - 4.94e-01 4.93e-0
1f 1
8 3.7725232e+03 8.28e-03 1.64e+01 -1.0 1.33e+01 - 5.36e-01 1.00e+0
0h 1
9 1.9501729e+03 4.86e-03 3.37e-01 -1.0 1.50e+01 - 9.88e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6784931e+03 4.24e-04 7.89e-02 -1.7 8.02e+00 - 1.00e+00 1.00e+0
0f 1
11 1.5546385e+03 2.14e-03 2.18e-01 -2.5 5.84e+00 - 7.49e-01 1.00e+0
0f 1
12 1.5216478e+03 3.05e-03 4.53e-02 -2.5 2.00e+00 - 1.00e+00 9.63e-0
1h 1
13 1.5308032e+03 1.53e-04 3.68e-03 -2.5 8.66e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5024599e+03 1.70e-04 1.82e-02 -3.8 1.11e+01 - 9.94e-01 9.39e-0
1h 1
15 1.5018189e+03 6.56e-07 6.92e-05 -3.8 4.85e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003120e+03 3.79e-07 1.86e-04 -5.7 5.95e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003117e+03 3.85e-11 3.01e-09 -5.7 7.20e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0h 1
1 8.6555974e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 4.97e-04 9.86e-0
3h 1
2 8.5244446e+02 9.17e+02 5.24e+01 -1.0 7.30e+02 - 8.21e-05 4.84e-0
4h 1
3 7.8829237e+02 9.15e+02 5.24e+01 -1.0 9.17e+02 - 4.42e-04 2.41e-0
3h 1
4 2.6739293e+02 8.95e+02 5.24e+01 -1.0 9.15e+02 - 3.00e-03 2.14e-0
2f 1
5 1.1543503e+04 6.25e-02 8.04e+01 -1.0 8.95e+02 - 5.69e-02 1.00e+0
0h 1
50 1.579664e+04 1.632511e+04 4.437747e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1158125e+02 1.57e+04 5.50e+01 -1.0 1.59e+04 - 1.75e-04 9.80e-0
3f 1
2 7.0876261e+02 1.57e+04 5.50e+01 -1.0 1.55e+04 - 9.69e-05 1.00e-0
4h 1
3 7.0208873e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 2.67e-06 5.41e-0
4f 1
4 4.8477463e+02 1.54e+04 5.40e+01 -1.0 1.57e+04 - 5.75e-04 1.88e-0
2h 1
5 2.6430672e+04 7.61e-02 8.69e+01 -1.0 1.54e+04 - 2.52e-02 1.00e+0
0h 1
6 1.7889005e+04 7.33e-02 7.38e+01 -1.0 7.46e+01 - 1.59e-01 3.97e-0
2f 1
7 1.6627388e+04 4.64e-02 3.43e+01 -1.0 1.95e+01 - 5.30e-01 3.77e-0
1f 1
8 1.6878391e+04 4.07e-02 1.02e+01 -1.0 1.34e+01 - 5.66e-01 1.25e-0
1f 4
9 1.6797292e+04 6.81e-03 1.94e-01 -1.0 8.86e-01 - 9.93e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6502007e+04 7.54e-04 2.01e-01 -1.7 5.86e+00 - 1.00e+00 8.96e-0
1f 1
11 1.6471171e+04 7.90e-04 1.14e-02 -1.7 1.44e+01 - 1.00e+00 1.00e+0
0f 1
12 1.6349749e+04 1.26e-03 8.16e-02 -3.8 1.99e+01 - 8.09e-01 9.34e-0
1f 1
13 1.6325868e+04 1.39e-03 6.58e-02 -3.8 1.67e+00 - 8.57e-01 7.76e-0
1h 1
14 1.6326081e+04 2.49e-06 7.03e-04 -3.8 2.89e-01 - 1.00e+00 1.00e+0
0h 1
15 1.6325124e+04 3.28e-07 5.56e-04 -5.7 1.49e-01 - 1.00e+00 9.89e-0
1h 1
16 1.6325118e+04 4.02e-11 5.92e-09 -5.7 3.79e-01 - 1.00e+00 1.00e+0
0f 1
17 1.6325105e+04 6.30e-11 2.05e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.6325105274765850e+01 1.6325105274765849e+0
4
Dual infeasibility......: 2.0519882203402227e-09 2.0519882203402227e-0
6
Constraint violation....: 6.2995150762468199e-11 6.2995150762468199e-1
1
Complementarity.........: 2.8881132355439762e-09 2.8881132355439762e-0
6
Overall NLP error.......: 2.8881132355439762e-09 2.8881132355439762e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.4944019e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.08e-04 9.80e-0
3f 1
2 7.4656416e+02 1.50e+04 5.25e+01 -1.0 1.43e+04 - 4.85e-05 1.03e-0
4h 1
3 7.4011681e+02 1.50e+04 5.25e+01 -1.0 1.49e+04 - 6.35e-06 4.83e-0
4f 1
4 7.3193201e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 4.89e-04 6.42e-0
4h 1
5 5.0668995e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 1.31e-03 1.97e-0
2f 1
6 2.5308628e+04 6.65e-02 8.55e+01 -1.0 1.47e+04 - 2.85e-02 1.00e+0
0h 1
7 1.7352763e+04 6.38e-02 6.73e+01 -1.0 7.28e+01 - 2.20e-01 4.27e-0
2f 1
8 1.5906010e+04 4.62e-02 3.22e+01 -1.0 2.57e+01 - 5.15e-01 4.14e-0
1f 1
9 1.6182182e+04 3.41e-02 1.16e+01 -1.0 1.49e+01 - 5.01e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6019392e+04 5.40e-03 1.95e-01 -1.0 2.74e+00 - 9.88e-01 1.00e+0
0h 1
11 1.5731005e+04 9.32e-04 2.29e-01 -1.7 4.74e+00 - 1.00e+00 8.85e-0
1f 1
12 1.5714231e+04 7.38e-04 9.59e-03 -1.7 2.37e+01 - 1.00e+00 1.00e+0
0f 1
13 1.5594070e+04 1.11e-03 2.14e-02 -3.8 3.27e+01 - 8.05e-01 8.32e-0
1f 1
14 1.5560639e+04 1.60e-03 3.50e-02 -3.8 2.08e+00 - 8.48e-01 8.03e-0
1h 1
15 1.5560093e+04 3.49e-06 8.28e-04 -3.8 7.77e-02 - 1.00e+00 1.00e+0
0h 1
16 1.5559222e+04 2.42e-07 7.60e-04 -5.7 1.50e-01 - 1.00e+00 9.87e-0
1h 1
17 1.5559215e+04 3.48e-11 6.65e-09 -5.7 3.38e-01 - 1.00e+00 1.00e+0
0f 1
18 1.5559202e+04 6.30e-11 2.06e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5559202142092248e+01 1.5559202142092248e+0
4
Dual infeasibility......: 2.0613675410144379e-09 2.0613675410144379e-0
6
Constraint violation....: 6.2996718952490482e-11 6.2996718952490482e-1
1
Complementarity.........: 2.8880935986142065e-09 2.8880935986142067e-0
6
Overall NLP error.......: 2.8880935986142065e-09 2.8880935986142067e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.8249760e+02 1.39e+04 5.25e+01 -1.0 1.40e+04 - 2.49e-04 9.80e-0
3f 1
2 7.7965744e+02 1.39e+04 5.25e+01 -1.0 1.37e+04 - 9.56e-05 1.01e-0
4h 1
3 7.7069004e+02 1.39e+04 5.25e+01 -1.0 1.39e+04 - 3.04e-06 6.23e-0
4f 1
4 4.9406844e+02 1.36e+04 5.27e+01 -1.0 1.39e+04 - 6.68e-04 2.01e-0
2h 1
5 2.5022820e+04 5.68e-02 8.42e+01 -1.0 1.36e+04 - 3.11e-02 1.00e+0
0h 1
6 1.6534787e+04 5.46e-02 6.53e+01 -1.0 8.01e+01 - 2.29e-01 4.41e-0
2f 1
7 1.4860695e+04 4.39e-02 3.30e+01 -1.0 3.12e+01 - 4.92e-01 4.53e-0
1f 1
8 1.5169032e+04 2.83e-02 1.40e+01 -1.0 1.71e+01 - 4.46e-01 1.25e-0
1f 4
9 1.4934786e+04 5.76e-03 1.43e-01 -1.0 4.48e+00 - 9.92e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4653198e+04 1.13e-03 2.60e-01 -1.7 4.68e+00 - 1.00e+00 8.74e-0
1f 1
11 1.4629278e+04 7.58e-04 1.06e-02 -1.7 1.56e+01 - 1.00e+00 1.00e+0
0f 1
12 1.4505021e+04 1.32e-03 8.79e-02 -3.8 1.99e+01 - 8.01e-01 9.32e-0
1f 1
13 1.4480779e+04 1.45e-03 6.29e-02 -3.8 1.69e+00 - 8.50e-01 7.75e-0
1h 1
14 1.4481018e+04 2.62e-06 7.28e-04 -3.8 2.99e-01 - 1.00e+00 1.00e+0
0h 1
15 1.4480071e+04 3.20e-07 5.98e-04 -5.7 1.49e-01 - 1.00e+00 9.89e-0
1h 1
16 1.4480065e+04 3.97e-11 6.10e-09 -5.7 7.22e-03 - 1.00e+00 1.00e+0
0f 1
17 1.4480052e+04 6.30e-11 2.08e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.4480051770964639e+01 1.4480051770964639e+0
4
Dual infeasibility......: 2.0787123588931694e-09 2.0787123588931694e-0
6
Constraint violation....: 6.2995580973890242e-11 6.2995580973890242e-1
1
Complementarity.........: 2.8881100431323271e-09 2.8881100431323269e-0
6
Overall NLP error.......: 2.8881100431323271e-09 2.8881100431323269e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.1611029e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.11e-04 9.80e-0
3f 1
2 8.1322395e+02 1.27e+04 5.24e+01 -1.0 1.20e+04 - 4.74e-05 1.04e-0
4h 1
3 7.7465892e+02 1.26e+04 5.25e+01 -1.0 1.26e+04 - 7.67e-06 2.48e-0
3h 1
4 5.0870710e+02 1.24e+04 5.26e+01 -1.0 1.26e+04 - 2.69e-03 2.02e-0
2h 1
5 2.3105079e+04 5.63e-02 8.30e+01 -1.0 1.24e+04 - 3.92e-02 1.00e+0
0h 1
6 1.5471524e+04 5.36e-02 4.96e+01 -1.0 7.32e+01 - 3.99e-01 5.21e-0
2f 1
7 1.3622522e+04 3.83e-02 2.53e+01 -1.0 3.81e+01 - 4.89e-01 4.84e-0
1f 1
8 1.3945958e+04 2.44e-02 1.03e+01 -1.0 1.88e+01 - 4.25e-01 1.25e-0
1f 4
9 1.3718072e+04 6.09e-03 1.96e-01 -1.0 4.73e+00 - 9.87e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3420275e+04 1.33e-03 3.48e-01 -1.7 5.11e+00 - 1.00e+00 8.42e-0
1f 1
11 1.3404694e+04 7.78e-04 1.42e-02 -1.7 3.52e+01 - 1.00e+00 1.00e+0
0f 1
12 1.3259028e+04 1.40e-03 9.56e-02 -3.8 3.98e+01 - 7.91e-01 9.30e-0
1f 1
13 1.3234106e+04 1.56e-03 7.29e-02 -3.8 2.73e+00 - 8.44e-01 7.61e-0
1h 1
14 1.3234160e+04 2.99e-06 7.98e-04 -3.8 6.51e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3233074e+04 2.97e-07 6.35e-04 -5.7 2.97e-01 - 1.00e+00 9.88e-0
1h 1
16 1.3233066e+04 3.76e-11 6.44e-09 -5.7 2.34e-01 - 1.00e+00 1.00e+0
0f 1
17 1.3233051e+04 6.30e-11 2.13e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.3233050924497986e+01 1.3233050924497986e+0
4
Dual infeasibility......: 2.1344970797299812e-09 2.1344970797299812e-0
6
Constraint violation....: 6.2997884686666339e-11 6.2997884686666339e-1
1
Complementarity.........: 3.4244040985470895e-09 3.4244040985470893e-0
6
Overall NLP error.......: 3.4244040985470895e-09 3.4244040985470893e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8000503e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 5.91e-04 9.80e-0
3h 1
2 8.7715304e+02 1.11e+04 5.24e+01 -1.0 1.04e+04 - 4.39e-05 1.06e-0
4h 1
3 8.2405335e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 9.28e-06 3.21e-0
3h 1
4 5.2335349e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 3.55e-03 2.13e-0
2h 1
5 2.1869416e+04 6.45e-02 7.95e+01 -1.0 1.09e+04 - 6.36e-02 1.00e+0
0h 1
6 1.4503633e+04 5.93e-02 4.75e+01 -1.0 5.89e+01 - 3.87e-01 7.42e-0
2f 1
7 1.3139127e+04 3.10e-02 2.10e+01 -1.0 3.12e+01 - 5.43e-01 4.37e-0
1f 1
8 1.2523474e+04 7.70e-03 1.45e+00 -1.0 1.06e+01 - 9.23e-01 8.70e-0
1f 1
9 1.2856745e+04 1.73e-04 5.32e-02 -1.0 4.34e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2222900e+04 1.26e-03 1.74e-01 -2.5 6.00e+00 - 8.79e-01 8.04e-0
1f 1
11 1.2193972e+04 1.93e-05 2.14e-02 -2.5 7.07e-01 - 9.97e-01 1.00e+0
0h 1
12 1.2157847e+04 1.78e-03 3.60e-02 -3.8 5.36e+00 - 6.85e-01 1.00e+0
0f 1
13 1.2156391e+04 7.32e-04 1.36e-03 -3.8 3.17e-02 - 9.68e-01 9.79e-0
1h 1
14 1.2155120e+04 2.79e-04 1.11e-03 -5.7 2.97e-01 - 9.13e-01 1.00e+0
0h 1
15 1.2155052e+04 8.74e-05 5.65e-05 -5.7 1.36e-02 - 1.00e+00 1.00e+0
0h 1
16 1.2155045e+04 1.40e-05 4.36e-05 -5.7 4.41e-03 - 1.00e+00 9.72e-0
1h 1
17 1.2155051e+04 8.48e-08 1.88e-06 -5.7 4.28e-04 - 1.00e+00 1.00e+0
0f 1
18 1.2155034e+04 8.49e-08 5.63e-06 -8.6 3.68e-03 - 9.99e-01 9.82e-0
1h 1
19 1.2155034e+04 3.71e-13 4.50e-11 -8.6 6.49e-05 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.2155033844393474e+01 1.2155033844393474e+0
4
Dual infeasibility......: 4.5041816387726587e-11 4.5041816387726587e-0
8
Constraint violation....: 3.7067571234672414e-13 3.7067571234672414e-1
3
Complementarity.........: 2.5491323536839367e-09 2.5491323536839366e-0
6
Overall NLP error.......: 2.5491323536839367e-09 2.5491323536839366e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891076e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0602418e+02 9.19e+03 5.23e+01 -1.0 8.41e+03 - 3.92e-05 1.08e-0
4h 1
3 8.1828325e+02 9.14e+03 5.24e+01 -1.0 9.19e+03 - 1.24e-05 4.81e-0
3h 1
4 5.0911012e+02 8.95e+03 5.22e+01 -1.0 9.14e+03 - 5.53e-03 2.13e-0
2h 1
5 1.9574030e+04 7.15e-02 7.74e+01 -1.0 8.95e+03 - 8.67e-02 1.00e+0
0h 1
6 1.2972291e+04 6.39e-02 3.14e+01 -1.0 2.60e+01 - 5.69e-01 9.74e-0
2f 1
7 1.1456842e+04 1.98e-02 1.02e+01 -1.0 1.50e+01 - 6.92e-01 7.89e-0
1f 1
8 1.1617387e+04 7.35e-03 8.73e-01 -1.0 3.38e+00 - 9.91e-01 5.00e-0
1f 2
9 1.1301584e+04 1.11e-02 8.43e-01 -1.7 9.39e+00 - 3.16e-01 8.28e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1286300e+04 6.58e-04 7.40e-01 -1.7 9.94e+00 - 6.88e-01 1.00e+0
0f 1
11 1.1285187e+04 1.21e-04 4.23e-02 -1.7 1.30e+01 - 9.46e-01 1.00e+0
0h 1
12 1.1114764e+04 6.10e-04 2.58e-02 -2.5 2.46e+01 - 9.62e-01 9.70e-0
1f 1
13 1.1087330e+04 1.56e-04 7.59e-02 -3.8 6.98e+00 - 9.80e-01 8.37e-0
1h 1
14 1.1084767e+04 2.01e-07 1.15e-01 -3.8 1.15e+00 - 9.10e-01 1.00e+0
0h 1
15 1.1084687e+04 4.85e-09 3.18e-05 -3.8 1.60e-04 - 1.00e+00 1.00e+0
0h 1
16 1.1083373e+04 1.92e-08 3.88e-03 -5.7 2.97e-01 - 1.00e+00 9.68e-0
1f 1
17 1.1083337e+04 5.75e-12 2.62e-08 -5.7 9.60e-03 - 1.00e+00 1.00e+0
0f 1
18 1.1083321e+04 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1083320743516493e+01 1.1083320743516493e+0
4
Dual infeasibility......: 4.4780426489503640e-09 4.4780426489503640e-0
6
Constraint violation....: 2.6339763703475683e-12 2.6339763703475683e-1
2
Complementarity.........: 3.8989274869897343e-09 3.8989274869897343e-0
6
Overall NLP error.......: 4.4780426489503640e-09 4.4780426489503640e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2300862e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.80e-0
3h 1
2 9.2018520e+02 6.71e+03 5.23e+01 -1.0 6.43e+03 - 7.59e-05 1.03e-0
4h 1
3 8.8417723e+02 6.69e+03 5.23e+01 -1.0 6.70e+03 - 7.25e-06 1.73e-0
3f 1
4 4.3415243e+02 6.54e+03 5.24e+01 -1.0 6.69e+03 - 2.08e-03 2.26e-0
2h 1
5 1.8486104e+04 7.08e-02 7.69e+01 -1.0 6.54e+03 - 8.04e-02 1.00e+0
0h 1
6 1.0916142e+04 6.40e-02 2.32e+01 -1.0 1.36e+01 - 6.65e-01 8.89e-0
2f 1
7 9.6154376e+03 1.98e-02 9.31e+00 -1.0 9.91e+00 - 6.64e-01 8.81e-0
1f 1
8 9.7199904e+03 1.05e-02 6.35e-01 -1.0 2.75e+00 - 9.95e-01 4.77e-0
1f 2
9 9.3967776e+03 9.36e-03 2.78e-01 -1.7 9.45e+00 - 1.00e+00 8.30e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.3672965e+03 2.18e-03 9.40e-01 -1.7 1.18e+01 - 1.00e+00 4.90e-0
1h 2
11 9.3624199e+03 2.10e-04 1.67e-02 -1.7 6.01e+00 - 1.00e+00 1.00e+0
0h 1
12 9.2069203e+03 4.79e-04 2.44e-02 -3.8 2.00e+01 - 8.46e-01 8.30e-0
1f 1
13 9.1886242e+03 1.49e-04 2.05e-01 -3.8 3.34e+00 - 9.89e-01 7.21e-0
1h 1
14 9.1840024e+03 3.89e-07 3.07e-04 -3.8 9.33e-01 - 1.00e+00 1.00e+0
0h 1
15 9.1828139e+03 1.95e-08 4.40e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
16 9.1828008e+03 7.97e-13 4.82e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 9.1828007818475577e+00 9.1828007818475580e+0
3
Dual infeasibility......: 4.8230711686060199e-10 4.8230711686060199e-0
7
Constraint violation....: 7.9657114238074200e-13 7.9657114238074200e-1
3
Complementarity.........: 2.6134527997868727e-09 2.6134527997868729e-0
6
Overall NLP error.......: 2.6134527997868727e-09 2.6134527997868729e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2997022e+02 4.77e+03 5.23e+01 -1.0 4.81e+03 - 1.96e-03 9.81e-0
3h 1
2 7.5577386e+02 4.74e+03 5.23e+01 -1.0 4.71e+03 - 1.27e-05 7.63e-0
3h 1
3 4.2762046e+02 4.64e+03 5.20e+01 -1.0 4.74e+03 - 9.45e-03 2.11e-0
2h 1
4 1.4309518e+04 8.17e-02 7.89e+01 -1.0 4.64e+03 - 7.63e-02 1.00e+0
0h 1
5 8.9296780e+03 7.37e-02 4.13e+01 -1.0 1.52e+01 - 4.63e-01 9.23e-0
2f 1
6 7.8352721e+03 2.26e-02 1.01e+01 -1.0 8.20e+00 - 7.64e-01 8.36e-0
1f 1
7 8.1785573e+03 2.17e-03 1.16e-01 -1.0 3.10e+00 - 9.91e-01 1.00e+0
0f 1
8 7.7795206e+03 1.44e-03 1.30e-01 -1.7 1.42e+01 - 1.00e+00 1.00e+0
0f 1
9 7.5954753e+03 1.94e-03 3.21e-01 -2.5 1.26e+00 - 1.00e+00 8.11e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.5780605e+03 1.03e-04 2.97e-02 -2.5 2.53e-01 - 1.00e+00 9.63e-0
1f 1
11 7.5811115e+03 6.27e-06 9.98e-04 -2.5 7.02e-03 - 1.00e+00 1.00e+0
0f 1
12 7.5486878e+03 7.50e-06 4.40e-03 -3.8 1.34e+01 - 1.00e+00 9.78e-0
1f 1
13 7.5483552e+03 1.37e-08 6.34e-06 -3.8 2.89e-01 - 1.00e+00 1.00e+0
0f 1
14 7.5465686e+03 1.73e-08 3.04e-06 -5.7 7.43e-01 - 1.00e+00 1.00e+0
0f 1
15 7.5465477e+03 1.28e-12 4.22e-10 -8.6 9.20e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 7.5465477395459386e+00 7.5465477395459384e+0
3
Dual infeasibility......: 4.2179857890266656e-10 4.2179857890266656e-0
7
Constraint violation....: 1.2798095916366492e-12 1.2798095916366492e-1
2
Complementarity.........: 2.9375961620309035e-09 2.9375961620309035e-0
6
Overall NLP error.......: 2.9375961620309035e-09 2.9375961620309035e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6647742e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 4.97e-04 9.81e-0
3h 1
2 8.6258607e+02 3.24e+03 5.24e+01 -1.0 2.21e+03 - 3.91e-05 1.45e-0
4h 1
3 3.1400433e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 5.82e-05 2.24e-0
2f 1
4 1.5420372e+04 5.91e-02 8.12e+01 -1.0 3.17e+03 - 3.49e-02 1.00e+0
0h 1
5 6.7290069e+03 5.61e-02 6.00e+01 -1.0 7.11e+01 - 2.59e-01 4.63e-0
2f 1
6 4.9141782e+03 2.50e-02 3.24e+01 -1.0 3.47e+01 - 4.68e-01 5.32e-0
1f 1
7 4.4464852e+03 1.14e-02 2.56e+00 -1.0 9.40e+00 - 9.28e-01 1.00e+0
0f 1
8 4.7445322e+03 5.19e-04 7.19e-02 -1.0 2.72e+00 - 9.98e-01 1.00e+0
0f 1
9 4.1967378e+03 5.77e-04 4.25e-01 -2.5 7.14e+00 - 8.93e-01 7.24e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.1292498e+03 1.97e-04 2.34e-01 -2.5 2.25e+00 - 9.13e-01 1.00e+0
0h 1
11 4.1116428e+03 2.84e-04 9.33e-02 -2.5 9.70e-01 - 1.00e+00 7.64e-0
1H 1
12 4.1091626e+03 3.40e-04 1.77e-03 -2.5 1.24e-01 - 1.00e+00 1.00e+0
0f 1
13 4.0879671e+03 1.22e-03 3.19e-02 -3.8 8.05e+00 - 7.96e-01 1.00e+0
0h 1
14 4.0846007e+03 2.79e-03 1.11e-03 -3.8 4.90e-02 - 1.00e+00 1.00e+0
0h 1
15 4.0849547e+03 3.93e-05 1.31e-04 -3.8 1.35e-02 - 1.00e+00 1.00e+0
0h 1
16 4.0833586e+03 1.01e-04 3.52e-04 -5.7 4.46e-01 - 9.51e-01 9.77e-0
1h 1
17 4.0833414e+03 2.19e-05 3.67e-03 -5.7 1.03e-02 - 1.00e+00 7.83e-0
1h 1
18 4.0833430e+03 8.57e-09 1.21e-06 -5.7 2.23e-03 - 1.00e+00 1.00e+0
0f 1
19 4.0833247e+03 9.02e-09 1.92e-05 -8.6 5.53e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 4.0833244e+03 1.37e-12 6.48e-11 -8.6 9.17e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 4.0833243917864301e+00 4.0833243917864302e+0
3
Dual infeasibility......: 6.4812998336596896e-11 6.4812998336596896e-0
8
Constraint violation....: 1.3687939670603555e-12 1.3687939670603555e-1
2
Complementarity.........: 3.0289473950120322e-09 3.0289473950120321e-0
6
Overall NLP error.......: 3.0289473950120322e-09 3.0289473950120321e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8047271e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.82e-0
3h 1
2 8.7571780e+02 2.00e+03 5.24e+01 -1.0 1.11e+03 - 4.57e-05 1.77e-0
4h 1
3 2.9373644e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 9.83e-05 2.27e-0
2f 1
4 1.4280611e+04 6.09e-02 7.92e+01 -1.0 1.95e+03 - 5.49e-02 1.00e+0
0h 1
5 5.5544141e+03 5.66e-02 5.35e+01 -1.0 6.57e+01 - 3.12e-01 6.38e-0
2f 1
6 4.1958834e+03 3.11e-02 2.65e+01 -1.0 3.24e+01 - 4.93e-01 4.18e-0
1f 1
7 3.3759781e+03 1.36e-02 2.17e+00 -1.0 1.11e+01 - 9.19e-01 9.26e-0
1f 1
8 3.8304846e+03 4.15e-04 1.07e-01 -1.0 5.03e+00 - 9.97e-01 1.00e+0
0f 1
9 3.1589222e+03 1.16e-03 1.16e+00 -1.7 4.65e+01 - 3.65e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.1976885e+03 8.94e-06 1.31e-02 -1.7 9.50e+00 - 1.00e+00 1.00e+0
0h 1
11 3.0828847e+03 2.93e-05 4.04e-01 -2.5 5.10e+01 - 1.00e+00 7.87e-0
1f 1
12 3.0635247e+03 1.07e-04 4.91e-03 -2.5 1.05e+01 - 1.00e+00 1.00e+0
0f 1
13 3.0434838e+03 2.78e-04 8.69e-02 -3.8 8.05e+00 - 7.71e-01 1.00e+0
0h 1
14 3.0407334e+03 1.61e-03 2.08e-03 -3.8 3.64e-02 - 9.71e-01 1.00e+0
0h 1
15 3.0407737e+03 7.55e-05 6.61e-05 -3.8 1.18e-02 - 1.00e+00 1.00e+0
0h 1
16 3.0392720e+03 1.31e-04 1.11e-03 -5.7 4.46e-01 - 9.18e-01 1.00e+0
0h 1
17 3.0392303e+03 3.28e-05 6.74e-06 -5.7 8.43e-03 - 1.00e+00 1.00e+0
0h 1
18 3.0392359e+03 1.93e-07 3.46e-06 -5.7 6.33e-04 - 1.00e+00 1.00e+0
0h 1
19 3.0392191e+03 2.64e-08 3.36e-05 -8.6 5.53e-03 - 1.00e+00 9.57e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 3.0392184e+03 4.51e-12 5.22e-11 -8.6 2.39e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 3.0392183902265488e+00 3.0392183902265488e+0
3
Dual infeasibility......: 5.2212615823777524e-11 5.2212615823777524e-0
8
Constraint violation....: 4.5118353497741737e-12 4.5118353497741737e-1
2
Complementarity.........: 3.6934932704990204e-09 3.6934932704990204e-0
6
Overall NLP error.......: 3.6934932704990204e-09 3.6934932704990204e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0808049e+02 9.17e+02 5.23e+01 -1.0 9.22e+02 - 1.00e-03 9.86e-0
3h 1
2 8.9044054e+02 9.17e+02 5.23e+01 -1.0 7.80e+02 - 7.68e-05 6.61e-0
4h 1
3 7.9332803e+02 9.14e+02 5.23e+01 -1.0 9.17e+02 - 6.17e-04 3.70e-0
3h 1
4 2.9381329e+02 8.94e+02 5.23e+01 -1.0 9.14e+02 - 4.55e-03 2.17e-0
2f 1
5 1.1418076e+04 7.11e-02 7.74e+01 -1.0 8.94e+02 - 8.66e-02 1.00e+0
0h 1
6 4.7100101e+03 6.36e-02 3.17e+01 -1.0 2.61e+01 - 5.64e-01 9.69e-0
2f 1
7 3.1944459e+03 1.98e-02 1.05e+01 -1.0 1.50e+01 - 6.86e-01 7.87e-0
1f 1
8 3.5058512e+03 2.31e-03 1.10e-01 -1.0 3.31e+00 - 9.90e-01 1.00e+0
0f 1
9 3.0504801e+03 1.60e-03 1.55e-01 -1.7 1.06e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8698340e+03 2.05e-03 3.74e-01 -2.5 1.08e+00 - 1.00e+00 7.83e-0
1f 1
11 2.8426369e+03 1.70e-04 5.45e-03 -2.5 2.09e-01 - 1.00e+00 1.00e+0
0h 1
12 2.8206804e+03 4.72e-05 1.87e-01 -3.8 1.11e+01 - 1.00e+00 7.35e-0
1h 1
13 2.8140607e+03 1.53e-07 3.60e-04 -3.8 2.75e+00 - 1.00e+00 1.00e+0
0f 1
14 2.8124030e+03 2.69e-08 1.01e-03 -5.7 5.93e-01 - 1.00e+00 9.85e-0
1f 1
15 2.8123840e+03 1.92e-12 1.37e-08 -5.7 8.24e-03 - 1.00e+00 1.00e+0
0f 1
16 2.8123637e+03 2.63e-12 4.48e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 2.8123637077619219e+00 2.8123637077619219e+0
3
Dual infeasibility......: 4.4777082212989463e-09 4.4777082212989463e-0
6
Constraint violation....: 2.6309163181359452e-12 2.6309163181359452e-1
2
Complementarity.........: 3.6085023552150326e-09 3.6085023552150325e-0
6
Overall NLP error.......: 4.4777082212989463e-09 4.4777082212989463e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.03e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 6.36e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643337e+00 1.6104063281643337e+0
3
Dual infeasibility......: 2.4574158090171458e-12 2.4574158090171458e-0
9
Constraint violation....: 6.3603173554942194e-15 6.3603173554942194e-1
5
Complementarity.........: 2.5062163910047551e-09 2.5062163910047549e-0
6
Overall NLP error.......: 2.5062163910047551e-09 2.5062163910047549e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933498e-01 5.8277753147933493e+0
2
Dual infeasibility......: 2.1031320946147231e-09 2.1031320946147231e-0
6
Constraint violation....: 6.2994318095199731e-11 6.2994318095199731e-1
1
Complementarity.........: 2.8882108896903808e-09 2.8882108896903807e-0
6
Overall NLP error.......: 2.8882108896903808e-09 2.8882108896903807e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254210157e-01 6.4890146254210151e+0
2
Dual infeasibility......: 4.9126604771081653e-09 4.9126604771081653e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646095252514899e-09 4.3646095252514903e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126604771081653e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.03e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 6.36e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643337e+00 1.6104063281643337e+0
3
Dual infeasibility......: 2.4574158090171458e-12 2.4574158090171458e-0
9
Constraint violation....: 6.3603173554942194e-15 6.3603173554942194e-1
5
Complementarity.........: 2.5062163910047551e-09 2.5062163910047549e-0
6
Overall NLP error.......: 2.5062163910047551e-09 2.5062163910047549e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2303872e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 3.31e-04 9.86e-0
3h 1
2 8.0919006e+02 9.17e+02 5.24e+01 -1.0 7.37e+02 - 8.12e-05 5.04e-0
4h 1
3 2.4239398e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 4.72e-04 2.11e-0
2f 1
4 1.2489447e+04 5.50e-02 8.23e+01 -1.0 8.98e+02 - 3.83e-02 1.00e+0
0h 1
5 3.8941148e+03 5.25e-02 5.67e+01 -1.0 8.14e+01 - 3.09e-01 4.98e-0
2f 1
6 1.9112633e+03 3.73e-02 3.04e+01 -1.0 3.92e+01 - 4.68e-01 5.06e-0
1f 1
7 4.6876227e+03 1.23e-02 2.71e+01 -1.0 2.07e+01 - 3.99e-01 1.00e+0
0h 1
8 1.8763004e+03 1.20e-02 1.04e+00 -1.0 2.56e+01 - 9.88e-01 8.91e-0
1f 1
9 1.9981274e+03 1.95e-04 4.76e-02 -1.0 2.98e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7321093e+03 2.19e-04 1.23e+00 -2.5 1.80e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5439398e+03 3.77e-03 1.33e-01 -2.5 7.59e+00 - 7.95e-01 1.00e+0
0f 1
12 1.5209204e+03 5.17e-03 3.09e-01 -2.5 1.82e+00 - 1.00e+00 7.67e-0
1h 1
13 1.5332321e+03 2.41e-04 4.72e-03 -2.5 7.16e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5031438e+03 1.70e-04 2.15e-02 -3.8 1.35e+01 - 9.90e-01 9.29e-0
1h 1
15 1.5019709e+03 7.24e-07 6.84e-05 -3.8 9.19e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003148e+03 3.77e-07 1.78e-04 -5.7 7.43e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.79e-11 2.92e-09 -5.7 4.20e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932776792490e+00 1.5002932776792491e+0
3
Dual infeasibility......: 2.1737235071273386e-09 2.1737235071273386e-0
6
Constraint violation....: 6.2995900163009821e-11 6.2995900163009821e-1
1
Complementarity.........: 2.8882174443522761e-09 2.8882174443522758e-0
6
Overall NLP error.......: 2.8882174443522761e-09 2.8882174443522758e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6555952e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 4.97e-04 9.86e-0
3h 1
2 8.5049278e+02 9.17e+02 5.24e+01 -1.0 7.54e+02 - 7.94e-05 5.56e-0
4h 1
3 2.6243053e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 5.25e-04 2.21e-0
2h 1
4 1.2843590e+04 5.96e-02 8.01e+01 -1.0 8.97e+02 - 5.01e-02 1.00e+0
0h 1
5 4.2877637e+03 5.57e-02 5.36e+01 -1.0 7.35e+01 - 3.21e-01 5.99e-0
2f 1
51 1.589841e+04 1.632511e+04 4.492766e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1156838e+02 1.57e+04 5.50e+01 -1.0 1.59e+04 - 1.75e-04 9.80e-0
3f 1
2 7.0871567e+02 1.57e+04 5.50e+01 -1.0 1.51e+04 - 4.89e-05 1.03e-0
4h 1
3 7.0668944e+02 1.57e+04 5.50e+01 -1.0 1.56e+04 - 6.02e-06 1.63e-0
4h 1
4 7.0434700e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 1.67e-04 1.93e-0
4h 1
5 4.8389551e+02 1.54e+04 5.40e+01 -1.0 1.57e+04 - 3.71e-04 1.89e-0
2f 1
6 2.6472935e+04 7.61e-02 8.69e+01 -1.0 1.54e+04 - 2.52e-02 1.00e+0
0h 1
7 1.7889482e+04 7.33e-02 7.39e+01 -1.0 7.50e+01 - 1.58e-01 3.96e-0
2f 1
8 1.6626980e+04 4.64e-02 3.43e+01 -1.0 1.95e+01 - 5.30e-01 3.77e-0
1f 1
9 1.6878151e+04 4.07e-02 1.02e+01 -1.0 1.34e+01 - 5.66e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6797239e+04 6.82e-03 1.93e-01 -1.0 9.03e-01 - 9.91e-01 1.00e+0
0h 1
11 1.6500117e+04 7.54e-04 2.00e-01 -1.7 5.58e+00 - 1.00e+00 8.96e-0
1f 1
12 1.6473351e+04 7.91e-04 1.15e-02 -1.7 1.84e+01 - 1.00e+00 1.00e+0
0f 1
13 1.6350121e+04 1.23e-03 7.08e-02 -3.8 2.42e+01 - 8.09e-01 9.18e-0
1f 1
14 1.6325736e+04 1.42e-03 6.09e-02 -3.8 1.73e+00 - 8.56e-01 7.80e-0
1h 1
15 1.6326069e+04 2.61e-06 7.19e-04 -3.8 9.31e-02 - 1.00e+00 1.00e+0
0h 1
16 1.6325124e+04 3.18e-07 5.83e-04 -5.7 1.49e-01 - 1.00e+00 9.89e-0
1h 1
17 1.6325118e+04 3.96e-11 6.00e-09 -5.7 3.79e-01 - 1.00e+00 1.00e+0
0f 1
18 1.6325105e+04 6.30e-11 2.05e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.6325105274746921e+01 1.6325105274746920e+0
4
Dual infeasibility......: 2.0519852089610653e-09 2.0519852089610653e-0
6
Constraint violation....: 6.2994956473438890e-11 6.2994956473438890e-1
1
Complementarity.........: 2.8881102999510189e-09 2.8881102999510186e-0
6
Overall NLP error.......: 2.8881102999510189e-09 2.8881102999510186e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9877155e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.75e-04 9.80e-0
3h 1
2 7.9583799e+02 1.50e+04 5.25e+01 -1.0 1.37e+04 - 3.21e-05 1.08e-0
4h 1
3 7.9439312e+02 1.50e+04 5.25e+01 -1.0 1.48e+04 - 1.18e-05 1.07e-0
4h 1
4 7.9342367e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 1.17e-04 7.34e-0
5h 1
5 5.2410528e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 1.93e-04 2.07e-0
2f 1
6 2.6443136e+04 5.37e-02 8.35e+01 -1.0 1.47e+04 - 3.30e-02 1.00e+0
0h 1
7 1.7754327e+04 5.15e-02 6.35e+01 -1.0 8.24e+01 - 2.42e-01 4.53e-0
2f 1
8 1.5954724e+04 4.20e-02 3.29e+01 -1.0 3.42e+01 - 4.81e-01 4.74e-0
1f 1
9 1.6279964e+04 2.57e-02 1.49e+01 -1.0 1.85e+01 - 4.23e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6017320e+04 6.14e-03 2.26e-01 -1.0 5.27e+00 - 9.88e-01 1.00e+0
0h 1
11 1.5732857e+04 1.24e-03 2.90e-01 -1.7 4.59e+00 - 1.00e+00 8.64e-0
1f 1
12 1.5720563e+04 7.89e-04 1.12e-02 -1.7 2.93e+01 - 1.00e+00 1.00e+0
0f 1
13 1.5593633e+04 1.17e-03 2.50e-02 -3.8 3.76e+01 - 7.98e-01 8.35e-0
1f 1
14 1.5560580e+04 1.66e-03 3.78e-02 -3.8 2.09e+00 - 8.43e-01 7.95e-0
1h 1
15 1.5560079e+04 3.83e-06 8.81e-04 -3.8 3.98e-02 - 1.00e+00 1.00e+0
0h 1
16 1.5559222e+04 2.23e-07 8.31e-04 -5.7 1.50e-01 - 1.00e+00 9.86e-0
1h 1
17 1.5559215e+04 3.39e-11 7.01e-09 -5.7 2.18e-01 - 1.00e+00 1.00e+0
0f 1
18 1.5559202e+04 6.30e-11 2.10e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5559202142061144e+01 1.5559202142061144e+0
4
Dual infeasibility......: 2.0959812590100541e-09 2.0959812590100541e-0
6
Constraint violation....: 6.2997690397637029e-11 6.2997690397637029e-1
1
Complementarity.........: 2.8880886699453173e-09 2.8880886699453174e-0
6
Overall NLP error.......: 2.8880886699453173e-09 2.8880886699453174e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8638120e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 6.50e-04 9.80e-0
3h 1
2 8.8357179e+02 1.39e+04 5.24e+01 -1.0 1.32e+04 - 4.26e-05 1.04e-0
4h 1
3 8.8271571e+02 1.39e+04 5.24e+01 -1.0 1.37e+04 - 7.64e-06 6.16e-0
5h 1
4 8.8150157e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 6.73e-05 8.90e-0
5h 1
5 5.7106341e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 1.57e-04 2.29e-0
2f 1
6 2.6169999e+04 6.18e-02 7.87e+01 -1.0 1.36e+04 - 5.89e-02 1.00e+0
0h 1
7 1.7517879e+04 5.72e-02 5.23e+01 -1.0 6.03e+01 - 3.22e-01 6.74e-0
2f 1
8 1.6209661e+04 3.03e-02 2.50e+01 -1.0 2.89e+01 - 5.11e-01 4.34e-0
1f 1
9 1.5474834e+04 1.15e-02 1.60e+00 -1.0 1.07e+01 - 9.22e-01 8.29e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5822830e+04 2.62e-04 7.74e-02 -1.0 4.10e+00 - 1.00e+00 1.00e+0
0f 1
11 1.5106621e+04 2.13e-03 1.14e-01 -2.5 5.66e+00 - 8.71e-01 9.16e-0
1f 1
12 1.5047750e+04 1.04e-03 1.16e+00 -2.5 6.78e-01 - 1.00e+00 4.76e-0
1h 1
13 1.5043898e+04 4.63e-06 9.29e-03 -2.5 2.57e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5026999e+04 3.10e-05 6.84e-02 -3.8 2.71e+00 - 8.38e-01 9.28e-0
1f 1
15 1.5023969e+04 6.13e-04 1.12e-03 -3.8 1.80e-01 - 1.00e+00 1.00e+0
0f 1
16 1.5022871e+04 1.23e-04 7.66e-03 -5.7 1.49e-01 - 8.17e-01 1.00e+0
0h 1
17 1.5022770e+04 5.19e-05 2.37e-05 -5.7 1.13e-02 - 1.00e+00 1.00e+0
0h 1
18 1.5022767e+04 5.99e-06 8.64e-05 -5.7 2.80e-03 - 1.00e+00 9.64e-0
1h 1
19 1.5022771e+04 5.38e-08 8.74e-07 -5.7 3.57e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5022756e+04 5.63e-08 4.05e-06 -8.6 1.84e-03 - 9.98e-01 9.85e-0
1h 1
21 1.5022756e+04 2.34e-13 2.60e-11 -8.6 2.69e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.5022756186427088e+01 1.5022756186427088e+0
4
Dual infeasibility......: 2.6006170322826771e-11 2.6006170322826771e-0
8
Constraint violation....: 2.3384072456167360e-13 2.3384072456167360e-1
3
Complementarity.........: 2.5095654273837292e-09 2.5095654273837294e-0
6
Overall NLP error.......: 2.5095654273837292e-09 2.5095654273837294e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8072093e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.97e-04 9.80e-0
3h 1
2 8.7779331e+02 1.27e+04 5.24e+01 -1.0 1.12e+04 - 2.87e-05 1.11e-0
4h 1
3 8.7585406e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 1.55e-05 1.29e-0
4h 1
4 8.6792561e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 1.41e-04 5.32e-0
4h 1
5 5.4106309e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 6.86e-04 2.25e-0
2f 1
6 2.4585059e+04 6.17e-02 7.93e+01 -1.0 1.24e+04 - 5.67e-02 1.00e+0
0h 1
7 1.6171954e+04 5.72e-02 5.23e+01 -1.0 6.39e+01 - 3.27e-01 6.59e-0
2f 1
8 1.4813438e+04 3.11e-02 2.54e+01 -1.0 3.21e+01 - 5.02e-01 4.22e-0
1f 1
9 1.4040260e+04 1.14e-02 2.00e+00 -1.0 1.10e+01 - 9.20e-01 9.11e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4460354e+04 3.39e-04 1.55e-01 -1.0 4.85e+00 - 9.48e-01 1.00e+0
0f 1
11 1.3756427e+04 1.20e-03 1.00e+00 -1.7 6.30e+00 - 4.47e-01 1.00e+0
0f 1
12 1.3826318e+04 4.25e-05 1.04e+00 -1.7 8.51e+00 - 7.25e-01 1.00e+0
0f 1
13 1.3807212e+04 6.83e-05 3.31e-02 -1.7 1.39e+01 - 8.87e-01 1.00e+0
0f 1
14 1.3732511e+04 3.00e-05 6.51e-01 -2.5 2.40e+01 - 1.00e+00 7.31e-0
1f 1
15 1.3714320e+04 1.17e-04 6.36e-03 -2.5 7.65e+00 - 1.00e+00 1.00e+0
0f 1
16 1.3696954e+04 2.73e-04 8.86e-02 -3.8 5.42e+00 - 7.69e-01 1.00e+0
0h 1
17 1.3694187e+04 1.65e-03 2.17e-03 -3.8 3.86e-02 - 9.73e-01 1.00e+0
0f 1
18 1.3694230e+04 7.20e-05 6.21e-05 -3.8 1.14e-02 - 1.00e+00 1.00e+0
0h 1
19 1.3692877e+04 1.31e-04 1.11e-03 -5.7 2.97e-01 - 9.18e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.3692836e+04 3.25e-05 6.65e-06 -5.7 8.40e-03 - 1.00e+00 1.00e+0
0h 1
21 1.3692841e+04 1.81e-07 3.37e-06 -5.7 6.12e-04 - 1.00e+00 1.00e+0
0h 1
22 1.3692826e+04 2.64e-08 3.27e-05 -8.6 3.68e-03 - 1.00e+00 9.57e-0
1h 1
23 1.3692826e+04 4.37e-12 5.15e-11 -8.6 1.57e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 23
(scaled) (unscaled)
Objective...............: 1.3692825527873902e+01 1.3692825527873902e+0
4
Dual infeasibility......: 5.1522780036547136e-11 5.1522780036547136e-0
8
Constraint violation....: 4.3749448508378919e-12 4.3749448508378919e-1
2
Complementarity.........: 3.3438773290177691e-09 3.3438773290177692e-0
6
Overall NLP error.......: 3.3438773290177691e-09 3.3438773290177692e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 24
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 24
Number of inequality constraint Jacobian evaluations = 24
Number of Lagrangian Hessian evaluations = 23
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2301164e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.51e-03 9.80e-0
3h 1
2 9.1989531e+02 1.11e+04 5.23e+01 -1.0 9.02e+03 - 1.92e-05 1.22e-0
4h 1
3 5.4989425e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 2.65e-05 2.25e-0
2h 1
4 2.1102552e+04 7.45e-02 7.98e+01 -1.0 1.09e+04 - 2.67e-02 1.00e+0
0h 1
5 1.5432123e+04 7.15e-02 5.55e+01 -1.0 2.13e+01 - 2.97e-01 3.84e-0
2f 1
6 1.4303813e+04 1.35e-02 2.41e+01 -1.0 1.11e+01 - 5.91e-01 7.46e-0
1f 1
7 1.4153592e+04 8.15e-03 2.49e-01 -1.0 1.97e+00 - 9.90e-01 1.00e+0
0f 1
8 1.3803440e+04 1.55e-03 1.99e-01 -1.7 4.96e+00 - 8.89e-01 1.00e+0
0f 1
9 1.3656498e+04 1.41e-03 6.69e-02 -2.5 1.40e+00 - 7.81e-01 7.95e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3625847e+04 3.65e-04 8.15e-02 -2.5 1.57e+00 - 1.00e+00 9.07e-0
1f 1
11 1.3630051e+04 1.35e-05 5.20e-03 -2.5 5.66e-01 - 1.00e+00 1.00e+0
0f 1
12 1.3602152e+04 1.14e-05 6.23e-03 -3.8 8.04e+00 - 1.00e+00 9.70e-0
1f 1
13 1.3601760e+04 1.60e-08 1.22e-05 -3.8 2.41e-01 - 1.00e+00 1.00e+0
0f 1
14 1.3600269e+04 1.79e-08 5.06e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0f 1
15 1.3600252e+04 6.40e-13 4.12e-10 -8.6 5.52e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.3600252141246292e+01 1.3600252141246292e+0
4
Dual infeasibility......: 4.1159588622458328e-10 4.1159588622458328e-0
7
Constraint violation....: 6.4048766290625281e-13 6.4048766290625281e-1
3
Complementarity.........: 2.9735522858818788e-09 2.9735522858818788e-0
6
Overall NLP error.......: 2.9735522858818788e-09 2.9735522858818788e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8777320e+02 9.19e+03 5.24e+01 -1.0 9.28e+03 - 6.64e-04 9.80e-0
3h 1
2 8.8499164e+02 9.19e+03 5.24e+01 -1.0 8.96e+03 - 8.88e-05 1.02e-0
4h 1
3 8.6604553e+02 9.18e+03 5.24e+01 -1.0 9.18e+03 - 4.81e-06 1.03e-0
3f 1
4 4.6753384e+02 8.97e+03 5.24e+01 -1.0 9.18e+03 - 1.16e-03 2.24e-0
2h 1
5 2.1019834e+04 6.31e-02 7.87e+01 -1.0 8.97e+03 - 6.27e-02 1.00e+0
0h 1
6 1.2779542e+04 5.82e-02 5.04e+01 -1.0 5.68e+01 - 3.45e-01 7.15e-0
2f 1
7 1.1474093e+04 2.98e-02 2.31e+01 -1.0 2.74e+01 - 5.30e-01 4.48e-0
1f 1
8 1.0826912e+04 8.86e-03 1.29e+00 -1.0 1.03e+01 - 9.25e-01 7.95e-0
1f 1
9 1.1132672e+04 2.56e-04 7.50e-02 -1.0 3.69e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.0462579e+04 2.14e-03 9.04e-02 -2.5 5.27e+00 - 8.69e-01 8.83e-0
1f 1
11 1.0356962e+04 1.11e-03 4.48e-01 -2.5 8.53e-01 - 1.00e+00 6.12e-0
1f 1
12 1.0357041e+04 2.64e-06 8.39e-03 -2.5 1.73e-01 - 1.00e+00 1.00e+0
0h 1
13 1.0339021e+04 7.22e-06 6.55e-03 -3.8 2.68e+00 - 9.00e-01 8.93e-0
1f 1
14 1.0335760e+04 4.68e-04 3.83e-04 -3.8 2.86e-01 - 1.00e+00 1.00e+0
0f 1
15 1.0334765e+04 6.30e-05 1.15e-02 -5.7 1.49e-01 - 8.13e-01 1.00e+0
0h 1
16 1.0334649e+04 3.63e-05 4.09e-05 -5.7 9.71e-03 - 1.00e+00 1.00e+0
0h 1
17 1.0334650e+04 1.61e-06 3.43e-05 -5.7 1.54e-03 - 1.00e+00 9.90e-0
1h 1
18 1.0334653e+04 3.53e-08 5.13e-07 -5.7 2.92e-04 - 1.00e+00 1.00e+0
0f 1
19 1.0334638e+04 3.96e-08 7.26e-06 -8.6 1.84e-03 - 9.97e-01 9.81e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.0334638e+04 5.32e-13 2.97e-11 -8.6 3.54e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.0334637959374300e+01 1.0334637959374300e+0
4
Dual infeasibility......: 2.9731375942070296e-11 2.9731375942070296e-0
8
Constraint violation....: 5.3168580649298747e-13 5.3168580649298747e-1
3
Complementarity.........: 2.5100786379880761e-09 2.5100786379880760e-0
6
Overall NLP error.......: 2.5100786379880761e-09 2.5100786379880760e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3709613e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 3.06e-03 9.81e-0
3h 1
2 9.3353198e+02 6.71e+03 5.23e+01 -1.0 5.10e+03 - 1.89e-05 1.30e-0
4h 1
3 4.2613385e+02 6.55e+03 5.24e+01 -1.0 6.71e+03 - 3.56e-05 2.29e-0
2f 1
4 1.9281092e+04 7.30e-02 8.02e+01 -1.0 6.55e+03 - 3.74e-02 1.00e+0
0h 1
5 1.1339331e+04 6.91e-02 5.90e+01 -1.0 8.02e+00 - 2.64e-01 5.00e-0
2f 1
6 1.0190236e+04 2.14e-02 2.42e+01 -1.0 5.08e+00 - 6.39e-01 1.00e+0
0f 1
7 1.0517954e+04 2.95e-03 2.00e-01 -1.0 2.03e+00 - 9.91e-01 1.00e+0
0f 1
8 1.0004069e+04 1.59e-03 6.62e-02 -1.7 5.17e+00 - 1.00e+00 9.87e-0
1f 1
9 9.8321730e+03 1.66e-03 3.42e-01 -2.5 1.25e+00 - 1.00e+00 8.01e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.8071757e+03 3.62e-05 7.24e-03 -2.5 2.80e-01 - 1.00e+00 1.00e+0
0h 1
11 9.7854015e+03 2.15e-06 7.23e-04 -3.8 5.36e+00 - 1.00e+00 1.00e+0
0h 1
12 9.7842083e+03 1.50e-08 3.75e-06 -5.7 2.95e-01 - 1.00e+00 1.00e+0
0h 1
13 9.7841926e+03 1.71e-12 4.05e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 13
(scaled) (unscaled)
Objective...............: 9.7841925856384560e+00 9.7841925856384551e+0
3
Dual infeasibility......: 4.0517118825163744e-10 4.0517118825163744e-0
7
Constraint violation....: 1.7063989110610578e-12 1.7063989110610578e-1
2
Complementarity.........: 2.5700935734883474e-09 2.5700935734883472e-0
6
Overall NLP error.......: 2.5700935734883474e-09 2.5700935734883472e-0
6
Number of objective function evaluations = 14
Number of objective gradient evaluations = 14
Number of equality constraint evaluations = 14
Number of inequality constraint evaluations = 14
Number of equality constraint Jacobian evaluations = 14
Number of inequality constraint Jacobian evaluations = 14
Number of Lagrangian Hessian evaluations = 13
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2997022e+02 4.77e+03 5.23e+01 -1.0 4.81e+03 - 1.96e-03 9.81e-0
3h 1
2 7.5577386e+02 4.74e+03 5.23e+01 -1.0 4.71e+03 - 1.27e-05 7.63e-0
3h 1
3 4.2762046e+02 4.64e+03 5.20e+01 -1.0 4.74e+03 - 9.45e-03 2.11e-0
2h 1
4 1.4309518e+04 8.17e-02 7.89e+01 -1.0 4.64e+03 - 7.63e-02 1.00e+0
0h 1
5 8.9296780e+03 7.37e-02 4.13e+01 -1.0 1.52e+01 - 4.63e-01 9.23e-0
2f 1
6 7.8352721e+03 2.26e-02 1.01e+01 -1.0 8.20e+00 - 7.64e-01 8.36e-0
1f 1
7 8.1785573e+03 2.17e-03 1.16e-01 -1.0 3.10e+00 - 9.91e-01 1.00e+0
0f 1
8 7.7795241e+03 1.44e-03 1.30e-01 -1.7 1.42e+01 - 1.00e+00 1.00e+0
0f 1
9 7.5954759e+03 1.94e-03 3.21e-01 -2.5 1.26e+00 - 1.00e+00 8.11e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.5780605e+03 1.03e-04 2.97e-02 -2.5 2.53e-01 - 1.00e+00 9.63e-0
1f 1
11 7.5811115e+03 6.27e-06 9.98e-04 -2.5 7.04e-03 - 1.00e+00 1.00e+0
0f 1
12 7.5486878e+03 7.50e-06 4.40e-03 -3.8 1.34e+01 - 1.00e+00 9.78e-0
1f 1
13 7.5483552e+03 1.37e-08 6.34e-06 -3.8 2.89e-01 - 1.00e+00 1.00e+0
0f 1
14 7.5465686e+03 1.73e-08 3.04e-06 -5.7 7.43e-01 - 1.00e+00 1.00e+0
0f 1
15 7.5465477e+03 1.28e-12 4.22e-10 -8.6 9.20e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 7.5465477396409337e+00 7.5465477396409333e+0
3
Dual infeasibility......: 4.2179880094938906e-10 4.2179880094938906e-0
7
Constraint violation....: 1.2798928583634961e-12 1.2798928583634961e-1
2
Complementarity.........: 2.9167605636077617e-09 2.9167605636077618e-0
6
Overall NLP error.......: 2.9167605636077617e-09 2.9167605636077618e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6647742e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 4.97e-04 9.81e-0
3h 1
2 8.6258607e+02 3.24e+03 5.24e+01 -1.0 2.21e+03 - 3.91e-05 1.45e-0
4h 1
3 3.1400433e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 5.82e-05 2.24e-0
2f 1
4 1.5420372e+04 5.91e-02 8.12e+01 -1.0 3.17e+03 - 3.49e-02 1.00e+0
0h 1
5 6.7290069e+03 5.61e-02 6.00e+01 -1.0 7.11e+01 - 2.59e-01 4.63e-0
2f 1
6 4.9141782e+03 2.50e-02 3.24e+01 -1.0 3.47e+01 - 4.68e-01 5.32e-0
1f 1
7 4.4464852e+03 1.14e-02 2.56e+00 -1.0 9.40e+00 - 9.28e-01 1.00e+0
0f 1
8 4.7445322e+03 5.19e-04 7.19e-02 -1.0 2.72e+00 - 9.98e-01 1.00e+0
0f 1
9 4.1967415e+03 5.77e-04 4.25e-01 -2.5 7.14e+00 - 8.93e-01 7.24e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.1292500e+03 1.97e-04 2.34e-01 -2.5 2.25e+00 - 9.13e-01 1.00e+0
0h 1
11 4.1116429e+03 2.84e-04 9.33e-02 -2.5 9.70e-01 - 1.00e+00 7.64e-0
1H 1
12 4.1091626e+03 3.40e-04 1.77e-03 -2.5 1.24e-01 - 1.00e+00 1.00e+0
0f 1
13 4.0879671e+03 1.22e-03 3.19e-02 -3.8 8.05e+00 - 7.96e-01 1.00e+0
0h 1
14 4.0846007e+03 2.79e-03 1.11e-03 -3.8 4.90e-02 - 1.00e+00 1.00e+0
0h 1
15 4.0849547e+03 3.93e-05 1.31e-04 -3.8 1.35e-02 - 1.00e+00 1.00e+0
0h 1
16 4.0833586e+03 1.01e-04 3.52e-04 -5.7 4.46e-01 - 9.51e-01 9.77e-0
1h 1
17 4.0833414e+03 2.19e-05 3.67e-03 -5.7 1.03e-02 - 1.00e+00 7.83e-0
1h 1
18 4.0833430e+03 8.57e-09 1.21e-06 -5.7 2.23e-03 - 1.00e+00 1.00e+0
0f 1
19 4.0833247e+03 9.02e-09 1.92e-05 -8.6 5.53e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 4.0833244e+03 1.37e-12 6.48e-11 -8.6 9.17e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 4.0833243918460234e+00 4.0833243918460234e+0
3
Dual infeasibility......: 6.4812998514017211e-11 6.4812998514017211e-0
8
Constraint violation....: 1.3685719224554305e-12 1.3685719224554305e-1
2
Complementarity.........: 2.9916908716668533e-09 2.9916908716668531e-0
6
Overall NLP error.......: 2.9916908716668533e-09 2.9916908716668531e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8047271e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.82e-0
3h 1
2 8.7571780e+02 2.00e+03 5.24e+01 -1.0 1.11e+03 - 4.57e-05 1.77e-0
4h 1
3 2.9373644e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 9.83e-05 2.27e-0
2f 1
4 1.4280611e+04 6.09e-02 7.92e+01 -1.0 1.95e+03 - 5.49e-02 1.00e+0
0h 1
5 5.5544141e+03 5.66e-02 5.35e+01 -1.0 6.57e+01 - 3.12e-01 6.38e-0
2f 1
6 4.1958834e+03 3.11e-02 2.65e+01 -1.0 3.24e+01 - 4.93e-01 4.18e-0
1f 1
7 3.3759781e+03 1.36e-02 2.17e+00 -1.0 1.11e+01 - 9.19e-01 9.26e-0
1f 1
8 3.8304846e+03 4.15e-04 1.07e-01 -1.0 5.03e+00 - 9.98e-01 1.00e+0
0f 1
9 3.1593984e+03 1.16e-03 1.11e+00 -1.7 4.69e+01 - 3.91e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.1977682e+03 9.02e-06 1.31e-02 -1.7 9.21e+00 - 1.00e+00 1.00e+0
0h 1
11 3.0829542e+03 2.92e-05 4.05e-01 -2.5 5.12e+01 - 1.00e+00 7.86e-0
1f 1
12 3.0635254e+03 1.06e-04 4.91e-03 -2.5 1.06e+01 - 1.00e+00 1.00e+0
0f 1
13 3.0434838e+03 2.78e-04 8.69e-02 -3.8 8.05e+00 - 7.71e-01 1.00e+0
0h 1
14 3.0407334e+03 1.61e-03 2.08e-03 -3.8 3.64e-02 - 9.71e-01 1.00e+0
0h 1
15 3.0407737e+03 7.54e-05 6.60e-05 -3.8 1.18e-02 - 1.00e+00 1.00e+0
0h 1
16 3.0392720e+03 1.31e-04 1.11e-03 -5.7 4.46e-01 - 9.18e-01 1.00e+0
0h 1
17 3.0392303e+03 3.28e-05 6.74e-06 -5.7 8.43e-03 - 1.00e+00 1.00e+0
0h 1
18 3.0392359e+03 1.93e-07 3.46e-06 -5.7 6.32e-04 - 1.00e+00 1.00e+0
0h 1
19 3.0392191e+03 2.64e-08 3.36e-05 -8.6 5.53e-03 - 1.00e+00 9.57e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 3.0392184e+03 4.51e-12 5.22e-11 -8.6 2.39e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 3.0392183904084060e+00 3.0392183904084059e+0
3
Dual infeasibility......: 5.2199434607068066e-11 5.2199434607068066e-0
8
Constraint violation....: 4.5091708145150733e-12 4.5091708145150733e-1
2
Complementarity.........: 3.5744552711818077e-09 3.5744552711818075e-0
6
Overall NLP error.......: 3.5744552711818077e-09 3.5744552711818075e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6555952e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 4.97e-04 9.86e-0
3h 1
2 8.5049278e+02 9.17e+02 5.24e+01 -1.0 7.54e+02 - 7.94e-05 5.56e-0
4h 1
3 2.6243053e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 5.25e-04 2.21e-0
2h 1
4 1.2843590e+04 5.96e-02 8.01e+01 -1.0 8.97e+02 - 5.01e-02 1.00e+0
0h 1
5 4.2877637e+03 5.57e-02 5.36e+01 -1.0 7.35e+01 - 3.21e-01 5.99e-0
2f 1
6 2.6987533e+03 3.02e-02 2.80e+01 -1.0 3.89e+01 - 4.73e-01 4.32e-0
1f 1
7 2.1338104e+03 1.47e-02 2.60e+00 -1.0 1.10e+01 - 9.18e-01 1.00e+0
0f 1
8 2.4784985e+03 4.35e-04 8.91e-02 -1.0 4.11e+00 - 9.95e-01 1.00e+0
0f 1
9 1.8850092e+03 7.20e-04 3.48e-01 -2.5 8.02e+00 - 8.81e-01 7.34e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8153168e+03 2.43e-04 3.44e-01 -2.5 5.63e+00 - 8.84e-01 1.00e+0
0h 1
11 1.8084641e+03 7.31e-04 4.28e-01 -2.5 1.40e+00 - 1.00e+00 1.97e-0
1h 2
12 1.7887640e+03 1.00e-03 1.17e-02 -2.5 9.26e-01 - 1.00e+00 1.00e+0
0h 1
13 1.7618411e+03 1.22e-03 3.34e-02 -3.8 1.35e+01 - 7.93e-01 1.00e+0
0h 1
14 1.7587835e+03 2.37e-03 9.33e-04 -3.8 3.99e-02 - 1.00e+00 1.00e+0
0h 1
15 1.7591123e+03 4.69e-05 1.25e-04 -3.8 1.50e-02 - 1.00e+00 1.00e+0
0h 1
16 1.7572173e+03 1.03e-04 3.65e-04 -5.7 7.43e-01 - 9.51e-01 9.77e-0
1h 1
17 1.7571949e+03 2.27e-05 3.68e-03 -5.7 1.67e-02 - 1.00e+00 7.82e-0
1h 1
18 1.7571952e+03 8.72e-09 1.23e-06 -5.7 3.66e-03 - 1.00e+00 1.00e+0
0f 1
19 1.7571733e+03 9.04e-09 1.92e-05 -8.6 9.21e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7571729e+03 1.37e-12 6.49e-11 -8.6 1.53e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.7571729209979268e+00 1.7571729209979267e+0
3
Dual infeasibility......: 6.4905802545147727e-11 6.4905802545147727e-0
8
Constraint violation....: 1.3682388555480429e-12 1.3682388555480429e-1
2
Complementarity.........: 2.5092410551473128e-09 2.5092410551473126e-0
6
Overall NLP error.......: 2.5092410551473128e-09 2.5092410551473126e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318724481455e-09 2.1031318724481455e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896894379e-09 2.8882108896894380e-0
6
Overall NLP error.......: 2.8882108896894379e-09 2.8882108896894380e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318724481455e-09 2.1031318724481455e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896894379e-09 2.8882108896894380e-0
6
Overall NLP error.......: 2.8882108896894379e-09 2.8882108896894380e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101521e-01 6.4890146112101525e+0
2
Dual infeasibility......: 4.9126605618489413e-09 4.9126605618489413e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984918224e-09 4.3646094984918221e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605618489413e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.04e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.57e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235660171e+00 1.6104063235660171e+0
3
Dual infeasibility......: 2.4574009793760635e-12 2.4574009793760635e-0
9
Constraint violation....: 7.5703172614159067e-16 7.5703172614159067e-1
6
Complementarity.........: 2.5062163919681798e-09 2.5062163919681799e-0
6
Overall NLP error.......: 2.5062163919681798e-09 2.5062163919681799e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2278083e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 3.31e-04 9.87e-0
3h 1
2 8.0391474e+02 9.17e+02 5.24e+01 -1.0 7.85e+02 - 8.87e-05 6.88e-0
4h 1
3 2.4271271e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 6.68e-04 2.10e-0
2h 1
4 1.2385916e+04 5.52e-02 8.23e+01 -1.0 8.98e+02 - 3.86e-02 1.00e+0
0h 1
5 3.8851959e+03 5.26e-02 5.59e+01 -1.0 8.06e+01 - 3.19e-01 5.02e-0
2f 1
6 1.9099004e+03 3.73e-02 2.99e+01 -1.0 3.93e+01 - 4.69e-01 5.04e-0
1f 1
7 4.6737272e+03 1.22e-02 2.67e+01 -1.0 2.06e+01 - 4.01e-01 1.00e+0
0h 1
8 1.8754601e+03 1.19e-02 1.01e+00 -1.0 2.53e+01 - 9.88e-01 8.94e-0
1f 1
9 2.0005994e+03 1.84e-04 4.66e-02 -1.0 3.18e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7351413e+03 2.16e-04 1.24e+00 -2.5 1.71e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5469297e+03 3.76e-03 1.33e-01 -2.5 7.60e+00 - 7.95e-01 1.00e+0
0f 1
12 1.5237159e+03 5.30e-03 3.11e-01 -2.5 1.84e+00 - 1.00e+00 7.66e-0
1h 1
13 1.5360639e+03 2.44e-04 4.74e-03 -2.5 7.11e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5034784e+03 1.70e-04 2.15e-02 -3.8 1.62e+01 - 9.91e-01 9.29e-0
1h 1
15 1.5021214e+03 7.21e-07 6.83e-05 -3.8 1.10e+00 - 1.00e+00 1.00e+0
0h 1
16 1.5003172e+03 3.77e-07 1.78e-04 -5.7 8.92e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003154e+03 3.79e-11 2.92e-09 -5.7 4.18e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.11e-02 - 1.00e+00 1.00e+0
0h 1
1 8.6534772e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 4.97e-04 9.87e-0
3h 1
2 8.4418057e+02 9.17e+02 5.24e+01 -1.0 8.02e+02 - 8.70e-05 7.83e-0
4h 1
3 2.6276094e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 7.65e-04 2.20e-0
2h 1
4 1.2724514e+04 5.99e-02 8.02e+01 -1.0 8.97e+02 - 5.06e-02 1.00e+0
0h 1
5 4.2755874e+03 5.59e-02 5.32e+01 -1.0 7.28e+01 - 3.26e-01 6.05e-0
2f 1
52 1.611599e+04 1.632511e+04 4.547604e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1155551e+02 1.57e+04 5.50e+01 -1.0 1.59e+04 - 1.75e-04 9.80e-0
3f 1
2 7.0865070e+02 1.57e+04 5.50e+01 -1.0 1.45e+04 - 3.33e-05 1.07e-0
4h 1
3 7.0701320e+02 1.57e+04 5.50e+01 -1.0 1.56e+04 - 1.08e-05 1.31e-0
4h 1
4 7.0600968e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 1.41e-04 8.23e-0
5h 1
5 4.8137539e+02 1.54e+04 5.40e+01 -1.0 1.57e+04 - 2.30e-04 1.89e-0
2f 1
6 2.6571224e+04 7.61e-02 8.69e+01 -1.0 1.54e+04 - 2.50e-02 1.00e+0
0h 1
7 1.7890295e+04 7.33e-02 7.43e+01 -1.0 7.60e+01 - 1.54e-01 3.94e-0
2f 1
8 1.6625965e+04 4.64e-02 3.45e+01 -1.0 1.94e+01 - 5.29e-01 3.77e-0
1f 1
9 1.6877507e+04 4.07e-02 1.03e+01 -1.0 1.34e+01 - 5.66e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6797388e+04 6.84e-03 1.93e-01 -1.0 9.45e-01 - 9.90e-01 1.00e+0
0h 1
11 1.6499207e+04 7.54e-04 2.00e-01 -1.7 5.53e+00 - 1.00e+00 8.97e-0
1f 1
12 1.6371794e+04 1.99e-03 1.79e-01 -2.5 5.47e+00 - 7.99e-01 1.00e+0
0f 1
13 1.6337836e+04 2.46e-03 3.83e-02 -2.5 3.34e+00 - 1.00e+00 9.66e-0
1h 1
14 1.6346916e+04 1.23e-04 4.13e-03 -2.5 2.87e+00 - 1.00e+00 1.00e+0
0f 1
15 1.6326263e+04 1.64e-04 1.07e-02 -3.8 2.85e+00 - 9.94e-01 9.56e-0
1h 1
16 1.6326178e+04 5.86e-07 6.36e-05 -3.8 6.63e-02 - 1.00e+00 1.00e+0
0h 1
17 1.6325117e+04 3.81e-07 1.32e-04 -5.7 1.49e-01 - 1.00e+00 9.97e-0
1h 1
18 1.6325118e+04 3.84e-11 3.16e-09 -5.7 1.27e-02 - 1.00e+00 1.00e+0
0f 1
19 1.6325105e+04 6.30e-11 2.05e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.6325105274727900e+01 1.6325105274727899e+0
4
Dual infeasibility......: 2.0521747196708432e-09 2.0521747196708432e-0
6
Constraint violation....: 6.2993471550143454e-11 6.2993471550143454e-1
1
Complementarity.........: 2.8882052154813432e-09 2.8882052154813431e-0
6
Overall NLP error.......: 2.8882052154813432e-09 2.8882052154813431e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9876163e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.75e-04 9.80e-0
3h 1
2 7.9582804e+02 1.50e+04 5.25e+01 -1.0 1.37e+04 - 3.21e-05 1.08e-0
4h 1
3 7.9412723e+02 1.50e+04 5.25e+01 -1.0 1.49e+04 - 1.17e-05 1.27e-0
4h 1
4 7.9302760e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 1.37e-04 8.34e-0
5h 1
5 5.2459290e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 2.23e-04 2.07e-0
2f 1
6 2.6416305e+04 5.38e-02 8.35e+01 -1.0 1.47e+04 - 3.31e-02 1.00e+0
0h 1
7 1.7752369e+04 5.16e-02 6.34e+01 -1.0 8.22e+01 - 2.44e-01 4.54e-0
2f 1
8 1.5954576e+04 4.21e-02 3.29e+01 -1.0 3.42e+01 - 4.81e-01 4.74e-0
1f 1
9 1.6279484e+04 2.57e-02 1.48e+01 -1.0 1.85e+01 - 4.24e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6017410e+04 6.14e-03 2.27e-01 -1.0 5.26e+00 - 9.88e-01 1.00e+0
0h 1
11 1.5732872e+04 1.24e-03 2.90e-01 -1.7 4.59e+00 - 1.00e+00 8.64e-0
1f 1
12 1.5721108e+04 7.88e-04 1.12e-02 -1.7 2.98e+01 - 1.00e+00 1.00e+0
0f 1
13 1.5594274e+04 1.16e-03 2.17e-02 -3.8 3.85e+01 - 7.98e-01 8.29e-0
1f 1
14 1.5560626e+04 1.67e-03 3.64e-02 -3.8 2.11e+00 - 8.42e-01 7.97e-0
1h 1
15 1.5560074e+04 3.92e-06 8.90e-04 -3.8 3.95e-02 - 1.00e+00 1.00e+0
0h 1
16 1.5559222e+04 2.17e-07 8.43e-04 -5.7 1.50e-01 - 1.00e+00 9.86e-0
1h 1
17 1.5559215e+04 3.35e-11 7.06e-09 -5.7 2.14e-01 - 1.00e+00 1.00e+0
0f 1
18 1.5559202e+04 6.30e-11 2.10e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5559202142059110e+01 1.5559202142059110e+0
4
Dual infeasibility......: 2.0959657966980406e-09 2.0959657966980406e-0
6
Constraint violation....: 6.2998203875785919e-11 6.2998203875785919e-1
1
Complementarity.........: 2.8880876115336305e-09 2.8880876115336303e-0
6
Overall NLP error.......: 2.8880876115336305e-09 2.8880876115336303e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4409204e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.92e-04 9.80e-0
3f 1
2 8.4128783e+02 1.39e+04 5.24e+01 -1.0 1.37e+04 - 9.29e-05 1.01e-0
4h 1
3 8.3223945e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 3.09e-06 6.42e-0
4f 1
4 5.3903749e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 6.89e-04 2.15e-0
2h 1
5 2.5524717e+04 5.72e-02 8.12e+01 -1.0 1.36e+04 - 4.53e-02 1.00e+0
0h 1
6 1.7022311e+04 5.37e-02 5.25e+01 -1.0 7.99e+01 - 3.46e-01 5.59e-0
2f 1
7 1.4909722e+04 3.42e-02 2.85e+01 -1.0 4.22e+01 - 4.65e-01 5.33e-0
1f 1
8 1.5382569e+04 1.84e-02 7.96e+00 -1.0 2.05e+01 - 5.93e-01 2.50e-0
1f 3
9 1.5064009e+04 5.25e-03 5.45e-01 -1.0 6.13e+00 - 9.52e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4709828e+04 1.46e-03 5.12e-01 -1.7 6.60e+00 - 1.00e+00 7.86e-0
1f 1
11 1.4650676e+04 7.05e-04 2.55e-02 -1.7 1.84e+01 - 1.00e+00 1.00e+0
0f 1
12 1.4510510e+04 1.45e-03 1.16e-01 -3.8 1.99e+01 - 7.66e-01 9.24e-0
1f 1
13 1.4479292e+04 2.48e-03 5.58e-02 -3.8 2.23e+00 - 8.16e-01 7.61e-0
1h 1
14 1.4480758e+04 1.87e-04 7.99e-02 -3.8 3.54e-01 - 1.00e+00 9.38e-0
1h 1
15 1.4481114e+04 4.05e-07 1.78e-05 -3.8 3.25e-02 - 1.00e+00 1.00e+0
0f 1
16 1.4480069e+04 4.15e-07 9.97e-04 -5.7 1.49e-01 - 1.00e+00 9.87e-0
1h 1
17 1.4480065e+04 4.53e-11 4.86e-09 -5.7 5.04e-03 - 1.00e+00 1.00e+0
0f 1
18 1.4480052e+04 6.30e-11 3.21e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.4480051772048464e+01 1.4480051772048464e+0
4
Dual infeasibility......: 3.2068715296961485e-09 3.2068715296961485e-0
6
Constraint violation....: 6.3005559103324060e-11 6.3005559103324060e-1
1
Complementarity.........: 2.9188250847475175e-09 2.9188250847475174e-0
6
Overall NLP error.......: 3.2068715296961485e-09 3.2068715296961485e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1458976e+02 1.27e+04 5.23e+01 -1.0 1.28e+04 - 1.16e-03 9.80e-0
3h 1
2 9.1162506e+02 1.27e+04 5.23e+01 -1.0 1.09e+04 - 2.24e-05 1.15e-0
4h 1
3 7.2084324e+02 1.25e+04 5.24e+01 -1.0 1.26e+04 - 1.95e-05 1.29e-0
2h 1
4 7.4749288e+02 1.22e+04 5.18e+01 -1.0 1.25e+04 - 1.46e-02 2.23e-0
2h 1
5 2.0810140e+04 8.03e-02 7.77e+01 -1.0 1.22e+04 - 9.64e-02 1.00e+0
0h 1
6 1.6284810e+04 7.04e-02 2.05e+01 -1.0 1.79e+01 - 7.13e-01 1.16e-0
1f 1
7 1.5083752e+04 1.76e-02 1.10e+00 -1.0 1.18e+01 - 9.51e-01 8.02e-0
1f 1
8 1.5367257e+04 1.34e-02 5.12e-01 -1.0 5.82e+00 - 4.45e-01 9.09e-0
1f 1
9 1.4975213e+04 2.88e-03 3.29e-01 -1.7 2.34e+00 - 8.42e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4947977e+04 7.62e-04 4.37e-01 -1.7 9.69e+00 - 7.09e-01 1.00e+0
0h 1
11 1.4980883e+04 8.06e-06 1.71e-01 -1.7 1.87e+01 - 6.94e-01 1.00e+0
0h 1
12 1.4821329e+04 4.57e-04 2.94e-02 -2.5 1.97e+01 - 9.72e-01 9.32e-0
1f 1
13 1.4805843e+04 1.89e-05 3.26e-03 -2.5 8.97e+00 - 1.00e+00 1.00e+0
0f 1
14 1.4783162e+04 8.64e-06 1.14e-01 -3.8 8.13e+00 - 1.00e+00 8.08e-0
1f 1
15 1.4778791e+04 6.17e-08 9.39e-05 -3.8 1.56e+00 - 1.00e+00 1.00e+0
0f 1
16 1.4777295e+04 2.07e-08 2.90e-04 -5.7 4.46e-01 - 1.00e+00 9.94e-0
1f 1
17 1.4777289e+04 1.81e-12 3.28e-09 -5.7 2.75e-03 - 1.00e+00 1.00e+0
0f 1
18 1.4777271e+04 2.63e-12 1.79e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.4777270656876347e+01 1.4777270656876346e+0
4
Dual infeasibility......: 1.7927288480311897e-09 1.7927288480311897e-0
6
Constraint violation....: 2.6299795674589177e-12 2.6299795674589177e-1
2
Complementarity.........: 3.3513046176035797e-09 3.3513046176035797e-0
6
Overall NLP error.......: 3.3513046176035797e-09 3.3513046176035797e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2301827e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.51e-03 9.80e-0
3h 1
2 9.2024087e+02 1.11e+04 5.23e+01 -1.0 1.08e+04 - 7.47e-05 1.02e-0
4h 1
3 9.0326738e+02 1.11e+04 5.23e+01 -1.0 1.11e+04 - 4.37e-06 1.03e-0
3f 1
4 5.3702294e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 1.15e-03 2.30e-0
2h 1
5 2.3289105e+04 6.96e-02 7.66e+01 -1.0 1.09e+04 - 7.98e-02 1.00e+0
0h 1
6 1.5362575e+04 6.29e-02 2.45e+01 -1.0 1.37e+01 - 6.46e-01 8.76e-0
2f 1
7 1.4033684e+04 2.07e-02 1.03e+01 -1.0 9.92e+00 - 6.53e-01 8.97e-0
1f 1
8 1.4145242e+04 1.08e-02 5.79e-01 -1.0 2.88e+00 - 9.94e-01 4.84e-0
1f 2
9 1.3817987e+04 8.41e-03 2.69e-01 -1.7 8.68e+00 - 1.00e+00 8.38e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3787132e+04 2.15e-03 8.88e-01 -1.7 1.24e+01 - 1.00e+00 5.00e-0
1h 2
11 1.3779949e+04 1.97e-04 1.51e-02 -1.7 6.18e+00 - 1.00e+00 1.00e+0
0h 1
12 1.3624290e+04 4.77e-04 2.41e-02 -3.8 1.99e+01 - 8.46e-01 8.31e-0
1f 1
13 1.3606068e+04 1.49e-04 2.06e-01 -3.8 3.35e+00 - 9.89e-01 7.20e-0
1h 1
14 1.3601454e+04 3.86e-07 3.06e-04 -3.8 9.35e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3600265e+04 1.95e-08 4.40e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
16 1.3600252e+04 7.95e-13 4.82e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.3600252142911209e+01 1.3600252142911209e+0
4
Dual infeasibility......: 4.8171339835227135e-10 4.8171339835227135e-0
7
Constraint violation....: 7.9504458572188241e-13 7.9504458572188241e-1
3
Complementarity.........: 2.6133282770717421e-09 2.6133282770717420e-0
6
Overall NLP error.......: 2.6133282770717421e-09 2.6133282770717420e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891076e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0602418e+02 9.19e+03 5.23e+01 -1.0 8.41e+03 - 3.92e-05 1.08e-0
4h 1
3 8.1828329e+02 9.14e+03 5.24e+01 -1.0 9.19e+03 - 1.24e-05 4.81e-0
3h 1
4 5.0911010e+02 8.95e+03 5.22e+01 -1.0 9.14e+03 - 5.53e-03 2.13e-0
2h 1
5 1.9574030e+04 7.15e-02 7.74e+01 -1.0 8.95e+03 - 8.67e-02 1.00e+0
0h 1
6 1.2972291e+04 6.39e-02 3.14e+01 -1.0 2.60e+01 - 5.69e-01 9.74e-0
2f 1
7 1.1456842e+04 1.98e-02 1.02e+01 -1.0 1.50e+01 - 6.92e-01 7.89e-0
1f 1
8 1.1617387e+04 7.35e-03 8.73e-01 -1.0 3.38e+00 - 9.91e-01 5.00e-0
1f 2
9 1.1301308e+04 1.11e-02 8.92e-01 -1.7 9.09e+00 - 2.86e-01 8.28e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1286835e+04 6.46e-04 7.48e-01 -1.7 9.43e+00 - 6.89e-01 1.00e+0
0f 1
11 1.1284537e+04 1.25e-04 5.90e-02 -1.7 1.30e+01 - 9.23e-01 1.00e+0
0h 1
12 1.1115823e+04 6.06e-04 2.55e-02 -2.5 2.34e+01 - 9.58e-01 9.67e-0
1f 1
13 1.1087407e+04 1.57e-04 7.50e-02 -3.8 7.43e+00 - 9.79e-01 8.39e-0
1h 1
14 1.1084767e+04 2.05e-07 1.19e-01 -3.8 1.21e+00 - 9.08e-01 1.00e+0
0h 1
15 1.1084687e+04 4.94e-09 3.25e-05 -3.8 1.62e-04 - 1.00e+00 1.00e+0
0h 1
16 1.1083373e+04 1.92e-08 3.88e-03 -5.7 2.97e-01 - 1.00e+00 9.68e-0
1f 1
17 1.1083337e+04 5.75e-12 2.62e-08 -5.7 9.60e-03 - 1.00e+00 1.00e+0
0f 1
18 1.1083321e+04 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1083320748851396e+01 1.1083320748851396e+0
4
Dual infeasibility......: 4.4780423391628867e-09 4.4780423391628867e-0
6
Constraint violation....: 2.6336433034401807e-12 2.6336433034401807e-1
2
Complementarity.........: 4.2408099936142239e-09 4.2408099936142237e-0
6
Overall NLP error.......: 4.4780423391628867e-09 4.4780423391628867e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2300862e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.80e-0
3h 1
2 9.2018520e+02 6.71e+03 5.23e+01 -1.0 6.43e+03 - 7.59e-05 1.03e-0
4h 1
3 8.8417723e+02 6.69e+03 5.23e+01 -1.0 6.70e+03 - 7.25e-06 1.73e-0
3f 1
4 4.3415243e+02 6.54e+03 5.24e+01 -1.0 6.69e+03 - 2.08e-03 2.26e-0
2h 1
5 1.8486104e+04 7.08e-02 7.69e+01 -1.0 6.54e+03 - 8.04e-02 1.00e+0
0h 1
6 1.0916142e+04 6.40e-02 2.32e+01 -1.0 1.36e+01 - 6.65e-01 8.89e-0
2f 1
7 9.6154376e+03 1.98e-02 9.31e+00 -1.0 9.91e+00 - 6.64e-01 8.81e-0
1f 1
8 9.7199904e+03 1.05e-02 6.35e-01 -1.0 2.75e+00 - 9.95e-01 4.77e-0
1f 2
9 9.3967776e+03 9.36e-03 2.78e-01 -1.7 9.45e+00 - 1.00e+00 8.30e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.3672965e+03 2.18e-03 9.40e-01 -1.7 1.18e+01 - 1.00e+00 4.90e-0
1h 2
11 9.3624199e+03 2.10e-04 1.67e-02 -1.7 6.01e+00 - 1.00e+00 1.00e+0
0h 1
12 9.2069203e+03 4.79e-04 2.44e-02 -3.8 2.00e+01 - 8.46e-01 8.30e-0
1f 1
13 9.1886242e+03 1.49e-04 2.05e-01 -3.8 3.34e+00 - 9.89e-01 7.21e-0
1h 1
14 9.1840024e+03 3.89e-07 3.07e-04 -3.8 9.33e-01 - 1.00e+00 1.00e+0
0h 1
15 9.1828139e+03 1.95e-08 4.40e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
16 9.1828008e+03 7.97e-13 4.82e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 9.1828007819166011e+00 9.1828007819166014e+0
3
Dual infeasibility......: 4.8230733893231197e-10 4.8230733893231197e-0
7
Constraint violation....: 7.9655726459293419e-13 7.9655726459293419e-1
3
Complementarity.........: 2.6134527997872491e-09 2.6134527997872490e-0
6
Overall NLP error.......: 2.6134527997872491e-09 2.6134527997872490e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0880494e+02 4.77e+03 5.23e+01 -1.0 4.81e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0291924e+02 4.77e+03 5.23e+01 -1.0 2.79e+03 - 2.15e-05 2.38e-0
4h 1
3 3.7467532e+02 4.66e+03 5.24e+01 -1.0 4.77e+03 - 1.51e-04 2.34e-0
2f 1
4 1.7300257e+04 6.53e-02 7.97e+01 -1.0 4.66e+03 - 4.04e-02 1.00e+0
0h 1
5 8.8617124e+03 6.16e-02 5.71e+01 -1.0 3.53e+01 - 2.79e-01 5.15e-0
2f 1
6 7.5509801e+03 1.93e-02 2.65e+01 -1.0 1.63e+01 - 5.49e-01 6.34e-0
1f 1
7 7.1819282e+03 5.83e-03 7.45e-01 -1.0 4.62e+00 - 9.62e-01 8.21e-0
1f 1
8 7.4584045e+03 1.60e-04 6.22e-02 -1.0 6.90e+00 - 1.00e+00 1.00e+0
0f 1
9 6.8766156e+03 2.24e-03 9.86e-02 -2.5 6.86e+00 - 8.54e-01 8.68e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.7217812e+03 2.17e-03 3.89e-01 -2.5 9.09e-01 - 1.00e+00 7.71e-0
1f 1
11 6.6995775e+03 1.09e-04 4.63e-03 -2.5 2.08e-01 - 1.00e+00 1.00e+0
0h 1
12 6.6742264e+03 2.92e-05 1.37e-01 -3.8 1.34e+01 - 1.00e+00 7.68e-0
1h 1
13 6.6677284e+03 1.16e-07 3.28e-04 -3.8 3.11e+00 - 1.00e+00 1.00e+0
0f 1
14 6.6659140e+03 2.88e-08 1.03e-03 -5.7 7.43e-01 - 1.00e+00 9.85e-0
1f 1
15 6.6658915e+03 1.98e-12 1.42e-08 -5.7 1.14e-02 - 1.00e+00 1.00e+0
0f 1
16 6.6658693e+03 2.63e-12 4.48e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.6658693442642392e+00 6.6658693442642389e+0
3
Dual infeasibility......: 4.4776956826867452e-09 4.4776956826867452e-0
6
Constraint violation....: 2.6309648903932725e-12 2.6309648903932725e-1
2
Complementarity.........: 3.6084966221637791e-09 3.6084966221637790e-0
6
Overall NLP error.......: 4.4776956826867452e-09 4.4776956826867452e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9469463e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3h 1
2 8.9070845e+02 3.24e+03 5.24e+01 -1.0 2.13e+03 - 3.61e-05 1.51e-0
4h 1
3 3.3042115e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 6.40e-05 2.31e-0
2f 1
4 1.5680539e+04 6.28e-02 8.02e+01 -1.0 3.17e+03 - 3.82e-02 1.00e+0
0h 1
5 7.1096018e+03 5.94e-02 5.80e+01 -1.0 5.03e+01 - 2.72e-01 4.93e-0
2f 1
6 5.7281758e+03 2.48e-02 2.85e+01 -1.0 2.32e+01 - 5.13e-01 5.39e-0
1f 1
7 5.1166765e+03 1.01e-02 1.45e+00 -1.0 8.86e+00 - 9.34e-01 7.73e-0
1f 1
8 5.4253179e+03 3.01e-04 8.55e-02 -1.0 3.30e+00 - 9.99e-01 1.00e+0
0f 1
9 4.7998185e+03 2.08e-03 7.85e-02 -2.5 4.78e+00 - 8.62e-01 8.55e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.6289356e+03 2.21e-03 3.37e-01 -2.5 1.04e+00 - 1.00e+00 7.83e-0
1f 1
11 4.6028014e+03 1.45e-04 4.55e-03 -2.5 1.98e-01 - 1.00e+00 1.00e+0
0h 1
12 4.5779290e+03 2.16e-05 4.19e-02 -3.8 8.05e+00 - 1.00e+00 8.86e-0
1h 1
13 4.5759312e+03 5.62e-08 5.97e-04 -3.8 9.12e-01 - 1.00e+00 1.00e+0
0f 1
14 4.5743283e+03 4.27e-08 6.46e-05 -5.7 4.46e-01 - 1.00e+00 9.98e-0
1f 1
15 4.5743286e+03 1.89e-12 1.38e-08 -5.7 1.06e-03 - 1.00e+00 1.00e+0
0f 1
16 4.5743102e+03 2.57e-12 3.30e-06 -8.6 5.53e-03 - 1.00e+00 9.99e-0
1f 1
17 4.5743102e+03 1.64e-15 4.86e-14 -8.6 3.09e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 4.5743102006722767e+00 4.5743102006722766e+0
3
Dual infeasibility......: 4.8639723030106455e-14 4.8639723030106455e-1
1
Constraint violation....: 1.6377102514289303e-15 1.6377102514289303e-1
5
Complementarity.........: 2.6137030653884056e-09 2.6137030653884058e-0
6
Overall NLP error.......: 2.6137030653884056e-09 2.6137030653884058e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1576532e+02 2.00e+03 5.23e+01 -1.0 2.01e+03 - 1.20e-03 9.82e-0
3h 1
2 9.1032142e+02 2.00e+03 5.23e+01 -1.0 1.04e+03 - 3.89e-05 2.06e-0
4h 1
3 3.1311212e+02 1.95e+03 5.24e+01 -1.0 2.00e+03 - 1.27e-04 2.35e-0
2f 1
4 1.4582884e+04 6.66e-02 7.62e+01 -1.0 1.95e+03 - 8.09e-02 1.00e+0
0h 1
5 6.1165383e+03 6.02e-02 3.22e+01 -1.0 2.09e+01 - 5.47e-01 8.74e-0
2f 1
6 4.5880149e+03 1.60e-02 1.42e+01 -1.0 1.27e+01 - 6.20e-01 8.67e-0
1f 1
7 4.8954300e+03 1.60e-03 1.24e-01 -1.0 3.70e+00 - 9.91e-01 1.00e+0
0f 1
8 4.4216488e+03 1.88e-03 1.47e-01 -1.7 9.33e+00 - 1.00e+00 1.00e+0
0f 1
9 4.2329481e+03 2.04e-03 3.71e-01 -2.5 1.56e+00 - 1.00e+00 7.85e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2060802e+03 1.91e-04 1.99e-02 -2.5 3.23e-01 - 1.00e+00 9.80e-0
1h 1
11 4.1818692e+03 1.86e-06 1.85e-02 -3.8 8.06e+00 - 9.84e-01 1.00e+0
0h 1
12 4.1819975e+03 1.74e-09 4.82e-06 -3.8 9.86e-03 - 1.00e+00 1.00e+0
0h 1
13 4.1805106e+03 1.80e-08 1.81e-04 -5.7 4.46e-01 - 1.00e+00 9.96e-0
1f 1
14 4.1805076e+03 1.80e-12 2.29e-09 -5.7 1.79e-03 - 1.00e+00 1.00e+0
0f 1
15 4.1804892e+03 2.63e-12 1.52e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 4.1804891618845579e+00 4.1804891618845577e+0
3
Dual infeasibility......: 1.5189630854590334e-09 1.5189630854590334e-0
6
Constraint violation....: 2.6288554666464847e-12 2.6288554666464847e-1
2
Complementarity.........: 3.1313933278843342e-09 3.1313933278843340e-0
6
Overall NLP error.......: 3.1313933278843342e-09 3.1313933278843340e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2278083e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 3.31e-04 9.87e-0
3h 1
2 8.0391474e+02 9.17e+02 5.24e+01 -1.0 7.85e+02 - 8.87e-05 6.88e-0
4h 1
3 2.4271271e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 6.68e-04 2.10e-0
2h 1
4 1.2385916e+04 5.52e-02 8.23e+01 -1.0 8.98e+02 - 3.86e-02 1.00e+0
0h 1
5 3.8851959e+03 5.26e-02 5.59e+01 -1.0 8.06e+01 - 3.19e-01 5.02e-0
2f 1
6 1.9099004e+03 3.73e-02 2.99e+01 -1.0 3.93e+01 - 4.69e-01 5.04e-0
1f 1
7 4.6737272e+03 1.22e-02 2.67e+01 -1.0 2.06e+01 - 4.01e-01 1.00e+0
0h 1
8 1.8754601e+03 1.19e-02 1.01e+00 -1.0 2.53e+01 - 9.88e-01 8.94e-0
1f 1
9 2.0005994e+03 1.84e-04 4.66e-02 -1.0 3.18e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7351413e+03 2.16e-04 1.24e+00 -2.5 1.71e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5469297e+03 3.76e-03 1.33e-01 -2.5 7.60e+00 - 7.95e-01 1.00e+0
0f 1
12 1.5237159e+03 5.30e-03 3.11e-01 -2.5 1.84e+00 - 1.00e+00 7.66e-0
1h 1
13 1.5360639e+03 2.44e-04 4.74e-03 -2.5 7.11e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5034784e+03 1.70e-04 2.15e-02 -3.8 1.62e+01 - 9.91e-01 9.29e-0
1h 1
15 1.5021214e+03 7.21e-07 6.83e-05 -3.8 1.10e+00 - 1.00e+00 1.00e+0
0h 1
16 1.5003172e+03 3.77e-07 1.78e-04 -5.7 8.92e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003154e+03 3.79e-11 2.92e-09 -5.7 4.18e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.11e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932798572901e+00 1.5002932798572901e+0
3
Dual infeasibility......: 2.1737235539873188e-09 2.1737235539873188e-0
6
Constraint violation....: 6.2995705873980512e-11 6.2995705873980512e-1
1
Complementarity.........: 2.8882174399873160e-09 2.8882174399873160e-0
6
Overall NLP error.......: 2.8882174399873160e-09 2.8882174399873160e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1584839e+02 1.09e+02 1.13e+02 -1.0 3.76e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1398692e+04 5.38e-02 8.36e+01 -1.0 4.53e+01 - 3.10e-02 1.00e+0
0h 1
3 2.7848913e+03 5.17e-02 6.48e+01 -1.0 8.43e+01 - 2.27e-01 4.32e-0
2f 1
4 9.8155782e+02 4.24e-02 3.38e+01 -1.0 3.41e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5909720e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.21e-01 1.00e+0
0h 1
6 9.4491031e+02 1.01e-02 8.73e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6264865e+02 4.59e-04 6.60e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536469e+02 1.94e-03 1.94e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379741e+02 3.25e-03 6.12e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140235e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388164e+02 1.57e-04 1.69e-02 -3.8 7.57e-01 - 9.93e-01 9.41e-0
1h 1
12 5.8370191e+02 7.28e-07 6.65e-05 -3.8 8.63e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278679e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.06e-09 -5.7 3.41e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148935341e-01 5.8277753148935335e+0
2
Dual infeasibility......: 2.0880537882896430e-09 2.0880537882896430e-0
6
Constraint violation....: 6.2994109928382613e-11 6.2994109928382613e-1
1
Complementarity.........: 2.8882094461370282e-09 2.8882094461370282e-0
6
Overall NLP error.......: 2.8882094461370282e-09 2.8882094461370282e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1584839e+02 1.09e+02 1.13e+02 -1.0 3.76e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1398692e+04 5.38e-02 8.36e+01 -1.0 4.53e+01 - 3.10e-02 1.00e+0
0h 1
3 2.7848913e+03 5.17e-02 6.48e+01 -1.0 8.43e+01 - 2.27e-01 4.32e-0
2f 1
4 9.8155782e+02 4.24e-02 3.38e+01 -1.0 3.41e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5909720e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.21e-01 1.00e+0
0h 1
6 9.4491031e+02 1.01e-02 8.73e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6264865e+02 4.59e-04 6.60e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536469e+02 1.94e-03 1.94e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379741e+02 3.25e-03 6.12e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140235e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388164e+02 1.57e-04 1.69e-02 -3.8 7.57e-01 - 9.93e-01 9.41e-0
1h 1
12 5.8370191e+02 7.28e-07 6.65e-05 -3.8 8.63e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278679e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.06e-09 -5.7 3.41e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148935341e-01 5.8277753148935335e+0
2
Dual infeasibility......: 2.0880537882896430e-09 2.0880537882896430e-0
6
Constraint violation....: 6.2994109928382613e-11 6.2994109928382613e-1
1
Complementarity.........: 2.8882094461370282e-09 2.8882094461370282e-0
6
Overall NLP error.......: 2.8882094461370282e-09 2.8882094461370282e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.77e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5003658e+02 7.50e+01 9.04e+01 -1.0 2.59e+01 - 3.83e-04 3.52e-0
2f 1
2 1.1818872e+04 5.63e-02 8.12e+01 -1.0 2.87e+01 - 4.64e-02 1.00e+0
0h 1
3 3.1585741e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.65e-0
2f 1
4 1.0154810e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8148913e+03 7.28e-03 1.55e+01 -1.0 1.93e+01 - 6.11e-01 1.00e+0
0h 1
6 1.1196665e+03 5.40e-03 4.04e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8244198e+02 9.99e-04 2.10e-01 -1.7 5.71e+00 - 1.00e+00 8.87e-0
1h 1
8 7.2817504e+02 8.46e-04 1.35e-02 -1.7 3.45e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0982255e+02 1.50e-03 1.13e-01 -3.8 4.49e+00 - 7.71e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8216110e+02 2.17e-03 7.23e-02 -3.8 2.11e+00 - 8.07e-01 7.40e-0
1h 1
11 5.8336685e+02 9.52e-05 4.78e-02 -3.8 3.17e-02 - 1.00e+00 9.56e-0
1h 1
12 5.8368716e+02 2.82e-07 1.33e-05 -3.8 3.28e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278928e+02 4.12e-07 5.39e-04 -5.7 3.47e-02 - 1.00e+00 9.91e-0
1h 1
14 5.8278859e+02 4.36e-11 3.52e-09 -5.7 2.10e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.65e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753111573039e-01 5.8277753111573043e+0
2
Dual infeasibility......: 2.6503203891817648e-09 2.6503203891817648e-0
6
Constraint violation....: 6.3002325578764840e-11 6.3002325578764840e-1
1
Complementarity.........: 2.8882681466212842e-09 2.8882681466212841e-0
6
Overall NLP error.......: 2.8882681466212842e-09 2.8882681466212841e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.27e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9796468e+02 4.09e+01 5.94e+01 -1.0 1.42e+01 - 6.99e-04 4.23e-0
2f 1
2 1.2226496e+04 6.07e-02 7.87e+01 -1.0 1.80e+01 - 7.07e-02 1.00e+0
0h 1
3 3.6201828e+03 5.54e-02 5.15e+01 -1.0 5.45e+01 - 3.33e-01 7.87e-0
2f 1
4 2.3523806e+03 2.93e-02 2.28e+01 -1.0 2.70e+01 - 5.45e-01 4.46e-0
1f 1
5 1.7571753e+03 8.49e-03 1.17e+00 -1.0 9.96e+00 - 9.27e-01 7.68e-0
1f 1
6 2.0298789e+03 3.42e-04 8.15e-02 -1.0 3.35e+00 - 1.00e+00 1.00e+0
0h 1
7 1.4033439e+03 2.08e-03 8.15e-02 -2.5 4.87e+00 - 8.66e-01 8.50e-0
1f 1
8 1.2236663e+03 2.16e-03 2.06e-01 -2.5 1.05e+00 - 1.00e+00 8.33e-0
1f 1
9 1.2066808e+03 8.65e-05 3.81e-03 -2.5 1.49e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1969329e+03 4.60e-05 1.08e+00 -3.8 9.70e-02 - 1.00e+00 4.99e-0
1h 1
11 1.1949888e+03 3.31e-07 1.13e-01 -3.8 3.83e-02 - 9.68e-01 1.00e+0
0f 1
12 1.1939522e+03 1.38e-08 1.76e-03 -3.8 3.31e-02 - 1.00e+00 1.00e+0
0H 1
13 1.1941490e+03 1.10e-05 2.71e-04 -3.8 3.66e-03 - 1.00e+00 1.00e+0
0f 1
14 1.1935288e+03 1.78e-06 6.37e-02 -5.7 1.23e-02 - 7.78e-01 9.68e-0
1h 1
15 1.1933608e+03 1.24e-05 2.14e-04 -5.7 5.02e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1933669e+03 2.91e-08 2.23e-06 -5.7 2.67e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1933536e+03 2.76e-08 9.71e-06 -8.6 2.46e-04 - 9.82e-01 9.89e-0
1h 1
18 1.1933535e+03 2.43e-13 3.27e-11 -8.6 1.97e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1933534998035142e+00 1.1933534998035143e+0
3
Dual infeasibility......: 3.2690563661288986e-11 3.2690563661288986e-0
8
Constraint violation....: 2.4313884239290928e-13 2.4313884239290928e-1
3
Complementarity.........: 2.5120655767786156e-09 2.5120655767786157e-0
6
Overall NLP error.......: 2.5120655767786156e-09 2.5120655767786157e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2252332e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 3.31e-04 9.88e-0
3h 1
2 8.0153381e+02 9.17e+02 5.24e+01 -1.0 7.99e+02 - 9.95e-05 7.66e-0
4h 1
3 5.3153721e+02 9.08e+02 5.25e+01 -1.0 9.17e+02 - 7.42e-04 1.01e-0
2h 1
4 2.7943647e+02 8.88e+02 5.21e+01 -1.0 9.08e+02 - 1.15e-02 2.18e-0
2f 1
5 8.4079586e+03 6.33e-02 8.19e+01 -1.0 8.88e+02 - 6.36e-02 1.00e+0
0h 1
6 3.4045691e+03 5.76e-02 2.46e+01 -1.0 5.34e+01 - 6.81e-01 8.27e-0
2f 1
7 1.8648424e+03 3.67e-02 6.81e+00 -1.0 3.49e+01 - 6.93e-01 4.95e-0
1f 1
8 2.2942264e+03 6.22e-03 1.33e+00 -1.0 1.29e+00 - 8.93e-01 1.00e+0
0f 1
9 2.0525849e+03 6.10e-04 7.87e-01 -1.0 7.68e+00 - 4.65e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7153745e+03 3.79e-04 1.05e-01 -1.7 5.63e+00 - 7.91e-01 8.21e-0
1f 1
11 1.5831912e+03 1.07e-03 3.96e-01 -2.5 5.32e+00 - 7.78e-01 1.00e+0
0f 1
12 1.5192152e+03 8.86e-03 5.35e-02 -2.5 3.79e+00 - 1.00e+00 9.58e-0
1h 1
13 1.5364921e+03 2.86e-04 5.26e-03 -2.5 3.85e+00 - 1.00e+00 1.00e+0
0f 1
14 1.5030593e+03 1.59e-04 1.93e-02 -3.8 1.67e+01 - 1.00e+00 9.38e-0
1h 1
15 1.5021213e+03 6.14e-07 6.31e-05 -3.8 7.52e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003164e+03 3.82e-07 1.81e-04 -5.7 8.92e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003154e+03 3.81e-11 2.91e-09 -5.7 1.84e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.11e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932797246695e+00 1.5002932797246694e+0
3
Dual infeasibility......: 2.1737182170199124e-09 2.1737182170199124e-0
6
Constraint violation....: 6.2995567096102434e-11 6.2995567096102434e-1
1
Complementarity.........: 2.8882172412067178e-09 2.8882172412067179e-0
6
Overall NLP error.......: 2.8882172412067178e-09 2.8882172412067179e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
1 8.6513624e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 4.97e-04 9.88e-0
3h 1
2 8.4156626e+02 9.17e+02 5.24e+01 -1.0 8.13e+02 - 9.77e-05 8.72e-0
4h 1
3 4.8682587e+02 9.04e+02 5.24e+01 -1.0 9.17e+02 - 8.47e-04 1.35e-0
2h 1
4 3.2667874e+02 8.82e+02 5.19e+01 -1.0 9.04e+02 - 1.52e-02 2.52e-0
2f 1
5 8.0911109e+03 7.01e-02 7.77e+01 -1.0 8.82e+02 - 1.07e-01 1.00e+0
0h 1
53 1.729972e+04 1.632511e+04 4.603081e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2433284e+02 1.57e+04 5.24e+01 -1.0 1.59e+04 - 3.31e-04 9.80e-0
3h 1
2 8.2134543e+02 1.57e+04 5.24e+01 -1.0 1.37e+04 - 2.40e-05 1.14e-0
4h 1
3 8.1983821e+02 1.57e+04 5.24e+01 -1.0 1.56e+04 - 1.84e-05 1.20e-0
4h 1
4 8.1913229e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 1.39e-04 5.73e-0
5h 1
5 5.6030009e+02 1.54e+04 5.26e+01 -1.0 1.57e+04 - 2.02e-04 2.13e-0
2f 1
6 2.7399671e+04 5.49e-02 8.23e+01 -1.0 1.54e+04 - 3.81e-02 1.00e+0
0h 1
7 1.8726019e+04 5.24e-02 5.73e+01 -1.0 8.21e+01 - 3.02e-01 4.95e-0
2f 1
8 1.6736985e+04 3.74e-02 3.08e+01 -1.0 3.92e+01 - 4.67e-01 5.07e-0
1f 1
9 1.7085267e+04 2.25e-02 1.45e+01 -1.0 2.08e+01 - 3.98e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6823196e+04 6.03e-03 4.17e-01 -1.0 5.03e+00 - 9.78e-01 1.00e+0
0h 1
11 1.6517153e+04 1.44e-03 4.10e-01 -1.7 5.56e+00 - 1.00e+00 8.24e-0
1f 1
12 1.6486606e+04 9.32e-04 1.43e-02 -1.7 2.88e+01 - 1.00e+00 1.00e+0
0f 1
13 1.6367047e+04 1.15e-03 2.11e-02 -3.8 3.88e+01 - 7.89e-01 7.64e-0
1f 1
14 1.6326871e+04 1.94e-03 3.68e-02 -3.8 2.41e+00 - 8.35e-01 7.95e-0
1h 1
15 1.6325923e+04 8.33e-05 4.11e-02 -3.8 3.80e-02 - 1.00e+00 9.56e-0
1h 1
16 1.6326164e+04 2.31e-07 1.26e-05 -3.8 3.35e-01 - 1.00e+00 1.00e+0
0f 1
17 1.6325118e+04 4.09e-07 2.37e-04 -5.7 1.49e-01 - 1.00e+00 9.95e-0
1h 1
18 1.6325118e+04 4.21e-11 3.33e-09 -5.7 2.44e-03 - 1.00e+00 1.00e+0
0f 1
19 1.6325105e+04 6.30e-11 2.17e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.6325105274628214e+01 1.6325105274628213e+0
4
Dual infeasibility......: 2.1737048197750714e-09 2.1737048197750714e-0
6
Constraint violation....: 6.2994581773168079e-11 6.2994581773168079e-1
1
Complementarity.........: 2.8882097830223440e-09 2.8882097830223440e-0
6
Overall NLP error.......: 2.8882097830223440e-09 2.8882097830223440e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9092302e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 6.99e-04 9.80e-0
3h 1
2 8.8794120e+02 1.50e+04 5.24e+01 -1.0 1.25e+04 - 2.00e-05 1.19e-0
4h 1
3 8.8669647e+02 1.50e+04 5.24e+01 -1.0 1.48e+04 - 2.33e-05 9.80e-0
5h 1
4 8.8599032e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 1.20e-04 5.65e-0
5h 1
5 6.0034444e+02 1.46e+04 5.25e+01 -1.0 1.50e+04 - 1.78e-04 2.30e-0
2f 1
6 2.7260218e+04 6.26e-02 7.83e+01 -1.0 1.46e+04 - 6.31e-02 1.00e+0
0h 1
7 1.8650562e+04 5.76e-02 5.10e+01 -1.0 5.54e+01 - 3.33e-01 7.12e-0
2f 1
8 1.7358730e+04 2.89e-02 2.35e+01 -1.0 2.58e+01 - 5.28e-01 4.58e-0
1f 1
9 1.6724081e+04 9.62e-03 1.19e+00 -1.0 9.98e+00 - 9.27e-01 7.69e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7011935e+04 3.38e-04 8.47e-02 -1.0 3.41e+00 - 9.74e-01 1.00e+0
0f 1
11 1.6382102e+04 2.07e-03 8.16e-02 -2.5 4.97e+00 - 8.66e-01 8.48e-0
1f 1
12 1.6202949e+04 2.16e-03 2.06e-01 -2.5 1.04e+00 - 1.00e+00 8.32e-0
1f 1
13 1.6185843e+04 9.02e-05 3.85e-03 -2.5 1.48e-01 - 1.00e+00 1.00e+0
0h 1
14 1.6174737e+04 4.81e-05 1.11e+00 -3.8 3.11e+00 - 1.00e+00 4.96e-0
1h 1
15 1.6171394e+04 3.48e-07 1.11e-01 -3.8 1.37e+00 - 9.68e-01 1.00e+0
0f 1
16 1.6170365e+04 1.45e-08 1.74e-03 -3.8 3.29e-02 - 1.00e+00 1.00e+0
0H 1
17 1.6170562e+04 1.11e-05 2.69e-04 -3.8 3.68e-03 - 1.00e+00 1.00e+0
0f 1
18 1.6169794e+04 1.86e-06 6.34e-02 -5.7 1.50e-01 - 7.76e-01 9.69e-0
1h 1
19 1.6169622e+04 1.26e-05 2.15e-04 -5.7 5.07e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6169628e+04 2.76e-08 2.18e-06 -5.7 2.59e-04 - 1.00e+00 1.00e+0
0h 1
21 1.6169613e+04 2.74e-08 8.28e-06 -8.6 1.84e-03 - 9.82e-01 9.88e-0
1h 1
22 1.6169613e+04 2.71e-13 3.29e-11 -8.6 2.13e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.6169612507255536e+01 1.6169612507255535e+0
4
Dual infeasibility......: 3.2895630317516931e-11 3.2895630317516931e-0
8
Constraint violation....: 2.7067237340361316e-13 2.7067237340361316e-1
3
Complementarity.........: 2.5120870559815457e-09 2.5120870559815458e-0
6
Overall NLP error.......: 2.5120870559815457e-09 2.5120870559815458e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0892329e+02 1.39e+04 5.23e+01 -1.0 1.40e+04 - 1.00e-03 9.80e-0
3h 1
2 9.0612191e+02 1.39e+04 5.23e+01 -1.0 1.31e+04 - 3.81e-05 1.05e-0
4h 1
3 8.9509751e+02 1.39e+04 5.23e+01 -1.0 1.39e+04 - 8.20e-06 8.14e-0
4f 1
4 8.7667684e+02 1.39e+04 5.23e+01 -1.0 1.39e+04 - 8.24e-04 1.40e-0
3h 1
5 6.0983684e+02 1.36e+04 5.23e+01 -1.0 1.39e+04 - 3.00e-03 2.26e-0
2f 1
6 2.4892634e+04 6.97e-02 7.72e+01 -1.0 1.36e+04 - 8.49e-02 1.00e+0
0h 1
7 1.7738256e+04 6.25e-02 3.39e+01 -1.0 2.70e+01 - 5.35e-01 9.41e-0
2f 1
8 1.6224794e+04 1.99e-02 1.23e+01 -1.0 1.51e+01 - 6.57e-01 7.72e-0
1f 1
9 1.6348645e+04 6.43e-03 1.00e+00 -1.0 2.79e+00 - 9.83e-01 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6568286e+04 2.07e-04 5.52e-02 -1.0 2.32e+01 - 1.00e+00 1.00e+0
0f 1
11 1.6005686e+04 2.29e-03 8.74e-02 -2.5 2.34e+01 - 8.55e-01 8.31e-0
1f 1
12 1.5841423e+04 2.12e-03 4.44e-01 -2.5 9.44e-01 - 1.00e+00 7.52e-0
1f 1
13 1.5814511e+04 1.50e-04 4.78e-03 -2.5 2.02e-01 - 1.00e+00 1.00e+0
0h 1
14 1.5797507e+04 4.00e-05 1.56e-01 -3.8 3.27e+00 - 1.00e+00 7.54e-0
1h 1
15 1.5793371e+04 1.39e-07 3.53e-04 -3.8 5.34e-01 - 1.00e+00 1.00e+0
0f 1
16 1.5792148e+04 2.81e-08 9.34e-04 -5.7 1.45e-01 - 1.00e+00 9.86e-0
1h 1
17 1.5792137e+04 1.87e-12 1.34e-08 -5.7 1.21e-03 - 1.00e+00 1.00e+0
0f 1
18 1.5792122e+04 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5792122205490539e+01 1.5792122205490539e+0
4
Dual infeasibility......: 4.4776944186264438e-09 4.4776944186264438e-0
6
Constraint violation....: 2.6306248845919811e-12 2.6306248845919811e-1
2
Complementarity.........: 3.6084996569268104e-09 3.6084996569268102e-0
6
Overall NLP error.......: 4.4776944186264438e-09 4.4776944186264438e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4549022e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.98e-04 9.80e-0
3f 1
2 8.4268289e+02 1.27e+04 5.24e+01 -1.0 1.24e+04 - 9.30e-05 1.01e-0
4h 1
3 8.3185819e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 3.40e-06 7.06e-0
4f 1
4 5.1298182e+02 1.24e+04 5.26e+01 -1.0 1.26e+04 - 7.64e-04 2.15e-0
2h 1
5 2.4253114e+04 5.75e-02 8.12e+01 -1.0 1.24e+04 - 4.59e-02 1.00e+0
0h 1
6 1.5783829e+04 5.39e-02 5.24e+01 -1.0 7.95e+01 - 3.46e-01 5.65e-0
2f 1
7 1.3665691e+04 3.43e-02 2.85e+01 -1.0 4.22e+01 - 4.66e-01 5.35e-0
1f 1
8 1.4122490e+04 1.83e-02 6.66e+00 -1.0 2.17e+01 - 6.31e-01 2.50e-0
1f 3
9 1.3813325e+04 5.37e-03 5.08e-01 -1.0 6.56e+00 - 9.50e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3462116e+04 1.47e-03 5.06e-01 -1.7 6.30e+00 - 1.00e+00 7.87e-0
1f 1
11 1.3408535e+04 6.08e-04 2.59e-02 -1.7 1.83e+01 - 1.00e+00 1.00e+0
0f 1
12 1.3266988e+04 1.38e-03 1.17e-01 -3.8 1.99e+01 - 7.65e-01 9.24e-0
1f 1
13 1.3231850e+04 2.70e-03 2.12e-02 -3.8 2.32e+00 - 8.15e-01 8.20e-0
1h 1
14 1.3233706e+04 3.11e-04 1.34e-01 -3.8 2.70e-01 - 1.00e+00 9.08e-0
1h 1
15 1.3234117e+04 5.09e-07 2.22e-05 -3.8 1.24e-01 - 1.00e+00 1.00e+0
0f 1
16 1.3233074e+04 4.18e-07 2.33e-03 -5.7 1.49e-01 - 1.00e+00 9.77e-0
1h 1
17 1.3233064e+04 4.90e-11 2.26e-08 -5.7 2.76e-02 - 1.00e+00 1.00e+0
0f 1
18 1.3233051e+04 6.30e-11 4.40e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.3233050923686045e+01 1.3233050923686045e+0
4
Dual infeasibility......: 4.4004630895152873e-09 4.4004630895152873e-0
6
Constraint violation....: 6.2987143278903091e-11 6.2987143278903091e-1
1
Complementarity.........: 3.8025353371385369e-09 3.8025353371385367e-0
6
Overall NLP error.......: 4.4004630895152873e-09 4.4004630895152873e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2243452e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.48e-03 9.80e-0
3h 1
2 9.1965916e+02 1.11e+04 5.23e+01 -1.0 1.08e+04 - 7.51e-05 1.02e-0
4h 1
3 9.0282880e+02 1.11e+04 5.23e+01 -1.0 1.11e+04 - 4.35e-06 1.02e-0
3f 1
4 5.3673037e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 1.14e-03 2.30e-0
2h 1
5 2.3289893e+04 6.95e-02 7.66e+01 -1.0 1.09e+04 - 8.00e-02 1.00e+0
0h 1
6 1.5350213e+04 6.28e-02 2.44e+01 -1.0 1.42e+01 - 6.48e-01 8.77e-0
2f 1
7 1.4017847e+04 1.97e-02 1.02e+01 -1.0 1.02e+01 - 6.51e-01 8.87e-0
1f 1
8 1.4124771e+04 1.03e-02 6.21e-01 -1.0 2.89e+00 - 9.94e-01 4.84e-0
1f 2
9 1.3793362e+04 8.67e-03 2.69e-01 -1.7 8.66e+00 - 1.00e+00 8.37e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3762396e+04 2.14e-03 9.03e-01 -1.7 1.24e+01 - 1.00e+00 4.98e-0
1h 2
11 1.3755820e+04 2.01e-04 1.55e-02 -1.7 6.21e+00 - 1.00e+00 1.00e+0
0h 1
12 1.3600001e+04 4.82e-04 2.42e-02 -3.8 1.99e+01 - 8.46e-01 8.30e-0
1f 1
13 1.3581632e+04 1.52e-04 2.07e-01 -3.8 3.35e+00 - 9.89e-01 7.17e-0
1h 1
14 1.3576970e+04 4.00e-07 3.32e-04 -3.8 9.47e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3575781e+04 1.98e-08 4.49e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
16 1.3575768e+04 7.68e-13 4.91e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.3575768021927741e+01 1.3575768021927741e+0
4
Dual infeasibility......: 4.9120916519770062e-10 4.9120916519770062e-0
7
Constraint violation....: 7.6824657746499270e-13 7.6824657746499270e-1
3
Complementarity.........: 2.6158860820644328e-09 2.6158860820644329e-0
6
Overall NLP error.......: 2.6158860820644328e-09 2.6158860820644329e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8776327e+02 9.19e+03 5.24e+01 -1.0 9.28e+03 - 6.64e-04 9.80e-0
3h 1
2 8.8487848e+02 9.19e+03 5.24e+01 -1.0 8.49e+03 - 4.35e-05 1.07e-0
4h 1
3 8.1017697e+02 9.15e+03 5.24e+01 -1.0 9.19e+03 - 1.14e-05 4.07e-0
3h 1
4 4.8829988e+02 8.96e+03 5.23e+01 -1.0 9.15e+03 - 4.62e-03 2.12e-0
2h 1
5 1.9624071e+04 6.67e-02 7.88e+01 -1.0 8.96e+03 - 7.36e-02 1.00e+0
0h 1
6 1.2613352e+04 6.06e-02 4.34e+01 -1.0 5.13e+01 - 4.30e-01 8.42e-0
2f 1
7 1.1287964e+04 2.91e-02 1.67e+01 -1.0 2.55e+01 - 6.00e-01 4.84e-0
1f 1
8 1.0844638e+04 5.12e-03 9.75e-01 -1.0 9.16e+00 - 9.34e-01 7.59e-0
1f 1
9 1.1096445e+04 1.87e-04 6.07e-02 -1.0 4.66e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.0465431e+04 2.23e-03 8.01e-02 -2.5 4.76e+00 - 8.70e-01 8.69e-0
1f 1
11 1.0359674e+04 1.08e-03 4.55e-01 -2.5 7.61e-01 - 1.00e+00 6.04e-0
1f 1
12 1.0359707e+04 2.49e-06 8.14e-03 -2.5 1.53e-01 - 1.00e+00 1.00e+0
0h 1
13 1.0339422e+04 6.17e-06 2.39e-02 -3.8 5.36e+00 - 9.14e-01 8.89e-0
1f 1
14 1.0335906e+04 4.60e-04 4.72e-04 -3.8 5.91e-01 - 1.00e+00 1.00e+0
0f 1
15 1.0334764e+04 6.26e-05 1.12e-02 -5.7 2.97e-01 - 8.14e-01 1.00e+0
0h 1
16 1.0334651e+04 3.51e-05 3.92e-05 -5.7 9.55e-03 - 1.00e+00 1.00e+0
0h 1
17 1.0334652e+04 1.18e-06 1.11e-05 -5.7 1.44e-03 - 1.00e+00 9.97e-0
1h 1
18 1.0334638e+04 2.43e-09 9.98e-08 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
19 1.0334638e+04 7.11e-15 3.66e-14 -8.6 4.46e-08 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.0334637961633659e+01 1.0334637961633658e+0
4
Dual infeasibility......: 3.6598646669738637e-14 3.6598646669738637e-1
1
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5062458183926943e-09 2.5062458183926944e-0
6
Overall NLP error.......: 2.5062458183926943e-09 2.5062458183926944e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891119e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0611351e+02 6.71e+03 5.23e+01 -1.0 6.46e+03 - 8.39e-05 1.03e-0
4h 1
3 8.7440044e+02 6.70e+03 5.23e+01 -1.0 6.70e+03 - 6.84e-06 1.53e-0
3f 1
4 4.2534165e+02 6.54e+03 5.24e+01 -1.0 6.70e+03 - 1.83e-03 2.26e-0
2h 1
5 1.8469067e+04 6.74e-02 7.67e+01 -1.0 6.54e+03 - 8.35e-02 1.00e+0
0h 1
6 1.0609292e+04 6.07e-02 3.68e+01 -1.0 2.85e+01 - 4.94e-01 9.10e-0
2f 1
7 9.1070968e+03 1.97e-02 1.46e+01 -1.0 1.53e+01 - 6.26e-01 7.49e-0
1f 1
8 9.1804482e+03 5.62e-03 1.19e+00 -1.0 2.08e+00 - 9.93e-01 5.00e-0
1f 2
9 9.3751841e+03 2.91e-04 6.67e-02 -1.0 2.88e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.8198147e+03 2.22e-03 9.09e-02 -2.5 2.66e+01 - 8.56e-01 8.23e-0
1f 1
11 8.6513288e+03 2.12e-03 4.55e-01 -2.5 4.37e+00 - 1.00e+00 7.50e-0
1f 1
12 8.6223061e+03 1.56e-04 4.78e-03 -2.5 1.09e+00 - 1.00e+00 1.00e+0
0h 1
13 8.6058823e+03 4.18e-05 1.61e-01 -3.8 2.68e+00 - 1.00e+00 7.51e-0
1h 1
14 8.6015687e+03 1.44e-07 3.57e-04 -3.8 6.67e-01 - 1.00e+00 1.00e+0
0f 1
15 8.6003430e+03 2.79e-08 9.26e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 8.6003307e+03 1.87e-12 1.33e-08 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
17 8.6003159e+03 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 8.6003159274015264e+00 8.6003159274015270e+0
3
Dual infeasibility......: 4.4776953979108802e-09 4.4776953979108802e-0
6
Constraint violation....: 2.6304375344565756e-12 2.6304375344565756e-1
2
Complementarity.........: 3.6085002362179792e-09 3.6085002362179791e-0
6
Overall NLP error.......: 4.4776953979108802e-09 4.4776953979108802e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0878107e+02 4.77e+03 5.23e+01 -1.0 4.81e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0050988e+02 4.77e+03 5.23e+01 -1.0 3.40e+03 - 2.05e-05 3.44e-0
4h 1
3 3.7491075e+02 4.66e+03 5.24e+01 -1.0 4.77e+03 - 2.58e-04 2.33e-0
2h 1
4 1.7252051e+04 6.54e-02 7.90e+01 -1.0 4.66e+03 - 4.98e-02 1.00e+0
0h 1
5 8.8322135e+03 6.11e-02 5.04e+01 -1.0 3.31e+01 - 3.51e-01 5.98e-0
2f 1
6 7.4758130e+03 1.75e-02 2.30e+01 -1.0 1.63e+01 - 5.60e-01 6.61e-0
1f 1
7 7.1800311e+03 8.01e-03 6.36e-01 -1.0 3.39e+00 - 9.70e-01 9.41e-0
1f 1
8 6.8743520e+03 3.08e-03 1.66e-01 -1.7 2.08e+00 - 1.00e+00 8.98e-0
1f 1
9 6.7369110e+03 1.66e-03 5.82e-01 -2.5 1.47e+01 - 9.78e-01 7.19e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.7002281e+03 3.67e-04 5.06e-03 -2.5 4.09e+00 - 1.00e+00 1.00e+0
0h 1
11 6.6776437e+03 1.19e-04 3.08e-01 -3.8 1.61e+01 - 1.00e+00 6.77e-0
1h 1
12 6.6678485e+03 2.93e-07 5.12e-04 -3.8 5.20e+00 - 1.00e+00 1.00e+0
0f 1
13 6.6659143e+03 2.31e-08 8.56e-04 -5.7 8.92e-01 - 1.00e+00 9.87e-0
1h 1
14 6.6658933e+03 1.85e-12 1.17e-08 -5.7 1.18e-02 - 1.00e+00 1.00e+0
0f 1
15 6.6658693e+03 2.63e-12 4.48e-09 -8.6 1.11e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 6.6658693461090905e+00 6.6658693461090907e+0
3
Dual infeasibility......: 4.4777164710792506e-09 4.4777164710792506e-0
6
Constraint violation....: 2.6299448729893982e-12 2.6299448729893982e-1
2
Complementarity.........: 3.6085123188451384e-09 3.6085123188451384e-0
6
Overall NLP error.......: 4.4777164710792506e-09 4.4777164710792506e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6653022e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 4.97e-04 9.81e-0
3f 1
2 8.6323248e+02 3.24e+03 5.24e+01 -1.0 2.66e+03 - 5.18e-05 1.21e-0
4h 1
3 5.3831719e+02 3.20e+03 5.25e+01 -1.0 3.24e+03 - 3.12e-05 1.32e-0
2f 1
4 3.9903897e+02 3.13e+03 5.15e+01 -1.0 3.20e+03 - 2.00e-02 2.32e-0
2f 1
5 9.8503143e+03 7.36e-02 7.80e+01 -1.0 3.13e+03 - 1.07e-01 1.00e+0
0h 1
6 5.7440217e+03 6.32e-02 2.21e+01 -1.0 4.61e+01 - 6.97e-01 1.31e-0
1f 1
7 4.3233476e+03 3.42e-02 1.97e+00 -1.0 2.67e+01 - 8.81e-01 6.15e-0
1f 1
8 4.6962635e+03 3.54e-03 1.10e-01 -1.0 4.17e+00 - 9.80e-01 1.00e+0
0f 1
9 4.1807879e+03 1.04e-03 3.61e-01 -2.5 6.88e+00 - 9.03e-01 7.57e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.1159766e+03 2.37e-04 6.62e-02 -2.5 2.31e+00 - 9.63e-01 1.00e+0
0h 1
11 4.1038273e+03 6.77e-03 1.42e-02 -2.5 3.79e-01 - 1.00e+00 1.00e+0
0h 1
12 4.0870366e+03 4.33e-04 2.68e-02 -3.8 5.36e+00 - 8.42e-01 1.00e+0
0h 1
13 4.0845634e+03 1.66e-03 9.04e-04 -3.8 4.29e-02 - 1.00e+00 1.00e+0
0h 1
14 4.0848101e+03 4.13e-05 1.24e-04 -3.8 1.29e-02 - 1.00e+00 1.00e+0
0h 1
15 4.0833533e+03 1.02e-04 3.50e-04 -5.7 2.97e-01 - 9.51e-01 9.76e-0
1h 1
16 4.0833389e+03 2.27e-05 3.81e-03 -5.7 7.11e-03 - 1.00e+00 7.79e-0
1h 1
17 4.0833412e+03 8.81e-09 1.21e-06 -5.7 1.57e-03 - 1.00e+00 1.00e+0
0f 1
18 4.0833246e+03 9.03e-09 1.93e-05 -8.6 3.68e-03 - 1.00e+00 9.83e-0
1h 1
19 4.0833244e+03 1.37e-12 6.51e-11 -8.6 6.12e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 4.0833243911288406e+00 4.0833243911288405e+0
3
Dual infeasibility......: 6.5090223601218868e-11 6.5090223601218875e-0
8
Constraint violation....: 1.3723466807391560e-12 1.3723466807391560e-1
2
Complementarity.........: 2.5185241902731457e-09 2.5185241902731457e-0
6
Overall NLP error.......: 2.5185241902731457e-09 2.5185241902731457e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4518010e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 3.98e-04 9.82e-0
3f 1
2 8.4053439e+02 2.00e+03 5.24e+01 -1.0 1.16e+03 - 4.81e-05 1.71e-0
4h 1
3 2.7515086e+02 1.95e+03 5.26e+01 -1.0 2.00e+03 - 9.15e-05 2.18e-0
2f 1
4 1.3963174e+04 5.67e-02 8.10e+01 -1.0 1.95e+03 - 4.46e-02 1.00e+0
0h 1
5 5.1649115e+03 5.33e-02 5.37e+01 -1.0 8.21e+01 - 3.29e-01 5.49e-0
2f 1
6 3.0153640e+03 3.34e-02 2.96e+01 -1.0 4.25e+01 - 4.59e-01 5.39e-0
1f 1
7 5.0682681e+03 9.22e-03 1.68e+01 -1.0 2.43e+01 - 5.84e-01 1.00e+0
0h 1
8 3.0866652e+03 7.53e-03 4.18e-01 -1.0 2.11e+01 - 9.67e-01 1.00e+0
0f 1
9 2.7842089e+03 9.65e-04 1.52e-01 -1.7 5.21e+00 - 1.00e+00 9.18e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.6509577e+03 1.61e-03 2.68e-01 -2.5 6.06e+00 - 7.51e-01 1.00e+0
0f 1
11 2.5991909e+03 4.55e-03 3.98e-02 -2.5 2.90e+00 - 1.00e+00 1.00e+0
0h 1
12 2.6091275e+03 2.07e-04 6.15e-03 -2.5 4.69e-01 - 1.00e+00 1.00e+0
0h 1
13 2.5823276e+03 2.56e-04 4.27e-02 -3.8 8.05e+00 - 9.87e-01 8.86e-0
1h 1
14 2.5808180e+03 1.93e-06 1.65e-04 -3.8 9.08e-01 - 1.00e+00 1.00e+0
0h 1
15 2.5794755e+03 3.20e-07 2.10e-03 -5.7 4.46e-01 - 1.00e+00 9.78e-0
1h 1
16 2.5794604e+03 3.72e-11 2.11e-08 -5.7 9.89e-03 - 1.00e+00 1.00e+0
0f 1
17 2.5794438e+03 6.30e-11 4.40e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 2.5794437870140565e+00 2.5794437870140564e+0
3
Dual infeasibility......: 4.3996167616170825e-09 4.3996167616170825e-0
6
Constraint violation....: 6.3009819584181059e-11 6.3009819584181059e-1
1
Complementarity.........: 3.2947039404681131e-09 3.2947039404681131e-0
6
Overall NLP error.......: 4.3996167616170825e-09 4.3996167616170825e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0705276e+02 9.17e+02 5.23e+01 -1.0 9.20e+02 - 9.83e-04 9.88e-0
3h 1
2 8.6770448e+02 9.16e+02 5.23e+01 -1.0 8.56e+02 - 9.29e-05 1.48e-0
3h 1
3 2.8553646e+02 8.95e+02 5.24e+01 -1.0 9.16e+02 - 1.45e-03 2.26e-0
2h 1
4 1.2833169e+04 6.68e-02 8.15e+01 -1.0 8.96e+02 - 2.55e-02 1.00e+0
0h 1
5 4.9924620e+03 6.40e-02 6.45e+01 -1.0 3.93e+01 - 2.11e-01 3.91e-0
2f 1
6 3.7406456e+03 2.11e-02 2.99e+01 -1.0 1.64e+01 - 5.44e-01 6.15e-0
1f 1
7 3.3002077e+03 6.64e-03 1.01e+00 -1.0 5.62e+00 - 9.55e-01 7.71e-0
1f 1
8 3.5647981e+03 2.21e-04 7.18e-02 -1.0 4.77e+00 - 9.90e-01 1.00e+0
0f 1
9 3.0072552e+03 2.07e-03 1.00e-01 -2.5 8.13e+00 - 8.09e-01 8.40e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8509251e+03 1.88e-03 1.26e-01 -2.5 4.81e+00 - 8.48e-01 7.74e-0
1f 1
11 2.8204985e+03 2.28e-04 6.09e-03 -2.5 1.66e+00 - 1.00e+00 1.00e+0
0h 1
12 2.7936365e+03 5.75e-05 1.56e-01 -3.8 1.66e+01 - 1.00e+00 7.54e-0
1h 1
13 2.7862752e+03 1.63e-07 4.49e-04 -3.8 3.82e+00 - 1.00e+00 1.00e+0
0f 1
14 2.7843115e+03 2.88e-08 6.11e-04 -5.7 8.88e-01 - 1.00e+00 9.89e-0
1f 1
15 2.7842954e+03 1.87e-12 1.25e-08 -5.7 8.84e-03 - 1.00e+00 1.00e+0
0f 1
16 2.7842714e+03 2.63e-12 5.21e-09 -8.6 1.11e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 2.7842713946661855e+00 2.7842713946661852e+0
3
Dual infeasibility......: 5.2107665251119919e-09 5.2107665251119919e-0
6
Constraint violation....: 2.6297436450661849e-12 2.6297436450661849e-1
2
Complementarity.........: 3.7934994179477348e-09 3.7934994179477347e-0
6
Overall NLP error.......: 5.2107665251119919e-09 5.2107665251119919e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933498e-01 5.8277753147933493e+0
2
Dual infeasibility......: 2.1031318722715391e-09 2.1031318722715391e-0
6
Constraint violation....: 6.2994248706260692e-11 6.2994248706260692e-1
1
Complementarity.........: 2.8882108896910881e-09 2.8882108896910880e-0
6
Overall NLP error.......: 2.8882108896910881e-09 2.8882108896910880e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933498e-01 5.8277753147933493e+0
2
Dual infeasibility......: 2.1031318722715391e-09 2.1031318722715391e-0
6
Constraint violation....: 6.2994248706260692e-11 6.2994248706260692e-1
1
Complementarity.........: 2.8882108896910881e-09 2.8882108896910880e-0
6
Overall NLP error.......: 2.8882108896910881e-09 2.8882108896910880e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254149783e-01 6.4890146254149784e+0
2
Dual infeasibility......: 4.9126604805712596e-09 4.9126604805712596e-0
6
Constraint violation....: 6.2123814981163150e-09 6.2123814981163150e-0
9
Complementarity.........: 4.3646095252439403e-09 4.3646095252439398e-0
6
Overall NLP error.......: 6.2123814981163150e-09 4.9126604805712596e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.05e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.11e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281623786e+00 1.6104063281623785e+0
3
Dual infeasibility......: 2.4575962345837612e-12 2.4575962345837612e-0
9
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5062163910051646e-09 2.5062163910051645e-0
6
Overall NLP error.......: 2.5062163910051646e-09 2.5062163910051645e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2208518e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 3.29e-04 9.87e-0
3h 1
2 8.0324048e+02 9.17e+02 5.24e+01 -1.0 7.85e+02 - 8.88e-05 6.87e-0
4h 1
3 2.4240462e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 6.67e-04 2.10e-0
2h 1
4 1.2380467e+04 5.52e-02 8.24e+01 -1.0 8.98e+02 - 3.84e-02 1.00e+0
0h 1
5 3.8796313e+03 5.26e-02 5.61e+01 -1.0 8.06e+01 - 3.16e-01 5.00e-0
2f 1
6 1.9096182e+03 3.75e-02 3.00e+01 -1.0 3.91e+01 - 4.70e-01 5.04e-0
1f 1
7 4.6686502e+03 1.22e-02 2.67e+01 -1.0 2.05e+01 - 4.02e-01 1.00e+0
0h 1
8 1.8748441e+03 1.18e-02 1.00e+00 -1.0 2.53e+01 - 9.88e-01 8.94e-0
1f 1
9 2.0007637e+03 1.82e-04 4.63e-02 -1.0 3.23e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7349595e+03 2.15e-04 1.23e+00 -2.5 1.77e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5468547e+03 3.76e-03 1.33e-01 -2.5 7.59e+00 - 7.96e-01 1.00e+0
0f 1
12 1.5237336e+03 5.33e-03 3.08e-01 -2.5 1.83e+00 - 1.00e+00 7.68e-0
1h 1
13 1.5360585e+03 2.45e-04 4.69e-03 -2.5 7.08e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5034659e+03 1.70e-04 2.13e-02 -3.8 1.62e+01 - 9.91e-01 9.30e-0
1h 1
15 1.5021214e+03 7.20e-07 6.83e-05 -3.8 1.09e+00 - 1.00e+00 1.00e+0
0h 1
16 1.5003171e+03 3.77e-07 1.76e-04 -5.7 8.92e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003154e+03 3.79e-11 2.93e-09 -5.7 3.96e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.11e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932801846049e+00 1.5002932801846050e+0
3
Dual infeasibility......: 2.1693855822758239e-09 2.1693855822758239e-0
6
Constraint violation....: 6.2995803018495167e-11 6.2995803018495167e-1
1
Complementarity.........: 2.8882170395831570e-09 2.8882170395831570e-0
6
Overall NLP error.......: 2.8882170395831570e-09 2.8882170395831570e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6465207e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 4.93e-04 9.87e-0
3h 1
2 8.4355022e+02 9.17e+02 5.24e+01 -1.0 8.01e+02 - 8.70e-05 7.80e-0
4h 1
3 2.6241287e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 7.62e-04 2.20e-0
2h 1
4 1.2719100e+04 5.98e-02 8.02e+01 -1.0 8.97e+02 - 5.04e-02 1.00e+0
0h 1
5 4.2679658e+03 5.58e-02 5.32e+01 -1.0 7.31e+01 - 3.26e-01 6.03e-0
2f 1
54 1.551428e+04 1.632511e+04 4.658281e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6795632e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.80e-0
3f 1
2 7.6508436e+02 1.57e+04 5.25e+01 -1.0 1.51e+04 - 4.81e-05 1.03e-0
4h 1
3 7.4099365e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 6.06e-06 1.91e-0
3h 1
4 5.3889767e+02 1.54e+04 5.27e+01 -1.0 1.57e+04 - 2.04e-03 1.95e-0
2h 1
5 2.6100342e+04 6.17e-02 8.49e+01 -1.0 1.54e+04 - 3.05e-02 1.00e+0
0h 1
6 1.8236447e+04 5.92e-02 6.40e+01 -1.0 7.32e+01 - 2.50e-01 4.45e-0
2f 1
7 1.6688751e+04 4.55e-02 3.12e+01 -1.0 2.88e+01 - 5.08e-01 4.32e-0
1f 1
8 1.6977987e+04 3.11e-02 1.20e+01 -1.0 1.59e+01 - 4.75e-01 1.25e-0
1f 4
9 1.6782927e+04 5.33e-03 2.36e-01 -1.0 3.86e+00 - 9.86e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6497635e+04 1.04e-03 1.35e+00 -1.7 4.60e+00 - 2.95e-01 8.79e-0
1f 1
11 1.6488842e+04 1.58e-04 6.98e-01 -1.7 5.37e+00 - 6.45e-01 1.00e+0
0f 1
12 1.6477717e+04 1.19e-04 1.51e-01 -1.7 1.01e+01 - 7.40e-01 1.00e+0
0h 1
13 1.6372090e+04 9.37e-04 6.98e-02 -2.5 9.31e+00 - 9.08e-01 1.00e+0
0f 1
14 1.6344424e+04 1.50e-03 1.56e-02 -2.5 4.62e+00 - 1.00e+00 1.00e+0
0h 1
15 1.6328289e+04 2.66e-04 1.06e-01 -3.8 5.58e+00 - 1.00e+00 8.34e-0
1h 1
16 1.6326334e+04 6.19e-07 1.27e-04 -3.8 9.27e-01 - 1.00e+00 1.00e+0
0h 1
17 1.6325117e+04 4.01e-07 1.10e-04 -5.7 2.97e-01 - 1.00e+00 9.98e-0
1h 1
18 1.6325119e+04 3.83e-11 3.01e-09 -5.7 2.91e-02 - 1.00e+00 1.00e+0
0f 1
19 1.6325107e+04 4.21e-11 1.03e-04 -8.6 3.34e-03 - 1.00e+00 8.33e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325105e+04 1.75e-12 5.75e-11 -8.6 1.41e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.6325105276143891e+01 1.6325105276143890e+0
4
Dual infeasibility......: 5.7545762591336215e-11 5.7545762591336215e-0
8
Constraint violation....: 1.7504470095630609e-12 1.7504470095630609e-1
2
Complementarity.........: 3.1789257460123759e-09 3.1789257460123758e-0
6
Overall NLP error.......: 3.1789257460123759e-09 3.1789257460123758e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6677669e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 4.98e-04 9.80e-0
3h 1
2 8.6399934e+02 1.50e+04 5.24e+01 -1.0 1.48e+04 - 9.09e-05 1.01e-0
4h 1
3 8.5620147e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 2.90e-06 6.09e-0
4f 1
4 5.8161776e+02 1.46e+04 5.25e+01 -1.0 1.50e+04 - 6.50e-04 2.21e-0
2h 1
5 2.6836043e+04 5.98e-02 8.01e+01 -1.0 1.46e+04 - 5.04e-02 1.00e+0
0h 1
6 1.8341212e+04 5.58e-02 5.34e+01 -1.0 7.30e+01 - 3.23e-01 6.03e-0
2f 1
7 1.6755757e+04 3.02e-02 2.77e+01 -1.0 3.88e+01 - 4.75e-01 4.32e-0
1f 1
8 1.6473563e+04 1.45e-02 2.55e+00 -1.0 1.10e+01 - 9.18e-01 5.00e-0
1f 2
9 1.6312176e+04 7.14e-03 1.81e+00 -1.0 7.89e+00 - 1.00e+00 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6416137e+04 5.57e-04 4.25e-02 -1.0 9.94e+01 - 1.00e+00 1.00e+0
0f 1
11 1.5983221e+04 4.46e-04 9.59e-01 -2.5 9.81e+01 - 9.17e-01 5.85e-0
1f 1
12 1.5861354e+04 2.19e-04 2.20e-01 -2.5 4.03e+01 - 9.25e-01 1.00e+0
0f 1
13 1.5835419e+04 3.07e-03 1.94e-02 -2.5 1.15e+00 - 1.00e+00 1.00e+0
0h 1
14 1.5822105e+04 7.99e-04 3.59e-02 -3.8 2.68e+00 - 8.03e-01 1.00e+0
0h 1
15 1.5819178e+04 2.13e-03 1.02e-03 -3.8 4.84e-02 - 1.00e+00 1.00e+0
0h 1
16 1.5819391e+04 4.92e-05 1.31e-04 -3.8 1.22e-02 - 1.00e+00 1.00e+0
0h 1
17 1.5818090e+04 1.01e-04 3.42e-04 -5.7 1.49e-01 - 9.50e-01 9.75e-0
1h 1
18 1.5818076e+04 2.31e-05 3.77e-03 -5.7 3.67e-03 - 1.00e+00 7.73e-0
1h 1
19 1.5818079e+04 9.13e-09 1.28e-06 -5.7 8.34e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5818064e+04 9.12e-09 1.91e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
21 1.5818064e+04 1.36e-12 6.49e-11 -8.6 3.06e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.5818063829718607e+01 1.5818063829718607e+0
4
Dual infeasibility......: 6.4922662590590794e-11 6.4922662590590794e-0
8
Constraint violation....: 1.3581358260239540e-12 1.3581358260239540e-1
2
Complementarity.........: 2.5092897301263584e-09 2.5092897301263583e-0
6
Overall NLP error.......: 2.5092897301263584e-09 2.5092897301263583e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2434766e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.31e-04 9.80e-0
3f 1
2 8.2152701e+02 1.39e+04 5.24e+01 -1.0 1.37e+04 - 9.41e-05 1.01e-0
4h 1
3 8.1250184e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 3.07e-06 6.34e-0
4f 1
4 5.2382711e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 6.80e-04 2.10e-0
2h 1
5 2.5354643e+04 5.52e-02 8.24e+01 -1.0 1.36e+04 - 3.86e-02 1.00e+0
0h 1
6 1.6863928e+04 5.27e-02 5.58e+01 -1.0 8.05e+01 - 3.19e-01 5.02e-0
2f 1
7 1.4889456e+04 3.73e-02 2.98e+01 -1.0 3.93e+01 - 4.70e-01 5.04e-0
1f 1
8 1.5234767e+04 2.27e-02 1.38e+01 -1.0 2.05e+01 - 4.01e-01 1.25e-0
1f 4
9 1.4978917e+04 6.02e-03 3.94e-01 -1.0 4.93e+00 - 9.79e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4673187e+04 1.43e-03 4.07e-01 -1.7 5.54e+00 - 1.00e+00 8.25e-0
1f 1
11 1.4632038e+04 9.15e-04 1.45e-02 -1.7 1.80e+01 - 1.00e+00 1.00e+0
0f 1
12 1.4504079e+04 1.44e-03 9.78e-02 -3.8 1.99e+01 - 7.88e-01 9.29e-0
1f 1
13 1.4480558e+04 1.62e-03 8.53e-02 -3.8 1.71e+00 - 8.43e-01 7.51e-0
1h 1
14 1.4481004e+04 3.34e-06 8.55e-04 -3.8 3.45e-01 - 1.00e+00 1.00e+0
0h 1
15 1.4480071e+04 2.80e-07 6.76e-04 -5.7 1.49e-01 - 1.00e+00 9.87e-0
1h 1
16 1.4480065e+04 3.64e-11 6.70e-09 -5.7 2.75e-01 - 1.00e+00 1.00e+0
0f 1
17 1.4480052e+04 6.30e-11 2.17e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.4480051773791013e+01 1.4480051773791012e+0
4
Dual infeasibility......: 2.1734473603355276e-09 2.1734473603355276e-0
6
Constraint violation....: 6.2998564698268922e-11 6.2998564698268922e-1
1
Complementarity.........: 2.8881015648090485e-09 2.8881015648090483e-0
6
Overall NLP error.......: 2.8881015648090485e-09 2.8881015648090483e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0496388e+02 1.27e+04 5.23e+01 -1.0 1.28e+04 - 9.13e-04 9.80e-0
3h 1
2 9.0214800e+02 1.27e+04 5.23e+01 -1.0 1.19e+04 - 3.94e-05 1.05e-0
4h 1
3 8.8820630e+02 1.26e+04 5.23e+01 -1.0 1.26e+04 - 8.82e-06 9.43e-0
4f 1
4 8.5981705e+02 1.26e+04 5.23e+01 -1.0 1.26e+04 - 9.54e-04 1.98e-0
3h 1
5 5.8358720e+02 1.23e+04 5.23e+01 -1.0 1.26e+04 - 4.47e-03 2.23e-0
2f 1
6 2.3043540e+04 7.07e-02 7.75e+01 -1.0 1.23e+04 - 8.71e-02 1.00e+0
0h 1
7 1.6349601e+04 6.32e-02 3.36e+01 -1.0 3.05e+01 - 5.43e-01 9.75e-0
2f 1
8 1.4849887e+04 2.39e-02 1.08e+01 -1.0 1.64e+01 - 6.85e-01 7.31e-0
1f 1
9 1.4948970e+04 8.26e-03 1.08e+00 -1.0 2.12e+00 - 9.79e-01 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5161594e+04 2.77e-04 2.36e-01 -1.0 2.58e+01 - 7.41e-01 1.00e+0
0f 1
11 1.4634083e+04 1.82e-03 7.74e-02 -1.7 2.44e+00 - 1.00e+00 1.00e+0
0f 1
12 1.4441956e+04 1.92e-03 2.67e-01 -2.5 2.85e+01 - 9.11e-01 7.59e-0
1f 1
13 1.4407107e+04 2.32e-04 4.63e-03 -2.5 3.63e+00 - 1.00e+00 1.00e+0
0h 1
14 1.4387356e+04 2.90e-05 3.27e-02 -3.8 2.83e+00 - 1.00e+00 8.93e-0
1h 1
15 1.4386196e+04 6.10e-08 5.69e-04 -3.8 8.21e-02 - 1.00e+00 1.00e+0
0f 1
16 1.4384890e+04 4.19e-08 1.68e-05 -5.7 1.53e-01 - 1.00e+00 9.99e-0
1f 1
17 1.4384878e+04 7.91e-13 3.70e-09 -8.6 8.00e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.4384878183098095e+01 1.4384878183098095e+0
4
Dual infeasibility......: 3.6953380231107542e-09 3.6953380231107542e-0
6
Constraint violation....: 7.9117268292350218e-13 7.9117268292350218e-1
3
Complementarity.........: 2.6321347533956545e-09 2.6321347533956545e-0
6
Overall NLP error.......: 3.6953380231107542e-09 3.6953380231107542e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6663227e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 4.97e-04 9.80e-0
3h 1
2 8.6384003e+02 1.11e+04 5.24e+01 -1.0 1.09e+04 - 9.14e-05 1.01e-0
4h 1
3 8.5017170e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 3.90e-06 8.21e-0
4f 1
4 4.9538323e+02 1.09e+04 5.25e+01 -1.0 1.11e+04 - 9.01e-04 2.20e-0
2h 1
5 2.2860587e+04 6.00e-02 8.02e+01 -1.0 1.09e+04 - 5.09e-02 1.00e+0
0h 1
6 1.4474022e+04 5.60e-02 5.30e+01 -1.0 7.24e+01 - 3.29e-01 6.09e-0
2f 1
7 1.2886580e+04 3.02e-02 2.74e+01 -1.0 3.88e+01 - 4.77e-01 4.34e-0
1f 1
8 1.2611916e+04 1.45e-02 2.53e+00 -1.0 1.09e+01 - 9.19e-01 5.00e-0
1f 2
9 1.2457830e+04 7.14e-03 1.79e+00 -1.0 7.67e+00 - 1.00e+00 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2560536e+04 5.57e-04 4.23e-02 -1.0 9.96e+01 - 1.00e+00 1.00e+0
0f 1
11 1.2128441e+04 4.45e-04 9.63e-01 -2.5 9.85e+01 - 9.18e-01 5.84e-0
1f 1
12 1.2005875e+04 2.23e-04 2.20e-01 -2.5 4.03e+01 - 9.25e-01 1.00e+0
0f 1
13 1.1979924e+04 3.09e-03 1.97e-02 -2.5 1.15e+00 - 1.00e+00 1.00e+0
0h 1
14 1.1966627e+04 8.07e-04 3.65e-02 -3.8 2.68e+00 - 8.02e-01 1.00e+0
0h 1
15 1.1963692e+04 2.15e-03 1.02e-03 -3.8 4.89e-02 - 1.00e+00 1.00e+0
0h 1
16 1.1963905e+04 4.87e-05 1.38e-04 -3.8 1.22e-02 - 1.00e+00 1.00e+0
0h 1
17 1.1962603e+04 1.01e-04 3.31e-04 -5.7 1.49e-01 - 9.50e-01 9.74e-0
1h 1
18 1.1962589e+04 2.31e-05 3.85e-03 -5.7 3.81e-03 - 1.00e+00 7.72e-0
1h 1
19 1.1962591e+04 9.00e-09 1.28e-06 -5.7 8.67e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.1962577e+04 9.08e-09 1.93e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
21 1.1962577e+04 1.37e-12 6.54e-11 -8.6 3.06e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.1962576502418091e+01 1.1962576502418091e+0
4
Dual infeasibility......: 6.5447236280741738e-11 6.5447236280741738e-0
8
Constraint violation....: 1.3696821454800556e-12 1.3696821454800556e-1
2
Complementarity.........: 2.5092871489911027e-09 2.5092871489911029e-0
6
Overall NLP error.......: 2.5092871489911027e-09 2.5092871489911029e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8775333e+02 9.19e+03 5.24e+01 -1.0 9.28e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8469544e+02 9.19e+03 5.24e+01 -1.0 7.80e+03 - 2.91e-05 1.17e-0
4h 1
3 6.6462142e+02 9.08e+03 5.24e+01 -1.0 9.19e+03 - 2.18e-05 1.20e-0
2h 1
4 5.9228810e+02 8.88e+03 5.19e+01 -1.0 9.08e+03 - 1.38e-02 2.17e-0
2h 1
5 1.7105302e+04 7.36e-02 7.74e+01 -1.0 8.88e+03 - 1.04e-01 1.00e+0
0h 1
6 1.2211572e+04 6.40e-02 2.02e+01 -1.0 4.24e+01 - 7.12e-01 1.21e-0
1f 1
7 1.0749760e+04 2.49e-02 1.83e+00 -1.0 2.14e+01 - 9.33e-01 6.71e-0
1f 1
8 1.0985588e+04 3.01e-03 1.27e+00 -1.0 4.35e+00 - 4.11e-01 1.00e+0
0f 1
9 1.1155850e+04 5.12e-04 8.60e-01 -1.0 7.21e+00 - 6.33e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.0502475e+04 1.73e-03 2.27e-01 -1.7 3.44e+00 - 8.73e-01 1.00e+0
0f 1
11 1.0478947e+04 4.81e-04 6.79e-02 -1.7 1.57e+01 - 8.75e-01 1.00e+0
0h 1
12 1.0373728e+04 3.33e-04 4.18e-01 -2.5 1.80e+01 - 9.94e-01 6.49e-0
1f 1
13 1.0361198e+04 5.79e-06 1.01e-02 -2.5 1.05e+01 - 1.00e+00 1.00e+0
0f 1
14 1.0339532e+04 9.45e-06 4.84e-02 -3.8 8.05e+00 - 8.54e-01 9.11e-0
1f 1
15 1.0336035e+04 5.45e-04 1.23e-03 -3.8 7.11e-01 - 9.93e-01 1.00e+0
0f 1
16 1.0334762e+04 5.27e-05 1.06e-02 -5.7 4.46e-01 - 8.35e-01 1.00e+0
0h 1
17 1.0334652e+04 3.36e-05 3.72e-05 -5.7 9.29e-03 - 1.00e+00 1.00e+0
0h 1
18 1.0334654e+04 6.36e-07 6.67e-06 -5.7 1.21e-03 - 1.00e+00 1.00e+0
0h 1
19 1.0334639e+04 3.76e-08 7.44e-05 -8.6 5.53e-03 - 1.00e+00 9.50e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.0334638e+04 5.62e-12 5.81e-11 -8.6 2.74e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.0334637961183846e+01 1.0334637961183846e+0
4
Dual infeasibility......: 5.8093402171098060e-11 5.8093402171098060e-0
8
Constraint violation....: 5.6160631700663544e-12 5.6160631700663544e-1
2
Complementarity.........: 3.2951829345731592e-09 3.2951829345731592e-0
6
Overall NLP error.......: 3.2951829345731592e-09 3.2951829345731592e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3709613e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 3.06e-03 9.81e-0
3h 1
2 9.3353198e+02 6.71e+03 5.23e+01 -1.0 5.10e+03 - 1.89e-05 1.30e-0
4h 1
3 4.2613385e+02 6.55e+03 5.24e+01 -1.0 6.71e+03 - 3.56e-05 2.29e-0
2f 1
4 1.9281092e+04 7.30e-02 8.02e+01 -1.0 6.55e+03 - 3.74e-02 1.00e+0
0h 1
5 1.1339331e+04 6.91e-02 5.90e+01 -1.0 8.02e+00 - 2.64e-01 5.00e-0
2f 1
6 1.0190236e+04 2.14e-02 2.42e+01 -1.0 5.08e+00 - 6.39e-01 1.00e+0
0f 1
7 1.0517954e+04 2.95e-03 2.01e-01 -1.0 2.03e+00 - 9.91e-01 1.00e+0
0f 1
8 1.0004053e+04 1.59e-03 6.62e-02 -1.7 5.15e+00 - 1.00e+00 9.87e-0
1f 1
9 9.8321705e+03 1.66e-03 3.42e-01 -2.5 1.25e+00 - 1.00e+00 8.01e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.8071755e+03 3.62e-05 7.24e-03 -2.5 2.80e-01 - 1.00e+00 1.00e+0
0h 1
11 9.7854015e+03 2.15e-06 7.23e-04 -3.8 5.36e+00 - 1.00e+00 1.00e+0
0h 1
12 9.7842083e+03 1.50e-08 3.75e-06 -5.7 2.95e-01 - 1.00e+00 1.00e+0
0h 1
13 9.7841926e+03 1.71e-12 4.05e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 13
(scaled) (unscaled)
Objective...............: 9.7841925857378893e+00 9.7841925857378883e+0
3
Dual infeasibility......: 4.0517118382207864e-10 4.0517118382207864e-0
7
Constraint violation....: 1.7061074775170937e-12 1.7061074775170937e-1
2
Complementarity.........: 3.4565981229488200e-09 3.4565981229488199e-0
6
Overall NLP error.......: 3.4565981229488200e-09 3.4565981229488199e-0
6
Number of objective function evaluations = 14
Number of objective gradient evaluations = 14
Number of equality constraint evaluations = 14
Number of inequality constraint evaluations = 14
Number of equality constraint Jacobian evaluations = 14
Number of inequality constraint Jacobian evaluations = 14
Number of Lagrangian Hessian evaluations = 13
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0882880e+02 4.77e+03 5.23e+01 -1.0 4.81e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0434947e+02 4.77e+03 5.23e+01 -1.0 2.68e+03 - 2.39e-05 1.77e-0
4h 1
3 3.7454299e+02 4.66e+03 5.24e+01 -1.0 4.77e+03 - 8.76e-05 2.34e-0
2f 1
4 1.7328207e+04 6.52e-02 8.01e+01 -1.0 4.66e+03 - 3.59e-02 1.00e+0
0h 1
5 8.8756218e+03 6.18e-02 5.99e+01 -1.0 3.67e+01 - 2.49e-01 4.75e-0
2f 1
6 7.5823595e+03 1.99e-02 2.80e+01 -1.0 1.63e+01 - 5.44e-01 6.25e-0
1f 1
7 7.1823255e+03 5.26e-03 8.31e-01 -1.0 5.07e+00 - 9.59e-01 7.94e-0
1f 1
8 7.4507207e+03 1.50e-04 6.10e-02 -1.0 5.80e+00 - 1.00e+00 1.00e+0
0f 1
9 6.8804600e+03 2.15e-03 8.62e-02 -2.5 5.25e+00 - 8.55e-01 8.54e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.7212292e+03 2.16e-03 4.08e-01 -2.5 9.22e-01 - 1.00e+00 7.65e-0
1f 1
11 6.6966339e+03 1.20e-04 4.68e-03 -2.5 2.02e-01 - 1.00e+00 1.00e+0
0h 1
12 6.6735647e+03 3.19e-05 1.43e-01 -3.8 1.07e+01 - 1.00e+00 7.63e-0
1h 1
13 6.6675769e+03 1.22e-07 3.35e-04 -3.8 2.53e+00 - 1.00e+00 1.00e+0
0f 1
14 6.6659095e+03 2.86e-08 1.00e-03 -5.7 5.94e-01 - 1.00e+00 9.85e-0
1f 1
15 6.6658896e+03 1.94e-12 1.40e-08 -5.7 8.99e-03 - 1.00e+00 1.00e+0
0f 1
16 6.6658693e+03 2.63e-12 4.48e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.6658693424564897e+00 6.6658693424564899e+0
3
Dual infeasibility......: 4.4776956273890463e-09 4.4776956273890463e-0
6
Constraint violation....: 2.6308538680908100e-12 2.6308538680908100e-1
2
Complementarity.........: 3.6084974564718302e-09 3.6084974564718303e-0
6
Overall NLP error.......: 4.4776956273890463e-09 4.4776956273890463e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9469463e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3h 1
2 8.9070845e+02 3.24e+03 5.24e+01 -1.0 2.13e+03 - 3.61e-05 1.51e-0
4h 1
3 3.3042115e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 6.40e-05 2.31e-0
2f 1
4 1.5680539e+04 6.28e-02 8.02e+01 -1.0 3.17e+03 - 3.82e-02 1.00e+0
0h 1
5 7.1096018e+03 5.94e-02 5.80e+01 -1.0 5.03e+01 - 2.72e-01 4.93e-0
2f 1
6 5.7281758e+03 2.48e-02 2.85e+01 -1.0 2.32e+01 - 5.13e-01 5.39e-0
1f 1
7 5.1166765e+03 1.01e-02 1.45e+00 -1.0 8.86e+00 - 9.34e-01 7.73e-0
1f 1
8 5.4253179e+03 3.01e-04 8.55e-02 -1.0 3.30e+00 - 1.00e+00 1.00e+0
0f 1
9 4.8000123e+03 2.08e-03 7.84e-02 -2.5 5.01e+00 - 8.62e-01 8.55e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.6289686e+03 2.21e-03 3.37e-01 -2.5 1.04e+00 - 1.00e+00 7.83e-0
1f 1
11 4.6028030e+03 1.45e-04 4.54e-03 -2.5 1.98e-01 - 1.00e+00 1.00e+0
0h 1
12 4.5779283e+03 2.15e-05 4.19e-02 -3.8 8.05e+00 - 1.00e+00 8.86e-0
1h 1
13 4.5759312e+03 5.61e-08 5.97e-04 -3.8 9.12e-01 - 1.00e+00 1.00e+0
0f 1
14 4.5743283e+03 4.27e-08 6.52e-05 -5.7 4.46e-01 - 1.00e+00 9.98e-0
1f 1
15 4.5743286e+03 1.89e-12 1.39e-08 -5.7 1.07e-03 - 1.00e+00 1.00e+0
0f 1
16 4.5743102e+03 2.57e-12 3.30e-06 -8.6 5.53e-03 - 1.00e+00 9.99e-0
1f 1
17 4.5743102e+03 7.11e-15 4.86e-14 -8.6 3.11e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 4.5743102014304915e+00 4.5743102014304914e+0
3
Dual infeasibility......: 4.8635044019278641e-14 4.8635044019278641e-1
1
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.6532338245921912e-09 2.6532338245921910e-0
6
Overall NLP error.......: 2.6532338245921912e-09 2.6532338245921910e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8038781e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.82e-0
3h 1
2 8.7405326e+02 2.00e+03 5.24e+01 -1.0 1.17e+03 - 4.28e-05 2.39e-0
4h 1
3 8.4458601e+02 1.99e+03 5.24e+01 -1.0 1.99e+03 - 1.65e-04 1.15e-0
3h 1
4 2.9615894e+02 1.95e+03 5.25e+01 -1.0 1.99e+03 - 1.31e-03 2.21e-0
2f 1
5 1.3635598e+04 6.24e-02 7.94e+01 -1.0 1.95e+03 - 5.84e-02 1.00e+0
0h 1
6 5.4864213e+03 5.78e-02 5.12e+01 -1.0 6.24e+01 - 3.41e-01 6.79e-0
2f 1
7 4.1281367e+03 3.11e-02 2.44e+01 -1.0 3.17e+01 - 5.11e-01 4.26e-0
1f 1
8 3.3955832e+03 1.03e-02 1.86e+00 -1.0 1.09e+01 - 9.21e-01 8.98e-0
1f 1
9 3.7897833e+03 2.86e-04 1.52e-01 -1.0 4.70e+00 - 9.44e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.1212078e+03 1.21e-03 1.05e+00 -1.7 2.40e+01 - 4.19e-01 9.93e-0
1f 1
11 3.1951829e+03 4.65e-05 2.46e-02 -1.7 9.74e+00 - 1.00e+00 1.00e+0
0f 1
12 3.0704438e+03 5.11e-05 1.63e-01 -2.5 2.99e+01 - 1.00e+00 8.68e-0
1f 1
13 3.0643695e+03 8.29e-05 2.54e-03 -2.5 9.80e-01 - 1.00e+00 1.00e+0
0f 1
14 3.0433045e+03 2.56e-04 7.44e-02 -3.8 9.88e+00 - 7.80e-01 9.73e-0
1h 1
15 3.0407860e+03 1.58e-03 2.37e-02 -3.8 4.92e-01 - 1.42e-01 1.00e+0
0f 1
16 3.0408407e+03 3.53e-05 1.29e-05 -3.8 3.86e-02 - 1.00e+00 1.00e+0
0h 1
17 3.0392740e+03 1.64e-04 1.32e-03 -5.7 4.54e-01 - 9.09e-01 1.00e+0
0h 1
18 3.0392316e+03 4.29e-05 1.09e-05 -5.7 9.65e-03 - 1.00e+00 1.00e+0
0h 1
19 3.0392349e+03 1.02e-06 6.73e-06 -5.7 1.46e-03 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 3.0392193e+03 7.65e-08 7.18e-05 -8.6 5.53e-03 - 1.00e+00 9.41e-0
1h 1
21 3.0392184e+03 8.42e-12 9.42e-11 -8.6 3.26e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 3.0392183933879862e+00 3.0392183933879860e+0
3
Dual infeasibility......: 9.4220020171662515e-11 9.4220020171662515e-0
8
Constraint violation....: 8.4205975525719623e-12 8.4205975525719623e-1
2
Complementarity.........: 2.7009042801117009e-09 2.7009042801117009e-0
6
Overall NLP error.......: 2.7009042801117009e-09 2.7009042801117009e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0791461e+02 9.17e+02 5.23e+01 -1.0 9.21e+02 - 1.00e-03 9.87e-0
3h 1
2 8.7165159e+02 9.16e+02 5.23e+01 -1.0 8.51e+02 - 8.19e-05 1.36e-0
3h 1
3 2.8567501e+02 8.96e+02 5.24e+01 -1.0 9.16e+02 - 1.36e-03 2.27e-0
2h 1
4 1.2880567e+04 6.68e-02 7.66e+01 -1.0 8.96e+02 - 8.33e-02 1.00e+0
0h 1
5 4.8360571e+03 6.02e-02 3.75e+01 -1.0 2.88e+01 - 4.85e-01 9.04e-0
2f 1
6 3.3367023e+03 1.95e-02 1.51e+01 -1.0 1.53e+01 - 6.20e-01 7.44e-0
1f 1
7 3.4587663e+03 4.48e-03 1.52e-01 -1.0 2.09e+00 - 9.91e-01 1.00e+0
0f 1
8 3.0299126e+03 1.48e-03 1.28e-01 -1.7 9.50e+00 - 1.00e+00 1.00e+0
0f 1
9 2.8718164e+03 2.04e-03 4.07e-01 -2.5 6.92e+00 - 1.00e+00 7.88e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8482474e+03 1.55e-04 5.37e-03 -2.5 1.35e+00 - 1.00e+00 1.00e+0
0h 1
11 2.8224001e+03 4.29e-05 1.82e-01 -3.8 1.62e+01 - 1.00e+00 7.38e-0
1h 1
12 2.8143652e+03 1.60e-07 3.60e-04 -3.8 4.19e+00 - 1.00e+00 1.00e+0
0f 1
13 2.8124113e+03 2.72e-08 9.78e-04 -5.7 8.92e-01 - 1.00e+00 9.85e-0
1f 1
14 2.8123877e+03 1.88e-12 1.35e-08 -5.7 1.31e-02 - 1.00e+00 1.00e+0
0f 1
15 2.8123637e+03 2.63e-12 4.48e-09 -8.6 1.11e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 2.8123637128563468e+00 2.8123637128563469e+0
3
Dual infeasibility......: 4.4777044324468814e-09 4.4777044324468814e-0
6
Constraint violation....: 2.6305832512285576e-12 2.6305832512285576e-1
2
Complementarity.........: 3.6085017797023177e-09 3.6085017797023178e-0
6
Overall NLP error.......: 4.4777044324468814e-09 4.4777044324468814e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.03e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.11e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643339e+00 1.6104063281643339e+0
3
Dual infeasibility......: 2.4575962202569930e-12 2.4575962202569930e-0
9
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5062163910047551e-09 2.5062163910047549e-0
6
Overall NLP error.......: 2.5062163910047551e-09 2.5062163910047549e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031320944927504e-09 2.1031320944927504e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896925026e-09 2.8882108896925025e-0
6
Overall NLP error.......: 2.8882108896925026e-09 2.8882108896925025e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254210179e-01 6.4890146254210174e+0
2
Dual infeasibility......: 4.9126604771119770e-09 4.9126604771119770e-0
6
Constraint violation....: 6.2123813870940126e-09 6.2123813870940126e-0
9
Complementarity.........: 4.3646095252481117e-09 4.3646095252481114e-0
6
Overall NLP error.......: 6.2123813870940126e-09 4.9126604771119770e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.03e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.11e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643339e+00 1.6104063281643339e+0
3
Dual infeasibility......: 2.4575962202569930e-12 2.4575962202569930e-0
9
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5062163910047551e-09 2.5062163910047549e-0
6
Overall NLP error.......: 2.5062163910047551e-09 2.5062163910047549e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2329662e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 3.31e-04 9.85e-0
3h 1
2 8.1338739e+02 9.17e+02 5.24e+01 -1.0 6.65e+02 - 7.53e-05 3.59e-0
4h 1
3 2.4215012e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 3.16e-04 2.12e-0
2f 1
4 1.2572829e+04 5.49e-02 8.23e+01 -1.0 8.98e+02 - 3.81e-02 1.00e+0
0h 1
5 3.9012337e+03 5.24e-02 5.73e+01 -1.0 8.21e+01 - 3.02e-01 4.95e-0
2f 1
6 1.9122630e+03 3.74e-02 3.08e+01 -1.0 3.92e+01 - 4.67e-01 5.07e-0
1f 1
7 4.6985285e+03 1.23e-02 2.74e+01 -1.0 2.08e+01 - 3.98e-01 1.00e+0
0h 1
8 1.8769618e+03 1.22e-02 1.07e+00 -1.0 2.57e+01 - 9.87e-01 8.88e-0
1f 1
9 1.9956227e+03 2.03e-04 4.84e-02 -1.0 2.76e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7291248e+03 2.21e-04 1.23e+00 -2.5 1.88e+01 - 9.37e-01 5.95e-0
1f 1
11 1.5409848e+03 3.77e-03 1.32e-01 -2.5 7.58e+00 - 7.96e-01 1.00e+0
0f 1
12 1.5181170e+03 5.06e-03 3.08e-01 -2.5 1.81e+00 - 1.00e+00 7.68e-0
1h 1
13 1.5303991e+03 2.38e-04 4.69e-03 -2.5 7.19e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5028095e+03 1.70e-04 2.15e-02 -3.8 1.08e+01 - 9.90e-01 9.29e-0
1h 1
15 1.5018205e+03 7.26e-07 6.85e-05 -3.8 7.35e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003124e+03 3.77e-07 1.78e-04 -5.7 5.94e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003117e+03 3.79e-11 2.92e-09 -5.7 4.21e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932751767060e+00 1.5002932751767059e+0
3
Dual infeasibility......: 2.1737236411499737e-09 2.1737236411499737e-0
6
Constraint violation....: 6.2995761385131743e-11 6.2995761385131743e-1
1
Complementarity.........: 2.8882174480583091e-09 2.8882174480583092e-0
6
Overall NLP error.......: 2.8882174480583091e-09 2.8882174480583092e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6577131e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 4.97e-04 9.85e-0
3h 1
2 8.5529111e+02 9.17e+02 5.24e+01 -1.0 6.82e+02 - 7.34e-05 3.86e-0
4h 1
3 2.6219590e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 3.43e-04 2.22e-0
2f 1
4 1.2935511e+04 5.94e-02 8.01e+01 -1.0 8.97e+02 - 4.97e-02 1.00e+0
0h 1
5 4.2970559e+03 5.55e-02 5.39e+01 -1.0 7.40e+01 - 3.17e-01 5.94e-0
2f 1
55 1.657966e+04 1.632511e+04 4.716318e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6794703e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.80e-0
3f 1
2 7.6502061e+02 1.57e+04 5.25e+01 -1.0 1.45e+04 - 3.26e-05 1.07e-0
4h 1
3 7.5970901e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 1.09e-05 4.21e-0
4h 1
4 7.4043688e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 4.28e-04 1.59e-0
3h 1
5 5.4571663e+02 1.54e+04 5.27e+01 -1.0 1.57e+04 - 2.16e-03 1.98e-0
2f 1
6 2.5849615e+04 6.20e-02 8.49e+01 -1.0 1.54e+04 - 3.10e-02 1.00e+0
0h 1
7 1.8222315e+04 5.94e-02 6.24e+01 -1.0 7.10e+01 - 2.70e-01 4.53e-0
2f 1
8 1.6686386e+04 4.57e-02 3.05e+01 -1.0 2.89e+01 - 5.11e-01 4.31e-0
1f 1
9 1.6972952e+04 3.13e-02 2.64e+01 -1.0 1.57e+01 - 4.78e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6783962e+04 5.33e-03 1.72e+00 -1.0 3.91e+00 - 8.92e-01 1.00e+0
0h 1
11 1.6827791e+04 2.84e-04 1.92e+00 -1.0 2.56e+00 - 2.36e-01 1.00e+0
0f 1
12 1.6830201e+04 8.69e-06 6.74e-01 -1.0 3.35e+00 - 6.33e-01 1.00e+0
0f 1
13 1.6532154e+04 2.30e-04 3.79e-01 -1.7 4.86e+00 - 8.97e-01 7.89e-0
1f 1
14 1.6483438e+04 6.21e-04 2.53e-01 -1.7 1.12e+01 - 6.45e-01 1.00e+0
0f 1
15 1.6488100e+04 5.73e-05 2.87e-02 -1.7 1.48e+01 - 8.87e-01 1.00e+0
0h 1
16 1.6363468e+04 9.93e-04 4.53e-02 -2.5 2.78e+01 - 9.27e-01 1.00e+0
0f 1
17 1.6345123e+04 1.07e-03 1.14e-02 -2.5 1.16e+00 - 1.00e+00 1.00e+0
0h 1
18 1.6327918e+04 1.79e-04 8.30e-02 -3.8 5.63e+00 - 1.00e+00 8.56e-0
1h 1
19 1.6326333e+04 5.64e-07 9.82e-05 -3.8 6.86e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325117e+04 4.00e-07 1.12e-04 -5.7 2.97e-01 - 1.00e+00 9.97e-0
1h 1
21 1.6325119e+04 3.81e-11 2.99e-09 -5.7 1.16e-03 - 1.00e+00 1.00e+0
0f 1
22 1.6325107e+04 4.27e-11 1.00e-04 -8.6 3.34e-03 - 1.00e+00 8.38e-0
1h 1
23 1.6325105e+04 1.66e-12 5.45e-11 -8.6 9.33e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 23
(scaled) (unscaled)
Objective...............: 1.6325105276122855e+01 1.6325105276122855e+0
4
Dual infeasibility......: 5.4475260755689027e-11 5.4475260755689027e-0
8
Constraint violation....: 1.6572160310701634e-12 1.6572160310701634e-1
2
Complementarity.........: 3.1577929443759480e-09 3.1577929443759478e-0
6
Overall NLP error.......: 3.1577929443759480e-09 3.1577929443759478e-0
6
Number of objective function evaluations = 27
Number of objective gradient evaluations = 24
Number of equality constraint evaluations = 27
Number of inequality constraint evaluations = 27
Number of equality constraint Jacobian evaluations = 24
Number of inequality constraint Jacobian evaluations = 24
Number of Lagrangian Hessian evaluations = 23
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6677301e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 4.98e-04 9.80e-0
3h 1
2 8.6395413e+02 1.50e+04 5.24e+01 -1.0 1.43e+04 - 4.44e-05 1.04e-0
4h 1
3 8.3490716e+02 1.49e+04 5.24e+01 -1.0 1.50e+04 - 6.75e-06 2.27e-0
3h 1
4 5.9651229e+02 1.46e+04 5.25e+01 -1.0 1.49e+04 - 2.43e-03 2.13e-0
2h 1
5 2.6041118e+04 6.16e-02 8.03e+01 -1.0 1.46e+04 - 5.43e-02 1.00e+0
0h 1
6 1.8256778e+04 5.72e-02 5.04e+01 -1.0 6.85e+01 - 3.61e-01 6.49e-0
2f 1
7 1.6679278e+04 3.04e-02 2.50e+01 -1.0 3.82e+01 - 4.95e-01 4.38e-0
1f 1
8 1.6187054e+04 1.34e-02 2.27e+00 -1.0 1.07e+01 - 9.21e-01 1.00e+0
0f 1
9 1.6473942e+04 3.89e-04 8.32e-02 -1.0 4.27e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5950651e+04 5.36e-04 5.48e-01 -2.5 7.36e+00 - 8.90e-01 6.70e-0
1f 1
11 1.5872049e+04 2.33e-04 3.74e-01 -2.5 2.47e+00 - 8.88e-01 1.00e+0
0h 1
12 1.5851371e+04 6.25e-03 2.44e-01 -2.5 1.61e+00 - 1.00e+00 5.51e-0
1h 1
13 1.5840555e+04 8.11e-04 6.63e-03 -2.5 5.30e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5822080e+04 1.12e-03 2.82e-02 -3.8 5.36e+00 - 8.14e-01 1.00e+0
0h 1
15 1.5819170e+04 2.12e-03 1.06e-03 -3.8 4.62e-02 - 1.00e+00 1.00e+0
0h 1
16 1.5819559e+04 4.79e-05 1.52e-04 -3.8 1.55e-02 - 1.00e+00 1.00e+0
0h 1
17 1.5818084e+04 1.07e-04 4.53e-04 -5.7 2.97e-01 - 9.50e-01 9.84e-0
1h 1
18 1.5818077e+04 2.19e-05 3.47e-03 -5.7 4.81e-03 - 1.00e+00 7.95e-0
1h 1
19 1.5818080e+04 8.70e-09 1.10e-06 -5.7 9.84e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5818064e+04 9.01e-09 1.92e-05 -8.6 3.68e-03 - 1.00e+00 9.83e-0
1h 1
21 1.5818064e+04 1.37e-12 6.43e-11 -8.6 6.14e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.5818063696156853e+01 1.5818063696156853e+0
4
Dual infeasibility......: 6.4288134812598983e-11 6.4288134812598976e-0
8
Constraint violation....: 1.3669065879184927e-12 1.3669065879184927e-1
2
Complementarity.........: 2.5470160815115891e-09 2.5470160815115890e-0
6
Overall NLP error.......: 2.5470160815115891e-09 2.5470160815115890e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6663159e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 4.97e-04 9.80e-0
3h 1
2 8.6380231e+02 1.39e+04 5.24e+01 -1.0 1.32e+04 - 4.46e-05 1.04e-0
4h 1
3 8.6189920e+02 1.39e+04 5.24e+01 -1.0 1.38e+04 - 7.32e-06 1.36e-0
4h 1
4 8.5956800e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 1.42e-04 1.69e-0
4h 1
5 5.5559471e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 3.19e-04 2.23e-0
2f 1
6 2.5865965e+04 5.95e-02 8.01e+01 -1.0 1.36e+04 - 4.99e-02 1.00e+0
0h 1
7 1.7271606e+04 5.56e-02 5.37e+01 -1.0 7.37e+01 - 3.19e-01 5.97e-0
2f 1
8 1.5682451e+04 3.01e-02 2.81e+01 -1.0 3.89e+01 - 4.72e-01 4.32e-0
1f 1
9 1.5398041e+04 1.45e-02 2.57e+00 -1.0 1.10e+01 - 9.18e-01 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5229852e+04 7.13e-03 1.83e+00 -1.0 8.13e+00 - 9.96e-01 5.00e-0
1f 2
11 1.5352742e+04 5.62e-04 4.21e-02 -1.0 1.18e+02 - 1.00e+00 1.00e+0
0f 1
12 1.4900935e+04 4.47e-04 9.63e-01 -2.5 1.32e+02 - 9.17e-01 5.84e-0
1f 1
13 1.4778329e+04 2.21e-04 1.84e-01 -2.5 4.16e+01 - 9.25e-01 9.90e-0
1f 1
14 1.4754470e+04 2.93e-03 1.65e-02 -2.5 2.81e+00 - 1.00e+00 1.00e+0
0f 1
15 1.4741026e+04 8.34e-04 3.62e-02 -3.8 2.82e+00 - 8.02e-01 1.00e+0
0h 1
16 1.4738031e+04 2.28e-03 1.03e-03 -3.8 4.88e-02 - 1.00e+00 1.00e+0
0h 1
17 1.4738260e+04 4.76e-05 1.37e-04 -3.8 1.22e-02 - 1.00e+00 1.00e+0
0h 1
18 1.4736957e+04 1.01e-04 3.33e-04 -5.7 1.49e-01 - 9.50e-01 9.75e-0
1h 1
19 1.4736943e+04 2.31e-05 3.87e-03 -5.7 3.68e-03 - 1.00e+00 7.72e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.4736946e+04 8.99e-09 1.28e-06 -5.7 8.38e-04 - 1.00e+00 1.00e+0
0f 1
21 1.4736932e+04 9.08e-09 1.93e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
22 1.4736931e+04 1.37e-12 6.55e-11 -8.6 3.06e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.4736931417034342e+01 1.4736931417034340e+0
4
Dual infeasibility......: 6.5452710146479926e-11 6.5452710146479926e-0
8
Constraint violation....: 1.3703482792948307e-12 1.3703482792948307e-1
2
Complementarity.........: 2.5092857956549071e-09 2.5092857956549069e-0
6
Overall NLP error.......: 2.5092857956549071e-09 2.5092857956549069e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8073105e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.97e-04 9.80e-0
3h 1
2 8.7796146e+02 1.27e+04 5.24e+01 -1.0 1.24e+04 - 8.93e-05 1.01e-0
4h 1
3 8.6692458e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 3.47e-06 7.37e-0
4f 1
4 5.4092019e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 7.99e-04 2.24e-0
2h 1
5 2.4576710e+04 6.17e-02 7.93e+01 -1.0 1.24e+04 - 5.67e-02 1.00e+0
0h 1
6 1.6171478e+04 5.73e-02 5.23e+01 -1.0 6.39e+01 - 3.28e-01 6.59e-0
2f 1
7 1.4812866e+04 3.11e-02 2.54e+01 -1.0 3.21e+01 - 5.03e-01 4.22e-0
1f 1
8 1.4040427e+04 1.14e-02 2.00e+00 -1.0 1.10e+01 - 9.20e-01 9.11e-0
1f 1
9 1.4460004e+04 3.38e-04 9.28e-02 -1.0 4.85e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3750291e+04 1.39e-03 7.06e-02 -2.5 6.50e+00 - 8.71e-01 8.55e-0
1f 1
11 1.3727058e+04 1.41e-05 1.70e-02 -2.5 6.60e-01 - 1.00e+00 1.00e+0
0h 1
12 1.3695913e+04 1.35e-03 3.69e-02 -3.8 2.68e+00 - 7.12e-01 1.00e+0
0f 1
13 1.3693938e+04 9.56e-04 1.56e-03 -3.8 3.41e-02 - 9.61e-01 1.00e+0
0h 1
14 1.3694087e+04 1.22e-04 1.32e-04 -3.8 1.60e-02 - 1.00e+00 1.00e+0
0h 1
15 1.3692879e+04 1.38e-04 1.17e-03 -5.7 1.49e-01 - 9.16e-01 1.00e+0
0h 1
16 1.3692835e+04 3.55e-05 7.55e-06 -5.7 8.77e-03 - 1.00e+00 1.00e+0
0h 1
17 1.3692839e+04 4.36e-07 4.70e-06 -5.7 9.55e-04 - 1.00e+00 1.00e+0
0h 1
18 1.3692826e+04 3.62e-08 4.80e-05 -8.6 1.84e-03 - 1.00e+00 9.49e-0
1h 1
19 1.3692826e+04 6.54e-12 6.63e-11 -8.6 9.47e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.3692825531240290e+01 1.3692825531240289e+0
4
Dual infeasibility......: 6.6307839228897524e-11 6.6307839228897524e-0
8
Constraint violation....: 6.5409899718815723e-12 6.5409899718815723e-1
2
Complementarity.........: 2.5095397414800338e-09 2.5095397414800338e-0
6
Overall NLP error.......: 2.5095397414800338e-09 2.5095397414800338e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9481942e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 7.48e-04 9.80e-0
3h 1
2 8.9197823e+02 1.11e+04 5.24e+01 -1.0 1.04e+04 - 4.18e-05 1.06e-0
4h 1
3 8.3527077e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 9.63e-06 3.46e-0
3h 1
4 5.3623937e+02 1.08e+04 5.23e+01 -1.0 1.11e+04 - 3.85e-03 2.15e-0
2h 1
5 2.1933099e+04 6.71e-02 7.79e+01 -1.0 1.08e+04 - 8.01e-02 1.00e+0
0h 1
6 1.4673675e+04 6.05e-02 4.23e+01 -1.0 4.53e+01 - 4.37e-01 8.94e-0
2f 1
7 1.3327687e+04 2.86e-02 1.56e+01 -1.0 2.13e+01 - 6.21e-01 5.45e-0
1f 1
8 1.3017486e+04 4.21e-03 8.87e-01 -1.0 6.85e+00 - 9.49e-01 7.63e-0
1f 1
9 1.3264412e+04 1.26e-04 5.69e-02 -1.0 6.42e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2672550e+04 2.20e-03 8.22e-02 -2.5 3.95e+00 - 8.61e-01 8.47e-0
1f 1
11 1.2504071e+04 2.15e-03 3.45e-01 -2.5 8.59e-01 - 1.00e+00 7.80e-0
1f 1
12 1.2479357e+04 1.51e-04 4.63e-03 -2.5 1.73e-01 - 1.00e+00 1.00e+0
0h 1
13 1.2456714e+04 2.21e-05 3.94e-02 -3.8 5.36e+00 - 1.00e+00 8.88e-0
1h 1
14 1.2455033e+04 5.68e-08 6.01e-04 -3.8 5.99e-01 - 1.00e+00 1.00e+0
0f 1
15 1.2453577e+04 4.28e-08 3.91e-05 -5.7 2.97e-01 - 1.00e+00 9.98e-0
1f 1
16 1.2453579e+04 1.88e-12 1.19e-08 -5.7 4.73e-04 - 1.00e+00 1.00e+0
0f 1
17 1.2453562e+04 2.57e-12 3.30e-06 -8.6 3.68e-03 - 1.00e+00 9.99e-0
1f 1
18 1.2453562e+04 1.65e-15 4.88e-14 -8.6 2.01e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.2453562308190989e+01 1.2453562308190989e+0
4
Dual infeasibility......: 4.8769244288118723e-14 4.8769244288118723e-1
1
Constraint violation....: 1.6506469723974554e-15 1.6506469723974554e-1
5
Complementarity.........: 2.6472952209914127e-09 2.6472952209914128e-0
6
Overall NLP error.......: 2.6472952209914127e-09 2.6472952209914128e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3004760e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 2.02e-03 9.81e-0
3h 1
2 9.2458171e+02 9.19e+03 5.23e+01 -1.0 5.43e+03 - 9.22e-06 2.42e-0
4h 1
3 4.8777176e+02 8.97e+03 5.24e+01 -1.0 9.19e+03 - 1.48e-04 2.34e-0
2h 1
4 2.1819681e+04 7.02e-02 7.81e+01 -1.0 8.97e+03 - 5.74e-02 1.00e+0
0h 1
5 1.3648766e+04 6.51e-02 4.65e+01 -1.0 1.06e+01 - 3.92e-01 6.72e-0
2f 1
6 1.2329076e+04 2.50e-02 1.99e+01 -1.0 6.90e+00 - 6.37e-01 1.00e+0
0f 1
7 1.2710449e+04 1.46e-03 1.70e-01 -1.0 2.42e+00 - 9.91e-01 1.00e+0
0f 1
8 1.2188894e+04 1.73e-03 6.89e-02 -1.7 7.63e+00 - 1.00e+00 1.00e+0
0f 1
9 1.2015268e+04 1.99e-03 3.42e-01 -2.5 3.07e+00 - 1.00e+00 7.99e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1992853e+04 1.62e-04 4.13e-02 -2.5 6.14e-01 - 1.00e+00 9.45e-0
1h 1
11 1.1995752e+04 6.80e-06 1.22e-03 -2.5 3.36e-02 - 1.00e+00 1.00e+0
0f 1
12 1.1965916e+04 7.60e-06 4.28e-03 -3.8 1.07e+01 - 1.00e+00 9.79e-0
1f 1
13 1.1965656e+04 1.37e-08 6.29e-06 -3.8 2.27e-01 - 1.00e+00 1.00e+0
0f 1
14 1.1964018e+04 1.73e-08 3.04e-06 -5.7 5.94e-01 - 1.00e+00 1.00e+0
0f 1
15 1.1963999e+04 1.28e-12 4.22e-10 -8.6 7.36e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.1963999150399099e+01 1.1963999150399099e+0
4
Dual infeasibility......: 4.2179882247461384e-10 4.2179882247461384e-0
7
Constraint violation....: 1.2796291803951476e-12 1.2796291803951476e-1
2
Complementarity.........: 2.9784389847009885e-09 2.9784389847009885e-0
6
Overall NLP error.......: 2.9784389847009885e-09 2.9784389847009885e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2299660e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1994562e+02 6.71e+03 5.23e+01 -1.0 5.82e+03 - 3.44e-05 1.14e-0
4h 1
3 7.2850993e+02 6.64e+03 5.23e+01 -1.0 6.70e+03 - 1.95e-05 9.17e-0
3f 1
4 4.9339546e+02 6.50e+03 5.19e+01 -1.0 6.64e+03 - 1.16e-02 2.10e-0
2h 1
5 1.5628521e+04 8.10e-02 7.81e+01 -1.0 6.50e+03 - 8.90e-02 1.00e+0
0h 1
6 1.0636045e+04 7.19e-02 2.13e+01 -1.0 1.24e+01 - 7.05e-01 1.06e-0
1f 1
7 9.4596867e+03 2.23e-02 3.10e+00 -1.0 9.08e+00 - 8.57e-01 8.74e-0
1f 1
8 9.7561577e+03 1.77e-02 3.07e-01 -1.0 2.44e+00 - 9.02e-01 9.15e-0
1f 1
9 9.3857369e+03 3.09e-03 7.96e-01 -1.7 3.14e+00 - 5.67e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.3524984e+03 3.81e-04 6.04e-01 -1.7 6.02e+00 - 6.61e-01 1.00e+0
0h 1
11 9.3689861e+03 6.19e-05 1.87e-01 -1.7 1.10e+01 - 7.65e-01 1.00e+0
0h 1
12 9.2187001e+03 4.30e-04 1.79e-02 -2.5 1.19e+01 - 9.63e-01 9.33e-0
1f 1
13 9.1915901e+03 1.46e-04 1.94e-01 -3.8 1.05e+01 - 9.87e-01 7.22e-0
1h 1
14 9.1841521e+03 4.29e-07 3.46e-04 -3.8 3.08e+00 - 1.00e+00 1.00e+0
0h 1
15 9.1828158e+03 2.02e-08 4.18e-06 -5.7 2.98e-01 - 1.00e+00 1.00e+0
0h 1
16 9.1828008e+03 8.58e-13 5.04e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 9.1828007845077586e+00 9.1828007845077591e+0
3
Dual infeasibility......: 5.0389258794840655e-10 5.0389258794840655e-0
7
Constraint violation....: 8.5789708670347409e-13 8.5789708670347409e-1
3
Complementarity.........: 4.4509179573668912e-09 4.4509179573668913e-0
6
Overall NLP error.......: 4.4509179573668912e-09 4.4509179573668913e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8763965e+02 4.77e+03 5.24e+01 -1.0 4.81e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8260399e+02 4.77e+03 5.24e+01 -1.0 2.41e+03 - 2.49e-05 2.00e-0
4h 1
3 3.6148267e+02 4.66e+03 5.25e+01 -1.0 4.77e+03 - 1.13e-04 2.29e-0
2f 1
4 1.7124683e+04 6.19e-02 8.08e+01 -1.0 4.66e+03 - 3.33e-02 1.00e+0
0h 1
5 8.5486089e+03 5.88e-02 6.12e+01 -1.0 5.72e+01 - 2.41e-01 4.50e-0
2f 1
6 7.0753812e+03 2.53e-02 3.10e+01 -1.0 2.60e+01 - 4.97e-01 5.31e-0
1f 1
7 6.3654600e+03 1.22e-02 2.08e+00 -1.0 9.69e+00 - 9.28e-01 8.76e-0
1f 1
8 6.7815393e+03 4.09e-04 8.46e-02 -1.0 4.02e+00 - 9.96e-01 1.00e+0
0f 1
9 6.0144313e+03 2.22e-03 1.93e-01 -2.5 6.43e+00 - 8.66e-01 9.54e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.9436437e+03 1.05e-03 5.82e-01 -2.5 4.17e+00 - 1.00e+00 5.83e-0
1h 1
11 5.9490643e+03 3.19e-06 8.15e-03 -2.5 2.11e+00 - 1.00e+00 1.00e+0
0h 1
12 5.9232707e+03 5.19e-06 3.60e-02 -3.8 1.34e+01 - 9.18e-01 8.84e-0
1f 1
13 5.9189071e+03 4.66e-04 5.62e-04 -3.8 1.55e+00 - 1.00e+00 1.00e+0
0f 1
14 5.9173203e+03 6.38e-05 1.15e-02 -5.7 7.43e-01 - 8.12e-01 1.00e+0
0h 1
15 5.9172047e+03 3.63e-05 4.13e-05 -5.7 9.70e-03 - 1.00e+00 1.00e+0
0h 1
16 5.9172063e+03 1.59e-06 4.30e-05 -5.7 1.47e-03 - 1.00e+00 9.88e-0
1h 1
17 5.9172088e+03 3.53e-08 5.13e-07 -5.7 2.92e-04 - 1.00e+00 1.00e+0
0f 1
18 5.9171869e+03 3.96e-08 7.28e-06 -8.6 9.21e-03 - 9.97e-01 9.81e-0
1h 1
19 5.9171866e+03 5.33e-13 2.97e-11 -8.6 1.77e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 5.9171865534138419e+00 5.9171865534138415e+0
3
Dual infeasibility......: 2.9740953376860870e-11 2.9740953376860870e-0
8
Constraint violation....: 5.3346216333238772e-13 5.3346216333238772e-1
3
Complementarity.........: 3.2929862524064668e-09 3.2929862524064667e-0
6
Overall NLP error.......: 3.2929862524064668e-09 3.2929862524064667e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9478285e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3f 1
2 8.9187540e+02 3.24e+03 5.24e+01 -1.0 3.02e+03 - 9.14e-05 1.06e-0
4h 1
3 8.1655199e+02 3.23e+03 5.24e+01 -1.0 3.24e+03 - 1.38e-05 3.11e-0
3f 1
4 3.3910587e+02 3.16e+03 5.23e+01 -1.0 3.23e+03 - 4.64e-03 2.16e-0
2h 1
5 1.3760479e+04 6.81e-02 7.78e+01 -1.0 3.16e+03 - 8.37e-02 1.00e+0
0h 1
6 6.7546785e+03 6.11e-02 3.98e+01 -1.0 4.44e+01 - 4.66e-01 9.34e-0
2f 1
7 5.3864148e+03 2.95e-02 1.35e+01 -1.0 2.09e+01 - 6.49e-01 5.65e-0
1f 1
8 5.1381255e+03 3.48e-03 7.14e-01 -1.0 6.07e+00 - 9.54e-01 7.93e-0
1h 1
9 4.8058915e+03 9.07e-03 2.89e-01 -1.7 1.90e+00 - 1.00e+00 8.12e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.7469494e+03 1.26e-03 1.39e-01 -1.7 1.88e+01 - 1.00e+00 9.70e-0
1f 1
11 4.6212428e+03 4.91e-04 1.73e-01 -2.5 1.68e+01 - 9.48e-01 8.28e-0
1h 1
12 4.5986044e+03 6.65e-05 4.46e-03 -2.5 2.80e+00 - 1.00e+00 1.00e+0
0f 1
13 4.5763010e+03 1.58e-05 2.73e-02 -3.8 2.68e+00 - 1.00e+00 9.25e-0
1h 1
14 4.5756328e+03 4.87e-08 5.45e-04 -3.8 1.99e-01 - 1.00e+00 1.00e+0
0f 1
15 4.5743308e+03 4.26e-08 4.12e-04 -5.7 1.49e-01 - 1.00e+00 9.91e-0
1f 1
16 4.5743249e+03 1.95e-12 3.00e-08 -5.7 1.33e-03 - 1.00e+00 1.00e+0
0f 1
17 4.5743102e+03 2.58e-12 3.28e-06 -8.6 1.84e-03 - 1.00e+00 9.99e-0
1f 1
18 4.5743102e+03 5.46e-15 4.84e-14 -8.6 1.07e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 4.5743101935902200e+00 4.5743101935902196e+0
3
Dual infeasibility......: 4.8371440086076532e-14 4.8371440086076532e-1
1
Constraint violation....: 5.4569991416867648e-15 5.4569991416867648e-1
5
Complementarity.........: 2.5059125779723417e-09 2.5059125779723415e-0
6
Overall NLP error.......: 2.5059125779723417e-09 2.5059125779723415e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8038781e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.82e-0
3h 1
2 8.7404419e+02 2.00e+03 5.24e+01 -1.0 1.17e+03 - 4.28e-05 2.39e-0
4h 1
3 2.9382745e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 1.65e-04 2.27e-0
2f 1
4 1.4249786e+04 6.10e-02 7.92e+01 -1.0 1.95e+03 - 5.51e-02 1.00e+0
0h 1
5 5.5512989e+03 5.67e-02 5.34e+01 -1.0 6.55e+01 - 3.14e-01 6.40e-0
2f 1
6 4.1927553e+03 3.11e-02 2.64e+01 -1.0 3.24e+01 - 4.94e-01 4.18e-0
1f 1
7 3.3769719e+03 1.34e-02 2.16e+00 -1.0 1.11e+01 - 9.19e-01 9.25e-0
1f 1
8 3.8285990e+03 4.08e-04 1.02e-01 -1.0 5.01e+00 - 9.96e-01 1.00e+0
0f 1
9 3.1627494e+03 1.16e-03 1.28e+00 -1.7 5.10e+01 - 2.98e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.2134404e+03 9.91e-06 1.36e-02 -1.7 1.93e+01 - 1.00e+00 1.00e+0
0h 1
11 3.0876143e+03 3.05e-05 3.85e-01 -2.5 6.28e+01 - 1.00e+00 7.92e-0
1f 1
12 3.0663428e+03 1.06e-04 4.77e-03 -2.5 1.26e+01 - 1.00e+00 1.00e+0
0f 1
13 3.0436286e+03 2.77e-04 8.68e-02 -3.8 1.07e+01 - 7.71e-01 1.00e+0
0h 1
14 3.0408841e+03 1.61e-03 2.08e-03 -3.8 3.64e-02 - 9.71e-01 1.00e+0
0h 1
15 3.0409241e+03 7.55e-05 6.61e-05 -3.8 1.18e-02 - 1.00e+00 1.00e+0
0h 1
16 3.0392738e+03 1.31e-04 1.11e-03 -5.7 5.94e-01 - 9.18e-01 1.00e+0
0h 1
17 3.0392321e+03 3.28e-05 6.74e-06 -5.7 8.43e-03 - 1.00e+00 1.00e+0
0h 1
18 3.0392377e+03 1.93e-07 3.46e-06 -5.7 6.32e-04 - 1.00e+00 1.00e+0
0h 1
19 3.0392192e+03 2.64e-08 3.36e-05 -8.6 7.37e-03 - 1.00e+00 9.57e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 3.0392184e+03 4.51e-12 5.22e-11 -8.6 3.18e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 3.0392183941223339e+00 3.0392183941223338e+0
3
Dual infeasibility......: 5.2198823722335506e-11 5.2198823722335506e-0
8
Constraint violation....: 4.5087267253052232e-12 4.5087267253052232e-1
2
Complementarity.........: 3.7973873086661995e-09 3.7973873086661994e-0
6
Overall NLP error.......: 3.7973873086661995e-09 3.7973873086661994e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2329662e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 3.31e-04 9.85e-0
3h 1
2 8.1338739e+02 9.17e+02 5.24e+01 -1.0 6.65e+02 - 7.53e-05 3.59e-0
4h 1
3 2.4215012e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 3.16e-04 2.12e-0
2f 1
4 1.2572829e+04 5.49e-02 8.23e+01 -1.0 8.98e+02 - 3.81e-02 1.00e+0
0h 1
5 3.9012337e+03 5.24e-02 5.73e+01 -1.0 8.21e+01 - 3.02e-01 4.95e-0
2f 1
6 1.9122630e+03 3.74e-02 3.08e+01 -1.0 3.92e+01 - 4.67e-01 5.07e-0
1f 1
7 4.6985285e+03 1.23e-02 2.74e+01 -1.0 2.08e+01 - 3.98e-01 1.00e+0
0h 1
8 1.8769618e+03 1.22e-02 1.07e+00 -1.0 2.57e+01 - 9.87e-01 8.88e-0
1f 1
9 1.9956227e+03 2.03e-04 4.84e-02 -1.0 2.76e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7291248e+03 2.21e-04 1.23e+00 -2.5 1.88e+01 - 9.37e-01 5.95e-0
1f 1
11 1.5409848e+03 3.77e-03 1.32e-01 -2.5 7.58e+00 - 7.96e-01 1.00e+0
0f 1
12 1.5181170e+03 5.06e-03 3.08e-01 -2.5 1.81e+00 - 1.00e+00 7.68e-0
1h 1
13 1.5303991e+03 2.38e-04 4.69e-03 -2.5 7.19e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5028095e+03 1.70e-04 2.15e-02 -3.8 1.08e+01 - 9.90e-01 9.29e-0
1h 1
15 1.5018205e+03 7.26e-07 6.85e-05 -3.8 7.35e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003124e+03 3.77e-07 1.78e-04 -5.7 5.94e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003117e+03 3.79e-11 2.92e-09 -5.7 4.21e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932751767062e+00 1.5002932751767062e+0
3
Dual infeasibility......: 2.1737238631945786e-09 2.1737238631945786e-0
6
Constraint violation....: 6.2995733629556128e-11 6.2995733629556128e-1
1
Complementarity.........: 2.8882174480583091e-09 2.8882174480583092e-0
6
Overall NLP error.......: 2.8882174480583091e-09 2.8882174480583092e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.27e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9796476e+02 4.09e+01 5.94e+01 -1.0 1.42e+01 - 6.99e-04 4.23e-0
2f 1
2 1.2226497e+04 6.07e-02 7.87e+01 -1.0 1.80e+01 - 7.07e-02 1.00e+0
0h 1
3 3.6201835e+03 5.54e-02 5.15e+01 -1.0 5.45e+01 - 3.33e-01 7.87e-0
2f 1
4 2.3523816e+03 2.93e-02 2.28e+01 -1.0 2.70e+01 - 5.45e-01 4.46e-0
1f 1
5 1.7571777e+03 8.49e-03 1.17e+00 -1.0 9.96e+00 - 9.27e-01 7.68e-0
1f 1
6 2.0298807e+03 3.42e-04 8.15e-02 -1.0 3.35e+00 - 1.00e+00 1.00e+0
0h 1
7 1.4033467e+03 2.08e-03 8.15e-02 -2.5 4.87e+00 - 8.66e-01 8.50e-0
1f 1
8 1.2236690e+03 2.16e-03 2.06e-01 -2.5 1.05e+00 - 1.00e+00 8.33e-0
1f 1
9 1.2066826e+03 8.65e-05 3.81e-03 -2.5 1.49e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1969337e+03 4.61e-05 1.08e+00 -3.8 9.70e-02 - 1.00e+00 4.99e-0
1h 1
11 1.1949898e+03 3.31e-07 1.13e-01 -3.8 3.83e-02 - 9.68e-01 1.00e+0
0f 1
12 1.1939532e+03 1.38e-08 1.76e-03 -3.8 3.31e-02 - 1.00e+00 1.00e+0
0H 1
13 1.1941500e+03 1.10e-05 2.71e-04 -3.8 3.66e-03 - 1.00e+00 1.00e+0
0f 1
14 1.1935298e+03 1.78e-06 6.37e-02 -5.7 1.23e-02 - 7.78e-01 9.68e-0
1h 1
15 1.1933618e+03 1.24e-05 2.14e-04 -5.7 5.02e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1933679e+03 2.91e-08 2.24e-06 -5.7 2.67e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1933546e+03 2.76e-08 9.72e-06 -8.6 2.46e-04 - 9.82e-01 9.89e-0
1h 1
18 1.1933545e+03 2.43e-13 3.27e-11 -8.6 1.97e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1933545103949155e+00 1.1933545103949155e+0
3
Dual infeasibility......: 3.2687086667630814e-11 3.2687086667630814e-0
8
Constraint violation....: 2.4291679778798425e-13 2.4291679778798425e-1
3
Complementarity.........: 2.5120650510416463e-09 2.5120650510416461e-0
6
Overall NLP error.......: 2.5120650510416463e-09 2.5120650510416461e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1584843e+02 1.09e+02 1.13e+02 -1.0 3.76e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1398692e+04 5.38e-02 8.36e+01 -1.0 4.53e+01 - 3.10e-02 1.00e+0
0h 1
3 2.7848918e+03 5.17e-02 6.48e+01 -1.0 8.43e+01 - 2.27e-01 4.32e-0
2f 1
4 9.8155788e+02 4.24e-02 3.38e+01 -1.0 3.41e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5909726e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.21e-01 1.00e+0
0h 1
6 9.4491032e+02 1.01e-02 8.73e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6264865e+02 4.59e-04 6.60e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536469e+02 1.94e-03 1.94e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379741e+02 3.25e-03 6.12e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140235e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388164e+02 1.57e-04 1.69e-02 -3.8 7.57e-01 - 9.93e-01 9.41e-0
1h 1
12 5.8370191e+02 7.28e-07 6.65e-05 -3.8 8.63e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278679e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.06e-09 -5.7 3.41e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148935407e-01 5.8277753148935403e+0
2
Dual infeasibility......: 2.0880540100627738e-09 2.0880540100627738e-0
6
Constraint violation....: 6.2994123806170421e-11 6.2994123806170421e-1
1
Complementarity.........: 2.8882094461568119e-09 2.8882094461568120e-0
6
Overall NLP error.......: 2.8882094461568119e-09 2.8882094461568120e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.77e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5003663e+02 7.50e+01 9.04e+01 -1.0 2.59e+01 - 3.83e-04 3.52e-0
2f 1
2 1.1818872e+04 5.63e-02 8.12e+01 -1.0 2.87e+01 - 4.64e-02 1.00e+0
0h 1
3 3.1585745e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.65e-0
2f 1
4 1.0154811e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8148885e+03 7.28e-03 1.55e+01 -1.0 1.93e+01 - 6.11e-01 1.00e+0
0h 1
6 1.1196678e+03 5.40e-03 4.04e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8244219e+02 9.99e-04 2.10e-01 -1.7 5.71e+00 - 1.00e+00 8.87e-0
1h 1
8 7.2817524e+02 8.46e-04 1.35e-02 -1.7 3.45e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0982262e+02 1.50e-03 1.13e-01 -3.8 4.49e+00 - 7.71e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8216109e+02 2.17e-03 7.23e-02 -3.8 2.11e+00 - 8.07e-01 7.40e-0
1h 1
11 5.8336684e+02 9.52e-05 4.78e-02 -3.8 3.17e-02 - 1.00e+00 9.56e-0
1h 1
12 5.8368716e+02 2.82e-07 1.33e-05 -3.8 3.28e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278928e+02 4.12e-07 5.39e-04 -5.7 3.47e-02 - 1.00e+00 9.91e-0
1h 1
14 5.8278859e+02 4.36e-11 3.52e-09 -5.7 2.10e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.65e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753111572472e-01 5.8277753111572474e+0
2
Dual infeasibility......: 2.6503284114663836e-09 2.6503284114663836e-0
6
Constraint violation....: 6.3002256189825800e-11 6.3002256189825800e-1
1
Complementarity.........: 2.8882681478294200e-09 2.8882681478294199e-0
6
Overall NLP error.......: 2.8882681478294200e-09 2.8882681478294199e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.27e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9796476e+02 4.09e+01 5.94e+01 -1.0 1.42e+01 - 6.99e-04 4.23e-0
2f 1
2 1.2226497e+04 6.07e-02 7.87e+01 -1.0 1.80e+01 - 7.07e-02 1.00e+0
0h 1
3 3.6201835e+03 5.54e-02 5.15e+01 -1.0 5.45e+01 - 3.33e-01 7.87e-0
2f 1
4 2.3523816e+03 2.93e-02 2.28e+01 -1.0 2.70e+01 - 5.45e-01 4.46e-0
1f 1
5 1.7571777e+03 8.49e-03 1.17e+00 -1.0 9.96e+00 - 9.27e-01 7.68e-0
1f 1
6 2.0298807e+03 3.42e-04 8.15e-02 -1.0 3.35e+00 - 1.00e+00 1.00e+0
0h 1
7 1.4033467e+03 2.08e-03 8.15e-02 -2.5 4.87e+00 - 8.66e-01 8.50e-0
1f 1
8 1.2236690e+03 2.16e-03 2.06e-01 -2.5 1.05e+00 - 1.00e+00 8.33e-0
1f 1
9 1.2066826e+03 8.65e-05 3.81e-03 -2.5 1.49e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1969337e+03 4.61e-05 1.08e+00 -3.8 9.70e-02 - 1.00e+00 4.99e-0
1h 1
11 1.1949898e+03 3.31e-07 1.13e-01 -3.8 3.83e-02 - 9.68e-01 1.00e+0
0f 1
12 1.1939532e+03 1.38e-08 1.76e-03 -3.8 3.31e-02 - 1.00e+00 1.00e+0
0H 1
13 1.1941500e+03 1.10e-05 2.71e-04 -3.8 3.66e-03 - 1.00e+00 1.00e+0
0f 1
14 1.1935298e+03 1.78e-06 6.37e-02 -5.7 1.23e-02 - 7.78e-01 9.68e-0
1h 1
15 1.1933618e+03 1.24e-05 2.14e-04 -5.7 5.02e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1933679e+03 2.91e-08 2.24e-06 -5.7 2.67e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1933546e+03 2.76e-08 9.72e-06 -8.6 2.46e-04 - 9.82e-01 9.89e-0
1h 1
18 1.1933545e+03 2.43e-13 3.27e-11 -8.6 1.97e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1933545103949155e+00 1.1933545103949155e+0
3
Dual infeasibility......: 3.2687086667630814e-11 3.2687086667630814e-0
8
Constraint violation....: 2.4291679778798425e-13 2.4291679778798425e-1
3
Complementarity.........: 2.5120650510416463e-09 2.5120650510416461e-0
6
Overall NLP error.......: 2.5120650510416463e-09 2.5120650510416461e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2303900e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 3.31e-04 9.86e-0
3h 1
2 8.1078909e+02 9.17e+02 5.24e+01 -1.0 7.14e+02 - 8.39e-05 4.45e-0
4h 1
3 7.5268194e+02 9.15e+02 5.24e+01 -1.0 9.17e+02 - 4.04e-04 2.16e-0
3h 1
4 2.4713900e+02 8.96e+02 5.25e+01 -1.0 9.15e+02 - 2.70e-03 2.06e-0
2f 1
5 1.1254750e+04 5.74e-02 8.26e+01 -1.0 8.96e+02 - 4.22e-02 1.00e+0
0h 1
6 3.7806374e+03 5.41e-02 4.69e+01 -1.0 7.19e+01 - 4.26e-01 5.51e-0
2f 1
7 1.8945181e+03 3.70e-02 2.37e+01 -1.0 3.93e+01 - 4.94e-01 4.93e-0
1f 1
8 3.7725233e+03 8.28e-03 1.64e+01 -1.0 1.33e+01 - 5.36e-01 1.00e+0
0h 1
9 1.9501729e+03 4.86e-03 3.37e-01 -1.0 1.50e+01 - 9.88e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6784931e+03 4.24e-04 7.89e-02 -1.7 8.02e+00 - 1.00e+00 1.00e+0
0f 1
11 1.5546385e+03 2.14e-03 2.18e-01 -2.5 5.84e+00 - 7.49e-01 1.00e+0
0f 1
12 1.5216478e+03 3.05e-03 4.53e-02 -2.5 2.00e+00 - 1.00e+00 9.63e-0
1h 1
13 1.5308032e+03 1.53e-04 3.68e-03 -2.5 8.66e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5024599e+03 1.70e-04 1.82e-02 -3.8 1.11e+01 - 9.94e-01 9.39e-0
1h 1
15 1.5018189e+03 6.56e-07 6.92e-05 -3.8 4.85e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003120e+03 3.79e-07 1.86e-04 -5.7 5.95e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003117e+03 3.85e-11 3.01e-09 -5.7 7.20e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0h 1
1 8.6555974e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 4.97e-04 9.86e-0
3h 1
2 8.5244446e+02 9.17e+02 5.24e+01 -1.0 7.30e+02 - 8.21e-05 4.84e-0
4h 1
3 7.8829237e+02 9.15e+02 5.24e+01 -1.0 9.17e+02 - 4.42e-04 2.41e-0
3h 1
4 2.6739293e+02 8.95e+02 5.24e+01 -1.0 9.15e+02 - 3.00e-03 2.14e-0
2f 1
5 1.1543503e+04 6.25e-02 8.04e+01 -1.0 8.95e+02 - 5.69e-02 1.00e+0
0h 1
56 1.518563e+04 1.632511e+04 4.771808e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1154264e+02 1.57e+04 5.50e+01 -1.0 1.59e+04 - 1.75e-04 9.80e-0
3h 1
2 7.0856659e+02 1.57e+04 5.50e+01 -1.0 1.38e+04 - 2.58e-05 1.13e-0
4h 1
3 7.0483062e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 1.70e-05 3.01e-0
4h 1
4 6.9978213e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 3.16e-04 4.22e-0
4h 1
5 4.9149385e+02 1.54e+04 5.39e+01 -1.0 1.57e+04 - 7.94e-04 1.90e-0
2f 1
6 2.6171906e+04 7.61e-02 8.68e+01 -1.0 1.54e+04 - 2.55e-02 1.00e+0
0h 1
7 1.7886961e+04 7.32e-02 7.29e+01 -1.0 7.22e+01 - 1.70e-01 4.01e-0
2f 1
8 1.6629538e+04 4.64e-02 3.37e+01 -1.0 1.97e+01 - 5.31e-01 3.77e-0
1f 1
9 1.7129718e+04 3.52e-02 2.06e+01 -1.0 1.34e+01 - 5.66e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6801152e+04 7.47e-03 1.21e+00 -1.0 1.36e+00 - 9.17e-01 1.00e+0
0h 1
11 1.6816288e+04 1.98e-04 1.97e+00 -1.0 3.69e+00 - 1.92e-01 1.00e+0
0f 1
12 1.6825161e+04 5.88e-06 7.66e-01 -1.0 3.72e+00 - 6.32e-01 1.00e+0
0f 1
13 1.6527987e+04 2.31e-04 3.37e-01 -1.7 4.73e+00 - 8.94e-01 8.09e-0
1f 1
14 1.6484315e+04 6.04e-04 2.40e-01 -1.7 1.27e+01 - 6.37e-01 1.00e+0
0f 1
15 1.6492010e+04 5.25e-05 3.11e-02 -1.7 1.72e+01 - 8.71e-01 1.00e+0
0h 1
16 1.6361470e+04 9.67e-04 4.31e-02 -2.5 3.48e+01 - 9.30e-01 1.00e+0
0f 1
17 1.6345460e+04 1.05e-03 1.11e-02 -2.5 2.55e+00 - 1.00e+00 1.00e+0
0h 1
18 1.6327814e+04 1.74e-04 8.05e-02 -3.8 6.08e+00 - 1.00e+00 8.58e-0
1h 1
19 1.6326333e+04 5.82e-07 9.54e-05 -3.8 5.97e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325117e+04 4.00e-07 1.04e-04 -5.7 2.97e-01 - 1.00e+00 9.98e-0
1h 1
21 1.6325119e+04 3.81e-11 3.00e-09 -5.7 3.12e-03 - 1.00e+00 1.00e+0
0f 1
22 1.6325107e+04 4.24e-11 1.00e-04 -8.6 3.34e-03 - 1.00e+00 8.36e-0
1h 1
23 1.6325105e+04 1.70e-12 5.53e-11 -8.6 1.19e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 23
(scaled) (unscaled)
Objective...............: 1.6325105276131445e+01 1.6325105276131446e+0
4
Dual infeasibility......: 5.5267670207512441e-11 5.5267670207512441e-0
8
Constraint violation....: 1.6959211812661579e-12 1.6959211812661579e-1
2
Complementarity.........: 3.1664228128103583e-09 3.1664228128103582e-0
6
Overall NLP error.......: 3.1664228128103583e-09 3.1664228128103582e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 24
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 24
Number of inequality constraint Jacobian evaluations = 24
Number of Lagrangian Hessian evaluations = 23
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9877765e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.75e-04 9.80e-0
3f 1
2 7.9594573e+02 1.50e+04 5.25e+01 -1.0 1.48e+04 - 9.50e-05 1.00e-0
4h 1
3 7.8822492e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 2.83e-06 5.81e-0
4f 1
4 5.2752121e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 6.20e-04 2.05e-0
2h 1
5 2.6253732e+04 5.40e-02 8.35e+01 -1.0 1.47e+04 - 3.33e-02 1.00e+0
0h 1
6 1.7740945e+04 5.18e-02 6.25e+01 -1.0 8.08e+01 - 2.54e-01 4.58e-0
2f 1
7 1.5953616e+04 4.21e-02 3.23e+01 -1.0 3.42e+01 - 4.83e-01 4.72e-0
1f 1
8 1.6276562e+04 2.59e-02 1.44e+01 -1.0 1.84e+01 - 4.26e-01 1.25e-0
1f 4
9 1.6018222e+04 6.13e-03 1.70e-01 -1.0 5.20e+00 - 9.91e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5734746e+04 1.24e-03 2.90e-01 -1.7 4.59e+00 - 1.00e+00 8.63e-0
1f 1
11 1.5709282e+04 7.80e-04 1.14e-02 -1.7 1.61e+01 - 1.00e+00 1.00e+0
0f 1
12 1.5584059e+04 1.34e-03 9.04e-02 -3.8 1.99e+01 - 7.98e-01 9.32e-0
1f 1
13 1.5559896e+04 1.49e-03 6.50e-02 -3.8 1.70e+00 - 8.48e-01 7.71e-0
1h 1
14 1.5560164e+04 2.75e-06 7.51e-04 -3.8 3.08e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5559221e+04 3.13e-07 6.18e-04 -5.7 1.49e-01 - 1.00e+00 9.88e-0
1h 1
16 1.5559215e+04 3.93e-11 6.23e-09 -5.7 1.97e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5559202e+04 6.30e-11 2.10e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5559202147630357e+01 1.5559202147630356e+0
4
Dual infeasibility......: 2.0959894011883750e-09 2.0959894011883750e-0
6
Constraint violation....: 6.2996066696463515e-11 6.2996066696463515e-1
1
Complementarity.........: 2.8881080690952838e-09 2.8881080690952839e-0
6
Overall NLP error.......: 2.8881080690952838e-09 2.8881080690952839e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4409023e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.92e-04 9.80e-0
3f 1
2 8.4128602e+02 1.39e+04 5.24e+01 -1.0 1.37e+04 - 9.29e-05 1.01e-0
4h 1
3 8.3223764e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 3.09e-06 6.42e-0
4f 1
4 5.3903606e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 6.89e-04 2.15e-0
2h 1
5 2.5524701e+04 5.72e-02 8.12e+01 -1.0 1.36e+04 - 4.53e-02 1.00e+0
0h 1
6 1.7022297e+04 5.37e-02 5.25e+01 -1.0 7.99e+01 - 3.46e-01 5.59e-0
2f 1
7 1.4909719e+04 3.42e-02 2.85e+01 -1.0 4.22e+01 - 4.65e-01 5.33e-0
1f 1
8 1.5382585e+04 1.84e-02 7.96e+00 -1.0 2.05e+01 - 5.93e-01 2.50e-0
1f 3
9 1.5064013e+04 5.25e-03 5.45e-01 -1.0 6.13e+00 - 9.52e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4709829e+04 1.46e-03 5.12e-01 -1.7 6.60e+00 - 1.00e+00 7.86e-0
1f 1
11 1.4650670e+04 7.05e-04 2.55e-02 -1.7 1.84e+01 - 1.00e+00 1.00e+0
0f 1
12 1.4510506e+04 1.45e-03 1.16e-01 -3.8 1.99e+01 - 7.66e-01 9.24e-0
1f 1
13 1.4479293e+04 2.48e-03 5.59e-02 -3.8 2.23e+00 - 8.16e-01 7.61e-0
1h 1
14 1.4480759e+04 1.87e-04 7.98e-02 -3.8 3.54e-01 - 1.00e+00 9.38e-0
1h 1
15 1.4481114e+04 4.05e-07 1.77e-05 -3.8 3.25e-02 - 1.00e+00 1.00e+0
0f 1
16 1.4480069e+04 4.15e-07 9.96e-04 -5.7 1.49e-01 - 1.00e+00 9.87e-0
1h 1
17 1.4480065e+04 4.53e-11 4.86e-09 -5.7 5.04e-03 - 1.00e+00 1.00e+0
0f 1
18 1.4480052e+04 6.30e-11 3.21e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.4480051775668734e+01 1.4480051775668733e+0
4
Dual infeasibility......: 3.2061062829392293e-09 3.2061062829392293e-0
6
Constraint violation....: 6.3005600736687484e-11 6.3005600736687484e-1
1
Complementarity.........: 2.9185370939038791e-09 2.9185370939038789e-0
6
Overall NLP error.......: 3.2061062829392293e-09 3.2061062829392293e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.7934763e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.86e-04 9.80e-0
3h 1
2 8.7651706e+02 1.27e+04 5.24e+01 -1.0 1.20e+04 - 4.36e-05 1.05e-0
4h 1
3 8.3441899e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 8.15e-06 2.81e-0
3h 1
4 5.5616195e+02 1.23e+04 5.24e+01 -1.0 1.26e+04 - 3.06e-03 2.14e-0
2h 1
5 2.3588136e+04 6.39e-02 7.96e+01 -1.0 1.23e+04 - 6.18e-02 1.00e+0
0h 1
6 1.6046880e+04 5.88e-02 4.85e+01 -1.0 6.03e+01 - 3.75e-01 7.21e-0
2f 1
7 1.4674867e+04 3.11e-02 2.21e+01 -1.0 3.18e+01 - 5.32e-01 4.33e-0
1f 1
8 1.4026011e+04 8.99e-03 1.62e+00 -1.0 1.07e+01 - 9.22e-01 8.91e-0
1f 1
9 1.4382140e+04 1.96e-04 6.32e-02 -1.0 4.55e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3744483e+04 1.20e-03 1.88e-01 -2.5 6.20e+00 - 8.77e-01 7.96e-0
1f 1
11 1.3713104e+04 2.37e-05 8.48e-02 -2.5 7.76e-01 - 9.84e-01 1.00e+0
0h 1
12 1.3691966e+04 5.51e-04 3.88e-03 -2.5 9.03e-01 - 1.00e+00 1.00e+0
0h 1
13 1.3676584e+04 1.93e-04 6.42e-02 -3.8 5.36e+00 - 8.35e-01 9.99e-0
1h 1
14 1.3674120e+04 1.38e-03 1.56e-03 -3.8 3.50e-02 - 1.00e+00 1.00e+0
0f 1
15 1.3674177e+04 4.19e-05 4.21e-05 -3.8 8.81e-03 - 1.00e+00 1.00e+0
0h 1
16 1.3672812e+04 1.28e-04 8.06e-04 -5.7 2.97e-01 - 9.28e-01 1.00e+0
0h 1
17 1.3672773e+04 2.93e-05 5.60e-06 -5.7 7.91e-03 - 1.00e+00 1.00e+0
0h 1
18 1.3672778e+04 1.04e-07 3.05e-06 -5.7 4.59e-04 - 1.00e+00 1.00e+0
0h 1
19 1.3672763e+04 2.44e-08 5.17e-05 -8.6 3.68e-03 - 1.00e+00 9.48e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.3672762e+04 6.96e-12 8.99e-11 -8.6 1.92e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.3672762395503513e+01 1.3672762395503512e+0
4
Dual infeasibility......: 8.9949242401300779e-11 8.9949242401300783e-0
8
Constraint violation....: 6.9597660967701813e-12 6.9597660967701813e-1
2
Complementarity.........: 2.8852092792800670e-09 2.8852092792800670e-0
6
Overall NLP error.......: 2.8852092792800670e-09 2.8852092792800670e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2301164e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.51e-03 9.80e-0
3h 1
2 9.1989531e+02 1.11e+04 5.23e+01 -1.0 9.02e+03 - 1.92e-05 1.22e-0
4h 1
3 5.4989472e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 2.65e-05 2.25e-0
2h 1
4 2.1102483e+04 7.45e-02 7.98e+01 -1.0 1.09e+04 - 2.67e-02 1.00e+0
0h 1
5 1.5432122e+04 7.15e-02 5.55e+01 -1.0 2.13e+01 - 2.97e-01 3.84e-0
2f 1
6 1.4303812e+04 1.35e-02 2.41e+01 -1.0 1.11e+01 - 5.91e-01 7.46e-0
1f 1
7 1.4153594e+04 8.15e-03 2.49e-01 -1.0 1.97e+00 - 9.90e-01 1.00e+0
0f 1
8 1.3803441e+04 1.55e-03 3.88e-01 -1.7 4.96e+00 - 7.84e-01 1.00e+0
0f 1
9 1.3790607e+04 5.90e-04 8.27e-01 -1.7 1.62e+01 - 5.27e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3800433e+04 6.39e-06 1.71e-01 -1.7 1.81e+01 - 7.31e-01 1.00e+0
0h 1
11 1.3640645e+04 4.23e-04 2.23e-02 -2.5 2.39e+01 - 9.70e-01 9.38e-0
1f 1
12 1.3610691e+04 1.40e-04 1.98e-01 -3.8 1.66e+01 - 9.85e-01 7.20e-0
1h 1
13 1.3601754e+04 4.23e-07 3.14e-04 -3.8 4.81e+00 - 1.00e+00 1.00e+0
0h 1
14 1.3600269e+04 2.00e-08 4.34e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3600252e+04 8.12e-13 4.88e-10 -8.6 5.52e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.3600252145216826e+01 1.3600252145216826e+0
4
Dual infeasibility......: 4.8783660998544145e-10 4.8783660998544145e-0
7
Constraint violation....: 8.1241957605726611e-13 8.1241957605726611e-1
3
Complementarity.........: 3.6186412117803483e-09 3.6186412117803482e-0
6
Overall NLP error.......: 3.6186412117803483e-09 3.6186412117803482e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3006359e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 2.02e-03 9.80e-0
3h 1
2 9.2722762e+02 9.19e+03 5.23e+01 -1.0 8.88e+03 - 6.77e-05 1.02e-0
4h 1
3 9.0058749e+02 9.18e+03 5.23e+01 -1.0 9.18e+03 - 5.63e-06 1.42e-0
3f 1
4 4.9463665e+02 8.97e+03 5.24e+01 -1.0 9.18e+03 - 1.64e-03 2.27e-0
2h 1
5 2.1164031e+04 7.23e-02 7.69e+01 -1.0 8.97e+03 - 7.85e-02 1.00e+0
0h 1
6 1.3562973e+04 6.54e-02 2.35e+01 -1.0 8.38e+00 - 6.64e-01 8.73e-0
2f 1
7 1.2324131e+04 3.29e-02 9.64e+00 -1.0 7.01e+00 - 6.84e-01 1.00e+0
0f 1
8 1.2476105e+04 1.68e-02 6.52e-01 -1.0 2.39e+00 - 9.95e-01 4.91e-0
1f 2
9 1.2182671e+04 6.71e-03 2.78e-01 -1.7 9.98e+00 - 1.00e+00 8.44e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2122153e+04 1.23e-03 8.86e-02 -1.7 1.11e+01 - 1.00e+00 1.00e+0
0f 1
11 1.1995228e+04 3.35e-04 9.60e-02 -2.5 1.72e+01 - 9.85e-01 8.95e-0
1f 1
12 1.1986791e+04 4.66e-06 1.02e-03 -2.5 1.79e+00 - 1.00e+00 1.00e+0
0f 1
13 1.1965361e+04 5.87e-06 5.32e-03 -3.8 2.68e+00 - 1.00e+00 9.75e-0
1f 1
14 1.1965205e+04 1.30e-08 6.21e-06 -3.8 6.52e-02 - 1.00e+00 1.00e+0
0f 1
15 1.1964013e+04 1.73e-08 3.04e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0f 1
16 1.1963999e+04 1.28e-12 4.22e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.1963999146608767e+01 1.1963999146608767e+0
4
Dual infeasibility......: 4.2180166556950041e-10 4.2180166556950041e-0
7
Constraint violation....: 1.2797402026976101e-12 1.2797402026976101e-1
2
Complementarity.........: 2.5909993213620254e-09 2.5909993213620255e-0
6
Overall NLP error.......: 2.5909993213620254e-09 2.5909993213620255e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2299660e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1994562e+02 6.71e+03 5.23e+01 -1.0 5.82e+03 - 3.44e-05 1.14e-0
4h 1
3 7.2850976e+02 6.64e+03 5.23e+01 -1.0 6.70e+03 - 1.95e-05 9.17e-0
3f 1
4 4.9339555e+02 6.50e+03 5.19e+01 -1.0 6.64e+03 - 1.16e-02 2.10e-0
2h 1
5 1.5628519e+04 8.10e-02 7.81e+01 -1.0 6.50e+03 - 8.90e-02 1.00e+0
0h 1
6 1.0636045e+04 7.19e-02 2.13e+01 -1.0 1.24e+01 - 7.05e-01 1.06e-0
1f 1
7 9.4596865e+03 2.23e-02 3.10e+00 -1.0 9.08e+00 - 8.57e-01 8.74e-0
1f 1
8 9.7561577e+03 1.77e-02 1.81e-01 -1.0 2.44e+00 - 9.53e-01 9.15e-0
1f 1
9 9.3908533e+03 3.05e-03 1.08e+00 -1.7 6.08e+00 - 4.20e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.3605965e+03 2.89e-04 5.36e-01 -1.7 7.90e+00 - 7.26e-01 1.00e+0
0h 1
11 9.3766041e+03 1.01e-04 9.39e-02 -1.7 1.32e+01 - 8.78e-01 1.00e+0
0f 1
12 9.2148055e+03 4.69e-04 1.86e-02 -2.5 2.12e+01 - 9.65e-01 9.47e-0
1f 1
13 9.1907261e+03 1.54e-04 2.07e-01 -3.8 8.59e+00 - 9.91e-01 7.17e-0
1h 1
14 9.1841527e+03 3.90e-07 3.57e-04 -3.8 2.46e+00 - 1.00e+00 1.00e+0
0h 1
15 9.1828158e+03 2.00e-08 4.19e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
16 9.1828008e+03 8.58e-13 5.04e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 9.1828007855769567e+00 9.1828007855769556e+0
3
Dual infeasibility......: 5.0419633962867181e-10 5.0419633962867181e-0
7
Constraint violation....: 8.5835505370113196e-13 8.5835505370113196e-1
3
Complementarity.........: 4.3209593758736964e-09 4.3209593758736962e-0
6
Overall NLP error.......: 4.3209593758736964e-09 4.3209593758736962e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2995079e+02 4.77e+03 5.23e+01 -1.0 4.81e+03 - 1.63e-03 9.81e-0
3h 1
2 6.9888330e+02 4.72e+03 5.23e+01 -1.0 4.73e+03 - 1.48e-05 1.03e-0
2h 1
3 4.5373359e+02 4.62e+03 5.18e+01 -1.0 4.72e+03 - 1.28e-02 2.13e-0
2h 1
4 1.3648607e+04 8.51e-02 8.15e+01 -1.0 4.62e+03 - 4.86e-02 1.00e+0
0h 1
5 8.9577797e+03 7.90e-02 5.18e+01 -1.0 1.77e+01 - 3.58e-01 6.93e-0
2f 1
6 8.0468238e+03 2.81e-02 1.49e+01 -1.0 1.14e+01 - 7.08e-01 6.42e-0
1f 1
7 8.1038231e+03 8.16e-03 1.55e-01 -1.0 2.34e+00 - 9.91e-01 1.00e+0
0f 1
8 7.7463403e+03 1.27e-03 1.17e-01 -1.7 9.56e+00 - 9.45e-01 1.00e+0
0f 1
9 7.6055902e+03 1.52e-03 1.55e-01 -2.5 4.13e+00 - 8.70e-01 7.90e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.5810718e+03 2.58e-04 8.18e-02 -2.5 3.21e+00 - 1.00e+00 8.87e-0
1f 1
11 7.5840941e+03 8.46e-06 2.24e-03 -2.5 6.23e-01 - 1.00e+00 1.00e+0
0f 1
12 7.5487880e+03 8.14e-06 3.77e-03 -3.8 1.61e+01 - 1.00e+00 9.81e-0
1f 1
13 7.5485056e+03 1.39e-08 6.10e-06 -3.8 2.94e-01 - 1.00e+00 1.00e+0
0f 1
14 7.5465704e+03 1.73e-08 3.04e-06 -5.7 8.92e-01 - 1.00e+00 1.00e+0
0f 1
15 7.5465477e+03 1.28e-12 4.22e-10 -8.6 1.10e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 7.5465477406181138e+00 7.5465477406181135e+0
3
Dual infeasibility......: 4.2180047142160434e-10 4.2180047142160434e-0
7
Constraint violation....: 1.2797957138488414e-12 1.2797957138488414e-1
2
Complementarity.........: 3.3873460668050744e-09 3.3873460668050745e-0
6
Overall NLP error.......: 3.3873460668050744e-09 3.3873460668050745e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2298268e+02 3.24e+03 5.23e+01 -1.0 3.27e+03 - 1.51e-03 9.81e-0
3h 1
2 9.2003557e+02 3.24e+03 5.23e+01 -1.0 2.98e+03 - 7.92e-05 1.08e-0
4h 1
3 8.2924045e+02 3.23e+03 5.23e+01 -1.0 3.24e+03 - 1.50e-05 3.73e-0
3f 1
4 3.5764794e+02 3.16e+03 5.22e+01 -1.0 3.23e+03 - 5.83e-03 2.18e-0
2h 1
5 1.3704663e+04 7.54e-02 7.77e+01 -1.0 3.16e+03 - 8.28e-02 1.00e+0
0h 1
6 7.3446410e+03 6.78e-02 2.26e+01 -1.0 1.31e+01 - 6.82e-01 9.46e-0
2f 1
7 6.0810712e+03 2.03e-02 7.24e+00 -1.0 9.63e+00 - 7.16e-01 8.72e-0
1f 1
8 6.2085934e+03 1.09e-02 6.05e-01 -1.0 2.64e+00 - 9.96e-01 4.67e-0
1f 2
9 5.9253757e+03 1.11e-02 2.98e-01 -1.7 1.18e+01 - 1.00e+00 8.14e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8752347e+03 1.11e-03 1.28e-01 -1.7 1.00e+01 - 1.00e+00 9.65e-0
1h 1
11 5.7570006e+03 4.14e-04 1.11e-01 -2.5 1.70e+01 - 9.54e-01 8.70e-0
1h 1
12 5.7430581e+03 1.61e-05 3.35e-03 -2.5 2.14e+00 - 1.00e+00 1.00e+0
0f 1
13 5.7235010e+03 5.14e-06 3.47e-02 -3.8 2.68e+00 - 1.00e+00 9.15e-0
1f 1
14 5.7222072e+03 1.38e-08 1.87e-05 -3.8 2.27e-01 - 1.00e+00 1.00e+0
0f 1
15 5.7210130e+03 1.79e-08 5.07e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0f 1
16 5.7210000e+03 6.39e-13 4.11e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 5.7210000352182178e+00 5.7210000352182178e+0
3
Dual infeasibility......: 4.1054900581029662e-10 4.1054900581029662e-0
7
Constraint violation....: 6.3948846218409017e-13 6.3948846218409017e-1
3
Complementarity.........: 2.5983435457961265e-09 2.5983435457961263e-0
6
Overall NLP error.......: 2.5983435457961265e-09 2.5983435457961263e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8030290e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.83e-0
3h 1
2 8.7171466e+02 2.00e+03 5.24e+01 -1.0 1.39e+03 - 4.30e-05 3.27e-0
4h 1
3 2.9396249e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 2.57e-04 2.26e-0
2f 1
4 1.4205172e+04 6.11e-02 7.92e+01 -1.0 1.95e+03 - 5.53e-02 1.00e+0
0h 1
5 5.5467686e+03 5.67e-02 5.32e+01 -1.0 6.53e+01 - 3.16e-01 6.42e-0
2f 1
6 4.1882105e+03 3.11e-02 2.63e+01 -1.0 3.24e+01 - 4.95e-01 4.19e-0
1f 1
7 3.3783859e+03 1.31e-02 2.13e+00 -1.0 1.11e+01 - 9.19e-01 9.23e-0
1f 1
8 3.8257438e+03 3.97e-04 9.67e-02 -1.0 4.99e+00 - 9.94e-01 1.00e+0
0f 1
9 3.1626049e+03 1.17e-03 1.16e+00 -1.7 5.19e+01 - 3.67e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.2255351e+03 1.19e-05 1.44e-02 -1.7 2.92e+01 - 1.00e+00 1.00e+0
0h 1
11 3.0915546e+03 3.14e-05 3.68e-01 -2.5 7.10e+01 - 1.00e+00 7.97e-0
1f 1
12 3.0691618e+03 1.04e-04 4.57e-03 -2.5 1.40e+01 - 1.00e+00 1.00e+0
0f 1
13 3.0437724e+03 2.77e-04 8.67e-02 -3.8 1.34e+01 - 7.72e-01 1.00e+0
0h 1
14 3.0410345e+03 1.61e-03 2.07e-03 -3.8 3.63e-02 - 9.72e-01 1.00e+0
0f 1
15 3.0410745e+03 7.52e-05 6.60e-05 -3.8 1.18e-02 - 1.00e+00 1.00e+0
0h 1
16 3.0392756e+03 1.31e-04 1.11e-03 -5.7 7.43e-01 - 9.18e-01 1.00e+0
0h 1
17 3.0392340e+03 3.27e-05 6.73e-06 -5.7 8.43e-03 - 1.00e+00 1.00e+0
0h 1
18 3.0392396e+03 1.92e-07 3.45e-06 -5.7 6.30e-04 - 1.00e+00 1.00e+0
0h 1
19 3.0392193e+03 2.64e-08 3.35e-05 -8.6 9.21e-03 - 1.00e+00 9.57e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 3.0392184e+03 4.49e-12 5.21e-11 -8.6 3.97e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 3.0392183955973615e+00 3.0392183955973615e+0
3
Dual infeasibility......: 5.2113125274858368e-11 5.2113125274858368e-0
8
Constraint violation....: 4.4910741792136832e-12 4.4910741792136832e-1
2
Complementarity.........: 3.3472514322334000e-09 3.3472514322334001e-0
6
Overall NLP error.......: 3.3472514322334000e-09 3.3472514322334001e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0808049e+02 9.17e+02 5.23e+01 -1.0 9.22e+02 - 1.00e-03 9.86e-0
3h 1
2 8.9044054e+02 9.17e+02 5.23e+01 -1.0 7.80e+02 - 7.68e-05 6.61e-0
4h 1
3 7.9332803e+02 9.14e+02 5.23e+01 -1.0 9.17e+02 - 6.17e-04 3.70e-0
3h 1
4 2.9381329e+02 8.94e+02 5.23e+01 -1.0 9.14e+02 - 4.55e-03 2.17e-0
2f 1
5 1.1418076e+04 7.11e-02 7.74e+01 -1.0 8.94e+02 - 8.66e-02 1.00e+0
0h 1
6 4.7100101e+03 6.36e-02 3.17e+01 -1.0 2.61e+01 - 5.64e-01 9.69e-0
2f 1
7 3.1944459e+03 1.98e-02 1.05e+01 -1.0 1.50e+01 - 6.86e-01 7.87e-0
1f 1
8 3.5058512e+03 2.31e-03 1.10e-01 -1.0 3.31e+00 - 9.90e-01 1.00e+0
0f 1
9 3.0504801e+03 1.60e-03 1.55e-01 -1.7 1.06e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8698340e+03 2.05e-03 3.74e-01 -2.5 1.08e+00 - 1.00e+00 7.83e-0
1f 1
11 2.8426369e+03 1.70e-04 5.45e-03 -2.5 2.09e-01 - 1.00e+00 1.00e+0
0h 1
12 2.8206804e+03 4.72e-05 1.87e-01 -3.8 1.11e+01 - 1.00e+00 7.35e-0
1h 1
13 2.8140607e+03 1.53e-07 3.60e-04 -3.8 2.75e+00 - 1.00e+00 1.00e+0
0f 1
14 2.8124030e+03 2.69e-08 1.01e-03 -5.7 5.93e-01 - 1.00e+00 9.85e-0
1f 1
15 2.8123840e+03 1.92e-12 1.37e-08 -5.7 8.24e-03 - 1.00e+00 1.00e+0
0f 1
16 2.8123637e+03 2.63e-12 4.48e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 2.8123637077619210e+00 2.8123637077619210e+0
3
Dual infeasibility......: 4.4777079977364583e-09 4.4777079977364583e-0
6
Constraint violation....: 2.6308746847725217e-12 2.6308746847725217e-1
2
Complementarity.........: 3.6085023552116862e-09 3.6085023552116863e-0
6
Overall NLP error.......: 4.4777079977364583e-09 4.4777079977364583e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.03e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 6.36e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643337e+00 1.6104063281643337e+0
3
Dual infeasibility......: 2.4574158090171458e-12 2.4574158090171458e-0
9
Constraint violation....: 6.3603173554942194e-15 6.3603173554942194e-1
5
Complementarity.........: 2.5062163910047551e-09 2.5062163910047549e-0
6
Overall NLP error.......: 2.5062163910047551e-09 2.5062163910047549e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933498e-01 5.8277753147933493e+0
2
Dual infeasibility......: 2.1031320946147231e-09 2.1031320946147231e-0
6
Constraint violation....: 6.2994318095199731e-11 6.2994318095199731e-1
1
Complementarity.........: 2.8882108896903808e-09 2.8882108896903807e-0
6
Overall NLP error.......: 2.8882108896903808e-09 2.8882108896903807e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254210157e-01 6.4890146254210151e+0
2
Dual infeasibility......: 4.9126604771081653e-09 4.9126604771081653e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646095252514899e-09 4.3646095252514903e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126604771081653e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.03e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 6.36e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643337e+00 1.6104063281643337e+0
3
Dual infeasibility......: 2.4574158090171458e-12 2.4574158090171458e-0
9
Constraint violation....: 6.3603173554942194e-15 6.3603173554942194e-1
5
Complementarity.........: 2.5062163910047551e-09 2.5062163910047549e-0
6
Overall NLP error.......: 2.5062163910047551e-09 2.5062163910047549e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2303872e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 3.31e-04 9.86e-0
3h 1
2 8.0919006e+02 9.17e+02 5.24e+01 -1.0 7.37e+02 - 8.12e-05 5.04e-0
4h 1
3 2.4239398e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 4.72e-04 2.11e-0
2f 1
4 1.2489447e+04 5.50e-02 8.23e+01 -1.0 8.98e+02 - 3.83e-02 1.00e+0
0h 1
5 3.8941148e+03 5.25e-02 5.67e+01 -1.0 8.14e+01 - 3.09e-01 4.98e-0
2f 1
6 1.9112633e+03 3.73e-02 3.04e+01 -1.0 3.92e+01 - 4.68e-01 5.06e-0
1f 1
7 4.6876227e+03 1.23e-02 2.71e+01 -1.0 2.07e+01 - 3.99e-01 1.00e+0
0h 1
8 1.8763004e+03 1.20e-02 1.04e+00 -1.0 2.56e+01 - 9.88e-01 8.91e-0
1f 1
9 1.9981274e+03 1.95e-04 4.76e-02 -1.0 2.98e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7321093e+03 2.19e-04 1.23e+00 -2.5 1.80e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5439398e+03 3.77e-03 1.33e-01 -2.5 7.59e+00 - 7.95e-01 1.00e+0
0f 1
12 1.5209204e+03 5.17e-03 3.09e-01 -2.5 1.82e+00 - 1.00e+00 7.67e-0
1h 1
13 1.5332321e+03 2.41e-04 4.72e-03 -2.5 7.16e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5031438e+03 1.70e-04 2.15e-02 -3.8 1.35e+01 - 9.90e-01 9.29e-0
1h 1
15 1.5019709e+03 7.24e-07 6.84e-05 -3.8 9.19e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003148e+03 3.77e-07 1.78e-04 -5.7 7.43e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.79e-11 2.92e-09 -5.7 4.20e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
1 8.6555952e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 4.97e-04 9.86e-0
3h 1
2 8.5049278e+02 9.17e+02 5.24e+01 -1.0 7.54e+02 - 7.94e-05 5.56e-0
4h 1
3 2.6243053e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 5.25e-04 2.21e-0
2h 1
4 1.2843590e+04 5.96e-02 8.01e+01 -1.0 8.97e+02 - 5.01e-02 1.00e+0
0h 1
5 4.2877637e+03 5.57e-02 5.36e+01 -1.0 7.35e+01 - 3.21e-01 5.99e-0
2f 1
57 2.030169e+04 1.632511e+04 4.826481e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1152978e+02 1.57e+04 5.50e+01 -1.0 1.59e+04 - 1.75e-04 9.81e-0
3h 1
2 7.0846250e+02 1.57e+04 5.50e+01 -1.0 1.30e+04 - 2.16e-05 1.20e-0
4h 1
3 7.0579193e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 2.49e-05 2.15e-0
4h 1
4 7.0325684e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 2.38e-04 2.10e-0
4h 1
5 4.8609657e+02 1.54e+04 5.40e+01 -1.0 1.57e+04 - 4.68e-04 1.89e-0
2f 1
6 2.6384687e+04 7.61e-02 8.69e+01 -1.0 1.54e+04 - 2.52e-02 1.00e+0
0h 1
7 1.7888733e+04 7.33e-02 7.36e+01 -1.0 7.42e+01 - 1.61e-01 3.97e-0
2f 1
8 1.6627806e+04 4.64e-02 3.42e+01 -1.0 1.95e+01 - 5.30e-01 3.77e-0
1f 1
9 1.7129495e+04 3.52e-02 1.68e+01 -1.0 1.34e+01 - 5.66e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6801208e+04 7.52e-03 6.47e-01 -1.0 1.20e+00 - 9.56e-01 1.00e+0
0h 1
11 1.6494417e+04 7.06e-04 1.32e+00 -1.7 5.59e+00 - 4.01e-01 9.17e-0
1f 1
12 1.6477360e+04 1.94e-04 7.04e-01 -1.7 2.70e+00 - 5.97e-01 1.00e+0
0f 1
13 1.6462908e+04 1.05e-04 2.36e-01 -1.7 3.61e+00 - 6.06e-01 1.00e+0
0f 1
14 1.6468220e+04 1.19e-05 8.29e-02 -1.7 8.01e+00 - 6.35e-01 1.00e+0
0f 1
15 1.6369867e+04 8.86e-04 5.13e-02 -2.5 3.72e+00 - 9.25e-01 1.00e+0
0f 1
16 1.6345517e+04 1.16e-03 1.23e-02 -2.5 4.16e+00 - 1.00e+00 1.00e+0
0h 1
17 1.6327812e+04 1.95e-04 8.63e-02 -3.8 6.49e+00 - 1.00e+00 8.52e-0
1h 1
18 1.6326333e+04 5.74e-07 1.02e-04 -3.8 5.67e-01 - 1.00e+00 1.00e+0
0h 1
19 1.6325116e+04 4.00e-07 1.03e-04 -5.7 2.97e-01 - 1.00e+00 9.98e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325119e+04 3.80e-11 2.99e-09 -5.7 2.68e-02 - 1.00e+00 1.00e+0
0f 1
21 1.6325107e+04 4.33e-11 9.61e-05 -8.6 3.35e-03 - 1.00e+00 8.43e-0
1h 1
22 1.6325105e+04 1.55e-12 5.06e-11 -8.6 6.61e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.6325105276098952e+01 1.6325105276098951e+0
4
Dual infeasibility......: 5.0629787222477590e-11 5.0629787222477590e-0
8
Constraint violation....: 1.5531742558749784e-12 1.5531742558749784e-1
2
Complementarity.........: 3.1337850605471751e-09 3.1337850605471752e-0
6
Overall NLP error.......: 3.1337850605471751e-09 3.1337850605471752e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4810922e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 4.08e-04 9.80e-0
3h 1
2 8.4527142e+02 1.50e+04 5.24e+01 -1.0 1.43e+04 - 4.57e-05 1.04e-0
4h 1
3 8.4408968e+02 1.50e+04 5.24e+01 -1.0 1.48e+04 - 6.68e-06 8.98e-0
5h 1
4 8.4261071e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 9.47e-05 1.14e-0
4h 1
5 5.6305267e+02 1.46e+04 5.26e+01 -1.0 1.50e+04 - 2.12e-04 2.18e-0
2f 1
6 2.6852128e+04 5.72e-02 8.10e+01 -1.0 1.46e+04 - 4.54e-02 1.00e+0
0h 1
7 1.8160239e+04 5.37e-02 5.35e+01 -1.0 8.07e+01 - 3.31e-01 5.57e-0
2f 1
8 1.6091868e+04 3.18e-02 2.93e+01 -1.0 4.23e+01 - 4.61e-01 5.22e-0
1f 1
9 1.6573458e+04 1.25e-02 2.80e+00 -1.0 2.05e+01 - 8.62e-01 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6059720e+04 5.16e-03 1.93e-01 -1.0 1.07e+01 - 9.56e-01 1.00e+0
0f 1
11 1.5779865e+04 1.30e-03 5.15e-01 -1.7 3.99e+00 - 1.00e+00 7.88e-0
1f 1
12 1.5748585e+04 3.76e-04 2.59e-02 -1.7 1.83e+01 - 1.00e+00 1.00e+0
0f 1
13 1.5603712e+04 1.15e-03 1.16e-01 -3.8 2.23e+01 - 7.67e-01 9.20e-0
1f 1
14 1.5574252e+04 1.47e-03 3.30e-02 -3.8 2.13e+00 - 8.19e-01 7.40e-0
1h 1
15 1.5574867e+04 3.45e-06 3.28e-02 -3.8 1.45e-01 - 9.81e-01 1.00e+0
0h 1
16 1.5573967e+04 8.69e-05 3.47e-04 -3.8 1.21e-02 - 1.00e+00 1.00e+0
0h 1
17 1.5572894e+04 1.51e-05 7.65e-03 -5.7 1.49e-01 - 9.11e-01 9.84e-0
1h 1
18 1.5572844e+04 4.81e-07 1.69e-06 -5.7 2.37e-03 - 1.00e+00 1.00e+0
0h 1
19 1.5572829e+04 4.63e-09 3.82e-07 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5572829e+04 9.66e-15 3.67e-14 -8.6 1.46e-07 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.5572828789861330e+01 1.5572828789861329e+0
4
Dual infeasibility......: 3.6746067865570828e-14 3.6746067865570828e-1
1
Constraint violation....: 9.6589403142388619e-15 9.6589403142388619e-1
5
Complementarity.........: 2.5059091823600978e-09 2.5059091823600979e-0
6
Overall NLP error.......: 2.5059091823600978e-09 2.5059091823600979e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2433988e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.31e-04 9.80e-0
3h 1
2 8.2147236e+02 1.39e+04 5.24e+01 -1.0 1.32e+04 - 4.69e-05 1.04e-0
4h 1
3 8.1089316e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 7.02e-06 7.41e-0
4f 1
4 7.9451834e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 7.50e-04 1.20e-0
3h 1
5 5.4374145e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 2.62e-03 2.10e-0
2f 1
6 2.4133779e+04 5.77e-02 8.27e+01 -1.0 1.36e+04 - 4.23e-02 1.00e+0
0h 1
7 1.6753710e+04 5.42e-02 4.65e+01 -1.0 7.14e+01 - 4.31e-01 5.53e-0
2f 1
8 1.4873592e+04 3.71e-02 2.34e+01 -1.0 3.92e+01 - 4.96e-01 4.93e-0
1f 1
9 1.5319472e+04 2.06e-02 6.95e+00 -1.0 1.26e+01 - 5.56e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5000449e+04 5.48e-03 1.95e-01 -1.0 4.94e+00 - 9.81e-01 1.00e+0
0h 1
11 1.4677134e+04 1.27e-03 3.63e-01 -1.7 5.55e+00 - 9.98e-01 8.32e-0
1f 1
12 1.4637011e+04 7.47e-04 1.67e-02 -1.7 1.90e+01 - 1.00e+00 1.00e+0
0f 1
13 1.4530780e+04 9.46e-04 6.55e-02 -2.5 2.90e+01 - 9.15e-01 8.04e-0
1f 1
14 1.4497756e+04 1.69e-03 1.90e-02 -2.5 5.18e+00 - 1.00e+00 1.00e+0
0f 1
15 1.4483045e+04 3.31e-04 1.34e-01 -3.8 5.14e+00 - 1.00e+00 8.13e-0
1h 1
16 1.4481128e+04 4.30e-07 1.07e-04 -3.8 9.18e-01 - 1.00e+00 1.00e+0
0h 1
17 1.4480063e+04 3.98e-07 1.74e-04 -5.7 1.49e-01 - 1.00e+00 9.96e-0
1h 1
18 1.4480065e+04 3.92e-11 3.03e-09 -5.7 2.87e-02 - 1.00e+00 1.00e+0
0f 1
19 1.4480052e+04 6.30e-11 2.17e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.4480051776219426e+01 1.4480051776219425e+0
4
Dual infeasibility......: 2.1737197267053690e-09 2.1737197267053690e-0
6
Constraint violation....: 6.2996066696463515e-11 6.2996066696463515e-1
1
Complementarity.........: 2.8882181392281100e-09 2.8882181392281098e-0
6
Overall NLP error.......: 2.8882181392281100e-09 2.8882181392281098e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0501023e+02 1.27e+04 5.23e+01 -1.0 1.28e+04 - 9.14e-04 9.80e-0
3h 1
2 9.0207603e+02 1.27e+04 5.23e+01 -1.0 1.10e+04 - 2.50e-05 1.13e-0
4h 1
3 7.5045395e+02 1.25e+04 5.24e+01 -1.0 1.26e+04 - 1.75e-05 1.03e-0
2h 1
4 6.7964112e+02 1.23e+04 5.20e+01 -1.0 1.25e+04 - 1.14e-02 2.11e-0
2h 1
5 2.1326736e+04 7.57e-02 7.77e+01 -1.0 1.23e+04 - 9.48e-02 1.00e+0
0h 1
6 1.6153468e+04 6.67e-02 2.35e+01 -1.0 2.70e+01 - 6.72e-01 1.11e-0
1f 1
7 1.4650574e+04 1.73e-02 1.19e+00 -1.0 1.59e+01 - 9.39e-01 8.03e-0
1f 1
8 1.5057653e+04 4.43e-03 3.22e-01 -1.0 4.20e+00 - 7.81e-01 9.57e-0
1f 1
9 1.4612988e+04 2.09e-03 4.83e-01 -1.7 3.35e+00 - 7.25e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4573524e+04 6.15e-04 4.94e-01 -1.7 9.88e+00 - 6.55e-01 1.00e+0
0h 1
11 1.4594786e+04 2.50e-05 1.54e-01 -1.7 1.71e+01 - 7.66e-01 1.00e+0
0h 1
12 1.4432961e+04 4.77e-04 2.66e-02 -2.5 1.94e+01 - 9.68e-01 9.32e-0
1f 1
13 1.4390959e+04 1.26e-04 4.71e-02 -3.8 1.59e+01 - 9.78e-01 9.02e-0
1h 1
14 1.4388508e+04 1.91e-07 5.34e-01 -3.8 1.73e+00 - 7.16e-01 1.00e+0
0h 1
15 1.4388411e+04 5.99e-09 1.27e-04 -3.8 4.33e-04 - 1.00e+00 1.00e+0
0h 1
16 1.4387007e+04 2.28e-08 2.33e-02 -5.7 4.46e-01 - 1.00e+00 9.12e-0
1f 1
17 1.4386892e+04 3.65e-11 2.05e-07 -5.7 3.91e-02 - 1.00e+00 1.00e+0
0f 1
18 1.4386873e+04 2.70e-12 2.19e-06 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0h 1
19 1.4386873e+04 9.24e-15 3.95e-14 -8.6 2.29e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.4386873414693120e+01 1.4386873414693120e+0
4
Dual infeasibility......: 3.9517952427576628e-14 3.9517952427576628e-1
1
Constraint violation....: 9.2381311498170386e-15 9.2381311498170386e-1
5
Complementarity.........: 2.6103681365474419e-09 2.6103681365474417e-0
6
Overall NLP error.......: 2.6103681365474419e-09 2.6103681365474417e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2301496e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.51e-03 9.80e-0
3h 1
2 9.2012933e+02 1.11e+04 5.23e+01 -1.0 1.02e+04 - 3.26e-05 1.08e-0
4h 1
3 8.3424138e+02 1.11e+04 5.23e+01 -1.0 1.11e+04 - 1.17e-05 5.22e-0
3h 1
4 5.7283738e+02 1.08e+04 5.22e+01 -1.0 1.11e+04 - 5.95e-03 2.13e-0
2h 1
5 2.1532474e+04 7.53e-02 7.76e+01 -1.0 1.08e+04 - 8.36e-02 1.00e+0
0h 1
6 1.5215064e+04 6.76e-02 2.23e+01 -1.0 1.30e+01 - 6.84e-01 9.54e-0
2f 1
7 1.3955436e+04 2.05e-02 7.03e+00 -1.0 9.59e+00 - 7.22e-01 8.73e-0
1f 1
8 1.4214931e+04 1.09e-02 1.48e-01 -1.0 2.63e+00 - 9.93e-01 9.34e-0
1f 1
9 1.3827927e+04 2.88e-03 7.77e-01 -1.7 1.49e+01 - 5.86e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3792242e+04 3.93e-04 2.25e-01 -1.7 1.44e+01 - 8.63e-01 1.00e+0
0h 1
11 1.3801178e+04 6.43e-05 2.10e-03 -1.7 8.86e+00 - 1.00e+00 1.00e+0
0h 1
12 1.3626565e+04 4.66e-04 2.13e-02 -3.8 3.90e+01 - 8.46e-01 8.38e-0
1f 1
13 1.3606899e+04 1.46e-04 2.13e-01 -3.8 6.27e+00 - 9.92e-01 7.18e-0
1h 1
14 1.3601605e+04 3.44e-07 3.06e-04 -3.8 1.77e+00 - 1.00e+00 1.00e+0
0h 1
15 1.3600267e+04 1.95e-08 4.43e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
16 1.3600252e+04 7.89e-13 4.79e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.3600252148837178e+01 1.3600252148837179e+0
4
Dual infeasibility......: 4.7916665460342707e-10 4.7916665460342707e-0
7
Constraint violation....: 7.8857753660344088e-13 7.8857753660344088e-1
3
Complementarity.........: 3.2733292513562872e-09 3.2733292513562870e-0
6
Overall NLP error.......: 3.2733292513562872e-09 3.2733292513562870e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891839e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0614875e+02 9.19e+03 5.23e+01 -1.0 8.94e+03 - 8.31e-05 1.02e-0
4h 1
3 8.8589053e+02 9.18e+03 5.23e+01 -1.0 9.18e+03 - 4.99e-06 1.11e-0
3f 1
4 4.8290407e+02 8.97e+03 5.24e+01 -1.0 9.18e+03 - 1.26e-03 2.28e-0
2h 1
5 2.1194856e+04 6.67e-02 7.66e+01 -1.0 8.97e+03 - 8.32e-02 1.00e+0
0h 1
6 1.3110859e+04 6.01e-02 3.76e+01 -1.0 2.89e+01 - 4.83e-01 9.02e-0
2f 1
7 1.1611939e+04 1.94e-02 1.53e+01 -1.0 1.53e+01 - 6.18e-01 7.42e-0
1f 1
8 1.1669715e+04 5.64e-03 1.25e+00 -1.0 2.10e+00 - 9.91e-01 5.00e-0
1f 2
9 1.1851856e+04 3.17e-04 6.99e-02 -1.0 2.45e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1303065e+04 2.21e-03 9.19e-02 -2.5 2.21e+01 - 8.56e-01 8.21e-0
1f 1
11 1.1134535e+04 2.12e-03 4.58e-01 -2.5 3.77e+00 - 1.00e+00 7.49e-0
1f 1
12 1.1105283e+04 1.58e-04 4.78e-03 -2.5 9.43e-01 - 1.00e+00 1.00e+0
0h 1
13 1.1088904e+04 4.25e-05 1.63e-01 -3.8 2.68e+00 - 1.00e+00 7.50e-0
1h 1
14 1.1084573e+04 1.45e-07 3.58e-04 -3.8 6.70e-01 - 1.00e+00 1.00e+0
0f 1
15 1.1083348e+04 2.78e-08 9.22e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 1.1083335e+04 1.87e-12 1.33e-08 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
17 1.1083321e+04 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.1083320752715757e+01 1.1083320752715757e+0
4
Dual infeasibility......: 4.4776954156325036e-09 4.4776954156325036e-0
6
Constraint violation....: 2.6306318234858850e-12 2.6306318234858850e-1
2
Complementarity.........: 3.6085004017884226e-09 3.6085004017884224e-0
6
Overall NLP error.......: 4.4776954156325036e-09 4.4776954156325036e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2298458e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1944863e+02 6.71e+03 5.23e+01 -1.0 4.84e+03 - 2.16e-05 1.37e-0
4h 1
3 4.2746489e+02 6.55e+03 5.24e+01 -1.0 6.71e+03 - 4.40e-05 2.36e-0
2f 1
4 1.9375137e+04 6.81e-02 8.01e+01 -1.0 6.55e+03 - 3.23e-02 1.00e+0
0h 1
5 1.1073105e+04 6.48e-02 6.20e+01 -1.0 2.30e+01 - 2.26e-01 4.46e-0
2f 1
6 9.8597986e+03 1.54e-02 2.76e+01 -1.0 1.04e+01 - 5.80e-01 7.55e-0
1f 1
7 9.7407089e+03 8.27e-03 3.90e-01 -1.0 2.06e+00 - 9.86e-01 1.00e+0
0f 1
8 9.3846978e+03 1.66e-03 1.00e-01 -1.7 3.27e+00 - 1.00e+00 9.75e-0
1f 1
9 9.2396015e+03 1.75e-03 5.24e-01 -2.5 4.91e+00 - 1.00e+00 7.49e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.2091546e+03 3.14e-04 9.62e-02 -2.5 1.22e+00 - 1.00e+00 8.96e-0
1h 1
11 9.2123965e+03 1.16e-05 4.01e-03 -2.5 1.27e-01 - 1.00e+00 1.00e+0
0f 1
12 9.1849124e+03 1.05e-05 7.99e-03 -3.8 8.04e+00 - 1.00e+00 9.61e-0
1f 1
13 9.1843091e+03 1.57e-08 1.36e-05 -3.8 3.09e-01 - 1.00e+00 1.00e+0
0f 1
14 9.1828174e+03 1.79e-08 5.06e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0f 1
15 9.1828008e+03 6.40e-13 4.11e-10 -8.6 5.52e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 9.1828007872789623e+00 9.1828007872789622e+0
3
Dual infeasibility......: 4.1141860209616230e-10 4.1141860209616230e-0
7
Constraint violation....: 6.4037664060379029e-13 6.4037664060379029e-1
3
Complementarity.........: 3.2192697917978149e-09 3.2192697917978149e-0
6
Overall NLP error.......: 3.2192697917978149e-09 3.2192697917978149e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8766795e+02 4.77e+03 5.24e+01 -1.0 4.81e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8353498e+02 4.77e+03 5.24e+01 -1.0 2.95e+03 - 2.75e-05 1.60e-0
4h 1
3 3.6139295e+02 4.66e+03 5.25e+01 -1.0 4.77e+03 - 7.13e-05 2.29e-0
2f 1
4 1.7143198e+04 6.18e-02 8.09e+01 -1.0 4.66e+03 - 3.19e-02 1.00e+0
0h 1
5 8.5555969e+03 5.88e-02 6.21e+01 -1.0 5.76e+01 - 2.31e-01 4.38e-0
2f 1
6 7.0738960e+03 2.50e-02 3.16e+01 -1.0 2.58e+01 - 4.96e-01 5.36e-0
1f 1
7 6.3640765e+03 1.22e-02 2.14e+00 -1.0 9.64e+00 - 9.28e-01 8.84e-0
1f 1
8 6.7865441e+03 4.25e-04 9.17e-02 -1.0 4.06e+00 - 9.97e-01 1.00e+0
0f 1
9 6.0100617e+03 2.23e-03 2.08e-01 -2.5 5.78e+00 - 8.66e-01 9.60e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.9413815e+03 1.05e-03 6.02e-01 -2.5 2.35e+00 - 1.00e+00 5.77e-0
1h 1
11 5.9461431e+03 3.58e-06 8.22e-03 -2.5 1.12e+00 - 1.00e+00 1.00e+0
0h 1
12 5.9228026e+03 5.05e-06 3.84e-02 -3.8 1.07e+01 - 9.20e-01 8.83e-0
1f 1
13 5.9187561e+03 4.66e-04 5.79e-04 -3.8 1.25e+00 - 1.00e+00 1.00e+0
0f 1
14 5.9173185e+03 6.39e-05 1.15e-02 -5.7 5.94e-01 - 8.12e-01 1.00e+0
0h 1
15 5.9172028e+03 3.63e-05 4.14e-05 -5.7 9.71e-03 - 1.00e+00 1.00e+0
0h 1
16 5.9172045e+03 1.60e-06 4.42e-05 -5.7 1.47e-03 - 1.00e+00 9.88e-0
1h 1
17 5.9172070e+03 3.53e-08 5.14e-07 -5.7 2.92e-04 - 1.00e+00 1.00e+0
0f 1
18 5.9171869e+03 3.96e-08 7.28e-06 -8.6 7.37e-03 - 9.97e-01 9.81e-0
1h 1
19 5.9171866e+03 5.33e-13 2.97e-11 -8.6 1.42e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 5.9171865519868891e+00 5.9171865519868888e+0
3
Dual infeasibility......: 2.9739909206848517e-11 2.9739909206848517e-0
8
Constraint violation....: 5.3312909642500017e-13 5.3312909642500017e-1
3
Complementarity.........: 2.9107424657817778e-09 2.9107424657817777e-0
6
Overall NLP error.......: 2.9107424657817778e-09 2.9107424657817777e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2294726e+02 3.24e+03 5.23e+01 -1.0 3.27e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1945201e+02 3.24e+03 5.23e+01 -1.0 2.47e+03 - 3.93e-05 1.30e-0
4h 1
3 3.4573144e+02 3.17e+03 5.24e+01 -1.0 3.24e+03 - 4.04e-05 2.36e-0
2f 1
4 1.5906615e+04 6.81e-02 7.93e+01 -1.0 3.17e+03 - 4.21e-02 1.00e+0
0h 1
5 7.5933644e+03 6.41e-02 5.66e+01 -1.0 2.00e+01 - 2.81e-01 5.33e-0
2f 1
6 6.3092956e+03 1.54e-02 2.51e+01 -1.0 1.01e+01 - 5.90e-01 8.06e-0
1f 1
7 6.3346293e+03 6.22e-03 2.30e-01 -1.0 1.94e+00 - 9.91e-01 1.00e+0
0f 1
8 5.9359407e+03 1.57e-03 8.95e-02 -1.7 4.62e+00 - 1.00e+00 9.66e-0
1f 1
9 5.7772838e+03 1.82e-03 5.17e-01 -2.5 1.14e+00 - 1.00e+00 7.50e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.7447658e+03 3.25e-04 1.02e-01 -2.5 2.94e-01 - 1.00e+00 8.96e-0
1h 1
11 5.7477659e+03 1.16e-05 4.01e-03 -2.5 2.85e-02 - 1.00e+00 1.00e+0
0f 1
12 5.7228582e+03 1.05e-05 8.02e-03 -3.8 5.36e+00 - 1.00e+00 9.61e-0
1f 1
13 5.7223579e+03 1.57e-08 1.36e-05 -3.8 2.04e-01 - 1.00e+00 1.00e+0
0f 1
14 5.7210148e+03 1.79e-08 5.06e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0f 1
15 5.7210000e+03 6.40e-13 4.11e-10 -8.6 3.67e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.7210000327408981e+00 5.7210000327408980e+0
3
Dual infeasibility......: 4.1141776460758229e-10 4.1141776460758229e-0
7
Constraint violation....: 6.4015459599886526e-13 6.4015459599886526e-1
3
Complementarity.........: 2.6877953313691653e-09 2.6877953313691654e-0
6
Overall NLP error.......: 2.6877953313691653e-09 2.6877953313691654e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8038781e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.82e-0
3h 1
2 8.7404419e+02 2.00e+03 5.24e+01 -1.0 1.17e+03 - 4.28e-05 2.39e-0
4h 1
3 2.9382745e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 1.65e-04 2.27e-0
2f 1
4 1.4249786e+04 6.10e-02 7.92e+01 -1.0 1.95e+03 - 5.51e-02 1.00e+0
0h 1
5 5.5512989e+03 5.67e-02 5.34e+01 -1.0 6.55e+01 - 3.14e-01 6.40e-0
2f 1
6 4.1927553e+03 3.11e-02 2.64e+01 -1.0 3.24e+01 - 4.94e-01 4.18e-0
1f 1
7 3.3769719e+03 1.34e-02 2.16e+00 -1.0 1.11e+01 - 9.19e-01 9.25e-0
1f 1
8 3.8285990e+03 4.08e-04 1.03e-01 -1.0 5.01e+00 - 9.96e-01 1.00e+0
0f 1
9 3.1642105e+03 1.16e-03 1.11e+00 -1.7 5.24e+01 - 3.94e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.2145412e+03 1.02e-05 1.36e-02 -1.7 1.93e+01 - 1.00e+00 1.00e+0
0h 1
11 3.0880660e+03 3.00e-05 3.90e-01 -2.5 6.42e+01 - 1.00e+00 7.91e-0
1f 1
12 3.0663467e+03 1.05e-04 4.77e-03 -2.5 1.30e+01 - 1.00e+00 1.00e+0
0f 1
13 3.0436286e+03 2.77e-04 8.68e-02 -3.8 1.07e+01 - 7.71e-01 1.00e+0
0h 1
14 3.0408839e+03 1.61e-03 2.07e-03 -3.8 3.64e-02 - 9.71e-01 1.00e+0
0h 1
15 3.0409241e+03 7.53e-05 6.60e-05 -3.8 1.18e-02 - 1.00e+00 1.00e+0
0h 1
16 3.0392738e+03 1.31e-04 1.11e-03 -5.7 5.94e-01 - 9.18e-01 1.00e+0
0h 1
17 3.0392321e+03 3.27e-05 6.74e-06 -5.7 8.43e-03 - 1.00e+00 1.00e+0
0h 1
18 3.0392377e+03 1.93e-07 3.46e-06 -5.7 6.31e-04 - 1.00e+00 1.00e+0
0h 1
19 3.0392192e+03 2.64e-08 3.35e-05 -8.6 7.37e-03 - 1.00e+00 9.57e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 3.0392184e+03 4.50e-12 5.22e-11 -8.6 3.18e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 3.0392183947902689e+00 3.0392183947902690e+0
3
Dual infeasibility......: 5.2159623872285065e-11 5.2159623872285065e-0
8
Constraint violation....: 4.5008441418303846e-12 4.5008441418303846e-1
2
Complementarity.........: 3.3523844551689132e-09 3.3523844551689131e-0
6
Overall NLP error.......: 3.3523844551689132e-09 3.3523844551689131e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0808031e+02 9.17e+02 5.23e+01 -1.0 9.22e+02 - 1.00e-03 9.86e-0
3h 1
2 8.8617108e+02 9.17e+02 5.23e+01 -1.0 8.07e+02 - 7.42e-05 8.22e-0
4h 1
3 2.8484271e+02 8.96e+02 5.24e+01 -1.0 9.17e+02 - 7.98e-04 2.30e-0
2h 1
4 1.3130925e+04 6.61e-02 7.64e+01 -1.0 8.96e+02 - 8.29e-02 1.00e+0
0h 1
5 4.8553004e+03 5.96e-02 3.83e+01 -1.0 2.93e+01 - 4.73e-01 8.96e-0
2f 1
6 3.3594619e+03 1.92e-02 1.58e+01 -1.0 1.54e+01 - 6.12e-01 7.37e-0
1f 1
7 3.4484569e+03 4.84e-03 1.76e-01 -1.0 2.12e+00 - 9.90e-01 1.00e+0
0f 1
8 3.0256349e+03 1.47e-03 1.26e-01 -1.7 7.99e+00 - 1.00e+00 1.00e+0
0f 1
9 2.8699577e+03 2.01e-03 4.20e-01 -2.5 5.63e+00 - 1.00e+00 7.84e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8453385e+03 1.62e-04 5.44e-03 -2.5 1.12e+00 - 1.00e+00 1.00e+0
0h 1
11 2.8215934e+03 4.47e-05 1.85e-01 -3.8 1.35e+01 - 1.00e+00 7.36e-0
1h 1
12 2.8142143e+03 1.62e-07 3.67e-04 -3.8 3.52e+00 - 1.00e+00 1.00e+0
0f 1
13 2.8124069e+03 2.71e-08 9.51e-04 -5.7 7.43e-01 - 1.00e+00 9.85e-0
1f 1
14 2.8123858e+03 1.86e-12 1.33e-08 -5.7 1.07e-02 - 1.00e+00 1.00e+0
0f 1
15 2.8123637e+03 2.63e-12 4.48e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 2.8123637103539116e+00 2.8123637103539118e+0
3
Dual infeasibility......: 4.4777030087674561e-09 4.4777030087674561e-0
6
Constraint violation....: 2.6307289680005397e-12 2.6307289680005397e-1
2
Complementarity.........: 3.6085022621179304e-09 3.6085022621179305e-0
6
Overall NLP error.......: 4.4777030087674561e-09 4.4777030087674561e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933498e-01 5.8277753147933493e+0
2
Dual infeasibility......: 2.1031320946147231e-09 2.1031320946147231e-0
6
Constraint violation....: 6.2994318095199731e-11 6.2994318095199731e-1
1
Complementarity.........: 2.8882108896903808e-09 2.8882108896903807e-0
6
Overall NLP error.......: 2.8882108896903808e-09 2.8882108896903807e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933498e-01 5.8277753147933493e+0
2
Dual infeasibility......: 2.1031320946147231e-09 2.1031320946147231e-0
6
Constraint violation....: 6.2994318095199731e-11 6.2994318095199731e-1
1
Complementarity.........: 2.8882108896903808e-09 2.8882108896903807e-0
6
Overall NLP error.......: 2.8882108896903808e-09 2.8882108896903807e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254210179e-01 6.4890146254210174e+0
2
Dual infeasibility......: 4.9126604805649068e-09 4.9126604805649068e-0
6
Constraint violation....: 6.2123811650494076e-09 6.2123811650494076e-0
9
Complementarity.........: 4.3646095252531724e-09 4.3646095252531725e-0
6
Overall NLP error.......: 6.2123811650494076e-09 4.9126604805649068e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.03e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 6.36e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643335e+00 1.6104063281643334e+0
3
Dual infeasibility......: 2.4573533589687019e-12 2.4573533589687019e-0
9
Constraint violation....: 6.3603173554942194e-15 6.3603173554942194e-1
5
Complementarity.........: 2.5062163910047530e-09 2.5062163910047528e-0
6
Overall NLP error.......: 2.5062163910047530e-09 2.5062163910047528e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2303872e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 3.31e-04 9.86e-0
3h 1
2 8.0919006e+02 9.17e+02 5.24e+01 -1.0 7.37e+02 - 8.12e-05 5.04e-0
4h 1
3 2.4239398e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 4.72e-04 2.11e-0
2f 1
4 1.2489447e+04 5.50e-02 8.23e+01 -1.0 8.98e+02 - 3.83e-02 1.00e+0
0h 1
5 3.8941148e+03 5.25e-02 5.67e+01 -1.0 8.14e+01 - 3.09e-01 4.98e-0
2f 1
6 1.9112633e+03 3.73e-02 3.04e+01 -1.0 3.92e+01 - 4.68e-01 5.06e-0
1f 1
7 4.6876227e+03 1.23e-02 2.71e+01 -1.0 2.07e+01 - 3.99e-01 1.00e+0
0h 1
8 1.8763004e+03 1.20e-02 1.04e+00 -1.0 2.56e+01 - 9.88e-01 8.91e-0
1f 1
9 1.9981274e+03 1.95e-04 4.76e-02 -1.0 2.98e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7321093e+03 2.19e-04 1.23e+00 -2.5 1.80e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5439398e+03 3.77e-03 1.33e-01 -2.5 7.59e+00 - 7.95e-01 1.00e+0
0f 1
12 1.5209204e+03 5.17e-03 3.09e-01 -2.5 1.82e+00 - 1.00e+00 7.67e-0
1h 1
13 1.5332321e+03 2.41e-04 4.72e-03 -2.5 7.16e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5031438e+03 1.70e-04 2.15e-02 -3.8 1.35e+01 - 9.90e-01 9.29e-0
1h 1
15 1.5019709e+03 7.24e-07 6.84e-05 -3.8 9.19e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003148e+03 3.77e-07 1.78e-04 -5.7 7.43e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.79e-11 2.92e-09 -5.7 4.20e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932776792490e+00 1.5002932776792491e+0
3
Dual infeasibility......: 2.1737235071273386e-09 2.1737235071273386e-0
6
Constraint violation....: 6.2995900163009821e-11 6.2995900163009821e-1
1
Complementarity.........: 2.8882174443522761e-09 2.8882174443522758e-0
6
Overall NLP error.......: 2.8882174443522761e-09 2.8882174443522758e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6555952e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 4.97e-04 9.86e-0
3h 1
2 8.5049278e+02 9.17e+02 5.24e+01 -1.0 7.54e+02 - 7.94e-05 5.56e-0
4h 1
3 2.6243053e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 5.25e-04 2.21e-0
2h 1
4 1.2843590e+04 5.96e-02 8.01e+01 -1.0 8.97e+02 - 5.01e-02 1.00e+0
0h 1
5 4.2877637e+03 5.57e-02 5.36e+01 -1.0 7.35e+01 - 3.21e-01 5.99e-0
2f 1
58 1.749176e+04 1.632511e+04 4.881472e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2432714e+02 1.57e+04 5.24e+01 -1.0 1.59e+04 - 3.31e-04 9.81e-0
3h 1
2 8.2123449e+02 1.57e+04 5.24e+01 -1.0 1.27e+04 - 1.98e-05 1.23e-0
4h 1
3 8.1852672e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 2.73e-05 2.17e-0
4h 1
4 8.1585762e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 2.42e-04 2.18e-0
4h 1
5 5.6392439e+02 1.54e+04 5.26e+01 -1.0 1.57e+04 - 4.82e-04 2.12e-0
2f 1
6 2.7198782e+04 5.52e-02 8.24e+01 -1.0 1.54e+04 - 3.86e-02 1.00e+0
0h 1
7 1.8708796e+04 5.27e-02 5.58e+01 -1.0 8.05e+01 - 3.20e-01 5.02e-0
2f 1
8 1.6734460e+04 3.73e-02 2.98e+01 -1.0 3.93e+01 - 4.70e-01 5.04e-0
1f 1
9 1.7079743e+04 2.27e-02 1.42e+01 -1.0 2.05e+01 - 4.01e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6823850e+04 6.02e-03 3.94e-01 -1.0 4.93e+00 - 9.79e-01 1.00e+0
0h 1
11 1.6517786e+04 1.43e-03 6.54e-01 -1.7 5.54e+00 - 6.09e-01 8.25e-0
1f 1
12 1.6483154e+04 3.37e-04 7.86e-01 -1.7 3.83e+00 - 4.49e-01 1.00e+0
0f 1
13 1.6473375e+04 9.44e-05 2.36e-01 -1.7 6.28e+00 - 6.49e-01 1.00e+0
0h 1
14 1.6484793e+04 8.95e-06 7.11e-02 -1.7 1.35e+01 - 6.90e-01 1.00e+0
0f 1
15 1.6369301e+04 1.02e-03 6.52e-02 -2.5 1.43e+01 - 9.09e-01 1.00e+0
0f 1
16 1.6344900e+04 1.32e-03 1.49e-02 -2.5 4.76e+00 - 1.00e+00 1.00e+0
0h 1
17 1.6328005e+04 2.39e-04 1.07e-01 -3.8 6.11e+00 - 1.00e+00 8.33e-0
1h 1
18 1.6326333e+04 4.78e-07 1.24e-04 -3.8 6.47e-01 - 1.00e+00 1.00e+0
0h 1
19 1.6325117e+04 4.02e-07 1.59e-04 -5.7 2.97e-01 - 1.00e+00 9.97e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325119e+04 3.86e-11 2.91e-09 -5.7 2.82e-03 - 1.00e+00 1.00e+0
0f 1
21 1.6325107e+04 4.26e-11 1.05e-04 -8.6 3.34e-03 - 1.00e+00 8.38e-0
1h 1
22 1.6325105e+04 1.66e-12 5.73e-11 -8.6 5.10e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.6325105276123672e+01 1.6325105276123672e+0
4
Dual infeasibility......: 5.7349674599254478e-11 5.7349674599254478e-0
8
Constraint violation....: 1.6613932452003155e-12 1.6613932452003155e-1
2
Complementarity.........: 3.1586190549946184e-09 3.1586190549946183e-0
6
Overall NLP error.......: 3.1586190549946184e-09 3.1586190549946183e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4158792e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 3.83e-04 9.80e-0
3h 1
2 8.3874407e+02 1.50e+04 5.24e+01 -1.0 1.43e+04 - 4.60e-05 1.04e-0
4h 1
3 8.1063150e+02 1.49e+04 5.24e+01 -1.0 1.50e+04 - 6.58e-06 2.15e-0
3h 1
4 5.7583371e+02 1.46e+04 5.25e+01 -1.0 1.49e+04 - 2.30e-03 2.08e-0
2h 1
5 2.5840271e+04 5.85e-02 8.16e+01 -1.0 1.46e+04 - 4.72e-02 1.00e+0
0h 1
6 1.8007647e+04 5.47e-02 4.93e+01 -1.0 7.48e+01 - 3.86e-01 5.88e-0
2f 1
7 1.5982427e+04 3.56e-02 2.57e+01 -1.0 4.16e+01 - 4.83e-01 5.20e-0
1f 1
8 1.6343955e+04 1.91e-02 4.61e+00 -1.0 1.45e+01 - 6.89e-01 2.50e-0
1f 3
9 1.6123462e+04 4.98e-03 3.32e-01 -1.0 6.13e+00 - 9.54e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5782383e+04 1.35e-03 5.04e-01 -1.7 6.08e+00 - 1.00e+00 7.90e-0
1f 1
11 1.5746110e+04 6.55e-04 2.61e-02 -1.7 3.69e+01 - 1.00e+00 1.00e+0
0f 1
12 1.5588274e+04 1.52e-03 1.16e-01 -3.8 3.98e+01 - 7.64e-01 9.25e-0
1f 1
13 1.5559321e+04 2.22e-03 9.62e-02 -3.8 2.94e+00 - 8.18e-01 7.33e-0
1h 1
14 1.5560214e+04 2.15e-06 1.39e-03 -3.8 7.84e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5559228e+04 2.63e-07 1.00e-03 -5.7 2.97e-01 - 1.00e+00 9.83e-0
1h 1
16 1.5559217e+04 2.62e-11 7.43e-09 -5.7 9.43e-03 - 1.00e+00 1.00e+0
0f 1
17 1.5559202e+04 6.30e-11 2.65e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5559202149282569e+01 1.5559202149282570e+0
4
Dual infeasibility......: 2.6486894837325715e-09 2.6486894837325715e-0
6
Constraint violation....: 6.3010804907115414e-11 6.3010804907115414e-1
1
Complementarity.........: 2.8881022647942397e-09 2.8881022647942396e-0
6
Overall NLP error.......: 2.8881022647942397e-09 2.8881022647942396e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6399623e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 4.82e-04 9.80e-0
3h 1
2 8.6108622e+02 1.39e+04 5.24e+01 -1.0 1.25e+04 - 2.98e-05 1.10e-0
4h 1
3 8.5835479e+02 1.39e+04 5.24e+01 -1.0 1.38e+04 - 1.35e-05 1.95e-0
4h 1
4 8.5661821e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 2.07e-04 1.26e-0
4h 1
5 5.5394230e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 3.43e-04 2.22e-0
2f 1
6 2.5800275e+04 5.93e-02 8.03e+01 -1.0 1.36e+04 - 4.93e-02 1.00e+0
0h 1
7 1.7238172e+04 5.54e-02 5.36e+01 -1.0 7.47e+01 - 3.22e-01 5.92e-0
2f 1
8 1.5592395e+04 2.96e-02 2.82e+01 -1.0 3.97e+01 - 4.70e-01 4.41e-0
1f 1
9 1.5127492e+04 1.39e-02 2.62e+00 -1.0 1.10e+01 - 9.18e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5377510e+04 5.39e-04 1.84e-01 -1.0 4.56e+00 - 9.60e-01 1.00e+0
0f 1
11 1.4841424e+04 6.00e-04 4.77e-01 -2.5 7.94e+00 - 8.86e-01 6.85e-0
1f 1
12 1.4750684e+04 3.37e-04 3.61e-01 -2.5 3.18e+00 - 8.72e-01 1.00e+0
0h 1
13 1.4749508e+04 6.42e-04 3.78e-01 -2.5 1.27e+02 - 8.61e-04 3.34e-0
4f 2
14 1.4718152e+04 1.37e-03 1.90e-02 -2.5 1.56e+00 - 1.00e+00 1.00e+0
0h 1
15 1.4705276e+04 1.66e-03 5.84e-02 -3.8 3.36e+00 - 6.98e-01 9.48e-0
1h 1
16 1.4700689e+04 4.49e-03 3.78e-03 -3.8 1.57e-01 - 9.44e-01 1.00e+0
0h 1
17 1.4700823e+04 6.51e-05 2.50e-04 -3.8 9.86e-03 - 1.00e+00 1.00e+0
0h 1
18 1.4699661e+04 7.09e-05 6.37e-04 -5.7 1.51e-01 - 9.42e-01 9.03e-0
1h 1
19 1.4699572e+04 1.81e-05 3.99e-03 -5.7 1.37e-02 - 1.00e+00 7.61e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.4699561e+04 6.54e-09 3.59e-06 -5.7 3.26e-03 - 1.00e+00 1.00e+0
0f 1
21 1.4699546e+04 9.68e-09 2.92e-05 -8.6 1.84e-03 - 1.00e+00 9.82e-0
1h 1
22 1.4699545e+04 2.09e-12 1.33e-10 -8.6 3.39e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.4699545347455420e+01 1.4699545347455420e+0
4
Dual infeasibility......: 1.3303625425147532e-10 1.3303625425147532e-0
7
Constraint violation....: 2.0878854201100694e-12 2.0878854201100694e-1
2
Complementarity.........: 2.5129541224840025e-09 2.5129541224840024e-0
6
Overall NLP error.......: 2.5129541224840025e-09 2.5129541224840024e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8073105e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.97e-04 9.80e-0
3h 1
2 8.7796146e+02 1.27e+04 5.24e+01 -1.0 1.24e+04 - 8.93e-05 1.01e-0
4h 1
3 8.6692458e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 3.47e-06 7.37e-0
4f 1
4 5.4092019e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 7.99e-04 2.24e-0
2h 1
5 2.4576710e+04 6.17e-02 7.93e+01 -1.0 1.24e+04 - 5.67e-02 1.00e+0
0h 1
6 1.6171478e+04 5.73e-02 5.23e+01 -1.0 6.39e+01 - 3.28e-01 6.59e-0
2f 1
7 1.4812866e+04 3.11e-02 2.54e+01 -1.0 3.21e+01 - 5.03e-01 4.22e-0
1f 1
8 1.4040427e+04 1.14e-02 2.00e+00 -1.0 1.10e+01 - 9.20e-01 9.11e-0
1f 1
9 1.4460004e+04 3.38e-04 9.28e-02 -1.0 4.85e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3750291e+04 1.39e-03 7.06e-02 -2.5 6.50e+00 - 8.71e-01 8.55e-0
1f 1
11 1.3727058e+04 1.41e-05 1.70e-02 -2.5 6.60e-01 - 1.00e+00 1.00e+0
0h 1
12 1.3695913e+04 1.35e-03 3.69e-02 -3.8 2.68e+00 - 7.12e-01 1.00e+0
0f 1
13 1.3693938e+04 9.56e-04 1.56e-03 -3.8 3.41e-02 - 9.61e-01 1.00e+0
0h 1
14 1.3694087e+04 1.22e-04 1.32e-04 -3.8 1.60e-02 - 1.00e+00 1.00e+0
0h 1
15 1.3692879e+04 1.38e-04 1.17e-03 -5.7 1.49e-01 - 9.16e-01 1.00e+0
0h 1
16 1.3692835e+04 3.55e-05 7.55e-06 -5.7 8.77e-03 - 1.00e+00 1.00e+0
0h 1
17 1.3692839e+04 4.36e-07 4.70e-06 -5.7 9.55e-04 - 1.00e+00 1.00e+0
0h 1
18 1.3692826e+04 3.62e-08 4.80e-05 -8.6 1.84e-03 - 1.00e+00 9.49e-0
1h 1
19 1.3692826e+04 6.54e-12 6.63e-11 -8.6 9.47e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.3692825532067991e+01 1.3692825532067991e+0
4
Dual infeasibility......: 6.6307836831253307e-11 6.6307836831253307e-0
8
Constraint violation....: 6.5407679272766472e-12 6.5407679272766472e-1
2
Complementarity.........: 2.5095397414849593e-09 2.5095397414849593e-0
6
Overall NLP error.......: 2.5095397414849593e-09 2.5095397414849593e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6662389e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 4.97e-04 9.80e-0
3h 1
2 8.6375901e+02 1.11e+04 5.24e+01 -1.0 1.04e+04 - 4.51e-05 1.05e-0
4h 1
3 8.1247866e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 9.09e-06 3.08e-0
3h 1
4 5.1271377e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 3.39e-03 2.10e-0
2h 1
5 2.1781269e+04 6.25e-02 8.04e+01 -1.0 1.09e+04 - 5.65e-02 1.00e+0
0h 1
6 1.4355473e+04 5.79e-02 4.85e+01 -1.0 6.64e+01 - 3.84e-01 6.77e-0
2f 1
7 1.2780687e+04 3.04e-02 2.34e+01 -1.0 3.79e+01 - 5.09e-01 4.42e-0
1f 1
8 1.2333284e+04 1.27e-02 2.11e+00 -1.0 1.05e+01 - 9.22e-01 1.00e+0
0f 1
9 1.2590751e+04 3.91e-04 7.29e-02 -1.0 4.30e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2099307e+04 5.08e-04 6.40e-01 -2.5 7.12e+00 - 8.93e-01 6.41e-0
1f 1
11 1.2017941e+04 2.37e-04 3.82e-01 -2.5 2.45e+00 - 8.88e-01 1.00e+0
0h 1
12 1.1994709e+04 6.02e-03 2.19e-01 -2.5 1.69e+00 - 1.00e+00 6.03e-0
1h 1
13 1.1985170e+04 7.03e-04 5.56e-03 -2.5 4.75e-01 - 1.00e+00 1.00e+0
0f 1
14 1.1966692e+04 1.15e-03 2.92e-02 -3.8 5.36e+00 - 8.09e-01 1.00e+0
0h 1
15 1.1963688e+04 2.25e-03 1.06e-03 -3.8 4.73e-02 - 1.00e+00 1.00e+0
0h 1
16 1.1964070e+04 4.49e-05 1.48e-04 -3.8 1.50e-02 - 1.00e+00 1.00e+0
0h 1
17 1.1962598e+04 1.05e-04 4.27e-04 -5.7 2.97e-01 - 9.51e-01 9.82e-0
1h 1
18 1.1962590e+04 2.18e-05 3.56e-03 -5.7 5.37e-03 - 1.00e+00 7.94e-0
1h 1
19 1.1962593e+04 8.54e-09 1.12e-06 -5.7 1.11e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.1962577e+04 8.97e-09 1.93e-05 -8.6 3.68e-03 - 1.00e+00 9.83e-0
1h 1
21 1.1962577e+04 1.38e-12 6.48e-11 -8.6 6.13e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.1962576503144447e+01 1.1962576503144446e+0
4
Dual infeasibility......: 6.4763639551006543e-11 6.4763639551006550e-0
8
Constraint violation....: 1.3765655282327316e-12 1.3765655282327316e-1
2
Complementarity.........: 2.5951517873940316e-09 2.5951517873940315e-0
6
Overall NLP error.......: 2.5951517873940316e-09 2.5951517873940315e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8777320e+02 9.19e+03 5.24e+01 -1.0 9.28e+03 - 6.64e-04 9.80e-0
3h 1
2 8.8499164e+02 9.19e+03 5.24e+01 -1.0 8.96e+03 - 8.88e-05 1.02e-0
4h 1
3 8.6604553e+02 9.18e+03 5.24e+01 -1.0 9.18e+03 - 4.81e-06 1.03e-0
3f 1
4 4.6753384e+02 8.97e+03 5.24e+01 -1.0 9.18e+03 - 1.16e-03 2.24e-0
2h 1
5 2.1019834e+04 6.31e-02 7.87e+01 -1.0 8.97e+03 - 6.27e-02 1.00e+0
0h 1
6 1.2779542e+04 5.82e-02 5.04e+01 -1.0 5.68e+01 - 3.45e-01 7.15e-0
2f 1
7 1.1474093e+04 2.98e-02 2.31e+01 -1.0 2.74e+01 - 5.30e-01 4.48e-0
1f 1
8 1.0826912e+04 8.86e-03 1.29e+00 -1.0 1.03e+01 - 9.25e-01 7.95e-0
1f 1
9 1.1132672e+04 2.56e-04 7.50e-02 -1.0 3.69e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.0462579e+04 2.14e-03 9.04e-02 -2.5 5.27e+00 - 8.69e-01 8.83e-0
1f 1
11 1.0356962e+04 1.11e-03 4.48e-01 -2.5 8.53e-01 - 1.00e+00 6.12e-0
1f 1
12 1.0357041e+04 2.64e-06 8.39e-03 -2.5 1.73e-01 - 1.00e+00 1.00e+0
0h 1
13 1.0339021e+04 7.22e-06 6.55e-03 -3.8 2.68e+00 - 9.00e-01 8.93e-0
1f 1
14 1.0335760e+04 4.68e-04 3.83e-04 -3.8 2.86e-01 - 1.00e+00 1.00e+0
0f 1
15 1.0334765e+04 6.30e-05 1.15e-02 -5.7 1.49e-01 - 8.13e-01 1.00e+0
0h 1
16 1.0334649e+04 3.63e-05 4.09e-05 -5.7 9.71e-03 - 1.00e+00 1.00e+0
0h 1
17 1.0334650e+04 1.61e-06 3.43e-05 -5.7 1.54e-03 - 1.00e+00 9.90e-0
1h 1
18 1.0334653e+04 3.53e-08 5.13e-07 -5.7 2.92e-04 - 1.00e+00 1.00e+0
0f 1
19 1.0334638e+04 3.96e-08 7.26e-06 -8.6 1.84e-03 - 9.97e-01 9.81e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.0334638e+04 5.32e-13 2.97e-11 -8.6 3.54e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.0334637960789227e+01 1.0334637960789227e+0
4
Dual infeasibility......: 2.9731379712230488e-11 2.9731379712230488e-0
8
Constraint violation....: 5.3168580649298747e-13 5.3168580649298747e-1
3
Complementarity.........: 2.5100786379621721e-09 2.5100786379621721e-0
6
Overall NLP error.......: 2.5100786379621721e-09 2.5100786379621721e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2298458e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1944863e+02 6.71e+03 5.23e+01 -1.0 4.84e+03 - 2.16e-05 1.37e-0
4h 1
3 4.2746489e+02 6.55e+03 5.24e+01 -1.0 6.71e+03 - 4.40e-05 2.36e-0
2f 1
4 1.9375137e+04 6.81e-02 8.01e+01 -1.0 6.55e+03 - 3.23e-02 1.00e+0
0h 1
5 1.1073105e+04 6.48e-02 6.20e+01 -1.0 2.30e+01 - 2.26e-01 4.46e-0
2f 1
6 9.8597986e+03 1.54e-02 2.76e+01 -1.0 1.04e+01 - 5.80e-01 7.55e-0
1f 1
7 9.7407089e+03 8.27e-03 3.90e-01 -1.0 2.06e+00 - 9.86e-01 1.00e+0
0f 1
8 9.3846978e+03 1.66e-03 1.00e-01 -1.7 3.27e+00 - 1.00e+00 9.75e-0
1f 1
9 9.2396015e+03 1.75e-03 5.24e-01 -2.5 4.91e+00 - 1.00e+00 7.49e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.2091546e+03 3.14e-04 9.62e-02 -2.5 1.22e+00 - 1.00e+00 8.96e-0
1h 1
11 9.2123965e+03 1.16e-05 4.01e-03 -2.5 1.27e-01 - 1.00e+00 1.00e+0
0f 1
12 9.1849124e+03 1.05e-05 7.99e-03 -3.8 8.04e+00 - 1.00e+00 9.61e-0
1f 1
13 9.1843091e+03 1.57e-08 1.36e-05 -3.8 3.09e-01 - 1.00e+00 1.00e+0
0f 1
14 9.1828174e+03 1.79e-08 5.06e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0f 1
15 9.1828008e+03 6.40e-13 4.11e-10 -8.6 5.52e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 9.1828007831433496e+00 9.1828007831433497e+0
3
Dual infeasibility......: 4.1141849572618830e-10 4.1141849572618830e-0
7
Constraint violation....: 6.4032112945255903e-13 6.4032112945255903e-1
3
Complementarity.........: 2.9653340823551612e-09 2.9653340823551613e-0
6
Overall NLP error.......: 2.9653340823551612e-09 2.9653340823551613e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8763965e+02 4.77e+03 5.24e+01 -1.0 4.81e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8260399e+02 4.77e+03 5.24e+01 -1.0 2.41e+03 - 2.49e-05 2.00e-0
4h 1
3 3.6148267e+02 4.66e+03 5.25e+01 -1.0 4.77e+03 - 1.13e-04 2.29e-0
2f 1
4 1.7124683e+04 6.19e-02 8.08e+01 -1.0 4.66e+03 - 3.33e-02 1.00e+0
0h 1
5 8.5486089e+03 5.88e-02 6.12e+01 -1.0 5.72e+01 - 2.41e-01 4.50e-0
2f 1
6 7.0753812e+03 2.53e-02 3.10e+01 -1.0 2.60e+01 - 4.97e-01 5.31e-0
1f 1
7 6.3654600e+03 1.22e-02 2.08e+00 -1.0 9.69e+00 - 9.28e-01 8.76e-0
1f 1
8 6.7815393e+03 4.09e-04 8.46e-02 -1.0 4.02e+00 - 9.96e-01 1.00e+0
0f 1
9 6.0144162e+03 2.22e-03 1.93e-01 -2.5 6.41e+00 - 8.66e-01 9.54e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.9436355e+03 1.05e-03 5.82e-01 -2.5 4.18e+00 - 1.00e+00 5.83e-0
1h 1
11 5.9490642e+03 3.19e-06 8.15e-03 -2.5 2.11e+00 - 1.00e+00 1.00e+0
0h 1
12 5.9232707e+03 5.19e-06 3.60e-02 -3.8 1.34e+01 - 9.19e-01 8.84e-0
1f 1
13 5.9189071e+03 4.66e-04 5.62e-04 -3.8 1.55e+00 - 1.00e+00 1.00e+0
0f 1
14 5.9173203e+03 6.38e-05 1.15e-02 -5.7 7.43e-01 - 8.12e-01 1.00e+0
0h 1
15 5.9172047e+03 3.63e-05 4.13e-05 -5.7 9.70e-03 - 1.00e+00 1.00e+0
0h 1
16 5.9172063e+03 1.59e-06 4.30e-05 -5.7 1.47e-03 - 1.00e+00 9.88e-0
1h 1
17 5.9172088e+03 3.53e-08 5.13e-07 -5.7 2.92e-04 - 1.00e+00 1.00e+0
0f 1
18 5.9171869e+03 3.96e-08 7.28e-06 -8.6 9.21e-03 - 9.97e-01 9.81e-0
1h 1
19 5.9171866e+03 5.34e-13 2.97e-11 -8.6 1.77e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 5.9171865532417387e+00 5.9171865532417387e+0
3
Dual infeasibility......: 2.9740961075642589e-11 2.9740961075642589e-0
8
Constraint violation....: 5.3357318563485023e-13 5.3357318563485023e-1
3
Complementarity.........: 3.4427502373379675e-09 3.4427502373379675e-0
6
Overall NLP error.......: 3.4427502373379675e-09 3.4427502373379675e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9478285e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3f 1
2 8.9187540e+02 3.24e+03 5.24e+01 -1.0 3.02e+03 - 9.14e-05 1.06e-0
4h 1
3 8.1655199e+02 3.23e+03 5.24e+01 -1.0 3.24e+03 - 1.38e-05 3.11e-0
3f 1
4 3.3910587e+02 3.16e+03 5.23e+01 -1.0 3.23e+03 - 4.64e-03 2.16e-0
2h 1
5 1.3760479e+04 6.81e-02 7.78e+01 -1.0 3.16e+03 - 8.37e-02 1.00e+0
0h 1
6 6.7546785e+03 6.11e-02 3.98e+01 -1.0 4.44e+01 - 4.66e-01 9.34e-0
2f 1
7 5.3864148e+03 2.95e-02 1.35e+01 -1.0 2.09e+01 - 6.49e-01 5.65e-0
1f 1
8 5.1381255e+03 3.48e-03 7.14e-01 -1.0 6.07e+00 - 9.54e-01 7.93e-0
1h 1
9 4.8058915e+03 9.07e-03 2.89e-01 -1.7 1.90e+00 - 1.00e+00 8.12e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.7469494e+03 1.26e-03 1.39e-01 -1.7 1.88e+01 - 1.00e+00 9.70e-0
1f 1
11 4.6212428e+03 4.91e-04 1.73e-01 -2.5 1.68e+01 - 9.48e-01 8.28e-0
1h 1
12 4.5986044e+03 6.65e-05 4.46e-03 -2.5 2.80e+00 - 1.00e+00 1.00e+0
0f 1
13 4.5763010e+03 1.58e-05 2.73e-02 -3.8 2.68e+00 - 1.00e+00 9.25e-0
1h 1
14 4.5756329e+03 4.87e-08 5.45e-04 -3.8 1.99e-01 - 1.00e+00 1.00e+0
0f 1
15 4.5743308e+03 4.26e-08 4.12e-04 -5.7 1.49e-01 - 1.00e+00 9.91e-0
1f 1
16 4.5743249e+03 1.95e-12 3.00e-08 -5.7 1.33e-03 - 1.00e+00 1.00e+0
0f 1
17 4.5743102e+03 2.58e-12 3.28e-06 -8.6 1.84e-03 - 1.00e+00 9.99e-0
1f 1
18 4.5743102e+03 5.46e-15 4.84e-14 -8.6 1.07e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 4.5743101960801198e+00 4.5743101960801196e+0
3
Dual infeasibility......: 4.8371428227615270e-14 4.8371428227615270e-1
1
Constraint violation....: 5.4569991483042097e-15 5.4569991483042097e-1
5
Complementarity.........: 2.5059125779723421e-09 2.5059125779723419e-0
6
Overall NLP error.......: 2.5059125779723421e-09 2.5059125779723419e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8030290e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.83e-0
3h 1
2 8.7171466e+02 2.00e+03 5.24e+01 -1.0 1.39e+03 - 4.30e-05 3.27e-0
4h 1
3 2.9396249e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 2.57e-04 2.26e-0
2f 1
4 1.4205172e+04 6.11e-02 7.92e+01 -1.0 1.95e+03 - 5.53e-02 1.00e+0
0h 1
5 5.5467686e+03 5.67e-02 5.32e+01 -1.0 6.53e+01 - 3.16e-01 6.42e-0
2f 1
6 4.1882106e+03 3.11e-02 2.63e+01 -1.0 3.24e+01 - 4.95e-01 4.19e-0
1f 1
7 3.3783860e+03 1.31e-02 2.13e+00 -1.0 1.11e+01 - 9.19e-01 9.23e-0
1f 1
8 3.8257438e+03 3.97e-04 9.75e-02 -1.0 4.99e+00 - 9.95e-01 1.00e+0
0f 1
9 3.1648296e+03 1.17e-03 9.61e-01 -1.7 5.41e+01 - 4.75e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.2284911e+03 1.23e-05 1.44e-02 -1.7 3.04e+01 - 1.00e+00 1.00e+0
0h 1
11 3.0924544e+03 3.09e-05 3.75e-01 -2.5 7.43e+01 - 1.00e+00 7.95e-0
1f 1
12 3.0691669e+03 1.03e-04 4.57e-03 -2.5 1.48e+01 - 1.00e+00 1.00e+0
0f 1
13 3.0437724e+03 2.77e-04 8.67e-02 -3.8 1.34e+01 - 7.72e-01 1.00e+0
0h 1
14 3.0410342e+03 1.61e-03 2.06e-03 -3.8 3.63e-02 - 9.72e-01 1.00e+0
0f 1
15 3.0410745e+03 7.51e-05 6.58e-05 -3.8 1.18e-02 - 1.00e+00 1.00e+0
0h 1
16 3.0392756e+03 1.31e-04 1.11e-03 -5.7 7.43e-01 - 9.18e-01 1.00e+0
0h 1
17 3.0392340e+03 3.27e-05 6.72e-06 -5.7 8.43e-03 - 1.00e+00 1.00e+0
0h 1
18 3.0392396e+03 1.91e-07 3.44e-06 -5.7 6.29e-04 - 1.00e+00 1.00e+0
0h 1
19 3.0392193e+03 2.64e-08 3.34e-05 -8.6 9.21e-03 - 1.00e+00 9.57e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 3.0392184e+03 4.48e-12 5.21e-11 -8.6 3.97e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 3.0392183965303512e+00 3.0392183965303511e+0
3
Dual infeasibility......: 5.2067307596852569e-11 5.2067307596852569e-0
8
Constraint violation....: 4.4817483058068319e-12 4.4817483058068319e-1
2
Complementarity.........: 3.0504659900374095e-09 3.0504659900374096e-0
6
Overall NLP error.......: 3.0504659900374095e-09 3.0504659900374096e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0808031e+02 9.17e+02 5.23e+01 -1.0 9.22e+02 - 1.00e-03 9.86e-0
3h 1
2 8.8617108e+02 9.17e+02 5.23e+01 -1.0 8.07e+02 - 7.42e-05 8.22e-0
4h 1
3 2.8484271e+02 8.96e+02 5.24e+01 -1.0 9.17e+02 - 7.98e-04 2.30e-0
2h 1
4 1.3130925e+04 6.61e-02 7.64e+01 -1.0 8.96e+02 - 8.29e-02 1.00e+0
0h 1
5 4.8553004e+03 5.96e-02 3.83e+01 -1.0 2.93e+01 - 4.73e-01 8.96e-0
2f 1
6 3.3594619e+03 1.92e-02 1.58e+01 -1.0 1.54e+01 - 6.12e-01 7.37e-0
1f 1
7 3.4484569e+03 4.84e-03 1.76e-01 -1.0 2.12e+00 - 9.90e-01 1.00e+0
0f 1
8 3.0256349e+03 1.47e-03 1.26e-01 -1.7 7.99e+00 - 1.00e+00 1.00e+0
0f 1
9 2.8699577e+03 2.01e-03 4.20e-01 -2.5 5.63e+00 - 1.00e+00 7.84e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8453385e+03 1.62e-04 5.44e-03 -2.5 1.12e+00 - 1.00e+00 1.00e+0
0h 1
11 2.8215934e+03 4.47e-05 1.85e-01 -3.8 1.35e+01 - 1.00e+00 7.36e-0
1h 1
12 2.8142143e+03 1.62e-07 3.67e-04 -3.8 3.52e+00 - 1.00e+00 1.00e+0
0f 1
13 2.8124069e+03 2.71e-08 9.51e-04 -5.7 7.43e-01 - 1.00e+00 9.85e-0
1f 1
14 2.8123858e+03 1.86e-12 1.33e-08 -5.7 1.07e-02 - 1.00e+00 1.00e+0
0f 1
15 2.8123637e+03 2.63e-12 4.48e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 2.8123637103539121e+00 2.8123637103539122e+0
3
Dual infeasibility......: 4.4777030100684987e-09 4.4777030100684987e-0
6
Constraint violation....: 2.6306873346371162e-12 2.6306873346371162e-1
2
Complementarity.........: 3.6085022621207987e-09 3.6085022621207985e-0
6
Overall NLP error.......: 4.4777030100684987e-09 4.4777030100684987e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.03e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 6.36e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643335e+00 1.6104063281643334e+0
3
Dual infeasibility......: 2.4573533589687019e-12 2.4573533589687019e-0
9
Constraint violation....: 6.3603173554942194e-15 6.3603173554942194e-1
5
Complementarity.........: 2.5062163910047530e-09 2.5062163910047528e-0
6
Overall NLP error.......: 2.5062163910047530e-09 2.5062163910047528e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933498e-01 5.8277753147933493e+0
2
Dual infeasibility......: 2.1031320946147231e-09 2.1031320946147231e-0
6
Constraint violation....: 6.2994318095199731e-11 6.2994318095199731e-1
1
Complementarity.........: 2.8882108896903808e-09 2.8882108896903807e-0
6
Overall NLP error.......: 2.8882108896903808e-09 2.8882108896903807e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254210179e-01 6.4890146254210174e+0
2
Dual infeasibility......: 4.9126604805649068e-09 4.9126604805649068e-0
6
Constraint violation....: 6.2123811650494076e-09 6.2123811650494076e-0
9
Complementarity.........: 4.3646095252531724e-09 4.3646095252531725e-0
6
Overall NLP error.......: 6.2123811650494076e-09 4.9126604805649068e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.03e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 6.36e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643335e+00 1.6104063281643334e+0
3
Dual infeasibility......: 2.4573533589687019e-12 2.4573533589687019e-0
9
Constraint violation....: 6.3603173554942194e-15 6.3603173554942194e-1
5
Complementarity.........: 2.5062163910047530e-09 2.5062163910047528e-0
6
Overall NLP error.......: 2.5062163910047530e-09 2.5062163910047528e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2278083e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 3.31e-04 9.87e-0
3h 1
2 8.0391474e+02 9.17e+02 5.24e+01 -1.0 7.85e+02 - 8.87e-05 6.88e-0
4h 1
3 2.4271271e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 6.68e-04 2.10e-0
2h 1
4 1.2385916e+04 5.52e-02 8.23e+01 -1.0 8.98e+02 - 3.86e-02 1.00e+0
0h 1
5 3.8851959e+03 5.26e-02 5.59e+01 -1.0 8.06e+01 - 3.19e-01 5.02e-0
2f 1
6 1.9099004e+03 3.73e-02 2.99e+01 -1.0 3.93e+01 - 4.69e-01 5.04e-0
1f 1
7 4.6737272e+03 1.22e-02 2.67e+01 -1.0 2.06e+01 - 4.01e-01 1.00e+0
0h 1
8 1.8754601e+03 1.19e-02 1.01e+00 -1.0 2.53e+01 - 9.88e-01 8.94e-0
1f 1
9 2.0005994e+03 1.84e-04 4.66e-02 -1.0 3.18e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7351413e+03 2.16e-04 1.24e+00 -2.5 1.71e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5469297e+03 3.76e-03 1.33e-01 -2.5 7.60e+00 - 7.95e-01 1.00e+0
0f 1
12 1.5237159e+03 5.30e-03 3.11e-01 -2.5 1.84e+00 - 1.00e+00 7.66e-0
1h 1
13 1.5360639e+03 2.44e-04 4.74e-03 -2.5 7.11e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5034784e+03 1.70e-04 2.15e-02 -3.8 1.62e+01 - 9.91e-01 9.29e-0
1h 1
15 1.5021214e+03 7.21e-07 6.83e-05 -3.8 1.10e+00 - 1.00e+00 1.00e+0
0h 1
16 1.5003172e+03 3.77e-07 1.78e-04 -5.7 8.92e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003154e+03 3.79e-11 2.92e-09 -5.7 4.18e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.11e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932801818607e+00 1.5002932801818606e+0
3
Dual infeasibility......: 2.1737235542854744e-09 2.1737235542854744e-0
6
Constraint violation....: 6.2995414440436548e-11 6.2995414440436548e-1
1
Complementarity.........: 2.8882174399991029e-09 2.8882174399991029e-0
6
Overall NLP error.......: 2.8882174399991029e-09 2.8882174399991029e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
1 8.6534772e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 4.97e-04 9.87e-0
3h 1
2 8.4418057e+02 9.17e+02 5.24e+01 -1.0 8.02e+02 - 8.70e-05 7.83e-0
4h 1
3 2.6276094e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 7.65e-04 2.20e-0
2h 1
4 1.2724514e+04 5.99e-02 8.02e+01 -1.0 8.97e+02 - 5.06e-02 1.00e+0
0h 1
5 4.2755874e+03 5.59e-02 5.32e+01 -1.0 7.28e+01 - 3.26e-01 6.05e-0
2f 1
59 1.449816e+04 1.632511e+04 4.936789e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2434425e+02 1.57e+04 5.24e+01 -1.0 1.59e+04 - 3.31e-04 9.80e-0
3h 1
2 8.2149280e+02 1.57e+04 5.24e+01 -1.0 1.51e+04 - 4.66e-05 1.03e-0
4h 1
3 7.9665183e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 6.19e-06 2.00e-0
3h 1
4 5.7865015e+02 1.54e+04 5.26e+01 -1.0 1.57e+04 - 2.13e-03 2.05e-0
2h 1
5 2.6522800e+04 5.65e-02 8.25e+01 -1.0 1.54e+04 - 4.06e-02 1.00e+0
0h 1
6 1.8648968e+04 5.35e-02 4.91e+01 -1.0 7.53e+01 - 4.00e-01 5.29e-0
2f 1
7 1.6722158e+04 3.63e-02 2.56e+01 -1.0 3.97e+01 - 4.81e-01 4.97e-0
1f 1
8 1.7056229e+04 2.33e-02 1.08e+01 -1.0 1.98e+01 - 4.13e-01 1.25e-0
1f 4
9 1.6827857e+04 5.93e-03 3.12e-01 -1.0 4.46e+00 - 9.80e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6520014e+04 1.39e-03 3.97e-01 -1.7 5.50e+00 - 1.00e+00 8.27e-0
1f 1
11 1.6497488e+04 8.52e-04 1.62e-01 -1.7 3.67e+01 - 4.64e-01 1.00e+0
0f 1
12 1.6361058e+04 1.18e-03 7.56e-02 -2.5 3.44e+01 - 9.00e-01 1.00e+0
0f 1
13 1.6344858e+04 1.36e-03 1.79e-02 -2.5 1.10e+00 - 1.00e+00 1.00e+0
0h 1
14 1.6328585e+04 2.51e-04 1.18e-01 -3.8 5.36e+00 - 1.00e+00 8.23e-0
1h 1
15 1.6326326e+04 1.31e-06 1.63e-04 -3.8 9.49e-01 - 1.00e+00 1.00e+0
0h 1
16 1.6325119e+04 3.91e-07 1.67e-04 -5.7 2.97e-01 - 1.00e+00 9.96e-0
1h 1
17 1.6325120e+04 3.91e-11 3.00e-09 -5.7 4.17e-02 - 1.00e+00 1.00e+0
0f 1
18 1.6325105e+04 6.13e-11 8.22e-06 -8.6 3.68e-03 - 1.00e+00 9.87e-0
1h 1
19 1.6325105e+04 1.04e-14 3.51e-13 -8.6 7.17e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.6325105277848643e+01 1.6325105277848643e+0
4
Dual infeasibility......: 3.5062872772716698e-13 3.5062872772716698e-1
0
Constraint violation....: 1.0352829704629585e-14 1.0352829704629585e-1
4
Complementarity.........: 4.8784185232372630e-09 4.8784185232372625e-0
6
Overall NLP error.......: 4.8784185232372630e-09 4.8784185232372625e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4158238e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 3.83e-04 9.80e-0
3h 1
2 8.3867420e+02 1.50e+04 5.24e+01 -1.0 1.37e+04 - 3.08e-05 1.08e-0
4h 1
3 8.2789723e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 1.21e-05 8.24e-0
4h 1
4 6.7025713e+02 1.48e+04 5.25e+01 -1.0 1.50e+04 - 8.31e-04 1.27e-0
2h 1
5 8.3586121e+02 1.44e+04 5.19e+01 -1.0 1.48e+04 - 1.59e-02 2.45e-0
2f 1
6 2.1777011e+04 6.71e-02 7.89e+01 -1.0 1.44e+04 - 9.86e-02 1.00e+0
0h 1
7 1.7302654e+04 5.85e-02 2.22e+01 -1.0 5.32e+01 - 6.96e-01 1.20e-0
1f 1
8 1.5950246e+04 3.52e-02 4.15e+00 -1.0 3.08e+01 - 7.73e-01 5.23e-0
1f 1
9 1.6269031e+04 5.61e-03 3.85e+00 -1.0 2.38e+00 - 5.46e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6102075e+04 5.05e-04 1.38e+00 -1.0 2.13e+00 - 5.14e-01 1.00e+0
0f 1
11 1.6123125e+04 9.57e-05 5.09e-01 -1.0 3.82e+00 - 5.91e-01 1.00e+0
0f 1
12 1.5810534e+04 2.33e-04 5.47e-01 -1.7 5.57e+00 - 8.95e-01 7.04e-0
1f 1
13 1.5743790e+04 5.08e-04 4.06e-01 -1.7 1.20e+01 - 6.31e-01 1.00e+0
0f 1
14 1.5740007e+04 1.09e-04 3.50e-02 -1.7 1.61e+01 - 8.71e-01 1.00e+0
0h 1
15 1.5601301e+04 1.13e-03 7.39e-02 -2.5 2.97e+01 - 8.97e-01 1.00e+0
0f 1
16 1.5578507e+04 1.82e-03 2.06e-02 -2.5 1.42e+00 - 1.00e+00 1.00e+0
0h 1
17 1.5562844e+04 4.27e-04 1.86e-01 -3.8 5.93e+00 - 1.00e+00 7.69e-0
1h 1
18 1.5560423e+04 2.76e-07 2.11e-04 -3.8 1.11e+00 - 1.00e+00 1.00e+0
0h 1
19 1.5559218e+04 3.91e-07 4.37e-04 -5.7 2.93e-01 - 1.00e+00 9.93e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5559217e+04 4.02e-11 3.67e-09 -5.7 1.23e-03 - 1.00e+00 1.00e+0
0f 1
21 1.5559202e+04 6.30e-11 2.65e-09 -8.6 3.69e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.5559202149154226e+01 1.5559202149154225e+0
4
Dual infeasibility......: 2.6490923872045705e-09 2.6490923872045705e-0
6
Constraint violation....: 6.3003893768787123e-11 6.3003893768787123e-1
1
Complementarity.........: 2.8882799567676955e-09 2.8882799567676953e-0
6
Overall NLP error.......: 2.8882799567676955e-09 2.8882799567676953e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2172164e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.24e-04 9.80e-0
3f 1
2 8.1889913e+02 1.39e+04 5.24e+01 -1.0 1.37e+04 - 9.42e-05 1.01e-0
4h 1
3 8.0987658e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 3.07e-06 6.33e-0
4f 1
4 5.2186309e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 6.79e-04 2.10e-0
2h 1
5 2.5332685e+04 5.51e-02 8.25e+01 -1.0 1.36e+04 - 3.79e-02 1.00e+0
0h 1
6 1.6842698e+04 5.26e-02 5.67e+01 -1.0 8.06e+01 - 3.11e-01 4.96e-0
2f 1
7 1.4888332e+04 3.79e-02 3.02e+01 -1.0 3.87e+01 - 4.71e-01 5.01e-0
1f 1
8 1.5231343e+04 2.29e-02 1.40e+01 -1.0 2.03e+01 - 4.03e-01 1.25e-0
1f 4
9 1.4971037e+04 6.10e-03 3.57e-01 -1.0 5.12e+00 - 9.81e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4669520e+04 1.41e-03 3.86e-01 -1.7 5.35e+00 - 1.00e+00 8.31e-0
1f 1
11 1.4631778e+04 8.90e-04 1.39e-02 -1.7 1.79e+01 - 1.00e+00 1.00e+0
0f 1
12 1.4504234e+04 1.43e-03 9.67e-02 -3.8 1.99e+01 - 7.90e-01 9.30e-0
1f 1
13 1.4480597e+04 1.59e-03 8.07e-02 -3.8 1.70e+00 - 8.43e-01 7.55e-0
1h 1
14 1.4481006e+04 3.24e-06 8.34e-04 -3.8 3.38e-01 - 1.00e+00 1.00e+0
0h 1
15 1.4480071e+04 2.87e-07 6.65e-04 -5.7 1.49e-01 - 1.00e+00 9.88e-0
1h 1
16 1.4480065e+04 3.70e-11 6.62e-09 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0f 1
17 1.4480052e+04 6.30e-11 2.16e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.4480051776508585e+01 1.4480051776508584e+0
4
Dual infeasibility......: 2.1582430154291219e-09 2.1582430154291219e-0
6
Constraint violation....: 6.2998134486846880e-11 6.2998134486846880e-1
1
Complementarity.........: 2.8881027746007679e-09 2.8881027746007679e-0
6
Overall NLP error.......: 2.8881027746007679e-09 2.8881027746007679e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0373270e+02 1.27e+04 5.23e+01 -1.0 1.28e+04 - 8.89e-04 9.80e-0
3h 1
2 9.0091701e+02 1.27e+04 5.23e+01 -1.0 1.19e+04 - 3.97e-05 1.05e-0
4h 1
3 8.5286882e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 8.76e-06 3.25e-0
3h 1
4 5.7875597e+02 1.23e+04 5.23e+01 -1.0 1.26e+04 - 3.57e-03 2.17e-0
2h 1
5 2.3673526e+04 6.84e-02 7.71e+01 -1.0 1.23e+04 - 8.63e-02 1.00e+0
0h 1
6 1.6375659e+04 6.12e-02 3.76e+01 -1.0 3.39e+01 - 4.88e-01 9.49e-0
2f 1
7 1.4914602e+04 2.58e-02 1.34e+01 -1.0 1.70e+01 - 6.48e-01 6.82e-0
1f 1
8 1.4928504e+04 8.42e-03 1.37e+00 -1.0 2.25e+00 - 9.83e-01 5.00e-0
1f 2
9 1.5096745e+04 4.47e-04 8.52e-02 -1.0 2.09e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4563580e+04 2.15e-03 1.11e-01 -2.5 1.57e+01 - 8.58e-01 8.07e-0
1f 1
11 1.4391322e+04 2.12e-03 4.65e-01 -2.5 2.96e+00 - 1.00e+00 7.47e-0
1f 1
12 1.4361153e+04 1.71e-04 4.63e-03 -2.5 7.47e-01 - 1.00e+00 1.00e+0
0h 1
13 1.4337285e+04 1.41e-05 9.50e-03 -3.8 5.36e+00 - 1.00e+00 9.53e-0
1h 1
14 1.4336805e+04 5.26e-08 6.04e-04 -3.8 2.49e-01 - 1.00e+00 1.00e+0
0f 1
15 1.4335329e+04 4.80e-08 3.44e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0f 1
16 1.4335314e+04 4.84e-11 6.39e-06 -8.6 3.68e-03 - 1.00e+00 9.99e-0
1h 1
17 1.4335314e+04 7.11e-15 9.22e-14 -8.6 3.34e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.4335313772242054e+01 1.4335313772242054e+0
4
Dual infeasibility......: 9.2236780483806165e-14 9.2236780483806165e-1
1
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.7653177935742979e-09 2.7653177935742977e-0
6
Overall NLP error.......: 2.7653177935742979e-09 2.7653177935742977e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9481357e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 7.48e-04 9.80e-0
3h 1
2 8.9183826e+02 1.11e+04 5.24e+01 -1.0 9.65e+03 - 2.73e-05 1.14e-0
4h 1
3 7.2358249e+02 1.10e+04 5.24e+01 -1.0 1.11e+04 - 1.86e-05 1.03e-0
2h 1
4 6.2607053e+02 1.08e+04 5.20e+01 -1.0 1.10e+04 - 1.15e-02 2.10e-0
2h 1
5 1.9624052e+04 7.36e-02 7.76e+01 -1.0 1.08e+04 - 9.80e-02 1.00e+0
0h 1
6 1.4380395e+04 6.46e-02 2.08e+01 -1.0 3.73e+01 - 7.04e-01 1.14e-0
1f 1
7 1.2837848e+04 2.05e-02 1.65e+00 -1.0 1.97e+01 - 9.31e-01 7.25e-0
1f 1
8 1.3179866e+04 1.96e-03 8.50e-01 -1.0 4.05e+00 - 5.64e-01 1.00e+0
0f 1
9 1.2665906e+04 1.72e-03 2.04e-01 -1.7 4.21e+00 - 8.83e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2644440e+04 9.57e-04 6.52e-01 -1.7 1.14e+01 - 4.78e-01 1.00e+0
0f 1
11 1.2665380e+04 2.28e-06 6.51e-02 -1.7 1.45e+01 - 9.21e-01 1.00e+0
0h 1
12 1.2494956e+04 5.02e-04 2.38e-02 -2.5 2.04e+01 - 9.75e-01 9.46e-0
1f 1
13 1.2457342e+04 1.41e-04 7.60e-02 -3.8 1.22e+01 - 9.72e-01 8.79e-0
1h 1
14 1.2455202e+04 2.28e-07 8.73e-01 -3.8 1.52e+00 - 6.18e-01 1.00e+0
0h 1
15 1.2455102e+04 6.50e-09 1.89e-04 -3.8 1.56e-04 - 1.00e+00 1.00e+0
0h 1
16 1.2453702e+04 2.26e-08 2.69e-02 -5.7 4.46e-01 - 1.00e+00 9.07e-0
1f 1
17 1.2453581e+04 4.40e-11 2.93e-07 -5.7 4.13e-02 - 1.00e+00 1.00e+0
0f 1
18 1.2453562e+04 2.64e-12 3.14e-06 -8.6 5.53e-03 - 1.00e+00 9.99e-0
1h 1
19 1.2453562e+04 7.11e-15 4.77e-14 -8.6 2.86e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.2453562314670872e+01 1.2453562314670871e+0
4
Dual infeasibility......: 4.7683043453713027e-14 4.7683043453713027e-1
1
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.7125981510707470e-09 2.7125981510707470e-0
6
Overall NLP error.......: 2.7125981510707470e-09 2.7125981510707470e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8776327e+02 9.19e+03 5.24e+01 -1.0 9.28e+03 - 6.64e-04 9.80e-0
3h 1
2 8.8487848e+02 9.19e+03 5.24e+01 -1.0 8.49e+03 - 4.35e-05 1.07e-0
4h 1
3 8.1017704e+02 9.15e+03 5.24e+01 -1.0 9.19e+03 - 1.14e-05 4.07e-0
3h 1
4 4.8829985e+02 8.96e+03 5.23e+01 -1.0 9.15e+03 - 4.62e-03 2.12e-0
2h 1
5 1.9624072e+04 6.67e-02 7.88e+01 -1.0 8.96e+03 - 7.36e-02 1.00e+0
0h 1
6 1.2613352e+04 6.06e-02 4.34e+01 -1.0 5.13e+01 - 4.30e-01 8.42e-0
2f 1
7 1.1287964e+04 2.91e-02 1.67e+01 -1.0 2.55e+01 - 6.00e-01 4.84e-0
1f 1
8 1.0844638e+04 5.12e-03 9.75e-01 -1.0 9.16e+00 - 9.34e-01 7.59e-0
1f 1
9 1.1096445e+04 1.87e-04 6.10e-02 -1.0 4.66e+00 - 9.93e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.0465482e+04 2.23e-03 7.93e-02 -2.5 4.77e+00 - 8.70e-01 8.69e-0
1f 1
11 1.0359628e+04 1.08e-03 4.55e-01 -2.5 7.59e-01 - 1.00e+00 6.04e-0
1f 1
12 1.0359688e+04 2.49e-06 8.12e-03 -2.5 1.52e-01 - 1.00e+00 1.00e+0
0h 1
13 1.0339422e+04 6.15e-06 2.41e-02 -3.8 5.36e+00 - 9.14e-01 8.89e-0
1f 1
14 1.0335906e+04 4.61e-04 4.73e-04 -3.8 5.92e-01 - 1.00e+00 1.00e+0
0f 1
15 1.0334764e+04 6.26e-05 1.12e-02 -5.7 2.97e-01 - 8.14e-01 1.00e+0
0h 1
16 1.0334651e+04 3.52e-05 3.93e-05 -5.7 9.55e-03 - 1.00e+00 1.00e+0
0h 1
17 1.0334652e+04 1.18e-06 1.12e-05 -5.7 1.44e-03 - 1.00e+00 9.97e-0
1h 1
18 1.0334638e+04 2.43e-09 9.91e-08 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
19 1.0334638e+04 7.11e-15 3.66e-14 -8.6 9.44e-07 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.0334637963727447e+01 1.0334637963727448e+0
4
Dual infeasibility......: 3.6568394605131680e-14 3.6568394605131680e-1
1
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.7102744750116427e-09 2.7102744750116429e-0
6
Overall NLP error.......: 2.7102744750116427e-09 2.7102744750116429e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0888295e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0557265e+02 6.71e+03 5.23e+01 -1.0 5.21e+03 - 2.69e-05 1.27e-0
4h 1
3 4.1986899e+02 6.55e+03 5.24e+01 -1.0 6.70e+03 - 3.43e-05 2.35e-0
2f 1
4 1.9285646e+04 6.51e-02 8.06e+01 -1.0 6.55e+03 - 2.96e-02 1.00e+0
0h 1
5 1.0827936e+04 6.21e-02 6.35e+01 -1.0 3.91e+01 - 2.12e-01 4.20e-0
2f 1
6 9.5566169e+03 2.07e-02 3.00e+01 -1.0 1.63e+01 - 5.39e-01 6.15e-0
1f 1
7 9.1167531e+03 6.69e-03 9.63e-01 -1.0 5.59e+00 - 9.55e-01 7.70e-0
1f 1
8 9.3796749e+03 2.25e-04 7.21e-02 -1.0 4.69e+00 - 9.96e-01 1.00e+0
0f 1
9 8.8178179e+03 2.08e-03 8.38e-02 -2.5 3.15e+00 - 8.56e-01 8.41e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.6549807e+03 2.16e-03 4.28e-01 -2.5 1.10e+00 - 1.00e+00 7.59e-0
1f 1
11 8.6281362e+03 1.30e-04 4.70e-03 -2.5 3.04e-01 - 1.00e+00 1.00e+0
0h 1
12 8.6073220e+03 3.48e-05 1.49e-01 -3.8 8.04e+00 - 1.00e+00 7.59e-0
1h 1
13 8.6018721e+03 1.28e-07 3.42e-04 -3.8 1.93e+00 - 1.00e+00 1.00e+0
0f 1
14 8.6003516e+03 2.84e-08 9.74e-04 -5.7 4.46e-01 - 1.00e+00 9.85e-0
1h 1
15 8.6003344e+03 1.89e-12 1.38e-08 -5.7 6.63e-03 - 1.00e+00 1.00e+0
0f 1
16 8.6003159e+03 2.63e-12 4.48e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 8.6003159313316786e+00 8.6003159313316792e+0
3
Dual infeasibility......: 4.4776950457107691e-09 4.4776950457107691e-0
6
Constraint violation....: 2.6307844791517709e-12 2.6307844791517709e-1
2
Complementarity.........: 3.6084982973975740e-09 3.6084982973975739e-0
6
Overall NLP error.......: 4.4776950457107691e-09 4.4776950457107691e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2997022e+02 4.77e+03 5.23e+01 -1.0 4.81e+03 - 1.96e-03 9.81e-0
3h 1
2 7.5577386e+02 4.74e+03 5.23e+01 -1.0 4.71e+03 - 1.27e-05 7.63e-0
3h 1
3 4.2762046e+02 4.64e+03 5.20e+01 -1.0 4.74e+03 - 9.45e-03 2.11e-0
2h 1
4 1.4309518e+04 8.17e-02 7.89e+01 -1.0 4.64e+03 - 7.63e-02 1.00e+0
0h 1
5 8.9296780e+03 7.37e-02 4.13e+01 -1.0 1.52e+01 - 4.63e-01 9.23e-0
2f 1
6 7.8352721e+03 2.26e-02 1.01e+01 -1.0 8.20e+00 - 7.64e-01 8.36e-0
1f 1
7 8.1785573e+03 2.17e-03 1.16e-01 -1.0 3.10e+00 - 9.91e-01 1.00e+0
0f 1
8 7.7794734e+03 1.44e-03 1.30e-01 -1.7 1.42e+01 - 1.00e+00 1.00e+0
0f 1
9 7.5954668e+03 1.94e-03 3.21e-01 -2.5 1.26e+00 - 1.00e+00 8.11e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.5780602e+03 1.03e-04 2.97e-02 -2.5 2.53e-01 - 1.00e+00 9.63e-0
1f 1
11 7.5811115e+03 6.27e-06 9.98e-04 -2.5 6.71e-03 - 1.00e+00 1.00e+0
0f 1
12 7.5486878e+03 7.50e-06 4.40e-03 -3.8 1.34e+01 - 1.00e+00 9.78e-0
1f 1
13 7.5483552e+03 1.37e-08 6.34e-06 -3.8 2.89e-01 - 1.00e+00 1.00e+0
0f 1
14 7.5465686e+03 1.73e-08 3.04e-06 -5.7 7.43e-01 - 1.00e+00 1.00e+0
0f 1
15 7.5465477e+03 1.28e-12 4.22e-10 -8.6 9.20e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 7.5465477393040334e+00 7.5465477393040337e+0
3
Dual infeasibility......: 4.2179880094600093e-10 4.2179880094600093e-0
7
Constraint violation....: 1.2796708137585711e-12 1.2796708137585711e-1
2
Complementarity.........: 3.2265150411058011e-09 3.2265150411058010e-0
6
Overall NLP error.......: 3.2265150411058011e-09 3.2265150411058010e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6653022e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 4.97e-04 9.81e-0
3f 1
2 8.6323248e+02 3.24e+03 5.24e+01 -1.0 2.66e+03 - 5.18e-05 1.21e-0
4h 1
3 5.3831800e+02 3.20e+03 5.25e+01 -1.0 3.24e+03 - 3.12e-05 1.32e-0
2f 1
4 3.9903849e+02 3.13e+03 5.15e+01 -1.0 3.20e+03 - 2.00e-02 2.32e-0
2f 1
5 9.8503218e+03 7.36e-02 7.80e+01 -1.0 3.13e+03 - 1.07e-01 1.00e+0
0h 1
6 5.7440233e+03 6.32e-02 2.21e+01 -1.0 4.61e+01 - 6.97e-01 1.31e-0
1f 1
7 4.3233476e+03 3.42e-02 1.97e+00 -1.0 2.67e+01 - 8.81e-01 6.15e-0
1f 1
8 4.6962640e+03 3.54e-03 1.70e+00 -1.0 4.17e+00 - 6.88e-01 1.00e+0
0f 1
9 4.6034500e+03 2.82e-04 5.31e-01 -1.0 6.45e+00 - 4.21e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2045095e+03 3.08e-04 4.26e-01 -1.7 4.82e+00 - 9.26e-01 7.64e-0
1f 1
11 4.2073479e+03 4.02e-05 4.67e-01 -1.7 1.33e+01 - 7.27e-01 1.00e+0
0f 1
12 4.2094979e+03 5.52e-06 6.77e-04 -1.7 1.25e+01 - 1.00e+00 1.00e+0
0h 1
13 4.1098388e+03 6.21e-05 6.67e-02 -3.8 3.58e+01 - 9.04e-01 8.52e-0
1f 1
14 4.0872344e+03 6.45e-03 7.32e-02 -3.8 5.12e+00 - 5.78e-01 9.88e-0
1h 1
15 4.0845757e+03 2.79e-03 2.14e-03 -3.8 5.86e-02 - 9.70e-01 8.89e-0
1h 1
16 4.0849012e+03 8.78e-05 6.07e-04 -3.8 1.82e-02 - 1.00e+00 1.00e+0
0f 1
17 4.0833251e+03 1.48e-04 8.69e-04 -5.7 2.97e-01 - 9.38e-01 1.00e+0
0h 1
18 4.0833316e+03 4.13e-05 5.44e-03 -5.7 1.11e-03 - 1.00e+00 7.21e-0
1h 1
19 4.0833413e+03 1.16e-08 1.63e-06 -5.7 1.06e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 4.0833247e+03 9.32e-09 2.06e-05 -8.6 3.68e-03 - 1.00e+00 9.83e-0
1h 1
21 4.0833244e+03 1.51e-12 7.23e-11 -8.6 6.33e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 4.0833243937258166e+00 4.0833243937258167e+0
3
Dual infeasibility......: 7.2340983205281449e-11 7.2340983205281443e-0
8
Constraint violation....: 1.5064616221138749e-12 1.5064616221138749e-1
2
Complementarity.........: 2.7980628882043170e-09 2.7980628882043170e-0
6
Overall NLP error.......: 2.7980628882043170e-09 2.7980628882043170e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4507754e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 3.98e-04 9.82e-0
3h 1
2 8.3905718e+02 2.00e+03 5.24e+01 -1.0 1.11e+03 - 4.51e-05 2.23e-0
4h 1
3 2.7524753e+02 1.95e+03 5.26e+01 -1.0 2.00e+03 - 1.49e-04 2.18e-0
2f 1
4 1.3935346e+04 5.68e-02 8.10e+01 -1.0 1.95e+03 - 4.47e-02 1.00e+0
0h 1
5 5.1622871e+03 5.33e-02 5.36e+01 -1.0 8.19e+01 - 3.31e-01 5.50e-0
2f 1
6 3.0125711e+03 3.35e-02 2.96e+01 -1.0 4.24e+01 - 4.60e-01 5.40e-0
1f 1
7 4.0558493e+03 1.30e-02 1.19e+01 -1.0 2.42e+01 - 5.72e-01 5.00e-0
1f 2
8 3.1610499e+03 5.79e-03 5.49e-01 -1.0 1.08e+01 - 9.57e-01 1.00e+0
0f 1
9 2.8018544e+03 1.34e-03 3.59e-01 -1.7 6.29e+00 - 1.00e+00 8.29e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8142575e+03 6.86e-04 1.73e-02 -1.7 7.79e+01 - 1.00e+00 1.00e+0
0f 1
11 2.6183447e+03 1.37e-03 1.15e-01 -3.8 8.08e+01 - 7.68e-01 9.22e-0
1f 1
12 2.5796322e+03 2.68e-03 2.12e-02 -3.8 5.62e+00 - 8.10e-01 8.19e-0
1h 1
13 2.5805160e+03 4.81e-04 2.05e-01 -3.8 1.01e+00 - 1.00e+00 8.55e-0
1h 1
14 2.5809608e+03 5.91e-07 4.78e-05 -3.8 1.45e-01 - 1.00e+00 1.00e+0
0f 1
15 2.5794821e+03 4.23e-07 2.33e-03 -5.7 5.94e-01 - 1.00e+00 9.77e-0
1h 1
16 2.5794622e+03 4.86e-11 2.27e-08 -5.7 1.36e-02 - 1.00e+00 1.00e+0
0f 1
17 2.5794438e+03 6.30e-11 4.40e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 2.5794437889540989e+00 2.5794437889540986e+0
3
Dual infeasibility......: 4.3999642424930273e-09 4.3999642424930273e-0
6
Constraint violation....: 6.2987656757051980e-11 6.2987656757051980e-1
1
Complementarity.........: 3.3856530450787381e-09 3.3856530450787379e-0
6
Overall NLP error.......: 4.3999642424930273e-09 4.3999642424930273e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2210501e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 3.29e-04 9.87e-0
3h 1
2 8.0325970e+02 9.17e+02 5.24e+01 -1.0 7.85e+02 - 8.88e-05 6.87e-0
4h 1
3 2.4241339e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 6.67e-04 2.10e-0
2h 1
4 1.2380622e+04 5.52e-02 8.24e+01 -1.0 8.98e+02 - 3.84e-02 1.00e+0
0h 1
5 3.8797899e+03 5.26e-02 5.61e+01 -1.0 8.06e+01 - 3.16e-01 5.00e-0
2f 1
6 1.9096264e+03 3.75e-02 3.00e+01 -1.0 3.91e+01 - 4.70e-01 5.04e-0
1f 1
7 4.6687952e+03 1.22e-02 2.67e+01 -1.0 2.05e+01 - 4.02e-01 1.00e+0
0h 1
8 1.8748614e+03 1.18e-02 1.00e+00 -1.0 2.53e+01 - 9.88e-01 8.94e-0
1f 1
9 2.0007588e+03 1.82e-04 4.64e-02 -1.0 3.23e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7349644e+03 2.15e-04 1.23e+00 -2.5 1.77e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5468567e+03 3.76e-03 1.33e-01 -2.5 7.59e+00 - 7.96e-01 1.00e+0
0f 1
12 1.5237331e+03 5.33e-03 3.08e-01 -2.5 1.83e+00 - 1.00e+00 7.68e-0
1h 1
13 1.5360587e+03 2.45e-04 4.69e-03 -2.5 7.08e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5034663e+03 1.70e-04 2.13e-02 -3.8 1.62e+01 - 9.91e-01 9.30e-0
1h 1
15 1.5021214e+03 7.20e-07 6.83e-05 -3.8 1.09e+00 - 1.00e+00 1.00e+0
0h 1
16 1.5003171e+03 3.77e-07 1.76e-04 -5.7 8.92e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003154e+03 3.79e-11 2.93e-09 -5.7 3.97e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.11e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932801846629e+00 1.5002932801846628e+0
3
Dual infeasibility......: 2.1695057968284342e-09 2.1695057968284342e-0
6
Constraint violation....: 6.2995428318224356e-11 6.2995428318224356e-1
1
Complementarity.........: 2.8882170506142545e-09 2.8882170506142543e-0
6
Overall NLP error.......: 2.8882170506142545e-09 2.8882170506142543e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1566044e+02 1.10e+02 1.13e+02 -1.0 3.77e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1396015e+04 5.38e-02 8.36e+01 -1.0 4.54e+01 - 3.09e-02 1.00e+0
0h 1
3 2.7823879e+03 5.17e-02 6.49e+01 -1.0 8.43e+01 - 2.27e-01 4.31e-0
2f 1
4 9.8131607e+02 4.24e-02 3.38e+01 -1.0 3.40e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5885253e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.22e-01 1.00e+0
0h 1
6 9.4486170e+02 1.01e-02 8.70e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6263137e+02 4.58e-04 6.61e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536201e+02 1.94e-03 1.93e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379517e+02 3.25e-03 6.09e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140262e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388122e+02 1.57e-04 1.68e-02 -3.8 7.57e-01 - 9.93e-01 9.42e-0
1h 1
12 5.8370190e+02 7.28e-07 6.65e-05 -3.8 8.53e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278678e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.07e-09 -5.7 3.36e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148958511e-01 5.8277753148958504e+0
2
Dual infeasibility......: 2.0877061975412429e-09 2.0877061975412429e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882094122148484e-09 2.8882094122148482e-0
6
Overall NLP error.......: 2.8882094122148484e-09 2.8882094122148482e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1566044e+02 1.10e+02 1.13e+02 -1.0 3.77e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1396015e+04 5.38e-02 8.36e+01 -1.0 4.54e+01 - 3.09e-02 1.00e+0
0h 1
3 2.7823879e+03 5.17e-02 6.49e+01 -1.0 8.43e+01 - 2.27e-01 4.31e-0
2f 1
4 9.8131607e+02 4.24e-02 3.38e+01 -1.0 3.40e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5885253e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.22e-01 1.00e+0
0h 1
6 9.4486170e+02 1.01e-02 8.70e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6263137e+02 4.58e-04 6.61e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536201e+02 1.94e-03 1.93e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379517e+02 3.25e-03 6.09e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140262e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388122e+02 1.57e-04 1.68e-02 -3.8 7.57e-01 - 9.93e-01 9.42e-0
1h 1
12 5.8370190e+02 7.28e-07 6.65e-05 -3.8 8.53e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278678e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.07e-09 -5.7 3.36e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148958511e-01 5.8277753148958504e+0
2
Dual infeasibility......: 2.0877061975412429e-09 2.0877061975412429e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882094122148484e-09 2.8882094122148482e-0
6
Overall NLP error.......: 2.8882094122148484e-09 2.8882094122148482e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.80e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.4978051e+02 7.52e+01 9.06e+01 -1.0 2.60e+01 - 3.82e-04 3.52e-0
2f 1
2 1.1816166e+04 5.63e-02 8.12e+01 -1.0 2.88e+01 - 4.62e-02 1.00e+0
0h 1
3 3.1564267e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.64e-0
2f 1
4 1.0149334e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8284302e+03 7.32e-03 1.59e+01 -1.0 1.90e+01 - 6.03e-01 1.00e+0
0h 1
6 1.1134168e+03 5.44e-03 4.06e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8143769e+02 9.79e-04 2.02e-01 -1.7 5.70e+00 - 1.00e+00 8.92e-0
1h 1
8 7.2728789e+02 8.59e-04 1.30e-02 -1.7 3.46e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0949856e+02 1.50e-03 1.12e-01 -3.8 4.46e+00 - 7.72e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8220670e+02 2.13e-03 7.55e-02 -3.8 2.09e+00 - 8.08e-01 7.38e-0
1h 1
11 5.8338964e+02 7.21e-05 3.64e-02 -3.8 3.06e-02 - 1.00e+00 9.66e-0
1h 1
12 5.8368705e+02 2.74e-07 1.08e-05 -3.8 4.02e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278916e+02 4.12e-07 5.13e-04 -5.7 3.46e-02 - 1.00e+00 9.92e-0
1h 1
14 5.8278859e+02 4.35e-11 3.44e-09 -5.7 2.52e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.62e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753113916864e-01 5.8277753113916867e+0
2
Dual infeasibility......: 2.6150468740752504e-09 2.6150468740752504e-0
6
Constraint violation....: 6.3001423522557332e-11 6.3001423522557332e-1
1
Complementarity.........: 2.8882628646907382e-09 2.8882628646907383e-0
6
Overall NLP error.......: 2.8882628646907382e-09 2.8882628646907383e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.30e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9759544e+02 4.11e+01 5.96e+01 -1.0 1.43e+01 - 6.96e-04 4.22e-0
2f 1
2 1.2224098e+04 6.07e-02 7.87e+01 -1.0 1.80e+01 - 7.04e-02 1.00e+0
0h 1
3 3.6170991e+03 5.54e-02 5.16e+01 -1.0 5.49e+01 - 3.32e-01 7.83e-0
2f 1
4 2.3476185e+03 2.94e-02 2.29e+01 -1.0 2.73e+01 - 5.43e-01 4.45e-0
1f 1
5 1.7456134e+03 8.58e-03 1.20e+00 -1.0 1.00e+01 - 9.27e-01 7.72e-0
1f 1
6 2.0213078e+03 3.37e-04 8.13e-02 -1.0 3.40e+00 - 1.00e+00 1.00e+0
0h 1
7 1.3902101e+03 2.08e-03 8.01e-02 -2.5 4.92e+00 - 8.66e-01 8.53e-0
1f 1
8 1.2107895e+03 2.16e-03 1.86e-01 -2.5 1.04e+00 - 1.00e+00 8.42e-0
1f 1
9 1.1998073e+03 5.14e-05 5.05e-03 -2.5 1.24e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1928755e+03 2.82e-05 1.76e+00 -3.8 9.02e-02 - 1.00e+00 4.73e-0
1h 1
11 1.1901849e+03 1.01e-06 9.00e-02 -3.8 6.87e-02 - 9.43e-01 1.00e+0
0f 1
12 1.1897177e+03 2.42e-05 1.77e-01 -3.8 2.56e-02 - 1.00e+00 4.57e-0
1h 2
13 1.1894881e+03 3.47e-06 1.32e-04 -3.8 1.21e-02 - 1.00e+00 1.00e+0
0h 1
14 1.1887733e+03 6.55e-06 5.62e-02 -5.7 1.33e-02 - 7.11e-01 9.85e-0
1h 1
15 1.1885981e+03 1.83e-05 2.23e-04 -5.7 6.48e-03 - 9.83e-01 1.00e+0
0f 1
16 1.1886023e+03 6.18e-09 1.23e-06 -5.7 1.27e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1885901e+03 1.58e-08 3.58e-05 -8.6 1.75e-04 - 9.91e-01 9.62e-0
1h 1
18 1.1885897e+03 3.45e-12 5.01e-11 -8.6 6.57e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1885897151338849e+00 1.1885897151338850e+0
3
Dual infeasibility......: 5.0130829851657035e-11 5.0130829851657035e-0
8
Constraint violation....: 3.4476865806709611e-12 3.4476865806709611e-1
2
Complementarity.........: 2.5125975246054917e-09 2.5125975246054916e-0
6
Overall NLP error.......: 2.5125975246054917e-09 2.5125975246054916e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2184677e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 3.29e-04 9.88e-0
3h 1
2 8.0091403e+02 9.17e+02 5.24e+01 -1.0 7.99e+02 - 9.95e-05 7.63e-0
4h 1
3 5.3166125e+02 9.08e+02 5.25e+01 -1.0 9.17e+02 - 7.40e-04 1.01e-0
2h 1
4 2.7895493e+02 8.88e+02 5.21e+01 -1.0 9.08e+02 - 1.15e-02 2.18e-0
2f 1
5 8.4111867e+03 6.32e-02 8.19e+01 -1.0 8.88e+02 - 6.31e-02 1.00e+0
0h 1
6 3.4032738e+03 5.76e-02 2.47e+01 -1.0 5.33e+01 - 6.80e-01 8.22e-0
2f 1
7 1.8640529e+03 3.67e-02 6.87e+00 -1.0 3.49e+01 - 6.91e-01 4.95e-0
1f 1
8 2.2961266e+03 6.24e-03 1.77e-01 -1.0 1.31e+00 - 9.90e-01 1.00e+0
0f 1
9 1.7062013e+03 9.71e-04 1.15e-01 -1.7 1.63e+01 - 1.00e+00 9.02e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5713683e+03 1.69e-03 2.99e-01 -2.5 5.71e+00 - 7.80e-01 1.00e+0
0h 1
11 1.5249231e+03 7.74e-03 1.83e-01 -2.5 3.00e+00 - 1.00e+00 8.54e-0
1h 1
12 1.5361644e+03 2.45e-04 6.53e-03 -2.5 5.19e-01 - 1.00e+00 1.00e+0
0h 1
13 1.5030724e+03 1.69e-04 2.13e-02 -3.8 1.67e+01 - 1.00e+00 9.36e-0
1h 1
14 1.5021207e+03 5.69e-07 6.57e-05 -3.8 7.86e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5003164e+03 3.83e-07 1.81e-04 -5.7 8.92e-01 - 1.00e+00 9.96e-0
1h 1
16 1.5003154e+03 3.83e-11 2.96e-09 -5.7 1.12e-02 - 1.00e+00 1.00e+0
0f 1
17 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.11e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5002932800517623e+00 1.5002932800517624e+0
3
Dual infeasibility......: 2.1695014106152771e-09 2.1695014106152771e-0
6
Constraint violation....: 6.2995580973890242e-11 6.2995580973890242e-1
1
Complementarity.........: 2.8882162899683723e-09 2.8882162899683724e-0
6
Overall NLP error.......: 2.8882162899683723e-09 2.8882162899683724e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6445969e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 4.93e-04 9.88e-0
3h 1
2 8.4100417e+02 9.17e+02 5.24e+01 -1.0 8.13e+02 - 9.78e-05 8.68e-0
4h 1
3 4.8921180e+02 9.04e+02 5.24e+01 -1.0 9.17e+02 - 8.43e-04 1.34e-0
2h 1
4 3.2500246e+02 8.82e+02 5.19e+01 -1.0 9.05e+02 - 1.50e-02 2.50e-0
2f 1
5 8.1089808e+03 7.00e-02 7.78e+01 -1.0 8.82e+02 - 1.06e-01 1.00e+0
0h 1
6 3.4846878e+03 6.05e-02 2.21e+01 -1.0 5.28e+01 - 6.91e-01 1.25e-0
1f 1
60 1.316856e+04 1.632511e+04 4.992358e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6794703e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.80e-0
3f 1
2 7.6502059e+02 1.57e+04 5.25e+01 -1.0 1.45e+04 - 3.26e-05 1.07e-0
4h 1
3 7.0468039e+02 1.57e+04 5.26e+01 -1.0 1.57e+04 - 1.09e-05 4.79e-0
3h 1
4 5.8464030e+02 1.54e+04 5.26e+01 -1.0 1.57e+04 - 5.10e-03 1.93e-0
2h 1
5 2.4827153e+04 6.31e-02 8.49e+01 -1.0 1.54e+04 - 3.35e-02 1.00e+0
0h 1
6 1.8159637e+04 6.02e-02 5.15e+01 -1.0 6.22e+01 - 3.96e-01 4.92e-0
2f 1
7 1.6670034e+04 4.56e-02 2.38e+01 -1.0 2.93e+01 - 5.32e-01 4.29e-0
1f 1
8 1.7215660e+04 2.76e-02 8.96e+00 -1.0 1.50e+01 - 4.96e-01 2.50e-0
1f 3
9 1.6795891e+04 5.68e-03 1.03e-01 -1.0 5.87e+00 - 9.92e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6503693e+04 9.81e-04 3.87e-01 -1.7 1.05e+01 - 7.06e-01 8.95e-0
1f 1
11 1.6498350e+04 3.04e-04 2.87e-01 -1.7 2.12e+01 - 6.77e-01 1.00e+0
0f 1
12 1.6506583e+04 6.90e-05 3.67e-02 -1.7 2.00e+01 - 8.62e-01 1.00e+0
0h 1
13 1.6369285e+04 9.94e-04 4.91e-02 -2.5 4.04e+01 - 9.22e-01 1.00e+0
0f 1
14 1.6347685e+04 1.14e-03 1.22e-02 -2.5 2.42e+00 - 1.00e+00 1.00e+0
0h 1
15 1.6328609e+04 1.92e-04 8.71e-02 -3.8 8.05e+00 - 1.00e+00 8.51e-0
1h 1
16 1.6326485e+04 5.89e-07 1.04e-04 -3.8 1.19e+00 - 1.00e+00 1.00e+0
0h 1
17 1.6325120e+04 4.00e-07 1.11e-04 -5.7 4.46e-01 - 1.00e+00 9.97e-0
1h 1
18 1.6325122e+04 3.81e-11 2.99e-09 -5.7 2.59e-02 - 1.00e+00 1.00e+0
0f 1
19 1.6325106e+04 5.63e-11 3.12e-05 -8.6 5.50e-03 - 1.00e+00 9.49e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325105e+04 1.61e-13 5.30e-12 -8.6 1.23e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.6325105279677437e+01 1.6325105279677437e+0
4
Dual infeasibility......: 5.3022228913626165e-12 5.3022228913626165e-0
9
Constraint violation....: 1.6135703884145869e-13 1.6135703884145869e-1
3
Complementarity.........: 6.7019685478650238e-09 6.7019685478650238e-0
6
Overall NLP error.......: 6.7019685478650238e-09 6.7019685478650238e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6808320e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.29e-04 9.80e-0
3f 1
2 7.6514449e+02 1.50e+04 5.25e+01 -1.0 1.37e+04 - 3.27e-05 1.08e-0
4h 1
3 7.5429352e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 1.15e-05 8.11e-0
4h 1
4 6.1505522e+02 1.48e+04 5.26e+01 -1.0 1.50e+04 - 8.18e-04 1.12e-0
2h 1
5 7.6665291e+02 1.44e+04 5.21e+01 -1.0 1.48e+04 - 1.42e-02 2.39e-0
2f 1
6 2.1583187e+04 6.39e-02 8.34e+01 -1.0 1.44e+04 - 5.17e-02 1.00e+0
0h 1
7 1.7167682e+04 5.93e-02 2.65e+01 -1.0 4.41e+01 - 6.70e-01 7.47e-0
2f 1
8 1.5879432e+04 3.90e-02 9.16e+00 -1.0 2.75e+01 - 6.36e-01 4.83e-0
1f 1
9 1.6306201e+04 7.13e-03 9.77e-01 -1.0 3.26e+00 - 9.32e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6082713e+04 6.52e-04 1.26e+00 -1.0 8.30e+00 - 1.55e-01 1.00e+0
0f 1
11 1.6075727e+04 1.11e-04 6.02e-01 -1.0 8.26e+00 - 6.34e-01 1.00e+0
0f 1
12 1.5773939e+04 2.44e-04 4.17e-01 -1.7 4.82e+00 - 9.39e-01 8.06e-0
1f 1
13 1.5734131e+04 6.95e-04 8.62e-02 -1.7 2.04e+01 - 8.40e-01 1.00e+0
0f 1
14 1.5598001e+04 1.23e-03 5.92e-02 -2.5 3.28e+01 - 9.04e-01 1.00e+0
0f 1
15 1.5578907e+04 1.36e-03 1.47e-02 -2.5 1.22e+00 - 1.00e+00 1.00e+0
0h 1
16 1.5562115e+04 2.31e-04 9.71e-02 -3.8 5.95e+00 - 1.00e+00 8.42e-0
1h 1
17 1.5560427e+04 5.38e-07 1.24e-04 -3.8 6.78e-01 - 1.00e+00 1.00e+0
0h 1
18 1.5559214e+04 4.01e-07 1.12e-04 -5.7 2.95e-01 - 1.00e+00 9.97e-0
1h 1
19 1.5559217e+04 3.84e-11 3.03e-09 -5.7 1.37e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5559202e+04 6.30e-11 2.07e-09 -8.6 3.69e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.5559202149542346e+01 1.5559202149542345e+0
4
Dual infeasibility......: 2.0695858044534957e-09 2.0695858044534957e-0
6
Constraint violation....: 6.2993388283416607e-11 6.2993388283416607e-1
1
Complementarity.........: 2.8882113742203938e-09 2.8882113742203939e-0
6
Overall NLP error.......: 2.8882113742203938e-09 2.8882113742203939e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.3158177e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.51e-04 9.80e-0
3h 1
2 8.2871964e+02 1.39e+04 5.24e+01 -1.0 1.32e+04 - 4.66e-05 1.04e-0
4h 1
3 8.2695741e+02 1.39e+04 5.24e+01 -1.0 1.38e+04 - 7.09e-06 1.23e-0
4h 1
4 8.2479636e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 1.28e-04 1.53e-0
4h 1
5 5.2699941e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 2.88e-04 2.14e-0
2f 1
6 2.5571055e+04 5.56e-02 8.19e+01 -1.0 1.36e+04 - 4.02e-02 1.00e+0
0h 1
7 1.6936281e+04 5.27e-02 5.45e+01 -1.0 8.15e+01 - 3.31e-01 5.14e-0
2f 1
8 1.4894275e+04 3.53e-02 2.95e+01 -1.0 4.07e+01 - 4.64e-01 5.16e-0
1f 1
9 1.5248307e+04 2.21e-02 1.39e+01 -1.0 2.15e+01 - 3.94e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5009543e+04 5.62e-03 5.52e-01 -1.0 4.11e+00 - 9.70e-01 1.00e+0
0h 1
11 1.4687933e+04 1.49e-03 4.87e-01 -1.7 6.32e+00 - 1.00e+00 8.01e-0
1f 1
12 1.4634796e+04 1.02e-03 1.71e-02 -1.7 2.09e+01 - 1.00e+00 1.00e+0
0f 1
13 1.4503350e+04 1.48e-03 9.48e-02 -3.8 2.36e+01 - 7.84e-01 9.19e-0
1f 1
14 1.4480171e+04 1.74e-03 1.03e-01 -3.8 1.76e+00 - 8.41e-01 7.38e-0
1h 1
15 1.4480986e+04 3.79e-06 9.68e-04 -3.8 3.52e-02 - 1.00e+00 1.00e+0
0h 1
16 1.4480072e+04 2.42e-07 7.50e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
17 1.4480065e+04 3.35e-11 7.15e-09 -5.7 1.71e-01 - 1.00e+00 1.00e+0
0f 1
18 1.4480052e+04 6.30e-11 2.24e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.4480051776437250e+01 1.4480051776437249e+0
4
Dual infeasibility......: 2.2424237536238482e-09 2.2424237536238482e-0
6
Constraint violation....: 6.3000812899893788e-11 6.3000812899893788e-1
1
Complementarity.........: 2.8880938131588521e-09 2.8880938131588520e-0
6
Overall NLP error.......: 2.8880938131588521e-09 2.8880938131588520e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.3793202e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.71e-04 9.80e-0
3h 1
2 8.3506138e+02 1.27e+04 5.24e+01 -1.0 1.20e+04 - 4.65e-05 1.04e-0
4h 1
3 7.9583940e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 7.77e-06 2.55e-0
3h 1
4 5.2387069e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 2.76e-03 2.06e-0
2h 1
5 2.3276058e+04 5.85e-02 8.18e+01 -1.0 1.24e+04 - 4.65e-02 1.00e+0
0h 1
6 1.5633413e+04 5.48e-02 4.82e+01 -1.0 7.34e+01 - 4.02e-01 5.85e-0
2f 1
7 1.3648889e+04 3.60e-02 2.48e+01 -1.0 4.11e+01 - 4.88e-01 5.13e-0
1f 1
8 1.4004343e+04 1.95e-02 4.54e+00 -1.0 1.25e+01 - 6.71e-01 2.50e-0
1f 3
9 1.3789629e+04 4.90e-03 3.01e-01 -1.0 5.28e+00 - 9.60e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3451137e+04 1.32e-03 4.89e-01 -1.7 6.09e+00 - 1.00e+00 7.95e-0
1f 1
11 1.3414439e+04 7.18e-04 2.45e-02 -1.7 3.67e+01 - 1.00e+00 1.00e+0
0f 1
12 1.3260602e+04 1.53e-03 1.08e-01 -3.8 3.98e+01 - 7.69e-01 9.22e-0
1f 1
13 1.3233608e+04 1.99e-03 1.04e-01 -3.8 3.08e+00 - 8.26e-01 7.31e-0
1h 1
14 1.3234109e+04 2.71e-06 1.14e-03 -3.8 8.28e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3233076e+04 2.36e-07 8.47e-04 -5.7 2.97e-01 - 1.00e+00 9.85e-0
1h 1
16 1.3233066e+04 3.01e-11 7.44e-09 -5.7 2.70e-02 - 1.00e+00 1.00e+0
0f 1
17 1.3233051e+04 6.30e-11 2.40e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.3233050930144508e+01 1.3233050930144507e+0
4
Dual infeasibility......: 2.3950552812121098e-09 2.3950552812121098e-0
6
Constraint violation....: 6.3004990114023940e-11 6.3004990114023940e-1
1
Complementarity.........: 3.0988519414322871e-09 3.0988519414322872e-0
6
Overall NLP error.......: 3.0988519414322871e-09 3.0988519414322872e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9039507e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 6.93e-04 9.80e-0
3h 1
2 8.8762844e+02 1.11e+04 5.24e+01 -1.0 1.09e+04 - 8.79e-05 1.01e-0
4h 1
3 8.7358167e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 3.98e-06 8.56e-0
4f 1
4 5.1379270e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 9.42e-04 2.26e-0
2h 1
5 2.3081538e+04 6.33e-02 7.84e+01 -1.0 1.09e+04 - 6.45e-02 1.00e+0
0h 1
6 1.4757310e+04 5.82e-02 5.00e+01 -1.0 5.46e+01 - 3.47e-01 7.30e-0
2f 1
7 1.3459670e+04 2.89e-02 2.26e+01 -1.0 2.58e+01 - 5.37e-01 4.62e-0
1f 1
8 1.2855600e+04 8.53e-03 1.15e+00 -1.0 9.88e+00 - 9.28e-01 7.67e-0
1f 1
9 1.3138003e+04 3.15e-04 7.95e-02 -1.0 3.36e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2507017e+04 2.10e-03 7.94e-02 -2.5 4.91e+00 - 8.67e-01 8.54e-0
1f 1
11 1.2327339e+04 2.16e-03 1.69e-01 -2.5 1.02e+00 - 1.00e+00 8.51e-0
1f 1
12 1.2323950e+04 2.01e-05 6.15e-03 -2.5 9.48e-02 - 1.00e+00 1.00e+0
0h 1
13 1.2313619e+04 1.03e-05 1.24e+00 -3.8 2.68e+00 - 1.00e+00 5.78e-0
1h 1
14 1.2309844e+04 1.37e-06 7.02e-02 -3.8 1.13e+00 - 9.28e-01 1.00e+0
0f 1
15 1.2309411e+04 3.76e-05 1.47e-01 -3.8 1.81e-02 - 1.00e+00 4.44e-0
1h 2
16 1.2309239e+04 2.95e-06 7.59e-05 -3.8 8.86e-03 - 1.00e+00 1.00e+0
0h 1
17 1.2308328e+04 1.25e-05 4.61e-02 -5.7 1.49e-01 - 7.00e-01 9.91e-0
1h 1
18 1.2308163e+04 1.94e-05 1.79e-04 -5.7 6.80e-03 - 9.84e-01 1.00e+0
0f 1
19 1.2308166e+04 4.01e-08 2.87e-06 -5.7 3.05e-04 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.2308153e+04 1.19e-08 6.90e-05 -8.6 1.84e-03 - 9.94e-01 9.51e-0
1h 1
21 1.2308152e+04 6.04e-12 7.00e-11 -8.6 9.09e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.2308151961959124e+01 1.2308151961959124e+0
4
Dual infeasibility......: 6.9976683511561505e-11 6.9976683511561505e-0
8
Constraint violation....: 6.0424998338248770e-12 6.0424998338248770e-1
2
Complementarity.........: 2.5116262914285080e-09 2.5116262914285080e-0
6
Overall NLP error.......: 2.5116262914285080e-09 2.5116262914285080e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3005826e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 2.02e-03 9.80e-0
3h 1
2 9.2703232e+02 9.19e+03 5.23e+01 -1.0 8.09e+03 - 2.76e-05 1.12e-0
4h 1
3 7.5783103e+02 9.11e+03 5.23e+01 -1.0 9.19e+03 - 1.67e-05 9.02e-0
3f 1
4 5.7019949e+02 8.91e+03 5.19e+01 -1.0 9.11e+03 - 1.10e-02 2.10e-0
2h 1
5 1.8305221e+04 8.28e-02 7.82e+01 -1.0 8.91e+03 - 8.71e-02 1.00e+0
0h 1
6 1.3289624e+04 7.37e-02 2.12e+01 -1.0 7.99e+00 - 7.08e-01 1.04e-0
1f 1
7 1.2190257e+04 3.47e-02 3.50e+00 -1.0 6.47e+00 - 8.56e-01 9.70e-0
1f 1
8 1.2545395e+04 3.12e-02 3.81e-01 -1.0 2.06e+00 - 9.30e-01 9.51e-0
1f 1
9 1.2154553e+04 4.32e-03 1.03e+00 -1.7 4.23e+00 - 5.11e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2129341e+04 3.97e-04 6.19e-01 -1.7 6.89e+00 - 6.86e-01 1.00e+0
0h 1
11 1.2149455e+04 8.50e-05 1.38e-01 -1.7 1.21e+01 - 8.10e-01 1.00e+0
0f 1
12 1.1997111e+04 3.82e-04 2.00e-02 -2.5 1.59e+01 - 9.73e-01 9.43e-0
1f 1
13 1.1971102e+04 9.97e-05 1.50e-01 -3.8 9.89e+00 - 9.95e-01 7.76e-0
1h 1
14 1.1965350e+04 2.28e-07 1.29e-04 -3.8 2.27e+00 - 1.00e+00 1.00e+0
0f 1
15 1.1964015e+04 1.78e-08 2.99e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
16 1.1963999e+04 1.29e-12 4.23e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.1963999143924184e+01 1.1963999143924184e+0
4
Dual infeasibility......: 4.2346578598889331e-10 4.2346578598889331e-0
7
Constraint violation....: 1.2940759575030825e-12 1.2940759575030825e-1
2
Complementarity.........: 4.5232181940478882e-09 4.5232181940478877e-0
6
Overall NLP error.......: 4.5232181940478882e-09 4.5232181940478877e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2297256e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1839350e+02 6.70e+03 5.23e+01 -1.0 3.55e+03 - 1.59e-05 1.87e-0
4h 1
3 4.2760061e+02 6.55e+03 5.24e+01 -1.0 6.70e+03 - 9.50e-05 2.35e-0
2f 1
4 1.9355175e+04 6.81e-02 7.97e+01 -1.0 6.55e+03 - 3.79e-02 1.00e+0
0h 1
5 1.1061879e+04 6.45e-02 5.90e+01 -1.0 2.11e+01 - 2.57e-01 4.96e-0
2f 1
6 9.8072523e+03 1.56e-02 2.61e+01 -1.0 1.02e+01 - 5.86e-01 7.85e-0
1f 1
7 9.7742726e+03 7.07e-03 2.93e-01 -1.0 1.99e+00 - 9.89e-01 1.00e+0
0f 1
8 9.3946958e+03 1.63e-03 9.33e-02 -1.7 4.64e+00 - 1.00e+00 9.64e-0
1f 1
9 9.2433018e+03 1.79e-03 5.23e-01 -2.5 6.41e+00 - 1.00e+00 7.49e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.2120625e+03 3.25e-04 1.02e-01 -2.5 1.60e+00 - 1.00e+00 8.95e-0
1h 1
11 9.2152286e+03 1.17e-05 4.05e-03 -2.5 1.68e-01 - 1.00e+00 1.00e+0
0f 1
12 9.1851601e+03 1.05e-05 7.92e-03 -3.8 1.07e+01 - 1.00e+00 9.61e-0
1f 1
13 9.1844595e+03 1.57e-08 1.35e-05 -3.8 4.10e-01 - 1.00e+00 1.00e+0
0f 1
14 9.1828192e+03 1.79e-08 5.06e-06 -5.7 5.94e-01 - 1.00e+00 1.00e+0
0f 1
15 9.1828008e+03 6.40e-13 4.11e-10 -8.6 7.36e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 9.1828007893061372e+00 9.1828007893061367e+0
3
Dual infeasibility......: 4.1142351119969844e-10 4.1142351119969844e-0
7
Constraint violation....: 6.4043215175502155e-13 6.4043215175502155e-1
3
Complementarity.........: 3.3163774023280412e-09 3.3163774023280411e-0
6
Overall NLP error.......: 3.3163774023280412e-09 3.3163774023280411e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8769624e+02 4.77e+03 5.24e+01 -1.0 4.82e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8418913e+02 4.77e+03 5.24e+01 -1.0 3.56e+03 - 3.31e-05 1.33e-0
4h 1
3 3.6133643e+02 4.66e+03 5.25e+01 -1.0 4.77e+03 - 4.21e-05 2.30e-0
2f 1
4 1.7154392e+04 6.18e-02 8.10e+01 -1.0 4.66e+03 - 3.09e-02 1.00e+0
0h 1
5 8.5606749e+03 5.89e-02 6.28e+01 -1.0 5.79e+01 - 2.24e-01 4.28e-0
2f 1
6 7.0723371e+03 2.48e-02 3.20e+01 -1.0 2.57e+01 - 4.96e-01 5.40e-0
1f 1
7 6.3632320e+03 1.23e-02 2.18e+00 -1.0 9.60e+00 - 9.29e-01 8.90e-0
1f 1
8 6.7901981e+03 4.37e-04 9.82e-02 -1.0 4.08e+00 - 9.99e-01 1.00e+0
0f 1
9 6.0061266e+03 2.23e-03 2.20e-01 -2.5 5.68e+00 - 8.65e-01 9.65e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.9389716e+03 1.04e-03 6.17e-01 -2.5 8.31e-01 - 1.00e+00 5.72e-0
1h 1
11 5.9432458e+03 3.92e-06 8.28e-03 -2.5 3.71e-01 - 1.00e+00 1.00e+0
0h 1
12 5.9223337e+03 4.94e-06 4.04e-02 -3.8 8.04e+00 - 9.21e-01 8.83e-0
1f 1
13 5.9186052e+03 4.67e-04 5.92e-04 -3.8 9.38e-01 - 1.00e+00 1.00e+0
0f 1
14 5.9173166e+03 6.39e-05 1.15e-02 -5.7 4.46e-01 - 8.12e-01 1.00e+0
0h 1
15 5.9172010e+03 3.63e-05 4.14e-05 -5.7 9.71e-03 - 1.00e+00 1.00e+0
0h 1
16 5.9172026e+03 1.61e-06 4.52e-05 -5.7 1.47e-03 - 1.00e+00 9.88e-0
1h 1
17 5.9172051e+03 3.53e-08 5.15e-07 -5.7 2.92e-04 - 1.00e+00 1.00e+0
0f 1
18 5.9171869e+03 3.96e-08 7.27e-06 -8.6 5.53e-03 - 9.97e-01 9.81e-0
1h 1
19 5.9171866e+03 5.33e-13 2.97e-11 -8.6 1.06e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 5.9171865504388279e+00 5.9171865504388279e+0
3
Dual infeasibility......: 2.9739013140566845e-11 2.9739013140566845e-0
8
Constraint violation....: 5.3290705182007514e-13 5.3290705182007514e-1
3
Complementarity.........: 2.6355574407635548e-09 2.6355574407635549e-0
6
Overall NLP error.......: 2.6355574407635548e-09 2.6355574407635549e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6647742e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 4.97e-04 9.81e-0
3h 1
2 8.6258607e+02 3.24e+03 5.24e+01 -1.0 2.21e+03 - 3.91e-05 1.45e-0
4h 1
3 3.1400433e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 5.82e-05 2.24e-0
2f 1
4 1.5420372e+04 5.91e-02 8.12e+01 -1.0 3.17e+03 - 3.49e-02 1.00e+0
0h 1
5 6.7290069e+03 5.61e-02 6.00e+01 -1.0 7.11e+01 - 2.59e-01 4.63e-0
2f 1
6 4.9141782e+03 2.50e-02 3.24e+01 -1.0 3.47e+01 - 4.68e-01 5.32e-0
1f 1
7 4.4464852e+03 1.14e-02 2.56e+00 -1.0 9.40e+00 - 9.28e-01 1.00e+0
0f 1
8 4.7445322e+03 5.19e-04 7.20e-02 -1.0 2.72e+00 - 9.98e-01 1.00e+0
0f 1
9 4.1967494e+03 5.77e-04 4.25e-01 -2.5 7.14e+00 - 8.93e-01 7.24e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.1292505e+03 1.97e-04 2.34e-01 -2.5 2.25e+00 - 9.13e-01 1.00e+0
0h 1
11 4.1116430e+03 2.84e-04 9.33e-02 -2.5 9.70e-01 - 1.00e+00 7.64e-0
1H 1
12 4.1091626e+03 3.40e-04 1.77e-03 -2.5 1.24e-01 - 1.00e+00 1.00e+0
0f 1
13 4.0879671e+03 1.22e-03 3.19e-02 -3.8 8.05e+00 - 7.96e-01 1.00e+0
0h 1
14 4.0846007e+03 2.79e-03 1.11e-03 -3.8 4.90e-02 - 1.00e+00 1.00e+0
0h 1
15 4.0849547e+03 3.93e-05 1.31e-04 -3.8 1.35e-02 - 1.00e+00 1.00e+0
0h 1
16 4.0833586e+03 1.01e-04 3.52e-04 -5.7 4.46e-01 - 9.51e-01 9.77e-0
1h 1
17 4.0833414e+03 2.19e-05 3.67e-03 -5.7 1.03e-02 - 1.00e+00 7.83e-0
1h 1
18 4.0833430e+03 8.57e-09 1.21e-06 -5.7 2.23e-03 - 1.00e+00 1.00e+0
0f 1
19 4.0833247e+03 9.02e-09 1.92e-05 -8.6 5.53e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 4.0833244e+03 1.37e-12 6.48e-11 -8.6 9.17e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 4.0833243935799084e+00 4.0833243935799082e+0
3
Dual infeasibility......: 6.4812999276580129e-11 6.4812999276580129e-0
8
Constraint violation....: 1.3686829447578930e-12 1.3686829447578930e-1
2
Complementarity.........: 3.1794210815105344e-09 3.1794210815105344e-0
6
Overall NLP error.......: 3.1794210815105344e-09 3.1794210815105344e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4497499e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 3.98e-04 9.83e-0
3h 1
2 8.3712335e+02 2.00e+03 5.24e+01 -1.0 1.32e+03 - 4.52e-05 2.94e-0
4h 1
3 7.9055389e+02 1.99e+03 5.24e+01 -1.0 2.00e+03 - 2.24e-04 1.80e-0
3h 1
4 2.7992525e+02 1.95e+03 5.25e+01 -1.0 1.99e+03 - 2.02e-03 2.11e-0
2f 1
5 1.2927692e+04 5.88e-02 8.13e+01 -1.0 1.95e+03 - 4.87e-02 1.00e+0
0h 1
6 5.0608636e+03 5.50e-02 4.95e+01 -1.0 7.48e+01 - 3.81e-01 6.00e-0
2f 1
7 3.0107951e+03 3.56e-02 2.59e+01 -1.0 4.18e+01 - 4.83e-01 5.27e-0
1f 1
8 3.7115838e+03 1.31e-02 4.13e+00 -1.0 1.72e+01 - 7.54e-01 5.00e-0
1f 2
9 3.1764102e+03 4.41e-03 2.47e-01 -1.0 8.14e+00 - 9.57e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8038644e+03 1.15e-03 1.11e-01 -1.7 6.01e+00 - 7.88e-01 8.17e-0
1f 1
11 2.6745852e+03 7.78e-04 3.89e-01 -2.5 5.13e+00 - 8.00e-01 1.00e+0
0f 1
12 2.5999454e+03 1.16e-02 5.49e-02 -2.5 4.24e+00 - 1.00e+00 9.86e-0
1h 1
13 2.6127652e+03 4.05e-04 9.94e-03 -2.5 2.61e+00 - 1.00e+00 1.00e+0
0f 1
14 2.5830334e+03 1.88e-04 5.77e-02 -3.8 1.28e+01 - 9.83e-01 8.62e-0
1h 1
15 2.5809064e+03 2.37e-06 1.64e-04 -3.8 1.19e+00 - 1.00e+00 1.00e+0
0h 1
16 2.5794713e+03 3.04e-07 2.19e-03 -5.7 5.54e-01 - 1.00e+00 9.77e-0
1h 1
17 2.5794622e+03 3.54e-11 2.17e-08 -5.7 3.88e-03 - 1.00e+00 1.00e+0
0f 1
18 2.5794438e+03 6.30e-11 4.40e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 2.5794437878373619e+00 2.5794437878373619e+0
3
Dual infeasibility......: 4.3996310380660291e-09 4.3996310380660291e-0
6
Constraint violation....: 6.3012317585986466e-11 6.3012317585986466e-1
1
Complementarity.........: 3.6367284069270392e-09 3.6367284069270392e-0
6
Overall NLP error.......: 4.3996310380660291e-09 4.3996310380660291e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0705918e+02 9.17e+02 5.23e+01 -1.0 9.20e+02 - 9.83e-04 9.88e-0
3h 1
2 8.6783447e+02 9.16e+02 5.23e+01 -1.0 8.56e+02 - 9.29e-05 1.47e-0
3h 1
3 2.8553204e+02 8.95e+02 5.24e+01 -1.0 9.16e+02 - 1.44e-03 2.26e-0
2h 1
4 1.2835228e+04 6.68e-02 8.15e+01 -1.0 8.96e+02 - 2.55e-02 1.00e+0
0h 1
5 4.9927568e+03 6.40e-02 6.45e+01 -1.0 3.93e+01 - 2.10e-01 3.91e-0
2f 1
6 3.7410267e+03 2.11e-02 2.99e+01 -1.0 1.64e+01 - 5.44e-01 6.15e-0
1f 1
7 3.3004490e+03 6.65e-03 1.01e+00 -1.0 5.62e+00 - 9.55e-01 7.71e-0
1f 1
8 3.5650322e+03 2.21e-04 7.17e-02 -1.0 4.77e+00 - 9.92e-01 1.00e+0
0f 1
9 3.0085187e+03 2.07e-03 8.44e-02 -2.5 9.38e+00 - 8.56e-01 8.40e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8474096e+03 2.16e-03 4.30e-01 -2.5 4.04e+00 - 1.00e+00 7.58e-0
1f 1
11 2.8213525e+03 1.33e-04 4.45e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
12 2.7930704e+03 3.30e-05 1.20e-01 -3.8 1.67e+01 - 1.00e+00 7.81e-0
1h 1
13 2.7865437e+03 1.12e-07 3.76e-04 -3.8 3.38e+00 - 1.00e+00 1.00e+0
0f 1
14 2.7845762e+03 3.06e-08 9.35e-04 -5.7 8.88e-01 - 1.00e+00 9.85e-0
1f 1
15 2.7845538e+03 1.89e-12 1.58e-08 -5.7 1.20e-02 - 1.00e+00 1.00e+0
0f 1
16 2.7845299e+03 2.63e-12 5.20e-09 -8.6 1.11e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 2.7845298689603335e+00 2.7845298689603333e+0
3
Dual infeasibility......: 5.2031847367607746e-09 5.2031847367607746e-0
6
Constraint violation....: 2.6313048961945640e-12 2.6313048961945640e-1
2
Complementarity.........: 3.7915723744013089e-09 3.7915723744013087e-0
6
Overall NLP error.......: 5.2031847367607746e-09 5.2031847367607746e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933498e-01 5.8277753147933493e+0
2
Dual infeasibility......: 2.1031320943161440e-09 2.1031320943161440e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896910881e-09 2.8882108896910880e-0
6
Overall NLP error.......: 2.8882108896910881e-09 2.8882108896910880e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933498e-01 5.8277753147933493e+0
2
Dual infeasibility......: 2.1031320943161440e-09 2.1031320943161440e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896910881e-09 2.8882108896910880e-0
6
Overall NLP error.......: 2.8882108896910881e-09 2.8882108896910880e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254150161e-01 6.4890146254150159e+0
2
Dual infeasibility......: 4.9126604771077418e-09 4.9126604771077418e-0
6
Constraint violation....: 6.2123813870940126e-09 6.2123813870940126e-0
9
Complementarity.........: 4.3646095252281105e-09 4.3646095252281105e-0
6
Overall NLP error.......: 6.2123813870940126e-09 4.9126604771077418e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.05e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.45e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281623890e+00 1.6104063281623889e+0
3
Dual infeasibility......: 2.4577211346012397e-12 2.4577211346012397e-0
9
Constraint violation....: 7.4511513724402514e-16 7.4511513724402514e-1
6
Complementarity.........: 2.5062163910051629e-09 2.5062163910051628e-0
6
Overall NLP error.......: 2.5062163910051629e-09 2.5062163910051628e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2183295e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 3.29e-04 9.88e-0
3h 1
2 7.9676914e+02 9.17e+02 5.24e+01 -1.0 8.18e+02 - 9.72e-05 9.15e-0
4h 1
3 2.4281750e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 9.07e-04 2.09e-0
2h 1
4 1.2255661e+04 5.54e-02 8.24e+01 -1.0 8.98e+02 - 3.87e-02 1.00e+0
0h 1
5 3.8688629e+03 5.28e-02 5.51e+01 -1.0 7.96e+01 - 3.29e-01 5.05e-0
2f 1
6 1.9078252e+03 3.74e-02 2.93e+01 -1.0 3.92e+01 - 4.72e-01 5.02e-0
1f 1
7 4.6515354e+03 1.22e-02 2.62e+01 -1.0 2.04e+01 - 4.04e-01 1.00e+0
0h 1
8 1.8738278e+03 1.17e-02 9.62e-01 -1.0 2.50e+01 - 9.88e-01 8.98e-0
1f 1
9 1.6952061e+03 5.07e-04 6.26e-02 -1.7 6.87e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5627586e+03 1.96e-03 2.18e-01 -2.5 1.24e+01 - 7.44e-01 1.00e+0
0f 1
11 1.5309890e+03 3.66e-03 1.02e-01 -2.5 2.11e+00 - 1.00e+00 9.20e-0
1h 1
12 1.5388593e+03 1.30e-04 3.48e-03 -2.5 1.17e+00 - 1.00e+00 1.00e+0
0h 1
13 1.5037282e+03 1.63e-04 2.14e-02 -3.8 1.88e+01 - 9.93e-01 9.32e-0
1h 1
14 1.5022722e+03 7.63e-07 7.14e-05 -3.8 1.23e+00 - 1.00e+00 1.00e+0
0f 1
15 1.5003195e+03 3.78e-07 1.76e-04 -5.7 1.04e+00 - 1.00e+00 9.96e-0
1h 1
16 1.5003172e+03 3.80e-11 2.94e-09 -5.7 1.08e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.29e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5002932826872879e+00 1.5002932826872880e+0
3
Dual infeasibility......: 2.1694097155019116e-09 2.1694097155019116e-0
6
Constraint violation....: 6.2995678118404896e-11 6.2995678118404896e-1
1
Complementarity.........: 2.8882169879836565e-09 2.8882169879836564e-0
6
Overall NLP error.......: 2.8882169879836565e-09 2.8882169879836564e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6444593e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 4.93e-04 9.88e-0
3h 1
2 8.3543537e+02 9.17e+02 5.24e+01 -1.0 8.33e+02 - 9.54e-05 1.07e-0
3h 1
3 2.6287781e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 1.07e-03 2.19e-0
2h 1
4 1.2569003e+04 6.01e-02 8.03e+01 -1.0 8.97e+02 - 5.11e-02 1.00e+0
0h 1
5 4.2524799e+03 5.61e-02 5.27e+01 -1.0 7.22e+01 - 3.33e-01 6.11e-0
2f 1
6 2.6512502e+03 3.01e-02 2.72e+01 -1.0 3.89e+01 - 4.78e-01 4.36e-0
1f 1
61 1.378761e+04 1.632511e+04 5.051416e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6793774e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.80e-0
3h 1
2 7.6493622e+02 1.57e+04 5.25e+01 -1.0 1.38e+04 - 2.51e-05 1.13e-0
4h 1
3 7.5737229e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 1.74e-05 6.00e-0
4h 1
4 5.2138449e+02 1.54e+04 5.27e+01 -1.0 1.57e+04 - 6.11e-04 1.98e-0
2h 1
5 2.6821104e+04 6.08e-02 8.54e+01 -1.0 1.54e+04 - 2.20e-02 1.00e+0
0h 1
6 1.8309183e+04 5.88e-02 7.26e+01 -1.0 8.49e+01 - 1.57e-01 3.59e-0
2f 1
7 1.6714218e+04 4.60e-02 3.63e+01 -1.0 2.76e+01 - 4.97e-01 4.48e-0
1f 1
8 1.7012031e+04 3.02e-02 1.55e+01 -1.0 1.63e+01 - 4.58e-01 1.25e-0
1f 4
9 1.6771844e+04 5.50e-03 2.48e-01 -1.0 4.35e+00 - 9.88e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6495063e+04 1.06e-03 1.42e+00 -1.7 4.47e+00 - 2.73e-01 8.82e-0
1f 1
11 1.6488737e+04 1.62e-04 6.33e-01 -1.7 5.46e+00 - 6.86e-01 1.00e+0
0f 1
12 1.6480755e+04 1.35e-04 2.28e-01 -1.7 1.35e+01 - 5.61e-01 1.00e+0
0f 1
13 1.6496422e+04 1.34e-05 1.04e-02 -1.7 1.84e+01 - 9.52e-01 1.00e+0
0h 1
14 1.6366327e+04 1.00e-03 4.59e-02 -2.5 3.31e+01 - 9.25e-01 1.00e+0
0f 1
15 1.6348047e+04 1.07e-03 1.13e-02 -2.5 1.17e+00 - 1.00e+00 1.00e+0
0h 1
16 1.6328418e+04 1.80e-04 8.28e-02 -3.8 8.44e+00 - 1.00e+00 8.56e-0
1h 1
17 1.6326484e+04 5.73e-07 9.74e-05 -3.8 1.04e+00 - 1.00e+00 1.00e+0
0h 1
18 1.6325120e+04 4.00e-07 1.11e-04 -5.7 4.45e-01 - 1.00e+00 9.97e-0
1h 1
19 1.6325122e+04 3.81e-11 2.98e-09 -5.7 3.95e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325106e+04 5.62e-11 3.15e-05 -8.6 5.50e-03 - 1.00e+00 9.49e-0
1h 1
21 1.6325105e+04 1.64e-13 5.40e-12 -8.6 1.96e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.6325105279704566e+01 1.6325105279704565e+0
4
Dual infeasibility......: 5.4021378037453334e-12 5.4021378037453334e-0
9
Constraint violation....: 1.6434076322013880e-13 1.6434076322013880e-1
3
Complementarity.........: 6.7292816916313210e-09 6.7292816916313206e-0
6
Overall NLP error.......: 6.7292816916313210e-09 6.7292816916313206e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6807293e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.29e-04 9.80e-0
3h 1
2 7.6505074e+02 1.50e+04 5.25e+01 -1.0 1.30e+04 - 2.53e-05 1.14e-0
4h 1
3 7.6278259e+02 1.50e+04 5.25e+01 -1.0 1.49e+04 - 1.84e-05 1.69e-0
4h 1
4 7.5934272e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 1.84e-04 2.61e-0
4h 1
5 5.0602172e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 4.55e-04 2.00e-0
2f 1
6 2.6036866e+04 6.08e-02 8.48e+01 -1.0 1.47e+04 - 2.95e-02 1.00e+0
0h 1
7 1.7509053e+04 5.84e-02 6.76e+01 -1.0 7.97e+01 - 2.09e-01 4.27e-0
2f 1
8 1.5926056e+04 4.48e-02 3.35e+01 -1.0 2.87e+01 - 5.00e-01 4.36e-0
1f 1
9 1.6222419e+04 3.06e-02 1.35e+01 -1.0 1.62e+01 - 4.67e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6014535e+04 5.30e-03 2.07e-01 -1.0 3.74e+00 - 9.89e-01 1.00e+0
0h 1
11 1.5730843e+04 1.04e-03 2.43e-01 -1.7 4.59e+00 - 1.00e+00 8.81e-0
1f 1
12 1.5744079e+04 7.56e-04 1.34e-01 -1.7 5.27e+01 - 4.82e-01 1.00e+0
0f 1
13 1.5590897e+04 1.07e-03 5.75e-02 -2.5 5.61e+01 - 9.18e-01 1.00e+0
0f 1
14 1.5580155e+04 1.11e-03 6.37e-01 -2.5 6.34e+00 - 9.74e-02 1.00e+0
0f 1
15 1.5584390e+04 6.59e-05 1.64e-03 -2.5 6.73e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5560444e+04 1.79e-04 1.04e-02 -3.8 5.98e+00 - 9.91e-01 9.55e-0
1h 1
17 1.5560427e+04 6.73e-07 6.71e-05 -3.8 4.41e-02 - 1.00e+00 1.00e+0
0h 1
18 1.5559215e+04 3.78e-07 1.38e-04 -5.7 3.00e-01 - 1.00e+00 9.97e-0
1h 1
19 1.5559217e+04 3.83e-11 3.14e-09 -5.7 7.68e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5559202e+04 6.30e-11 2.07e-09 -8.6 3.69e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.5559202149524507e+01 1.5559202149524506e+0
4
Dual infeasibility......: 2.0695714135428694e-09 2.0695714135428694e-0
6
Constraint violation....: 6.2993096849872643e-11 6.2993096849872643e-1
1
Complementarity.........: 2.8882068584283382e-09 2.8882068584283380e-0
6
Overall NLP error.......: 2.8882068584283382e-09 2.8882068584283380e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.8928966e+02 1.39e+04 5.25e+01 -1.0 1.40e+04 - 2.59e-04 9.80e-0
3f 1
2 7.8640502e+02 1.39e+04 5.25e+01 -1.0 1.33e+04 - 4.79e-05 1.04e-0
4h 1
3 7.8367293e+02 1.39e+04 5.25e+01 -1.0 1.38e+04 - 6.94e-06 1.89e-0
4h 1
4 7.8040602e+02 1.39e+04 5.25e+01 -1.0 1.39e+04 - 1.94e-04 2.30e-0
4h 1
5 4.9813082e+02 1.36e+04 5.27e+01 -1.0 1.39e+04 - 4.42e-04 2.04e-0
2f 1
6 2.5111576e+04 5.48e-02 8.39e+01 -1.0 1.36e+04 - 3.19e-02 1.00e+0
0h 1
7 1.6588881e+04 5.26e-02 6.43e+01 -1.0 8.06e+01 - 2.37e-01 4.47e-0
2f 1
8 1.4866817e+04 4.32e-02 3.28e+01 -1.0 3.25e+01 - 4.88e-01 4.61e-0
1f 1
9 1.5181498e+04 2.72e-02 1.43e+01 -1.0 1.76e+01 - 4.37e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4935451e+04 5.94e-03 1.82e-01 -1.0 4.80e+00 - 9.90e-01 1.00e+0
0h 1
11 1.4652494e+04 1.17e-03 2.71e-01 -1.7 4.53e+00 - 1.00e+00 8.70e-0
1f 1
12 1.4632564e+04 7.65e-04 1.09e-02 -1.7 2.01e+01 - 1.00e+00 1.00e+0
0f 1
13 1.4507275e+04 1.26e-03 6.67e-02 -3.8 2.56e+01 - 8.00e-01 8.99e-0
1f 1
14 1.4480818e+04 1.52e-03 5.35e-02 -3.8 1.83e+00 - 8.47e-01 7.82e-0
1h 1
15 1.4480990e+04 2.95e-06 7.76e-04 -3.8 2.74e-02 - 1.00e+00 1.00e+0
0h 1
16 1.4480071e+04 2.93e-07 6.73e-04 -5.7 1.49e-01 - 1.00e+00 9.88e-0
1h 1
17 1.4480065e+04 3.82e-11 6.36e-09 -5.7 8.73e-02 - 1.00e+00 1.00e+0
0f 1
18 1.4480052e+04 6.30e-11 2.08e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.4480051776532616e+01 1.4480051776532615e+0
4
Dual infeasibility......: 2.0847382762295782e-09 2.0847382762295782e-0
6
Constraint violation....: 6.2996385885583095e-11 6.2996385885583095e-1
1
Complementarity.........: 2.8881027462004691e-09 2.8881027462004689e-0
6
Overall NLP error.......: 2.8881027462004691e-09 2.8881027462004689e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8939349e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 6.82e-04 9.80e-0
3h 1
2 8.8646879e+02 1.27e+04 5.24e+01 -1.0 1.12e+04 - 2.77e-05 1.12e-0
4h 1
3 8.8198475e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 1.60e-05 3.00e-0
4h 1
4 8.6345468e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 3.13e-04 1.26e-0
3h 1
5 5.5529717e+02 1.23e+04 5.24e+01 -1.0 1.26e+04 - 1.66e-03 2.23e-0
2f 1
6 2.4160500e+04 6.42e-02 7.86e+01 -1.0 1.23e+04 - 6.66e-02 1.00e+0
0h 1
7 1.6223486e+04 5.89e-02 4.85e+01 -1.0 5.38e+01 - 3.67e-01 7.56e-0
2f 1
8 1.4917667e+04 2.89e-02 2.13e+01 -1.0 2.59e+01 - 5.49e-01 4.66e-0
1f 1
9 1.4352632e+04 7.01e-03 1.10e+00 -1.0 9.76e+00 - 9.29e-01 7.67e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4627599e+04 2.78e-04 3.41e-01 -1.0 3.31e+00 - 8.09e-01 1.00e+0
0f 1
11 1.4007798e+04 1.51e-03 5.11e-01 -1.7 4.51e+00 - 7.07e-01 1.00e+0
0f 1
12 1.3984283e+04 4.60e-04 3.65e-01 -1.7 7.16e+00 - 6.39e-01 1.00e+0
0h 1
13 1.3989391e+04 3.13e-05 8.07e-02 -1.7 1.24e+01 - 7.67e-01 1.00e+0
0h 1
14 1.3845412e+04 3.40e-04 6.96e-02 -2.5 1.53e+01 - 9.77e-01 8.35e-0
1f 1
15 1.3845696e+04 5.60e-06 1.00e-02 -2.5 6.51e+00 - 1.00e+00 1.00e+0
0f 1
16 1.3824549e+04 3.57e-06 1.33e-01 -3.8 5.55e+00 - 1.00e+00 8.74e-0
1f 1
17 1.3822076e+04 7.75e-05 8.43e-04 -3.8 5.95e-01 - 1.00e+00 1.00e+0
0f 1
18 1.3820710e+04 1.01e-04 1.84e-02 -5.7 2.97e-01 - 6.02e-01 1.00e+0
0h 1
19 1.3820629e+04 1.72e-05 1.12e-04 -5.7 6.80e-03 - 9.90e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.3820624e+04 8.88e-07 6.66e-05 -5.7 1.16e-03 - 1.00e+00 9.87e-0
1h 1
21 1.3820627e+04 2.31e-08 5.39e-07 -5.7 2.42e-04 - 1.00e+00 1.00e+0
0f 1
22 1.3820610e+04 2.92e-08 1.21e-05 -8.6 3.68e-03 - 9.95e-01 9.77e-0
1h 1
23 1.3820610e+04 1.02e-12 3.57e-11 -8.6 8.61e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 23
(scaled) (unscaled)
Objective...............: 1.3820609806688081e+01 1.3820609806688080e+0
4
Dual infeasibility......: 3.5672600482708839e-11 3.5672600482708839e-0
8
Constraint violation....: 1.0239586956117819e-12 1.0239586956117819e-1
2
Complementarity.........: 2.9786758061123194e-09 2.9786758061123192e-0
6
Overall NLP error.......: 2.9786758061123194e-09 2.9786758061123192e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 24
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 24
Number of inequality constraint Jacobian evaluations = 24
Number of Lagrangian Hessian evaluations = 23
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2301496e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.51e-03 9.80e-0
3h 1
2 9.2012933e+02 1.11e+04 5.23e+01 -1.0 1.02e+04 - 3.26e-05 1.08e-0
4h 1
3 8.3424141e+02 1.11e+04 5.23e+01 -1.0 1.11e+04 - 1.17e-05 5.22e-0
3h 1
4 5.7283736e+02 1.08e+04 5.22e+01 -1.0 1.11e+04 - 5.95e-03 2.13e-0
2h 1
5 2.1532475e+04 7.53e-02 7.76e+01 -1.0 1.08e+04 - 8.36e-02 1.00e+0
0h 1
6 1.5215064e+04 6.76e-02 2.23e+01 -1.0 1.30e+01 - 6.84e-01 9.54e-0
2f 1
7 1.3955436e+04 2.05e-02 7.03e+00 -1.0 9.59e+00 - 7.22e-01 8.73e-0
1f 1
8 1.4214931e+04 1.09e-02 1.48e-01 -1.0 2.63e+00 - 9.91e-01 9.34e-0
1f 1
9 1.3825514e+04 2.88e-03 1.24e+00 -1.7 1.26e+01 - 3.41e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3791377e+04 2.52e-04 3.30e-01 -1.7 1.11e+01 - 8.31e-01 1.00e+0
0h 1
11 1.3800700e+04 1.28e-04 2.84e-03 -1.7 1.24e+01 - 1.00e+00 1.00e+0
0h 1
12 1.3625953e+04 5.02e-04 2.08e-02 -3.8 3.69e+01 - 8.41e-01 8.40e-0
1f 1
13 1.3606816e+04 1.59e-04 2.22e-01 -3.8 5.85e+00 - 9.93e-01 7.11e-0
1h 1
14 1.3601605e+04 3.45e-07 3.45e-04 -3.8 1.69e+00 - 1.00e+00 1.00e+0
0h 1
15 1.3600267e+04 1.96e-08 4.31e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
16 1.3600252e+04 8.23e-13 4.92e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.3600252143682205e+01 1.3600252143682204e+0
4
Dual infeasibility......: 4.9161612774390948e-10 4.9161612774390948e-0
7
Constraint violation....: 8.2266138345943318e-13 8.2266138345943318e-1
3
Complementarity.........: 4.0912728558319370e-09 4.0912728558319367e-0
6
Overall NLP error.......: 4.0912728558319370e-09 4.0912728558319367e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8777320e+02 9.19e+03 5.24e+01 -1.0 9.28e+03 - 6.64e-04 9.80e-0
3h 1
2 8.8499164e+02 9.19e+03 5.24e+01 -1.0 8.96e+03 - 8.88e-05 1.02e-0
4h 1
3 8.6604553e+02 9.18e+03 5.24e+01 -1.0 9.18e+03 - 4.81e-06 1.03e-0
3f 1
4 4.6753384e+02 8.97e+03 5.24e+01 -1.0 9.18e+03 - 1.16e-03 2.24e-0
2h 1
5 2.1019834e+04 6.31e-02 7.87e+01 -1.0 8.97e+03 - 6.27e-02 1.00e+0
0h 1
6 1.2779542e+04 5.82e-02 5.04e+01 -1.0 5.68e+01 - 3.45e-01 7.15e-0
2f 1
7 1.1474093e+04 2.98e-02 2.31e+01 -1.0 2.74e+01 - 5.30e-01 4.48e-0
1f 1
8 1.0826912e+04 8.86e-03 1.29e+00 -1.0 1.03e+01 - 9.25e-01 7.95e-0
1f 1
9 1.1132672e+04 2.56e-04 7.50e-02 -1.0 3.69e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.0462579e+04 2.14e-03 9.04e-02 -2.5 5.27e+00 - 8.69e-01 8.83e-0
1f 1
11 1.0356962e+04 1.11e-03 4.48e-01 -2.5 8.53e-01 - 1.00e+00 6.12e-0
1f 1
12 1.0357041e+04 2.64e-06 8.39e-03 -2.5 1.73e-01 - 1.00e+00 1.00e+0
0h 1
13 1.0339021e+04 7.22e-06 6.55e-03 -3.8 2.68e+00 - 9.00e-01 8.93e-0
1f 1
14 1.0335760e+04 4.68e-04 3.83e-04 -3.8 2.86e-01 - 1.00e+00 1.00e+0
0f 1
15 1.0334765e+04 6.30e-05 1.15e-02 -5.7 1.49e-01 - 8.13e-01 1.00e+0
0h 1
16 1.0334649e+04 3.63e-05 4.09e-05 -5.7 9.71e-03 - 1.00e+00 1.00e+0
0h 1
17 1.0334650e+04 1.61e-06 3.43e-05 -5.7 1.54e-03 - 1.00e+00 9.90e-0
1h 1
18 1.0334653e+04 3.53e-08 5.13e-07 -5.7 2.92e-04 - 1.00e+00 1.00e+0
0f 1
19 1.0334638e+04 3.96e-08 7.26e-06 -8.6 1.84e-03 - 9.97e-01 9.81e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.0334638e+04 5.32e-13 2.97e-11 -8.6 3.54e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.0334637964840526e+01 1.0334637964840525e+0
4
Dual infeasibility......: 2.9731377988707037e-11 2.9731377988707037e-0
8
Constraint violation....: 5.3157478419052495e-13 5.3157478419052495e-1
3
Complementarity.........: 2.5100786379823744e-09 2.5100786379823742e-0
6
Overall NLP error.......: 2.5100786379823744e-09 2.5100786379823742e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0886882e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0500382e+02 6.71e+03 5.23e+01 -1.0 4.31e+03 - 2.09e-05 1.54e-0
4h 1
3 4.1993273e+02 6.55e+03 5.24e+01 -1.0 6.71e+03 - 6.23e-05 2.34e-0
2f 1
4 1.9275723e+04 6.51e-02 8.04e+01 -1.0 6.55e+03 - 3.10e-02 1.00e+0
0h 1
5 1.0823593e+04 6.21e-02 6.27e+01 -1.0 3.84e+01 - 2.20e-01 4.32e-0
2f 1
6 9.5475188e+03 2.05e-02 2.95e+01 -1.0 1.63e+01 - 5.40e-01 6.17e-0
1f 1
7 9.1168163e+03 6.34e-03 9.31e-01 -1.0 5.47e+00 - 9.56e-01 7.74e-0
1f 1
8 9.3808628e+03 2.02e-04 6.95e-02 -1.0 5.18e+00 - 1.00e+00 1.00e+0
0f 1
9 8.8195682e+03 2.09e-03 8.24e-02 -2.5 5.86e+00 - 8.56e-01 8.44e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.6573435e+03 2.16e-03 4.23e-01 -2.5 9.76e-01 - 1.00e+00 7.60e-0
1f 1
11 8.6309958e+03 1.27e-04 4.69e-03 -2.5 2.17e-01 - 1.00e+00 1.00e+0
0h 1
12 8.6080881e+03 3.39e-05 1.47e-01 -3.8 1.07e+01 - 1.00e+00 7.60e-0
1h 1
13 8.6020228e+03 1.26e-07 3.40e-04 -3.8 2.57e+00 - 1.00e+00 1.00e+0
0f 1
14 8.6003558e+03 2.84e-08 9.83e-04 -5.7 5.94e-01 - 1.00e+00 9.85e-0
1f 1
15 8.6003362e+03 1.91e-12 1.38e-08 -5.7 8.89e-03 - 1.00e+00 1.00e+0
0f 1
16 8.6003159e+03 2.63e-12 4.48e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 8.6003159332743557e+00 8.6003159332743562e+0
3
Dual infeasibility......: 4.4776953717218921e-09 4.4776953717218921e-0
6
Constraint violation....: 2.6308816236664256e-12 2.6308816236664256e-1
2
Complementarity.........: 3.6084980673951115e-09 3.6084980673951114e-0
6
Overall NLP error.......: 4.4776953717218921e-09 4.4776953717218921e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0882880e+02 4.77e+03 5.23e+01 -1.0 4.81e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0434947e+02 4.77e+03 5.23e+01 -1.0 2.68e+03 - 2.39e-05 1.77e-0
4h 1
3 3.7454299e+02 4.66e+03 5.24e+01 -1.0 4.77e+03 - 8.76e-05 2.34e-0
2f 1
4 1.7328207e+04 6.52e-02 8.01e+01 -1.0 4.66e+03 - 3.59e-02 1.00e+0
0h 1
5 8.8756218e+03 6.18e-02 5.99e+01 -1.0 3.67e+01 - 2.49e-01 4.75e-0
2f 1
6 7.5823595e+03 1.99e-02 2.80e+01 -1.0 1.63e+01 - 5.44e-01 6.25e-0
1f 1
7 7.1823255e+03 5.26e-03 8.31e-01 -1.0 5.07e+00 - 9.59e-01 7.94e-0
1f 1
8 7.4507207e+03 1.50e-04 6.10e-02 -1.0 5.80e+00 - 1.00e+00 1.00e+0
0f 1
9 6.8804600e+03 2.15e-03 8.62e-02 -2.5 5.25e+00 - 8.55e-01 8.54e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.7212292e+03 2.16e-03 4.08e-01 -2.5 9.22e-01 - 1.00e+00 7.65e-0
1f 1
11 6.6966339e+03 1.20e-04 4.68e-03 -2.5 2.02e-01 - 1.00e+00 1.00e+0
0h 1
12 6.6735647e+03 3.19e-05 1.43e-01 -3.8 1.07e+01 - 1.00e+00 7.63e-0
1h 1
13 6.6675769e+03 1.22e-07 3.35e-04 -3.8 2.53e+00 - 1.00e+00 1.00e+0
0f 1
14 6.6659095e+03 2.86e-08 1.00e-03 -5.7 5.94e-01 - 1.00e+00 9.85e-0
1f 1
15 6.6658896e+03 1.94e-12 1.40e-08 -5.7 8.99e-03 - 1.00e+00 1.00e+0
0f 1
16 6.6658693e+03 2.63e-12 4.48e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.6658693427661726e+00 6.6658693427661728e+0
3
Dual infeasibility......: 4.4776955496669971e-09 4.4776955496669971e-0
6
Constraint violation....: 2.6309579514993686e-12 2.6309579514993686e-1
2
Complementarity.........: 3.6084974572317035e-09 3.6084974572317036e-0
6
Overall NLP error.......: 4.4776955496669971e-09 4.4776955496669971e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9465052e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3h 1
2 8.8961066e+02 3.24e+03 5.24e+01 -1.0 1.65e+03 - 3.15e-05 1.94e-0
4h 1
3 3.3049321e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 1.10e-04 2.31e-0
2f 1
4 1.5661028e+04 6.29e-02 8.00e+01 -1.0 3.17e+03 - 4.12e-02 1.00e+0
0h 1
5 7.0966213e+03 5.93e-02 5.59e+01 -1.0 4.98e+01 - 2.95e-01 5.19e-0
2f 1
6 5.7201217e+03 2.49e-02 2.72e+01 -1.0 2.33e+01 - 5.16e-01 5.36e-0
1f 1
7 5.1215761e+03 9.32e-03 1.31e+00 -1.0 8.82e+00 - 9.35e-01 7.62e-0
1f 1
8 5.4190355e+03 3.08e-04 8.42e-02 -1.0 3.70e+00 - 9.98e-01 1.00e+0
0f 1
9 4.8033536e+03 2.09e-03 8.11e-02 -2.5 5.88e+00 - 8.62e-01 8.49e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.6319919e+03 2.20e-03 3.43e-01 -2.5 2.22e+00 - 1.00e+00 7.80e-0
1f 1
11 4.6055448e+03 1.52e-04 4.72e-03 -2.5 5.60e-01 - 1.00e+00 1.00e+0
0h 1
12 4.5784269e+03 2.24e-05 4.27e-02 -3.8 1.07e+01 - 1.00e+00 8.84e-0
1h 1
13 4.5760808e+03 5.69e-08 5.99e-04 -3.8 1.24e+00 - 1.00e+00 1.00e+0
0f 1
14 4.5743301e+03 4.25e-08 5.43e-05 -5.7 5.94e-01 - 1.00e+00 9.98e-0
1f 1
15 4.5743305e+03 1.88e-12 1.31e-08 -5.7 1.22e-03 - 1.00e+00 1.00e+0
0f 1
16 4.5743102e+03 2.57e-12 3.30e-06 -8.6 7.37e-03 - 1.00e+00 9.99e-0
1f 1
17 4.5743102e+03 7.11e-15 4.85e-14 -8.6 4.04e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 4.5743102056241494e+00 4.5743102056241496e+0
3
Dual infeasibility......: 4.8505286198364530e-14 4.8505286198364530e-1
1
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.6548133733885584e-09 2.6548133733885583e-0
6
Overall NLP error.......: 2.6548133733885584e-09 2.6548133733885583e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1556356e+02 2.00e+03 5.23e+01 -1.0 2.01e+03 - 1.20e-03 9.83e-0
3h 1
2 8.9129625e+02 1.99e+03 5.23e+01 -1.0 1.79e+03 - 3.90e-05 9.44e-0
4h 1
3 8.2964130e+02 1.99e+03 5.23e+01 -1.0 1.99e+03 - 8.88e-04 2.46e-0
3h 1
4 3.2299030e+02 1.95e+03 5.23e+01 -1.0 1.99e+03 - 3.40e-03 2.23e-0
2f 1
5 1.2897637e+04 7.17e-02 7.73e+01 -1.0 1.95e+03 - 8.40e-02 1.00e+0
0h 1
6 5.9803054e+03 6.44e-02 2.75e+01 -1.0 1.93e+01 - 6.16e-01 9.39e-0
2f 1
7 4.5221363e+03 1.66e-02 9.90e+00 -1.0 1.25e+01 - 6.78e-01 8.55e-0
1f 1
8 4.8686785e+03 1.01e-03 3.38e-01 -1.0 3.73e+00 - 9.67e-01 9.88e-0
1f 1
9 4.4201641e+03 2.20e-03 1.10e+00 -1.7 6.47e+00 - 3.81e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.3682156e+03 2.89e-04 5.78e-01 -1.7 7.11e+00 - 6.83e-01 1.00e+0
0h 1
11 4.3811419e+03 1.03e-04 2.52e-01 -1.7 1.66e+01 - 6.97e-01 1.00e+0
0f 1
12 4.4105879e+03 2.79e-06 5.93e-02 -1.7 3.35e+01 - 7.06e-01 1.00e+0
0f 1
13 4.2359703e+03 4.70e-04 2.19e-02 -2.5 3.50e+01 - 9.67e-01 9.52e-0
1f 1
14 4.1921018e+03 1.60e-04 1.41e-01 -3.8 3.25e+01 - 9.85e-01 7.39e-0
1h 1
15 4.1817205e+03 7.18e-06 3.74e-02 -3.8 7.45e+00 - 1.00e+00 9.55e-0
1h 1
16 4.1822155e+03 6.40e-10 9.10e-02 -3.8 6.69e-01 - 4.56e-03 1.00e+0
0f 1
17 4.1821572e+03 1.22e-13 1.50e-09 -3.8 5.78e-02 - 1.00e+00 1.00e+0
0h 1
18 4.1805101e+03 1.76e-08 4.76e-04 -5.7 6.19e-01 - 1.00e+00 9.89e-0
1f 1
19 4.1805097e+03 6.46e-13 8.55e-02 -5.7 7.60e-03 - 4.88e-03 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 4.1805094e+03 3.06e-15 1.84e-11 -5.7 2.18e-04 - 1.00e+00 1.00e+0
0h 1
21 4.1804892e+03 2.63e-12 1.52e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 4.1804891622666345e+00 4.1804891622666346e+0
3
Dual infeasibility......: 1.5189362383347241e-09 1.5189362383347241e-0
6
Constraint violation....: 2.6279325937572651e-12 2.6279325937572651e-1
2
Complementarity.........: 3.6358146574508371e-09 3.6358146574508372e-0
6
Overall NLP error.......: 3.6358146574508371e-09 3.6358146574508372e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2252293e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 3.31e-04 9.88e-0
3h 1
2 7.9742303e+02 9.17e+02 5.24e+01 -1.0 8.18e+02 - 9.71e-05 9.16e-0
4h 1
3 2.4312288e+02 8.97e+02 5.26e+01 -1.0 9.17e+02 - 9.08e-04 2.09e-0
2h 1
4 1.2260850e+04 5.54e-02 8.24e+01 -1.0 8.98e+02 - 3.89e-02 1.00e+0
0h 1
5 3.8743081e+03 5.28e-02 5.49e+01 -1.0 7.96e+01 - 3.31e-01 5.07e-0
2f 1
6 1.9080741e+03 3.72e-02 2.92e+01 -1.0 3.93e+01 - 4.71e-01 5.03e-0
1f 1
7 4.6563841e+03 1.22e-02 2.61e+01 -1.0 2.04e+01 - 4.03e-01 1.00e+0
0h 1
8 1.8744334e+03 1.17e-02 9.66e-01 -1.0 2.51e+01 - 9.88e-01 8.98e-0
1f 1
9 1.6954233e+03 5.10e-04 6.26e-02 -1.7 6.76e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5627878e+03 1.96e-03 2.19e-01 -2.5 1.25e+01 - 7.43e-01 1.00e+0
0f 1
11 1.5309769e+03 3.67e-03 1.04e-01 -2.5 2.12e+00 - 1.00e+00 9.19e-0
1h 1
12 1.5388648e+03 1.31e-04 3.49e-03 -2.5 1.16e+00 - 1.00e+00 1.00e+0
0h 1
13 1.5037418e+03 1.63e-04 2.17e-02 -3.8 1.88e+01 - 9.93e-01 9.32e-0
1h 1
14 1.5022722e+03 7.65e-07 7.15e-05 -3.8 1.24e+00 - 1.00e+00 1.00e+0
0f 1
15 1.5003196e+03 3.77e-07 1.78e-04 -5.7 1.04e+00 - 1.00e+00 9.96e-0
1h 1
16 1.5003172e+03 3.80e-11 2.94e-09 -5.7 1.11e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.29e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5002932826844322e+00 1.5002932826844321e+0
3
Dual infeasibility......: 2.1737076377846537e-09 2.1737076377846537e-0
6
Constraint violation....: 6.2995511584951203e-11 6.2995511584951203e-1
1
Complementarity.........: 2.8882173926692563e-09 2.8882173926692561e-0
6
Overall NLP error.......: 2.8882173926692563e-09 2.8882173926692561e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1582576e+02 1.09e+02 1.13e+02 -1.0 3.76e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1398370e+04 5.38e-02 8.36e+01 -1.0 4.53e+01 - 3.10e-02 1.00e+0
0h 1
3 2.7845901e+03 5.17e-02 6.49e+01 -1.0 8.43e+01 - 2.27e-01 4.32e-0
2f 1
4 9.8152882e+02 4.24e-02 3.38e+01 -1.0 3.41e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5906778e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.22e-01 1.00e+0
0h 1
6 9.4490441e+02 1.01e-02 8.72e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6264654e+02 4.59e-04 6.60e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536437e+02 1.94e-03 1.94e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379715e+02 3.25e-03 6.12e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140238e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388159e+02 1.57e-04 1.69e-02 -3.8 7.57e-01 - 9.93e-01 9.41e-0
1h 1
12 5.8370191e+02 7.28e-07 6.65e-05 -3.8 8.62e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278679e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.06e-09 -5.7 3.40e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148938161e-01 5.8277753148938154e+0
2
Dual infeasibility......: 2.0880117297296560e-09 2.0880117297296560e-0
6
Constraint violation....: 6.2994151561746037e-11 6.2994151561746037e-1
1
Complementarity.........: 2.8882094420373540e-09 2.8882094420373540e-0
6
Overall NLP error.......: 2.8882094420373540e-09 2.8882094420373540e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1582576e+02 1.09e+02 1.13e+02 -1.0 3.76e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1398370e+04 5.38e-02 8.36e+01 -1.0 4.53e+01 - 3.10e-02 1.00e+0
0h 1
3 2.7845901e+03 5.17e-02 6.49e+01 -1.0 8.43e+01 - 2.27e-01 4.32e-0
2f 1
4 9.8152882e+02 4.24e-02 3.38e+01 -1.0 3.41e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5906778e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.22e-01 1.00e+0
0h 1
6 9.4490441e+02 1.01e-02 8.72e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6264654e+02 4.59e-04 6.60e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536437e+02 1.94e-03 1.94e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379715e+02 3.25e-03 6.12e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140238e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388159e+02 1.57e-04 1.69e-02 -3.8 7.57e-01 - 9.93e-01 9.41e-0
1h 1
12 5.8370191e+02 7.28e-07 6.65e-05 -3.8 8.62e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278679e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.06e-09 -5.7 3.40e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148938161e-01 5.8277753148938154e+0
2
Dual infeasibility......: 2.0880117297296560e-09 2.0880117297296560e-0
6
Constraint violation....: 6.2994151561746037e-11 6.2994151561746037e-1
1
Complementarity.........: 2.8882094420373540e-09 2.8882094420373540e-0
6
Overall NLP error.......: 2.8882094420373540e-09 2.8882094420373540e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.78e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5000575e+02 7.50e+01 9.04e+01 -1.0 2.59e+01 - 3.83e-04 3.52e-0
2f 1
2 1.1818546e+04 5.63e-02 8.12e+01 -1.0 2.87e+01 - 4.64e-02 1.00e+0
0h 1
3 3.1583161e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.65e-0
2f 1
4 1.0154149e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8164779e+03 7.28e-03 1.55e+01 -1.0 1.92e+01 - 6.10e-01 1.00e+0
0h 1
6 1.1189268e+03 5.40e-03 4.04e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8232674e+02 9.97e-04 2.09e-01 -1.7 5.71e+00 - 1.00e+00 8.88e-0
1h 1
8 7.2806667e+02 8.48e-04 1.34e-02 -1.7 3.45e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0978200e+02 1.50e-03 1.13e-01 -3.8 4.49e+00 - 7.71e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8216668e+02 2.17e-03 7.27e-02 -3.8 2.11e+00 - 8.07e-01 7.39e-0
1h 1
11 5.8336969e+02 9.23e-05 4.64e-02 -3.8 3.15e-02 - 1.00e+00 9.57e-0
1h 1
12 5.8368715e+02 2.81e-07 1.30e-05 -3.8 3.37e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278926e+02 4.12e-07 5.35e-04 -5.7 3.47e-02 - 1.00e+00 9.91e-0
1h 1
14 5.8278859e+02 4.35e-11 3.51e-09 -5.7 2.16e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.65e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753111869779e-01 5.8277753111869777e+0
2
Dual infeasibility......: 2.6458543383450699e-09 2.6458543383450699e-0
6
Constraint violation....: 6.3002006389645260e-11 6.3002006389645260e-1
1
Complementarity.........: 2.8882674693016566e-09 2.8882674693016564e-0
6
Overall NLP error.......: 2.8882674693016566e-09 2.8882674693016564e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.28e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9792022e+02 4.09e+01 5.94e+01 -1.0 1.43e+01 - 6.99e-04 4.23e-0
2f 1
2 1.2226208e+04 6.07e-02 7.87e+01 -1.0 1.80e+01 - 7.07e-02 1.00e+0
0h 1
3 3.6198120e+03 5.54e-02 5.15e+01 -1.0 5.46e+01 - 3.33e-01 7.86e-0
2f 1
4 2.3518136e+03 2.93e-02 2.28e+01 -1.0 2.71e+01 - 5.45e-01 4.46e-0
1f 1
5 1.7557842e+03 8.50e-03 1.17e+00 -1.0 9.97e+00 - 9.27e-01 7.68e-0
1f 1
6 2.0288429e+03 3.41e-04 8.15e-02 -1.0 3.36e+00 - 1.00e+00 1.00e+0
0h 1
7 1.4017677e+03 2.08e-03 8.13e-02 -2.5 4.88e+00 - 8.66e-01 8.50e-0
1f 1
8 1.2221186e+03 2.16e-03 2.04e-01 -2.5 1.05e+00 - 1.00e+00 8.34e-0
1f 1
9 1.2056881e+03 8.29e-05 3.94e-03 -2.5 1.47e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1964862e+03 4.50e-05 1.20e+00 -3.8 9.56e-02 - 1.00e+00 4.86e-0
1h 1
11 1.1944260e+03 3.81e-07 1.16e-01 -3.8 4.16e-02 - 9.65e-01 1.00e+0
0f 1
12 1.1933751e+03 2.37e-08 2.01e-03 -3.8 3.32e-02 - 1.00e+00 1.00e+0
0H 1
13 1.1935802e+03 1.35e-05 3.08e-04 -3.8 4.28e-03 - 1.00e+00 1.00e+0
0f 1
14 1.1929524e+03 2.10e-06 6.04e-02 -5.7 1.24e-02 - 7.79e-01 9.70e-0
1h 1
15 1.1927877e+03 1.23e-05 2.01e-04 -5.7 5.02e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1927934e+03 2.14e-08 1.78e-06 -5.7 2.27e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1927802e+03 2.61e-08 2.54e-06 -8.6 2.38e-04 - 9.83e-01 9.85e-0
1h 1
18 1.1927801e+03 4.57e-13 3.48e-11 -8.6 2.60e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1927800696977220e+00 1.1927800696977220e+0
3
Dual infeasibility......: 3.4834170051677838e-11 3.4834170051677838e-0
8
Constraint violation....: 4.5652370772586437e-13 4.5652370772586437e-1
3
Complementarity.........: 2.5123551813334683e-09 2.5123551813334682e-0
6
Overall NLP error.......: 2.5123551813334683e-09 2.5123551813334682e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 40
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 20
inequality constraints with only lower bounds: 11
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2226548e+02 9.17e+02 5.24e+01 -1.0 9.19e+02 - 3.31e-04 9.89e-0
3h 1
2 7.9567419e+02 9.17e+02 5.24e+01 -1.0 8.24e+02 - 1.08e-04 9.71e-0
4h 1
3 2.4325600e+02 8.97e+02 5.26e+01 -1.0 9.17e+02 - 9.56e-04 2.09e-0
2h 1
4 1.2231736e+04 5.55e-02 8.38e+01 -1.0 8.98e+02 - 2.32e-02 1.00e+0
0h 1
5 3.9591307e+03 5.36e-02 6.86e+01 -1.0 8.19e+01 - 1.86e-01 3.68e-0
2f 1
6 1.9812308e+03 4.37e-02 3.67e+01 -1.0 3.39e+01 - 4.72e-01 5.47e-0
1f 1
7 2.6523735e+03 1.86e-02 2.12e+01 -1.0 1.93e+01 - 3.72e-01 2.50e-0
1f 3
8 1.9462783e+03 7.68e-03 4.04e-01 -1.0 1.01e+01 - 9.83e-01 1.00e+0
0f 1
9 1.6820695e+03 1.34e-03 2.81e-01 -1.7 4.79e+00 - 1.00e+00 8.75e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7931170e+03 9.77e-04 1.28e-02 -1.7 1.58e+02 - 1.00e+00 1.00e+0
0f 1
11 1.5333032e+03 1.40e-03 9.44e-02 -3.8 1.63e+02 - 7.94e-01 9.28e-0
1f 1
12 1.5036001e+03 1.58e-03 7.61e-02 -3.8 9.00e+00 - 8.37e-01 7.54e-0
1h 1
13 1.5021321e+03 3.35e-06 8.58e-04 -3.8 2.12e+00 - 1.00e+00 1.00e+0
0h 1
14 1.5003347e+03 2.74e-07 7.38e-04 -5.7 1.04e+00 - 1.00e+00 9.87e-0
1h 1
15 1.5003172e+03 3.71e-11 6.81e-09 -5.7 2.81e-01 - 1.00e+00 1.00e+0
0f 1
16 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.29e-02 - 1.00e+00 1.00e+0
0h 1
1 8.6492449e+02 9.17e+02 5.24e+01 -1.0 9.19e+02 - 4.97e-04 9.89e-0
3h 1
2 8.3429719e+02 9.16e+02 5.24e+01 -1.0 8.37e+02 - 1.07e-04 1.13e-0
3h 1
3 2.6334808e+02 8.96e+02 5.25e+01 -1.0 9.16e+02 - 1.12e-03 2.18e-0
2h 1
4 1.2547951e+04 6.03e-02 8.25e+01 -1.0 8.97e+02 - 2.44e-02 1.00e+0
0h 1
5 4.4093479e+03 5.78e-02 6.61e+01 -1.0 6.99e+01 - 2.02e-01 3.77e-0
2f 1
6 2.4528855e+03 3.38e-02 3.55e+01 -1.0 3.12e+01 - 4.78e-01 6.14e-0
1f 1
7 2.2633860e+03 7.17e-03 2.37e+00 -1.0 7.75e+00 - 9.39e-01 1.00e+0
0f 1
62 1.501190e+04 1.632511e+04 5.107523e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2432714e+02 1.57e+04 5.24e+01 -1.0 1.59e+04 - 3.31e-04 9.81e-0
3h 1
2 8.2123431e+02 1.57e+04 5.24e+01 -1.0 1.27e+04 - 1.98e-05 1.23e-0
4h 1
3 8.1625523e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 2.72e-05 4.00e-0
4h 1
4 8.0169965e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 4.24e-04 1.20e-0
3h 1
5 5.7852469e+02 1.54e+04 5.26e+01 -1.0 1.57e+04 - 1.77e-03 2.09e-0
2f 1
6 2.6494210e+04 5.66e-02 8.26e+01 -1.0 1.54e+04 - 4.07e-02 1.00e+0
0h 1
7 1.8645598e+04 5.35e-02 4.89e+01 -1.0 7.51e+01 - 4.02e-01 5.30e-0
2f 1
8 1.6721755e+04 3.64e-02 2.54e+01 -1.0 3.96e+01 - 4.82e-01 4.97e-0
1f 1
9 1.7050001e+04 2.33e-02 1.27e+01 -1.0 1.94e+01 - 4.19e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6828134e+04 5.90e-03 6.05e-01 -1.0 4.41e+00 - 9.60e-01 1.00e+0
0h 1
11 1.6518130e+04 1.38e-03 1.19e+00 -1.7 5.49e+00 - 4.51e-01 8.27e-0
1f 1
12 1.6488269e+04 2.35e-04 9.75e-01 -1.7 2.60e+00 - 5.13e-01 1.00e+0
0f 1
13 1.6472102e+04 1.11e-04 2.61e-01 -1.7 5.03e+00 - 6.90e-01 1.00e+0
0f 1
14 1.6482480e+04 1.58e-05 1.10e-01 -1.7 1.34e+01 - 5.59e-01 1.00e+0
0f 1
15 1.6375829e+04 9.84e-04 6.99e-02 -2.5 5.96e+00 - 9.07e-01 1.00e+0
0f 1
16 1.6348421e+04 1.39e-03 1.57e-02 -2.5 7.02e+00 - 1.00e+00 1.00e+0
0h 1
17 1.6328751e+04 2.54e-04 1.11e-01 -3.8 9.68e+00 - 1.00e+00 8.29e-0
1h 1
18 1.6326481e+04 4.58e-07 1.29e-04 -3.8 1.23e+00 - 1.00e+00 1.00e+0
0h 1
19 1.6325120e+04 4.02e-07 1.59e-04 -5.7 4.43e-01 - 1.00e+00 9.97e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325122e+04 3.86e-11 2.91e-09 -5.7 2.82e-03 - 1.00e+00 1.00e+0
0f 1
21 1.6325106e+04 5.63e-11 3.28e-05 -8.6 5.50e-03 - 1.00e+00 9.49e-0
1h 1
22 1.6325105e+04 1.61e-13 5.56e-12 -8.6 4.87e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.6325105279663596e+01 1.6325105279663596e+0
4
Dual infeasibility......: 5.5628648893608425e-12 5.5628648893608425e-0
9
Constraint violation....: 1.6051049378518201e-13 1.6051049378518201e-1
3
Complementarity.........: 6.6875745756769304e-09 6.6875745756769300e-0
6
Overall NLP error.......: 6.6875745756769304e-09 6.6875745756769300e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4157186e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 3.83e-04 9.81e-0
3h 1
2 8.3845109e+02 1.50e+04 5.24e+01 -1.0 1.19e+04 - 1.94e-05 1.25e-0
4h 1
3 8.3684392e+02 1.50e+04 5.24e+01 -1.0 1.49e+04 - 2.97e-05 1.22e-0
4h 1
4 8.3476839e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 1.49e-04 1.60e-0
4h 1
5 5.5889087e+02 1.46e+04 5.26e+01 -1.0 1.50e+04 - 3.17e-04 2.17e-0
2f 1
6 2.6713969e+04 5.67e-02 8.13e+01 -1.0 1.46e+04 - 4.37e-02 1.00e+0
0h 1
7 1.8094366e+04 5.33e-02 5.29e+01 -1.0 8.09e+01 - 3.42e-01 5.44e-0
2f 1
8 1.5984412e+04 3.39e-02 2.89e+01 -1.0 4.21e+01 - 4.63e-01 5.31e-0
1f 1
9 1.6524150e+04 1.85e-02 1.11e+01 -1.0 1.98e+01 - 5.09e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6143681e+04 5.30e-03 6.20e-01 -1.0 5.27e+00 - 9.56e-01 1.00e+0
0h 1
11 1.5787846e+04 1.47e-03 5.04e-01 -1.7 7.01e+00 - 1.00e+00 7.90e-0
1f 1
12 1.5778270e+04 8.83e-04 2.59e-01 -1.7 7.51e+01 - 2.39e-01 1.00e+0
0f 1
13 1.5758859e+04 1.53e-05 2.08e-03 -1.7 2.08e+01 - 1.00e+00 1.00e+0
0h 1
14 1.5598752e+04 1.05e-03 4.27e-02 -3.8 6.64e+01 - 7.79e-01 8.33e-0
1f 1
15 1.5560219e+04 2.17e-03 6.68e-01 -3.8 2.54e+00 - 1.16e-01 7.80e-0
1h 1
16 1.5559946e+04 4.83e-04 2.39e-01 -3.8 1.78e-02 - 1.00e+00 7.77e-0
1h 1
17 1.5560413e+04 4.22e-07 9.66e-05 -3.8 2.49e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5559219e+04 4.11e-07 5.45e-04 -5.7 3.00e-01 - 1.00e+00 9.91e-0
1h 1
19 1.5559217e+04 4.32e-11 3.56e-09 -5.7 1.46e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5559202e+04 6.30e-11 2.65e-09 -8.6 3.69e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.5559202149122163e+01 1.5559202149122162e+0
4
Dual infeasibility......: 2.6490856897434322e-09 2.6490856897434322e-0
6
Constraint violation....: 6.3002839056913729e-11 6.3002839056913729e-1
1
Complementarity.........: 2.8882676946054615e-09 2.8882676946054615e-0
6
Overall NLP error.......: 2.8882676946054615e-09 2.8882676946054615e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0629558e+02 1.39e+04 5.23e+01 -1.0 1.40e+04 - 9.41e-04 9.80e-0
3h 1
2 9.0339546e+02 1.39e+04 5.23e+01 -1.0 1.23e+04 - 2.45e-05 1.12e-0
4h 1
3 9.0228001e+02 1.39e+04 5.23e+01 -1.0 1.37e+04 - 1.63e-05 8.15e-0
5h 1
4 9.0138814e+02 1.39e+04 5.23e+01 -1.0 1.39e+04 - 9.58e-05 6.61e-0
5h 1
5 5.8792806e+02 1.36e+04 5.24e+01 -1.0 1.39e+04 - 1.64e-04 2.34e-0
2f 1
6 2.6343354e+04 6.49e-02 7.62e+01 -1.0 1.36e+04 - 8.32e-02 1.00e+0
0h 1
7 1.7792975e+04 5.85e-02 4.14e+01 -1.0 3.38e+01 - 4.33e-01 8.92e-0
2f 1
8 1.6335672e+04 2.19e-02 1.72e+01 -1.0 1.65e+01 - 5.99e-01 6.78e-0
1f 1
9 1.6296414e+04 7.42e-03 1.61e+00 -1.0 2.48e+00 - 9.77e-01 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6423200e+04 6.34e-04 9.20e-02 -1.0 5.22e+00 - 9.94e-01 1.00e+0
0f 1
11 1.6101656e+04 9.88e-04 7.83e-01 -2.5 1.08e+01 - 8.58e-01 4.95e-0
1f 1
12 1.5748280e+04 2.59e-03 2.90e-01 -2.5 3.46e+00 - 1.00e+00 8.12e-0
1f 1
13 1.5707354e+04 2.83e-04 1.36e-02 -2.5 3.19e-01 - 1.00e+00 1.00e+0
0h 1
14 1.5691205e+04 6.90e-05 1.94e-01 -3.8 2.82e+00 - 1.00e+00 7.59e-0
1h 1
15 1.5686874e+04 1.99e-07 3.90e-04 -3.8 6.11e-01 - 1.00e+00 1.00e+0
0f 1
16 1.5685667e+04 2.67e-08 3.19e-03 -5.7 1.49e-01 - 1.00e+00 9.70e-0
1h 1
17 1.5685639e+04 5.14e-12 4.43e-08 -5.7 4.21e-03 - 1.00e+00 1.00e+0
0f 1
18 1.5685625e+04 2.64e-12 8.64e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5685624667907490e+01 1.5685624667907490e+0
4
Dual infeasibility......: 8.6389706110414411e-09 8.6389706110414411e-0
6
Constraint violation....: 2.6416854814748092e-12 2.6416854814748092e-1
2
Complementarity.........: 4.6580468560108257e-09 4.6580468560108258e-0
6
Overall NLP error.......: 8.6389706110414411e-09 8.6389706110414411e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8072093e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.97e-04 9.80e-0
3h 1
2 8.7779304e+02 1.27e+04 5.24e+01 -1.0 1.12e+04 - 2.87e-05 1.11e-0
4h 1
3 7.5964023e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 1.54e-05 7.89e-0
3h 1
4 6.2167179e+02 1.23e+04 5.22e+01 -1.0 1.26e+04 - 8.66e-03 2.06e-0
2h 1
5 2.1691208e+04 6.89e-02 7.89e+01 -1.0 1.23e+04 - 8.17e-02 1.00e+0
0h 1
6 1.5787436e+04 6.18e-02 3.10e+01 -1.0 5.21e+01 - 5.83e-01 9.54e-0
2f 1
7 1.4389513e+04 3.02e-02 5.44e+00 -1.0 2.76e+01 - 7.85e-01 5.09e-0
1f 1
8 1.4101514e+04 4.61e-03 6.73e-01 -1.0 8.44e+00 - 9.44e-01 7.95e-0
1f 1
9 1.3748618e+04 1.35e-03 2.01e-01 -1.7 3.07e+00 - 8.31e-01 9.39e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3812270e+04 7.29e-05 1.37e+00 -1.7 1.38e+01 - 4.01e-01 1.00e+0
0f 1
11 1.3804749e+04 3.65e-05 2.11e-01 -1.7 1.49e+01 - 7.65e-01 1.00e+0
0f 1
12 1.3827744e+04 4.27e-07 4.32e-05 -1.7 1.92e+01 - 1.00e+00 1.00e+0
0h 1
13 1.3739046e+04 1.02e-05 6.32e-01 -2.5 4.33e+01 - 1.00e+00 7.36e-0
1f 1
14 1.3717056e+04 1.21e-04 6.22e-03 -2.5 1.14e+01 - 1.00e+00 1.00e+0
0f 1
15 1.3697135e+04 2.70e-04 8.82e-02 -3.8 8.04e+00 - 7.71e-01 1.00e+0
0h 1
16 1.3694336e+04 1.64e-03 2.15e-03 -3.8 3.58e-02 - 9.78e-01 1.00e+0
0f 1
17 1.3694380e+04 7.00e-05 6.02e-05 -3.8 1.13e-02 - 1.00e+00 1.00e+0
0h 1
18 1.3692879e+04 1.30e-04 1.10e-03 -5.7 4.46e-01 - 9.18e-01 1.00e+0
0h 1
19 1.3692837e+04 3.23e-05 6.58e-06 -5.7 8.37e-03 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.3692843e+04 1.71e-07 3.28e-06 -5.7 5.94e-04 - 1.00e+00 1.00e+0
0h 1
21 1.3692826e+04 2.65e-08 3.19e-05 -8.6 5.53e-03 - 1.00e+00 9.58e-0
1h 1
22 1.3692826e+04 4.25e-12 5.09e-11 -8.6 2.33e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.3692825537041537e+01 1.3692825537041537e+0
4
Dual infeasibility......: 5.0920974723934226e-11 5.0920974723934226e-0
8
Constraint violation....: 4.2497116936601742e-12 4.2497116936601742e-1
2
Complementarity.........: 2.9719800981840589e-09 2.9719800981840587e-0
6
Overall NLP error.......: 2.9719800981840589e-09 2.9719800981840587e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9482527e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 7.48e-04 9.80e-0
3h 1
2 8.9206259e+02 1.11e+04 5.24e+01 -1.0 1.09e+04 - 8.69e-05 1.01e-0
4h 1
3 8.7788074e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 4.01e-06 8.67e-0
4f 1
4 5.1726064e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 9.54e-04 2.26e-0
2h 1
5 2.3121559e+04 6.40e-02 7.79e+01 -1.0 1.09e+04 - 6.98e-02 1.00e+0
0h 1
6 1.4812165e+04 5.85e-02 4.83e+01 -1.0 4.95e+01 - 3.63e-01 7.77e-0
2f 1
7 1.3505031e+04 2.67e-02 2.10e+01 -1.0 2.28e+01 - 5.57e-01 5.00e-0
1f 1
8 1.3018007e+04 6.85e-03 1.23e+00 -1.0 8.59e+00 - 9.37e-01 7.36e-0
1f 1
9 1.3268789e+04 3.20e-04 7.93e-02 -1.0 2.91e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2683148e+04 2.08e-03 9.07e-02 -2.5 4.28e+00 - 8.62e-01 8.28e-0
1f 1
11 1.2505092e+04 2.17e-03 3.62e-01 -2.5 1.06e+00 - 1.00e+00 7.74e-0
1f 1
12 1.2476207e+04 1.68e-04 5.11e-03 -2.5 2.15e-01 - 1.00e+00 1.00e+0
0h 1
13 1.2456345e+04 2.44e-05 4.31e-02 -3.8 2.68e+00 - 1.00e+00 8.82e-0
1h 1
14 1.2454881e+04 5.88e-08 6.10e-04 -3.8 3.16e-01 - 1.00e+00 1.00e+0
0f 1
15 1.2453574e+04 4.24e-08 1.39e-05 -5.7 1.49e-01 - 1.00e+00 9.99e-0
1f 1
16 1.2453562e+04 6.84e-13 3.99e-09 -8.6 1.93e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.2453562308955169e+01 1.2453562308955168e+0
4
Dual infeasibility......: 3.9883527490485750e-09 3.9883527490485750e-0
6
Constraint violation....: 6.8442473910579338e-13 6.8442473910579338e-1
3
Complementarity.........: 2.7863203150657590e-09 2.7863203150657590e-0
6
Overall NLP error.......: 3.9883527490485750e-09 3.9883527490485750e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8776327e+02 9.19e+03 5.24e+01 -1.0 9.28e+03 - 6.64e-04 9.80e-0
3h 1
2 8.8487848e+02 9.19e+03 5.24e+01 -1.0 8.49e+03 - 4.35e-05 1.07e-0
4h 1
3 8.1017702e+02 9.15e+03 5.24e+01 -1.0 9.19e+03 - 1.14e-05 4.07e-0
3h 1
4 4.8829986e+02 8.96e+03 5.23e+01 -1.0 9.15e+03 - 4.62e-03 2.12e-0
2h 1
5 1.9624072e+04 6.67e-02 7.88e+01 -1.0 8.96e+03 - 7.36e-02 1.00e+0
0h 1
6 1.2613352e+04 6.06e-02 4.34e+01 -1.0 5.13e+01 - 4.30e-01 8.42e-0
2f 1
7 1.1287964e+04 2.91e-02 1.67e+01 -1.0 2.55e+01 - 6.00e-01 4.84e-0
1f 1
8 1.0844638e+04 5.12e-03 9.75e-01 -1.0 9.16e+00 - 9.34e-01 7.59e-0
1f 1
9 1.1096445e+04 1.87e-04 6.08e-02 -1.0 4.66e+00 - 9.98e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.0465437e+04 2.23e-03 7.99e-02 -2.5 4.77e+00 - 8.70e-01 8.69e-0
1f 1
11 1.0359660e+04 1.08e-03 4.55e-01 -2.5 7.60e-01 - 1.00e+00 6.04e-0
1f 1
12 1.0359702e+04 2.49e-06 8.14e-03 -2.5 1.53e-01 - 1.00e+00 1.00e+0
0h 1
13 1.0339422e+04 6.16e-06 2.39e-02 -3.8 5.36e+00 - 9.14e-01 8.89e-0
1f 1
14 1.0335906e+04 4.60e-04 4.72e-04 -3.8 5.92e-01 - 1.00e+00 1.00e+0
0f 1
15 1.0334764e+04 6.26e-05 1.12e-02 -5.7 2.97e-01 - 8.14e-01 1.00e+0
0h 1
16 1.0334651e+04 3.51e-05 3.92e-05 -5.7 9.55e-03 - 1.00e+00 1.00e+0
0h 1
17 1.0334652e+04 1.18e-06 1.11e-05 -5.7 1.44e-03 - 1.00e+00 9.97e-0
1h 1
18 1.0334638e+04 2.43e-09 9.96e-08 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
19 1.0334638e+04 3.68e-15 3.66e-14 -8.6 5.13e-07 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.0334637966188140e+01 1.0334637966188140e+0
4
Dual infeasibility......: 3.6593440689439526e-14 3.6593440689439526e-1
1
Constraint violation....: 3.6785976904832955e-15 3.6785976904832955e-1
5
Complementarity.........: 2.5877832905179734e-09 2.5877832905179731e-0
6
Overall NLP error.......: 2.5877832905179734e-09 2.5877832905179731e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0885470e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0407391e+02 6.70e+03 5.23e+01 -1.0 3.36e+03 - 1.78e-05 1.98e-0
4h 1
3 4.2004843e+02 6.55e+03 5.24e+01 -1.0 6.70e+03 - 1.08e-04 2.34e-0
2f 1
4 1.9256453e+04 6.52e-02 8.03e+01 -1.0 6.55e+03 - 3.33e-02 1.00e+0
0h 1
5 1.0816391e+04 6.20e-02 6.14e+01 -1.0 3.75e+01 - 2.34e-01 4.53e-0
2f 1
6 9.5325700e+03 2.03e-02 2.88e+01 -1.0 1.63e+01 - 5.42e-01 6.21e-0
1f 1
7 9.1168117e+03 5.73e-03 8.82e-01 -1.0 5.28e+00 - 9.57e-01 7.83e-0
1f 1
8 9.3828903e+03 1.65e-04 6.55e-02 -1.0 5.70e+00 - 9.99e-01 1.00e+0
0f 1
9 8.8196185e+03 2.12e-03 8.12e-02 -2.5 7.80e+00 - 8.55e-01 8.49e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.6592570e+03 2.16e-03 4.16e-01 -2.5 1.46e+00 - 1.00e+00 7.62e-0
1f 1
11 8.6338603e+03 1.24e-04 4.69e-03 -2.5 3.54e-01 - 1.00e+00 1.00e+0
0h 1
12 8.6088446e+03 3.31e-05 1.45e-01 -3.8 1.34e+01 - 1.00e+00 7.62e-0
1h 1
13 8.6021735e+03 1.25e-07 3.38e-04 -3.8 3.19e+00 - 1.00e+00 1.00e+0
0f 1
14 8.6003600e+03 2.85e-08 9.91e-04 -5.7 7.43e-01 - 1.00e+00 9.85e-0
1f 1
15 8.6003380e+03 1.92e-12 1.39e-08 -5.7 1.12e-02 - 1.00e+00 1.00e+0
0f 1
16 8.6003159e+03 2.63e-12 4.48e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 8.6003159347032092e+00 8.6003159347032088e+0
3
Dual infeasibility......: 4.4776951771092962e-09 4.4776951771092962e-0
6
Constraint violation....: 2.6310204015445038e-12 2.6310204015445038e-1
2
Complementarity.........: 3.6084978205870004e-09 3.6084978205870002e-0
6
Overall NLP error.......: 4.4776951771092962e-09 4.4776951771092962e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3004795e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 2.02e-03 9.80e-0
3h 1
2 9.2712367e+02 4.77e+03 5.23e+01 -1.0 4.47e+03 - 6.97e-05 1.06e-0
4h 1
3 8.6230721e+02 4.76e+03 5.23e+01 -1.0 4.77e+03 - 1.09e-05 2.80e-0
3f 1
4 3.9458856e+02 4.65e+03 5.23e+01 -1.0 4.76e+03 - 3.78e-03 2.20e-0
2h 1
5 1.5936731e+04 7.51e-02 7.75e+01 -1.0 4.65e+03 - 7.99e-02 1.00e+0
0h 1
6 9.0816127e+03 6.78e-02 2.29e+01 -1.0 8.31e+00 - 6.77e-01 9.05e-0
2f 1
7 7.8525062e+03 3.47e-02 8.39e+00 -1.0 6.89e+00 - 7.10e-01 1.00e+0
0f 1
8 8.1952987e+03 2.05e-02 2.98e-01 -1.0 2.41e+00 - 9.96e-01 9.69e-0
1f 1
9 7.7640020e+03 3.95e-03 3.54e-01 -1.7 1.12e+01 - 8.33e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.7107177e+03 7.81e-04 3.48e-02 -1.7 7.24e+00 - 1.00e+00 1.00e+0
0h 1
11 7.5664017e+03 4.99e-04 2.40e-02 -2.5 1.64e+01 - 9.77e-01 9.84e-0
1f 1
12 7.5511474e+03 1.19e-04 1.70e-01 -3.8 2.89e+00 - 9.96e-01 7.71e-0
1h 1
13 7.5477479e+03 2.23e-07 1.25e-04 -3.8 6.61e-01 - 1.00e+00 1.00e+0
0f 1
14 7.5465612e+03 1.74e-08 3.02e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
15 7.5465477e+03 1.28e-12 4.23e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 7.5465477345467571e+00 7.5465477345467571e+0
3
Dual infeasibility......: 4.2290145445222262e-10 4.2290145445222262e-0
7
Constraint violation....: 1.2841533392204951e-12 1.2841533392204951e-1
2
Complementarity.........: 2.5905430566459489e-09 2.5905430566459489e-0
6
Overall NLP error.......: 2.5905430566459489e-09 2.5905430566459489e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6637182e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 4.97e-04 9.82e-0
3h 1
2 8.6042939e+02 3.24e+03 5.24e+01 -1.0 1.84e+03 - 3.26e-05 2.28e-0
4h 1
3 3.1417401e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 1.47e-04 2.23e-0
2f 1
4 1.5379505e+04 5.92e-02 8.10e+01 -1.0 3.17e+03 - 3.78e-02 1.00e+0
0h 1
5 6.7093918e+03 5.60e-02 5.74e+01 -1.0 7.11e+01 - 2.87e-01 4.89e-0
2f 1
6 4.9418778e+03 2.59e-02 3.09e+01 -1.0 3.57e+01 - 4.68e-01 5.10e-0
1f 1
7 4.4134385e+03 1.24e-02 2.54e+00 -1.0 9.80e+00 - 9.26e-01 1.00e+0
0f 1
8 4.8172359e+03 7.35e-04 6.14e-02 -1.0 3.06e+00 - 9.96e-01 1.00e+0
0f 1
9 4.2453706e+03 7.96e-04 2.08e-01 -1.7 5.70e+01 - 1.00e+00 8.91e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2840509e+03 9.46e-05 2.83e-02 -1.7 4.63e+01 - 1.00e+00 1.00e+0
0f 1
11 4.1196181e+03 7.26e-05 1.88e-02 -2.5 8.67e+01 - 1.00e+00 9.81e-0
1f 1
12 4.0897107e+03 2.83e-03 7.72e-02 -3.8 1.47e+01 - 6.58e-01 9.88e-0
1h 1
13 4.0847021e+03 5.96e-03 1.14e-02 -3.8 1.62e-01 - 8.54e-01 1.00e+0
0h 1
14 4.0853459e+03 9.90e-05 6.44e-04 -3.8 1.90e-02 - 1.00e+00 1.00e+0
0h 1
15 4.0833342e+03 1.53e-04 9.39e-04 -5.7 7.43e-01 - 9.35e-01 1.00e+0
0h 1
16 4.0833362e+03 4.82e-05 6.07e-03 -5.7 1.40e-03 - 1.00e+00 6.86e-0
1h 1
17 4.0833469e+03 1.22e-08 2.27e-06 -5.7 1.20e-04 - 1.00e+00 1.00e+0
0f 1
18 4.0833248e+03 9.68e-09 2.17e-05 -8.6 9.21e-03 - 1.00e+00 9.82e-0
1h 1
19 4.0833244e+03 1.63e-12 8.01e-11 -8.6 1.62e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 4.0833243987214312e+00 4.0833243987214310e+0
3
Dual infeasibility......: 8.0052701115146151e-11 8.0052701115146145e-0
8
Constraint violation....: 1.6306955785694299e-12 1.6306955785694299e-1
2
Complementarity.........: 3.0291413885635131e-09 3.0291413885635130e-0
6
Overall NLP error.......: 3.0291413885635131e-09 3.0291413885635130e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4538520e+02 2.00e+03 5.24e+01 -1.0 2.02e+03 - 3.98e-04 9.81e-0
3f 1
2 8.4231260e+02 2.00e+03 5.24e+01 -1.0 1.79e+03 - 1.02e-04 1.10e-0
4h 1
3 7.1124430e+02 1.99e+03 5.24e+01 -1.0 2.00e+03 - 2.16e-05 5.05e-0
3f 1
4 2.8981165e+02 1.95e+03 5.20e+01 -1.0 1.99e+03 - 1.05e-02 2.03e-0
2f 1
5 1.0201295e+04 6.58e-02 8.06e+01 -1.0 1.95e+03 - 7.71e-02 1.00e+0
0h 1
6 4.6339951e+03 5.92e-02 2.35e+01 -1.0 5.97e+01 - 6.87e-01 9.29e-0
2f 1
7 2.9806183e+03 3.57e-02 5.61e+00 -1.0 3.57e+01 - 7.27e-01 5.16e-0
1f 1
8 3.4333562e+03 5.70e-03 3.60e-01 -1.0 6.59e+00 - 9.67e-01 1.00e+0
0h 1
9 2.8155727e+03 1.00e-03 1.73e-01 -1.7 9.11e+00 - 1.00e+00 8.65e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.6595013e+03 1.27e-03 3.83e-01 -2.5 6.48e+00 - 7.67e-01 1.00e+0
0h 1
11 2.5900984e+03 2.05e-02 6.76e-02 -2.5 4.11e+00 - 9.30e-01 9.07e-0
1h 1
12 2.6017434e+03 7.28e-04 1.17e-02 -2.5 4.90e-01 - 1.00e+00 1.00e+0
0h 1
13 2.5815687e+03 2.61e-04 5.66e-02 -3.8 2.69e+00 - 9.94e-01 8.74e-0
1h 1
14 2.5805166e+03 1.09e-06 1.27e-04 -3.8 3.36e-01 - 1.00e+00 1.00e+0
0h 1
15 2.5794652e+03 3.43e-07 2.10e-03 -5.7 1.49e-01 - 1.00e+00 9.78e-0
1h 1
16 2.5794567e+03 3.85e-11 2.12e-08 -5.7 3.27e-03 - 1.00e+00 1.00e+0
0f 1
17 2.5794438e+03 6.30e-11 4.40e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 2.5794437842090501e+00 2.5794437842090501e+0
3
Dual infeasibility......: 4.3996645727394973e-09 4.3996645727394973e-0
6
Constraint violation....: 6.3005808903504601e-11 6.3005808903504601e-1
1
Complementarity.........: 3.3091807432793533e-09 3.3091807432793533e-0
6
Overall NLP error.......: 4.3996645727394973e-09 4.3996645727394973e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 40
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 20
inequality constraints with only lower bounds: 11
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2157199e+02 9.17e+02 5.24e+01 -1.0 9.19e+02 - 3.29e-04 9.89e-0
3h 1
2 7.9501737e+02 9.17e+02 5.24e+01 -1.0 8.24e+02 - 1.08e-04 9.70e-0
4h 1
3 2.4294958e+02 8.97e+02 5.26e+01 -1.0 9.17e+02 - 9.54e-04 2.09e-0
2h 1
4 1.2226498e+04 5.54e-02 8.38e+01 -1.0 8.98e+02 - 2.32e-02 1.00e+0
0h 1
5 3.9525615e+03 5.36e-02 6.86e+01 -1.0 8.20e+01 - 1.85e-01 3.67e-0
2f 1
6 1.9798293e+03 4.38e-02 3.67e+01 -1.0 3.39e+01 - 4.73e-01 5.45e-0
1f 1
7 2.6504959e+03 1.87e-02 2.12e+01 -1.0 1.93e+01 - 3.73e-01 2.50e-0
1f 3
8 1.9447595e+03 7.69e-03 3.95e-01 -1.0 1.01e+01 - 9.83e-01 1.00e+0
0f 1
9 1.6813375e+03 1.32e-03 2.75e-01 -1.7 4.75e+00 - 1.00e+00 8.77e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7929284e+03 9.71e-04 1.26e-02 -1.7 1.58e+02 - 1.00e+00 1.00e+0
0f 1
11 1.5332592e+03 1.40e-03 9.40e-02 -3.8 1.63e+02 - 7.95e-01 9.28e-0
1f 1
12 1.5035867e+03 1.57e-03 7.53e-02 -3.8 8.95e+00 - 8.38e-01 7.55e-0
1h 1
13 1.5021331e+03 3.31e-06 8.52e-04 -3.8 2.10e+00 - 1.00e+00 1.00e+0
0h 1
14 1.5003346e+03 2.76e-07 7.32e-04 -5.7 1.04e+00 - 1.00e+00 9.87e-0
1h 1
15 1.5003172e+03 3.72e-11 6.78e-09 -5.7 2.86e-01 - 1.00e+00 1.00e+0
0f 1
16 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.29e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.5002932825310773e+00 1.5002932825310772e+0
3
Dual infeasibility......: 2.1691335316181044e-09 2.1691335316181044e-0
6
Constraint violation....: 6.2998814498449462e-11 6.2998814498449462e-1
1
Complementarity.........: 2.8880993621783901e-09 2.8880993621783902e-0
6
Overall NLP error.......: 2.8880993621783901e-09 2.8880993621783902e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1561707e+02 1.10e+02 1.13e+02 -1.0 3.77e+01 - 2.63e-04 3.01e-0
2f 1
2 1.1395397e+04 5.38e-02 8.36e+01 -1.0 4.54e+01 - 3.09e-02 1.00e+0
0h 1
3 2.7818096e+03 5.17e-02 6.49e+01 -1.0 8.43e+01 - 2.26e-01 4.31e-0
2f 1
4 9.8126003e+02 4.25e-02 3.38e+01 -1.0 3.40e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5879597e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.22e-01 1.00e+0
0h 1
6 9.4485061e+02 1.01e-02 8.69e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6262745e+02 4.58e-04 6.61e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536138e+02 1.94e-03 1.93e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379465e+02 3.25e-03 6.08e-02 -2.5 2.05e+00 - 1.00e+00 9.48e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140268e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388112e+02 1.57e-04 1.68e-02 -3.8 7.57e-01 - 9.93e-01 9.42e-0
1h 1
12 5.8370190e+02 7.27e-07 6.65e-05 -3.8 8.51e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278678e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.07e-09 -5.7 3.34e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148963773e-01 5.8277753148963768e+0
2
Dual infeasibility......: 2.0876265324107697e-09 2.0876265324107697e-0
6
Constraint violation....: 6.2994179317321652e-11 6.2994179317321652e-1
1
Complementarity.........: 2.8882094043971760e-09 2.8882094043971758e-0
6
Overall NLP error.......: 2.8882094043971760e-09 2.8882094043971758e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1561707e+02 1.10e+02 1.13e+02 -1.0 3.77e+01 - 2.63e-04 3.01e-0
2f 1
2 1.1395397e+04 5.38e-02 8.36e+01 -1.0 4.54e+01 - 3.09e-02 1.00e+0
0h 1
3 2.7818096e+03 5.17e-02 6.49e+01 -1.0 8.43e+01 - 2.26e-01 4.31e-0
2f 1
4 9.8126003e+02 4.25e-02 3.38e+01 -1.0 3.40e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5879597e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.22e-01 1.00e+0
0h 1
6 9.4485061e+02 1.01e-02 8.69e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6262745e+02 4.58e-04 6.61e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536138e+02 1.94e-03 1.93e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379465e+02 3.25e-03 6.08e-02 -2.5 2.05e+00 - 1.00e+00 9.48e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140268e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388112e+02 1.57e-04 1.68e-02 -3.8 7.57e-01 - 9.93e-01 9.42e-0
1h 1
12 5.8370190e+02 7.27e-07 6.65e-05 -3.8 8.51e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278678e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.07e-09 -5.7 3.34e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148963773e-01 5.8277753148963768e+0
2
Dual infeasibility......: 2.0876265324107697e-09 2.0876265324107697e-0
6
Constraint violation....: 6.2994179317321652e-11 6.2994179317321652e-1
1
Complementarity.........: 2.8882094043971760e-09 2.8882094043971758e-0
6
Overall NLP error.......: 2.8882094043971760e-09 2.8882094043971758e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.80e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.4972143e+02 7.53e+01 9.06e+01 -1.0 2.60e+01 - 3.82e-04 3.51e-0
2f 1
2 1.1815541e+04 5.63e-02 8.12e+01 -1.0 2.88e+01 - 4.62e-02 1.00e+0
0h 1
3 3.1559297e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.63e-0
2f 1
4 1.0148074e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8316698e+03 7.33e-03 1.59e+01 -1.0 1.90e+01 - 6.01e-01 1.00e+0
0h 1
6 1.1119400e+03 5.45e-03 4.07e-01 -1.0 1.74e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8118998e+02 9.74e-04 2.00e-01 -1.7 5.70e+00 - 1.00e+00 8.93e-0
1h 1
8 7.2708731e+02 8.62e-04 1.28e-02 -1.7 3.47e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0942784e+02 1.50e-03 1.12e-01 -3.8 4.46e+00 - 7.73e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8221700e+02 2.13e-03 7.62e-02 -3.8 2.08e+00 - 8.09e-01 7.38e-0
1h 1
11 5.8339463e+02 6.70e-05 3.39e-02 -3.8 3.03e-02 - 1.00e+00 9.68e-0
1h 1
12 5.8368702e+02 2.73e-07 1.02e-05 -3.8 4.19e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278914e+02 4.12e-07 5.08e-04 -5.7 3.46e-02 - 1.00e+00 9.92e-0
1h 1
14 5.8278859e+02 4.34e-11 3.43e-09 -5.7 2.59e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.61e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753114421005e-01 5.8277753114421000e+0
2
Dual infeasibility......: 2.6074599171069661e-09 2.6074599171069661e-0
6
Constraint violation....: 6.3001867611767182e-11 6.3001867611767182e-1
1
Complementarity.........: 2.8882617490268177e-09 2.8882617490268175e-0
6
Overall NLP error.......: 2.8882617490268177e-09 2.8882617490268175e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.30e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9751028e+02 4.12e+01 5.97e+01 -1.0 1.43e+01 - 6.95e-04 4.22e-0
2f 1
2 1.2223543e+04 6.06e-02 7.87e+01 -1.0 1.80e+01 - 7.03e-02 1.00e+0
0h 1
3 3.6163864e+03 5.54e-02 5.16e+01 -1.0 5.49e+01 - 3.32e-01 7.83e-0
2f 1
4 2.3465029e+03 2.94e-02 2.29e+01 -1.0 2.73e+01 - 5.43e-01 4.44e-0
1f 1
5 1.7429437e+03 8.60e-03 1.20e+00 -1.0 1.00e+01 - 9.27e-01 7.72e-0
1f 1
6 2.0193415e+03 3.35e-04 8.12e-02 -1.0 3.41e+00 - 1.00e+00 1.00e+0
0h 1
7 1.3871663e+03 2.09e-03 7.98e-02 -2.5 4.93e+00 - 8.66e-01 8.53e-0
1f 1
8 1.2078116e+03 2.16e-03 1.82e-01 -2.5 1.03e+00 - 1.00e+00 8.45e-0
1f 1
9 1.1988475e+03 4.15e-05 5.40e-03 -2.5 1.17e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1918113e+03 2.21e-05 1.69e+00 -3.8 9.24e-02 - 1.00e+00 4.95e-0
1h 1
11 1.1890582e+03 1.20e-06 8.02e-02 -3.8 7.45e-02 - 9.39e-01 1.00e+0
0f 1
12 1.1886086e+03 2.80e-05 1.64e-01 -3.8 2.27e-02 - 1.00e+00 4.53e-0
1h 2
13 1.1884020e+03 3.39e-06 1.10e-04 -3.8 1.09e-02 - 1.00e+00 1.00e+0
0h 1
14 1.1876707e+03 8.26e-06 5.27e-02 -5.7 1.33e-02 - 7.06e-01 9.87e-0
1h 1
15 1.1874991e+03 1.88e-05 2.09e-04 -5.7 6.61e-03 - 9.83e-01 1.00e+0
0f 1
16 1.1875027e+03 1.52e-08 1.85e-06 -5.7 1.81e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1874908e+03 1.41e-08 4.78e-05 -8.6 1.74e-04 - 9.92e-01 9.58e-0
1h 1
18 1.1874903e+03 4.38e-12 5.65e-11 -8.6 7.37e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1874903477613632e+00 1.1874903477613632e+0
3
Dual infeasibility......: 5.6524952812551450e-11 5.6524952812551450e-0
8
Constraint violation....: 4.3780534753068423e-12 4.3780534753068423e-1
2
Complementarity.........: 2.5123309890616143e-09 2.5123309890616142e-0
6
Overall NLP error.......: 2.5123309890616143e-09 2.5123309890616142e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 42
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 21
inequality constraints with only lower bounds: 12
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2131391e+02 9.17e+02 5.24e+01 -1.0 9.18e+02 - 3.29e-04 9.90e-0
3h 1
2 7.9403866e+02 9.17e+02 5.24e+01 -1.0 8.26e+02 - 1.20e-04 9.96e-0
4h 1
3 6.0837822e+02 9.10e+02 5.24e+01 -1.0 9.16e+02 - 9.92e-04 7.04e-0
3h 1
4 2.6557630e+02 8.91e+02 5.23e+01 -1.0 9.10e+02 - 8.53e-03 2.08e-0
2f 1
5 9.0707937e+03 6.19e-02 8.25e+01 -1.0 8.91e+02 - 5.51e-02 1.00e+0
0h 1
6 3.5127525e+03 5.71e-02 2.76e+01 -1.0 5.71e+01 - 6.50e-01 7.23e-0
2f 1
7 1.8666961e+03 3.67e-02 8.49e+00 -1.0 3.66e+01 - 6.67e-01 4.89e-0
1f 1
8 2.4324787e+03 5.83e-03 1.90e-01 -1.0 2.50e+00 - 9.90e-01 1.00e+0
0f 1
9 1.6931621e+03 1.40e-03 9.31e-02 -1.7 1.27e+01 - 1.00e+00 9.48e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5727955e+03 1.69e-03 2.86e-01 -2.5 8.75e+00 - 7.83e-01 1.00e+0
0h 1
11 1.5293060e+03 5.67e-03 1.90e-01 -2.5 2.81e+00 - 1.00e+00 8.46e-0
1h 1
12 1.5393468e+03 1.93e-04 6.06e-03 -2.5 4.68e-01 - 1.00e+00 1.00e+0
0h 1
13 1.5032324e+03 1.67e-04 2.29e-02 -3.8 2.01e+01 - 9.99e-01 9.33e-0
1h 1
14 1.5022708e+03 6.30e-07 6.59e-05 -3.8 7.53e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5003176e+03 3.81e-07 1.80e-04 -5.7 1.04e+00 - 1.00e+00 9.96e-0
1h 1
16 1.5003172e+03 3.82e-11 2.95e-09 -5.7 8.64e-03 - 1.00e+00 1.00e+0
0f 1
17 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.29e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5002932823762336e+00 1.5002932823762335e+0
3
Dual infeasibility......: 2.1694039427911110e-09 2.1694039427911110e-0
6
Constraint violation....: 6.2995955674161053e-11 6.2995955674161053e-1
1
Complementarity.........: 2.8882164720189762e-09 2.8882164720189763e-0
6
Overall NLP error.......: 2.8882164720189762e-09 2.8882164720189763e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
1 8.6401891e+02 9.17e+02 5.24e+01 -1.0 9.18e+02 - 4.93e-04 9.90e-0
3h 1
2 8.3300778e+02 9.16e+02 5.24e+01 -1.0 8.38e+02 - 1.18e-04 1.15e-0
3h 1
3 5.9651247e+02 9.08e+02 5.24e+01 -1.0 9.16e+02 - 1.14e-03 9.05e-0
3h 1
4 2.9570247e+02 8.88e+02 5.21e+01 -1.0 9.08e+02 - 1.08e-02 2.16e-0
2f 1
5 8.9190555e+03 6.87e-02 7.93e+01 -1.0 8.89e+02 - 8.62e-02 1.00e+0
0h 1
6 3.7004448e+03 6.11e-02 2.16e+01 -1.0 5.55e+01 - 7.01e-01 1.03e-0
1f 1
63 1.373164e+04 1.632511e+04 5.162760e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1155551e+02 1.57e+04 5.50e+01 -1.0 1.59e+04 - 1.75e-04 9.80e-0
3f 1
2 7.0865062e+02 1.57e+04 5.50e+01 -1.0 1.45e+04 - 3.33e-05 1.07e-0
4h 1
3 6.5142725e+02 1.57e+04 5.48e+01 -1.0 1.57e+04 - 1.07e-05 4.62e-0
3h 1
4 5.5287085e+02 1.54e+04 5.37e+01 -1.0 1.57e+04 - 4.92e-03 1.87e-0
2h 1
5 2.4518413e+04 7.56e-02 8.64e+01 -1.0 1.54e+04 - 2.82e-02 1.00e+0
0h 1
6 1.7865769e+04 7.24e-02 6.19e+01 -1.0 5.72e+01 - 2.91e-01 4.49e-0
2f 1
7 1.6628352e+04 4.80e-02 2.76e+01 -1.0 2.10e+01 - 5.48e-01 3.81e-0
1f 1
8 1.7113440e+04 3.46e-02 8.52e+00 -1.0 1.31e+01 - 5.69e-01 2.50e-0
1f 3
9 1.6805679e+04 6.62e-03 1.36e-01 -1.0 2.91e+00 - 9.91e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6504326e+04 7.68e-04 2.76e-01 -1.7 1.03e+01 - 7.67e-01 9.05e-0
1f 1
11 1.6497056e+04 3.63e-04 4.20e-01 -1.7 2.37e+01 - 4.14e-01 1.00e+0
0f 1
12 1.6504273e+04 4.67e-05 2.41e-03 -1.7 1.59e+01 - 1.00e+00 1.00e+0
0h 1
13 1.6354741e+04 1.17e-03 8.78e-02 -3.8 4.93e+01 - 8.02e-01 9.31e-0
1f 1
14 1.6326725e+04 1.45e-03 4.56e-02 -3.8 3.39e+00 - 8.53e-01 7.97e-0
1h 1
15 1.6326366e+04 2.31e-06 6.71e-04 -3.8 6.89e-01 - 1.00e+00 1.00e+0
0h 1
16 1.6325131e+04 3.40e-07 6.22e-04 -5.7 4.46e-01 - 1.00e+00 9.89e-0
1h 1
17 1.6325122e+04 4.21e-11 5.77e-09 -5.7 2.29e+00 - 1.00e+00 1.00e+0
0f 1
18 1.6325105e+04 6.17e-11 6.18e-06 -8.6 5.53e-03 - 1.00e+00 9.90e-0
1h 1
19 1.6325105e+04 1.42e-14 2.11e-13 -8.6 4.33e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.6325105279166941e+01 1.6325105279166941e+0
4
Dual infeasibility......: 2.1070933616853450e-13 2.1070933616853450e-1
0
Constraint violation....: 1.4210854715202004e-14 1.4210854715202004e-1
4
Complementarity.........: 6.1257686586885741e-09 6.1257686586885737e-0
6
Overall NLP error.......: 6.1257686586885741e-09 6.1257686586885737e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4810445e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 4.08e-04 9.80e-0
3h 1
2 8.4520171e+02 1.50e+04 5.24e+01 -1.0 1.37e+04 - 3.05e-05 1.09e-0
4h 1
3 8.3442758e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 1.22e-05 8.28e-0
4h 1
4 6.7195846e+02 1.48e+04 5.25e+01 -1.0 1.50e+04 - 8.35e-04 1.31e-0
2h 1
5 8.5677086e+02 1.44e+04 5.18e+01 -1.0 1.48e+04 - 1.65e-02 2.50e-0
2f 1
6 2.1753129e+04 6.82e-02 7.85e+01 -1.0 1.44e+04 - 1.02e-01 1.00e+0
0h 1
7 1.7331487e+04 5.91e-02 2.29e+01 -1.0 5.29e+01 - 6.86e-01 1.23e-0
1f 1
8 1.5968278e+04 3.55e-02 3.38e+00 -1.0 3.05e+01 - 8.10e-01 5.33e-0
1f 1
9 1.6289196e+04 5.38e-03 4.02e+00 -1.0 3.66e+00 - 4.70e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6122995e+04 5.10e-04 1.34e+00 -1.0 2.29e+00 - 5.46e-01 1.00e+0
0f 1
11 1.6148351e+04 9.96e-05 5.03e-01 -1.0 4.08e+00 - 5.86e-01 1.00e+0
0f 1
12 1.5829068e+04 2.33e-04 5.92e-01 -1.7 5.64e+00 - 8.96e-01 6.88e-0
1f 1
13 1.5764384e+04 3.82e-04 4.49e-01 -1.7 1.26e+01 - 6.36e-01 1.00e+0
0f 1
14 1.5757521e+04 9.45e-05 2.87e-02 -1.7 1.63e+01 - 8.92e-01 1.00e+0
0h 1
15 1.5615102e+04 8.95e-04 7.04e-02 -2.5 3.15e+01 - 9.03e-01 1.00e+0
0f 1
16 1.5593128e+04 1.29e-03 5.64e-03 -2.5 1.37e+00 - 1.00e+00 1.00e+0
0h 1
17 1.5578388e+04 4.60e-04 3.37e-01 -3.8 5.97e+00 - 1.00e+00 6.64e-0
1h 1
18 1.5574948e+04 2.85e-05 1.98e-01 -3.8 1.75e+00 - 8.03e-01 1.00e+0
0h 1
19 1.5574109e+04 7.25e-05 9.25e-04 -3.8 9.47e-03 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5572899e+04 1.36e-05 7.26e-03 -5.7 2.99e-01 - 9.16e-01 9.83e-0
1h 1
21 1.5572847e+04 4.56e-07 1.57e-06 -5.7 4.09e-03 - 1.00e+00 1.00e+0
0f 1
22 1.5572830e+04 4.62e-09 3.82e-07 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
23 1.5572830e+04 9.44e-15 3.67e-14 -8.6 1.90e-07 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 23
(scaled) (unscaled)
Objective...............: 1.5572830466610084e+01 1.5572830466610083e+0
4
Dual infeasibility......: 3.6659430522484394e-14 3.6659430522484394e-1
1
Constraint violation....: 9.4368957093138306e-15 9.4368957093138306e-1
5
Complementarity.........: 2.5150876559780230e-09 2.5150876559780229e-0
6
Overall NLP error.......: 2.5150876559780230e-09 2.5150876559780229e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 24
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 24
Number of inequality constraint Jacobian evaluations = 24
Number of Lagrangian Hessian evaluations = 23
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6663632e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 4.97e-04 9.80e-0
3h 1
2 8.6385551e+02 1.39e+04 5.24e+01 -1.0 1.37e+04 - 9.10e-05 1.01e-0
4h 1
3 8.5474456e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 3.12e-06 6.56e-0
4f 1
4 5.5736289e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 7.05e-04 2.21e-0
2h 1
5 2.5729005e+04 5.98e-02 8.02e+01 -1.0 1.36e+04 - 5.05e-02 1.00e+0
0h 1
6 1.7257833e+04 5.58e-02 5.33e+01 -1.0 7.29e+01 - 3.25e-01 6.04e-0
2f 1
7 1.5669674e+04 3.02e-02 2.77e+01 -1.0 3.88e+01 - 4.75e-01 4.33e-0
1f 1
8 1.5391032e+04 1.45e-02 2.54e+00 -1.0 1.10e+01 - 9.18e-01 5.00e-0
1f 2
9 1.5231410e+04 7.14e-03 1.81e+00 -1.0 7.85e+00 - 1.00e+00 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5334693e+04 5.59e-04 4.23e-02 -1.0 9.95e+01 - 1.00e+00 1.00e+0
0f 1
11 1.4902809e+04 4.46e-04 9.63e-01 -2.5 9.82e+01 - 9.17e-01 5.84e-0
1f 1
12 1.4780239e+04 2.23e-04 2.20e-01 -2.5 4.04e+01 - 9.25e-01 1.00e+0
0f 1
13 1.4754279e+04 3.09e-03 1.97e-02 -2.5 1.15e+00 - 1.00e+00 1.00e+0
0h 1
14 1.4740982e+04 8.07e-04 3.65e-02 -3.8 2.68e+00 - 8.02e-01 1.00e+0
0h 1
15 1.4738047e+04 2.15e-03 1.02e-03 -3.8 4.89e-02 - 1.00e+00 1.00e+0
0h 1
16 1.4738260e+04 4.87e-05 1.38e-04 -3.8 1.22e-02 - 1.00e+00 1.00e+0
0h 1
17 1.4736958e+04 1.01e-04 3.31e-04 -5.7 1.49e-01 - 9.50e-01 9.74e-0
1h 1
18 1.4736944e+04 2.31e-05 3.85e-03 -5.7 3.81e-03 - 1.00e+00 7.72e-0
1h 1
19 1.4736946e+04 9.00e-09 1.28e-06 -5.7 8.67e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.4736932e+04 9.08e-09 1.93e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
21 1.4736931e+04 1.37e-12 6.54e-11 -8.6 3.06e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.4736931425491850e+01 1.4736931425491850e+0
4
Dual infeasibility......: 6.5446543064386025e-11 6.5446543064386019e-0
8
Constraint violation....: 1.3696821454800556e-12 1.3696821454800556e-1
2
Complementarity.........: 2.5092871215753400e-09 2.5092871215753400e-0
6
Overall NLP error.......: 2.5092871215753400e-09 2.5092871215753400e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8071586e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.97e-04 9.81e-0
3h 1
2 8.7764106e+02 1.26e+04 5.24e+01 -1.0 1.03e+04 - 2.17e-05 1.21e-0
4h 1
3 5.9098660e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 2.59e-05 1.91e-0
2h 1
4 7.4791794e+03 6.91e+03 6.33e+01 -1.0 1.24e+04 - 2.12e-02 4.43e-0
1h 1
5 1.5267974e+04 1.39e+03 4.88e+01 -1.0 6.91e+03 - 3.99e-01 7.98e-0
1h 1
6 1.3281750e+04 8.06e+02 3.94e+00 -1.0 1.39e+03 - 9.77e-01 4.21e-0
1h 1
7 1.4177628e+04 9.86e-03 3.40e-01 -1.0 8.12e+02 - 7.44e-01 1.00e+0
0h 1
8 1.3748149e+04 9.56e-04 3.07e-01 -1.7 4.09e+00 - 8.27e-01 9.99e-0
1f 1
9 1.3817620e+04 3.54e-05 1.00e+00 -1.7 1.77e+01 - 4.94e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3822988e+04 3.44e-05 2.86e-03 -1.7 2.10e+01 - 9.95e-01 1.00e+0
0f 1
11 1.3741002e+04 1.90e-05 6.65e-01 -2.5 3.73e+01 - 1.00e+00 7.30e-0
1f 1
12 1.3719870e+04 1.25e-04 6.24e-03 -2.5 1.03e+01 - 1.00e+00 1.00e+0
0f 1
13 1.3697283e+04 2.69e-04 8.81e-02 -3.8 1.07e+01 - 7.71e-01 1.00e+0
0h 1
14 1.3694485e+04 1.64e-03 2.15e-03 -3.8 3.60e-02 - 9.77e-01 1.00e+0
0f 1
15 1.3694530e+04 7.04e-05 6.07e-05 -3.8 1.13e-02 - 1.00e+00 1.00e+0
0h 1
16 1.3692881e+04 1.30e-04 1.10e-03 -5.7 5.94e-01 - 9.18e-01 1.00e+0
0h 1
17 1.3692839e+04 3.23e-05 6.59e-06 -5.7 8.37e-03 - 1.00e+00 1.00e+0
0h 1
18 1.3692845e+04 1.73e-07 3.30e-06 -5.7 5.98e-04 - 1.00e+00 1.00e+0
0h 1
19 1.3692826e+04 2.65e-08 3.20e-05 -8.6 7.37e-03 - 1.00e+00 9.58e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.3692826e+04 4.27e-12 5.10e-11 -8.6 3.11e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.3692825537487639e+01 1.3692825537487639e+0
4
Dual infeasibility......: 5.1032437346504364e-11 5.1032437346504364e-0
8
Constraint violation....: 4.2721381987576024e-12 4.2721381987576024e-1
2
Complementarity.........: 2.7855821512673735e-09 2.7855821512673734e-0
6
Overall NLP error.......: 2.7855821512673735e-09 2.7855821512673734e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2301827e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.51e-03 9.80e-0
3h 1
2 9.2024087e+02 1.11e+04 5.23e+01 -1.0 1.08e+04 - 7.47e-05 1.02e-0
4h 1
3 9.0326738e+02 1.11e+04 5.23e+01 -1.0 1.11e+04 - 4.37e-06 1.03e-0
3f 1
4 5.3702294e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 1.15e-03 2.30e-0
2h 1
5 2.3289105e+04 6.96e-02 7.66e+01 -1.0 1.09e+04 - 7.98e-02 1.00e+0
0h 1
6 1.5362575e+04 6.29e-02 2.45e+01 -1.0 1.37e+01 - 6.46e-01 8.76e-0
2f 1
7 1.4033685e+04 2.07e-02 1.03e+01 -1.0 9.92e+00 - 6.53e-01 8.97e-0
1f 1
8 1.4145242e+04 1.08e-02 5.79e-01 -1.0 2.88e+00 - 9.94e-01 4.84e-0
1f 2
9 1.3817987e+04 8.41e-03 2.69e-01 -1.7 8.68e+00 - 1.00e+00 8.38e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3787132e+04 2.15e-03 8.88e-01 -1.7 1.24e+01 - 1.00e+00 5.00e-0
1h 2
11 1.3779949e+04 1.97e-04 1.51e-02 -1.7 6.18e+00 - 1.00e+00 1.00e+0
0h 1
12 1.3624290e+04 4.77e-04 2.41e-02 -3.8 1.99e+01 - 8.46e-01 8.31e-0
1f 1
13 1.3606068e+04 1.49e-04 2.06e-01 -3.8 3.35e+00 - 9.89e-01 7.20e-0
1h 1
14 1.3601454e+04 3.86e-07 3.06e-04 -3.8 9.35e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3600265e+04 1.95e-08 4.40e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
16 1.3600252e+04 7.95e-13 4.82e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.3600252144846412e+01 1.3600252144846410e+0
4
Dual infeasibility......: 4.8171320768557844e-10 4.8171320768557844e-0
7
Constraint violation....: 7.9501683014626678e-13 7.9501683014626678e-1
3
Complementarity.........: 2.6133282775198779e-09 2.6133282775198779e-0
6
Overall NLP error.......: 2.6133282775198779e-09 2.6133282775198779e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3005826e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 2.02e-03 9.80e-0
3h 1
2 9.2703232e+02 9.19e+03 5.23e+01 -1.0 8.09e+03 - 2.76e-05 1.12e-0
4h 1
3 7.5783103e+02 9.11e+03 5.23e+01 -1.0 9.19e+03 - 1.67e-05 9.02e-0
3f 1
4 5.7019949e+02 8.91e+03 5.19e+01 -1.0 9.11e+03 - 1.10e-02 2.10e-0
2h 1
5 1.8305221e+04 8.28e-02 7.82e+01 -1.0 8.91e+03 - 8.71e-02 1.00e+0
0h 1
6 1.3289624e+04 7.37e-02 2.12e+01 -1.0 7.99e+00 - 7.08e-01 1.04e-0
1f 1
7 1.2190257e+04 3.47e-02 3.50e+00 -1.0 6.47e+00 - 8.56e-01 9.70e-0
1f 1
8 1.2545395e+04 3.12e-02 3.81e-01 -1.0 2.06e+00 - 9.29e-01 9.51e-0
1f 1
9 1.2154521e+04 4.32e-03 1.03e+00 -1.7 4.21e+00 - 5.12e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2129293e+04 3.98e-04 6.19e-01 -1.7 6.88e+00 - 6.86e-01 1.00e+0
0h 1
11 1.2149412e+04 8.47e-05 1.39e-01 -1.7 1.21e+01 - 8.09e-01 1.00e+0
0f 1
12 1.1997133e+04 3.82e-04 2.00e-02 -2.5 1.58e+01 - 9.73e-01 9.43e-0
1f 1
13 1.1971106e+04 9.97e-05 1.50e-01 -3.8 9.90e+00 - 9.95e-01 7.76e-0
1h 1
14 1.1965350e+04 2.28e-07 1.29e-04 -3.8 2.28e+00 - 1.00e+00 1.00e+0
0f 1
15 1.1964015e+04 1.78e-08 2.99e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
16 1.1963999e+04 1.29e-12 4.23e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.1963999150818521e+01 1.1963999150818521e+0
4
Dual infeasibility......: 4.2346600383814405e-10 4.2346600383814405e-0
7
Constraint violation....: 1.2941731020177372e-12 1.2941731020177372e-1
2
Complementarity.........: 4.5249464027839635e-09 4.5249464027839638e-0
6
Overall NLP error.......: 4.5249464027839635e-09 4.5249464027839638e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0885470e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0407391e+02 6.70e+03 5.23e+01 -1.0 3.36e+03 - 1.78e-05 1.98e-0
4h 1
3 4.2004843e+02 6.55e+03 5.24e+01 -1.0 6.70e+03 - 1.08e-04 2.34e-0
2f 1
4 1.9256453e+04 6.52e-02 8.03e+01 -1.0 6.55e+03 - 3.33e-02 1.00e+0
0h 1
5 1.0816391e+04 6.20e-02 6.14e+01 -1.0 3.75e+01 - 2.34e-01 4.53e-0
2f 1
6 9.5325700e+03 2.03e-02 2.88e+01 -1.0 1.63e+01 - 5.42e-01 6.21e-0
1f 1
7 9.1168117e+03 5.73e-03 8.82e-01 -1.0 5.28e+00 - 9.57e-01 7.83e-0
1f 1
8 9.3828903e+03 1.65e-04 6.55e-02 -1.0 5.70e+00 - 1.00e+00 1.00e+0
0f 1
9 8.8197491e+03 2.12e-03 8.12e-02 -2.5 7.97e+00 - 8.55e-01 8.49e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.6592862e+03 2.16e-03 4.16e-01 -2.5 1.32e+00 - 1.00e+00 7.62e-0
1f 1
11 8.6338609e+03 1.24e-04 4.69e-03 -2.5 3.17e-01 - 1.00e+00 1.00e+0
0h 1
12 8.6088438e+03 3.31e-05 1.45e-01 -3.8 1.34e+01 - 1.00e+00 7.62e-0
1h 1
13 8.6021735e+03 1.25e-07 3.38e-04 -3.8 3.19e+00 - 1.00e+00 1.00e+0
0f 1
14 8.6003600e+03 2.85e-08 9.91e-04 -5.7 7.43e-01 - 1.00e+00 9.85e-0
1f 1
15 8.6003381e+03 1.92e-12 1.39e-08 -5.7 1.12e-02 - 1.00e+00 1.00e+0
0f 1
16 8.6003159e+03 2.63e-12 4.48e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 8.6003159395424227e+00 8.6003159395424227e+0
3
Dual infeasibility......: 4.4776951709246851e-09 4.4776951709246851e-0
6
Constraint violation....: 2.6310897904835429e-12 2.6310897904835429e-1
2
Complementarity.........: 3.6084977888686940e-09 3.6084977888686940e-0
6
Overall NLP error.......: 4.4776951709246851e-09 4.4776951709246851e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0890039e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0606063e+02 4.77e+03 5.23e+01 -1.0 4.53e+03 - 8.51e-05 1.04e-0
4h 1
3 8.5674884e+02 4.76e+03 5.23e+01 -1.0 4.77e+03 - 9.62e-06 2.18e-0
3f 1
4 3.8122229e+02 4.65e+03 5.23e+01 -1.0 4.76e+03 - 2.82e-03 2.23e-0
2h 1
5 1.6129511e+04 6.86e-02 7.70e+01 -1.0 4.65e+03 - 8.42e-02 1.00e+0
0h 1
6 8.6428592e+03 6.17e-02 3.53e+01 -1.0 2.77e+01 - 5.15e-01 9.25e-0
2f 1
7 7.1353041e+03 1.99e-02 1.35e+01 -1.0 1.52e+01 - 6.41e-01 7.60e-0
1f 1
8 7.2345504e+03 6.03e-03 1.10e+00 -1.0 2.38e+00 - 9.93e-01 5.00e-0
1f 2
9 7.4467494e+03 2.48e-04 6.11e-02 -1.0 3.13e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.8841153e+03 2.26e-03 8.91e-02 -2.5 2.93e+01 - 8.55e-01 8.27e-0
1f 1
11 6.7163515e+03 2.12e-03 4.49e-01 -2.5 4.53e+00 - 1.00e+00 7.51e-0
1f 1
12 6.6879049e+03 1.53e-04 4.78e-03 -2.5 1.12e+00 - 1.00e+00 1.00e+0
0h 1
13 6.6714077e+03 4.08e-05 1.58e-01 -3.8 2.68e+00 - 1.00e+00 7.53e-0
1h 1
14 6.6671226e+03 1.41e-07 3.55e-04 -3.8 6.62e-01 - 1.00e+00 1.00e+0
0f 1
15 6.6658964e+03 2.80e-08 9.30e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 6.6658841e+03 1.87e-12 1.34e-08 -5.7 2.14e-03 - 1.00e+00 1.00e+0
0f 1
17 6.6658693e+03 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 6.6658693410282952e+00 6.6658693410282949e+0
3
Dual infeasibility......: 4.4776946848230646e-09 4.4776946848230646e-0
6
Constraint violation....: 2.6307428457883475e-12 2.6307428457883475e-1
2
Complementarity.........: 3.6084999013875860e-09 3.6084999013875860e-0
6
Overall NLP error.......: 4.4776946848230646e-09 4.4776946848230646e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9456230e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.82e-0
3h 1
2 8.8567886e+02 3.24e+03 5.24e+01 -1.0 2.33e+03 - 2.99e-05 3.52e-0
4h 1
3 3.3078106e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 2.74e-04 2.30e-0
2h 1
4 1.5584859e+04 6.31e-02 7.90e+01 -1.0 3.17e+03 - 5.28e-02 1.00e+0
0h 1
5 7.0420108e+03 5.88e-02 5.10e+01 -1.0 4.91e+01 - 3.42e-01 6.22e-0
2f 1
6 5.6883038e+03 2.56e-02 2.41e+01 -1.0 2.35e+01 - 5.27e-01 5.20e-0
1f 1
7 5.1332986e+03 7.87e-03 1.20e+00 -1.0 8.72e+00 - 9.35e-01 7.43e-0
1f 1
8 5.4047519e+03 3.26e-04 8.27e-02 -1.0 4.48e+00 - 9.94e-01 1.00e+0
0f 1
9 4.8091936e+03 2.09e-03 8.69e-02 -2.5 6.73e+00 - 8.62e-01 8.36e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.6375389e+03 2.18e-03 3.57e-01 -2.5 5.85e+00 - 1.00e+00 7.76e-0
1f 1
11 4.6110940e+03 1.65e-04 5.03e-03 -2.5 1.96e+00 - 1.00e+00 1.00e+0
0h 1
12 4.5794194e+03 2.40e-05 4.35e-02 -3.8 1.61e+01 - 1.00e+00 8.82e-0
1h 1
13 4.5763807e+03 5.84e-08 6.07e-04 -3.8 1.89e+00 - 1.00e+00 1.00e+0
0f 1
14 4.5743326e+03 4.23e-08 2.56e-05 -5.7 8.92e-01 - 1.00e+00 9.99e-0
1f 1
15 4.5743342e+03 1.87e-12 1.08e-08 -5.7 9.55e-04 - 1.00e+00 1.00e+0
0f 1
16 4.5743102e+03 2.57e-12 3.30e-06 -8.6 1.11e-02 - 1.00e+00 9.99e-0
1f 1
17 4.5743102e+03 1.64e-15 4.88e-14 -8.6 6.09e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 4.5743102091868622e+00 4.5743102091868623e+0
3
Dual infeasibility......: 4.8756158731715401e-14 4.8756158731715401e-1
1
Constraint violation....: 1.6380310188355886e-15 1.6380310188355886e-1
5
Complementarity.........: 2.6847844976057304e-09 2.6847844976057303e-0
6
Overall NLP error.......: 2.6847844976057304e-09 2.6847844976057303e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8055761e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.81e-0
3f 1
2 8.7687121e+02 2.00e+03 5.24e+01 -1.0 1.46e+03 - 5.64e-05 1.36e-0
4h 1
3 8.6755992e+02 2.00e+03 5.24e+01 -1.0 1.99e+03 - 5.21e-05 3.63e-0
4h 1
4 2.9429068e+02 1.95e+03 7.08e+01 -1.0 2.00e+03 - 4.09e-04 2.26e-0
2f 1
5 1.4099799e+04 6.13e-02 7.92e+01 -1.0 1.95e+03 - 5.58e-02 1.00e+0
0h 1
6 5.5358032e+03 5.69e-02 5.29e+01 -1.0 6.47e+01 - 3.20e-01 6.49e-0
2f 1
7 4.1772488e+03 3.11e-02 2.60e+01 -1.0 3.23e+01 - 4.98e-01 4.20e-0
1f 1
8 3.3814418e+03 1.24e-02 2.08e+00 -1.0 1.10e+01 - 9.20e-01 9.18e-0
1f 1
9 3.8167791e+03 3.73e-04 2.77e-01 -1.0 4.94e+00 - 9.11e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.1080824e+03 1.19e-03 7.85e-01 -1.7 1.36e+01 - 5.57e-01 9.96e-0
1f 1
11 3.1739179e+03 4.34e-05 2.27e-02 -1.7 4.00e+00 - 1.00e+00 1.00e+0
0f 1
12 3.0621831e+03 4.74e-05 2.02e-01 -2.5 2.05e+01 - 1.00e+00 8.52e-0
1f 1
13 3.0594920e+03 8.62e-05 2.94e-03 -2.5 3.01e+00 - 1.00e+00 1.00e+0
0f 1
14 3.0432477e+03 2.62e-04 7.77e-02 -3.8 4.75e+00 - 7.77e-01 9.79e-0
1h 1
15 3.0404487e+03 1.59e-03 1.81e-03 -3.8 1.57e-01 - 9.79e-01 1.00e+0
0h 1
16 3.0404728e+03 7.76e-05 6.40e-05 -3.8 1.21e-02 - 1.00e+00 1.00e+0
0h 1
17 3.0392662e+03 1.30e-04 1.10e-03 -5.7 1.52e-01 - 9.18e-01 1.00e+0
0h 1
18 3.0392266e+03 3.25e-05 6.64e-06 -5.7 8.39e-03 - 1.00e+00 1.00e+0
0h 1
19 3.0392322e+03 1.79e-07 3.34e-06 -5.7 6.08e-04 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 3.0392189e+03 2.64e-08 3.25e-05 -8.6 1.84e-03 - 1.00e+00 9.57e-0
1h 1
21 3.0392184e+03 4.34e-12 5.14e-11 -8.6 7.81e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 3.0392183905780010e+00 3.0392183905780012e+0
3
Dual infeasibility......: 5.1361484062254719e-11 5.1361484062254719e-0
8
Constraint violation....: 4.3410830485868246e-12 4.3410830485868246e-1
2
Complementarity.........: 2.5095205307126458e-09 2.5095205307126457e-0
6
Overall NLP error.......: 2.5095205307126458e-09 2.5095205307126457e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 42
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 21
inequality constraints with only lower bounds: 12
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0741815e+02 9.17e+02 5.23e+01 -1.0 9.18e+02 - 1.00e-03 9.90e-0
3h 1
2 8.4983222e+02 9.16e+02 5.23e+01 -1.0 8.76e+02 - 1.13e-04 2.17e-0
3h 1
3 2.8726081e+02 8.95e+02 5.24e+01 -1.0 9.16e+02 - 2.15e-03 2.23e-0
2h 1
4 1.2535915e+04 6.78e-02 8.16e+01 -1.0 8.95e+02 - 2.59e-02 1.00e+0
0h 1
5 4.9804414e+03 6.49e-02 6.35e+01 -1.0 3.74e+01 - 2.24e-01 3.99e-0
2f 1
6 3.7371746e+03 2.08e-02 2.90e+01 -1.0 1.61e+01 - 5.52e-01 6.24e-0
1f 1
7 3.3251945e+03 5.54e-03 9.29e-01 -1.0 5.15e+00 - 9.58e-01 7.89e-0
1f 1
8 3.5934386e+03 1.49e-04 6.35e-02 -1.0 4.98e+00 - 9.87e-01 1.00e+0
0f 1
9 3.0330197e+03 2.12e-03 8.09e-02 -2.5 1.02e+01 - 8.55e-01 8.47e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8760138e+03 2.16e-03 4.19e-01 -2.5 5.80e+00 - 1.00e+00 7.61e-0
1f 1
11 2.8522594e+03 1.27e-04 4.72e-03 -2.5 2.23e+00 - 1.00e+00 1.00e+0
0h 1
12 2.8222259e+03 3.38e-05 1.47e-01 -3.8 2.01e+01 - 1.00e+00 7.61e-0
1h 1
13 2.8145093e+03 1.26e-07 3.40e-04 -3.8 4.22e+00 - 1.00e+00 1.00e+0
0f 1
14 2.8124134e+03 2.85e-08 9.82e-04 -5.7 1.03e+00 - 1.00e+00 9.85e-0
1f 1
15 2.8123895e+03 1.91e-12 1.38e-08 -5.7 1.32e-02 - 1.00e+00 1.00e+0
0f 1
16 2.8123637e+03 2.63e-12 4.48e-09 -8.6 1.29e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 2.8123637150480145e+00 2.8123637150480145e+0
3
Dual infeasibility......: 4.4776949794698280e-09 4.4776949794698280e-0
6
Constraint violation....: 2.6311383627408702e-12 2.6311383627408702e-1
2
Complementarity.........: 3.6084980307855497e-09 3.6084980307855495e-0
6
Overall NLP error.......: 4.4776949794698280e-09 4.4776949794698280e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254210124e-01 6.4890146254210117e+0
2
Dual infeasibility......: 4.9126604805733771e-09 4.9126604805733771e-0
6
Constraint violation....: 6.2123813870940126e-09 6.2123813870940126e-0
9
Complementarity.........: 4.3646095252459305e-09 4.3646095252459303e-0
6
Overall NLP error.......: 6.2123813870940126e-09 4.9126604805733771e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031320943025915e-09 2.1031320943025915e-0
6
Constraint violation....: 6.2994179317321652e-11 6.2994179317321652e-1
1
Complementarity.........: 2.8882108896920311e-09 2.8882108896920312e-0
6
Overall NLP error.......: 2.8882108896920311e-09 2.8882108896920312e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254210124e-01 6.4890146254210117e+0
2
Dual infeasibility......: 4.9126604805733771e-09 4.9126604805733771e-0
6
Constraint violation....: 6.2123813870940126e-09 6.2123813870940126e-0
9
Complementarity.........: 4.3646095252459305e-09 4.3646095252459303e-0
6
Overall NLP error.......: 6.2123813870940126e-09 4.9126604805733771e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.03e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.45e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643326e+00 1.6104063281643325e+0
3
Dual infeasibility......: 2.4577488759278421e-12 2.4577488759278421e-0
9
Constraint violation....: 7.4511016092546002e-16 7.4511016092546002e-1
6
Complementarity.........: 2.5062163910047563e-09 2.5062163910047562e-0
6
Overall NLP error.......: 2.5062163910047563e-09 2.5062163910047562e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2252293e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 3.31e-04 9.88e-0
3h 1
2 7.9742303e+02 9.17e+02 5.24e+01 -1.0 8.18e+02 - 9.71e-05 9.16e-0
4h 1
3 2.4312288e+02 8.97e+02 5.26e+01 -1.0 9.17e+02 - 9.08e-04 2.09e-0
2h 1
4 1.2260850e+04 5.54e-02 8.24e+01 -1.0 8.98e+02 - 3.89e-02 1.00e+0
0h 1
5 3.8743081e+03 5.28e-02 5.49e+01 -1.0 7.96e+01 - 3.31e-01 5.07e-0
2f 1
6 1.9080741e+03 3.72e-02 2.92e+01 -1.0 3.93e+01 - 4.71e-01 5.03e-0
1f 1
7 4.6563841e+03 1.22e-02 2.61e+01 -1.0 2.04e+01 - 4.03e-01 1.00e+0
0h 1
8 1.8744334e+03 1.17e-02 9.66e-01 -1.0 2.51e+01 - 9.88e-01 8.98e-0
1f 1
9 1.6954233e+03 5.10e-04 6.26e-02 -1.7 6.76e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5627878e+03 1.96e-03 2.19e-01 -2.5 1.25e+01 - 7.43e-01 1.00e+0
0f 1
11 1.5309769e+03 3.67e-03 1.04e-01 -2.5 2.12e+00 - 1.00e+00 9.19e-0
1h 1
12 1.5388648e+03 1.31e-04 3.49e-03 -2.5 1.16e+00 - 1.00e+00 1.00e+0
0h 1
13 1.5037418e+03 1.63e-04 2.17e-02 -3.8 1.88e+01 - 9.93e-01 9.32e-0
1h 1
14 1.5022722e+03 7.65e-07 7.15e-05 -3.8 1.24e+00 - 1.00e+00 1.00e+0
0f 1
15 1.5003196e+03 3.77e-07 1.78e-04 -5.7 1.04e+00 - 1.00e+00 9.96e-0
1h 1
16 1.5003172e+03 3.80e-11 2.94e-09 -5.7 1.11e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.29e-02 - 1.00e+00 1.00e+0
0h 1
1 8.6513592e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 4.97e-04 9.88e-0
3h 1
2 8.3600930e+02 9.17e+02 5.24e+01 -1.0 8.33e+02 - 9.54e-05 1.08e-0
3h 1
3 2.6322504e+02 8.96e+02 5.25e+01 -1.0 9.17e+02 - 1.07e-03 2.19e-0
2h 1
4 1.2573574e+04 6.02e-02 8.02e+01 -1.0 8.97e+02 - 5.13e-02 1.00e+0
0h 1
5 4.2599275e+03 5.61e-02 5.27e+01 -1.0 7.19e+01 - 3.32e-01 6.13e-0
2f 1
6 2.6731519e+03 3.02e-02 2.71e+01 -1.0 3.87e+01 - 4.79e-01 4.34e-0
1f 1
64 1.702090e+04 1.632511e+04 5.218313e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2433284e+02 1.57e+04 5.24e+01 -1.0 1.59e+04 - 3.31e-04 9.80e-0
3h 1
2 8.2134523e+02 1.57e+04 5.24e+01 -1.0 1.37e+04 - 2.39e-05 1.14e-0
4h 1
3 8.1656455e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 1.83e-05 3.84e-0
4h 1
4 7.5648634e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 3.98e-04 4.96e-0
3h 1
5 6.3183035e+02 1.53e+04 5.24e+01 -1.0 1.57e+04 - 5.59e-03 2.02e-0
2f 1
6 2.4986648e+04 5.97e-02 8.27e+01 -1.0 1.53e+04 - 4.73e-02 1.00e+0
0h 1
7 1.8488692e+04 5.57e-02 3.99e+01 -1.0 6.41e+01 - 5.07e-01 6.20e-0
2f 1
8 1.6709729e+04 3.80e-02 1.82e+01 -1.0 3.83e+01 - 5.39e-01 4.87e-0
1f 1
9 1.7198595e+04 1.45e-02 3.81e+00 -1.0 6.11e+00 - 8.09e-01 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6879662e+04 3.09e-03 1.09e+00 -1.0 4.37e+00 - 5.55e-01 1.00e+0
0f 1
11 1.6861516e+04 1.11e-04 7.27e-01 -1.0 3.26e+00 - 6.13e-01 1.00e+0
0f 1
12 1.6541326e+04 2.88e-04 2.08e-01 -1.7 5.35e+00 - 8.28e-01 7.96e-0
1f 1
13 1.6488462e+04 5.42e-04 2.22e-01 -1.7 7.88e+00 - 7.70e-01 1.00e+0
0f 1
14 1.6493964e+04 1.03e-04 1.48e-01 -1.7 2.07e+01 - 5.42e-01 1.00e+0
0h 1
15 1.6375627e+04 1.05e-03 5.88e-02 -2.5 1.66e+01 - 9.14e-01 1.00e+0
0f 1
16 1.6347786e+04 1.31e-03 1.54e-02 -2.5 9.15e+00 - 1.00e+00 1.00e+0
0h 1
17 1.6328868e+04 2.35e-04 1.08e-01 -3.8 8.68e+00 - 1.00e+00 8.32e-0
1h 1
18 1.6326483e+04 4.27e-07 1.30e-04 -3.8 1.34e+00 - 1.00e+00 1.00e+0
0h 1
19 1.6325121e+04 4.02e-07 1.61e-04 -5.7 4.46e-01 - 1.00e+00 9.97e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325122e+04 3.88e-11 2.93e-09 -5.7 1.15e-03 - 1.00e+00 1.00e+0
0f 1
21 1.6325105e+04 6.14e-11 7.53e-06 -8.6 5.53e-03 - 1.00e+00 9.88e-0
1h 1
22 1.6325105e+04 1.07e-14 1.77e-06 -8.6 1.72e-04 - 9.97e-01 1.00e+0
0f 1
23 1.6325105e+04 1.07e-14 2.53e-14 -8.6 4.86e-06 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 23
(scaled) (unscaled)
Objective...............: 1.6325105275809339e+01 1.6325105275809339e+0
4
Dual infeasibility......: 2.5313084961453569e-14 2.5313084961453569e-1
1
Constraint violation....: 1.0658141036401503e-14 1.0658141036401503e-1
4
Complementarity.........: 2.7197919717993144e-09 2.7197919717993145e-0
6
Overall NLP error.......: 2.7197919717993144e-09 2.7197919717993145e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 24
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 24
Number of inequality constraint Jacobian evaluations = 24
Number of Lagrangian Hessian evaluations = 23
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9092977e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 6.99e-04 9.80e-0
3h 1
2 8.8817884e+02 1.50e+04 5.24e+01 -1.0 1.47e+04 - 8.73e-05 1.01e-0
4h 1
3 8.8019535e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 2.96e-06 6.36e-0
4f 1
4 6.0281933e+02 1.46e+04 5.25e+01 -1.0 1.50e+04 - 6.80e-04 2.27e-0
2h 1
5 2.7061250e+04 6.30e-02 7.83e+01 -1.0 1.46e+04 - 6.43e-02 1.00e+0
0h 1
6 1.8630005e+04 5.80e-02 5.03e+01 -1.0 5.45e+01 - 3.42e-01 7.26e-0
2f 1
7 1.7334783e+04 2.88e-02 2.29e+01 -1.0 2.56e+01 - 5.35e-01 4.63e-0
1f 1
8 1.6727092e+04 8.82e-03 1.18e+00 -1.0 9.84e+00 - 9.28e-01 7.64e-0
1f 1
9 1.7008792e+04 3.29e-04 8.10e-02 -1.0 3.33e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6382322e+04 2.09e-03 8.12e-02 -2.5 4.87e+00 - 8.66e-01 8.50e-0
1f 1
11 1.6202338e+04 2.17e-03 2.02e-01 -2.5 1.04e+00 - 1.00e+00 8.35e-0
1f 1
12 1.6185689e+04 8.56e-05 3.85e-03 -2.5 1.46e-01 - 1.00e+00 1.00e+0
0h 1
13 1.6174722e+04 4.57e-05 1.11e+00 -3.8 2.68e+00 - 1.00e+00 4.97e-0
1h 1
14 1.6171406e+04 3.44e-07 1.13e-01 -3.8 1.35e+00 - 9.68e-01 1.00e+0
0f 1
15 1.6170371e+04 1.54e-08 1.79e-03 -3.8 3.29e-02 - 1.00e+00 1.00e+0
0H 1
16 1.6170569e+04 1.15e-05 2.77e-04 -3.8 3.78e-03 - 1.00e+00 1.00e+0
0f 1
17 1.6169803e+04 1.86e-06 6.31e-02 -5.7 1.49e-01 - 7.77e-01 9.69e-0
1h 1
18 1.6169630e+04 1.24e-05 2.12e-04 -5.7 5.04e-03 - 1.00e+00 1.00e+0
0f 1
19 1.6169636e+04 2.69e-08 2.12e-06 -5.7 2.56e-04 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6169621e+04 2.73e-08 7.73e-06 -8.6 1.84e-03 - 9.82e-01 9.88e-0
1h 1
21 1.6169621e+04 2.92e-13 3.32e-11 -8.6 2.21e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.6169621156651100e+01 1.6169621156651099e+0
4
Dual infeasibility......: 3.3198049899453351e-11 3.3198049899453351e-0
8
Constraint violation....: 2.9154456626656611e-13 2.9154456626656611e-1
3
Complementarity.........: 2.5121397130075436e-09 2.5121397130075437e-0
6
Overall NLP error.......: 2.5121397130075436e-09 2.5121397130075437e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6663159e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 4.97e-04 9.80e-0
3h 1
2 8.6380228e+02 1.39e+04 5.24e+01 -1.0 1.32e+04 - 4.46e-05 1.04e-0
4h 1
3 8.2981809e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 7.27e-06 2.45e-0
3h 1
4 5.7278541e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 2.64e-03 2.13e-0
2h 1
5 2.4870492e+04 6.18e-02 8.04e+01 -1.0 1.36e+04 - 5.47e-02 1.00e+0
0h 1
6 1.7166036e+04 5.73e-02 5.00e+01 -1.0 6.81e+01 - 3.66e-01 6.55e-0
2f 1
7 1.5586788e+04 3.04e-02 2.47e+01 -1.0 3.82e+01 - 4.98e-01 4.39e-0
1f 1
8 1.5108141e+04 1.32e-02 2.24e+00 -1.0 1.07e+01 - 9.21e-01 1.00e+0
0f 1
9 1.5385167e+04 3.90e-04 8.04e-02 -1.0 4.29e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4871095e+04 5.17e-04 5.73e-01 -2.5 7.30e+00 - 8.91e-01 6.62e-0
1f 1
11 1.4791323e+04 2.37e-04 3.76e-01 -2.5 2.48e+00 - 8.87e-01 1.00e+0
0h 1
12 1.4770540e+04 6.21e-03 2.47e-01 -2.5 1.64e+00 - 1.00e+00 5.48e-0
1h 1
13 1.4759458e+04 8.25e-04 6.71e-03 -2.5 5.43e-01 - 1.00e+00 1.00e+0
0f 1
14 1.4740960e+04 1.13e-03 2.85e-02 -3.8 5.36e+00 - 8.14e-01 1.00e+0
0h 1
15 1.4738037e+04 2.14e-03 1.05e-03 -3.8 4.67e-02 - 1.00e+00 1.00e+0
0h 1
16 1.4738429e+04 4.79e-05 1.56e-04 -3.8 1.54e-02 - 1.00e+00 1.00e+0
0h 1
17 1.4736951e+04 1.07e-04 4.46e-04 -5.7 2.97e-01 - 9.51e-01 9.83e-0
1h 1
18 1.4736945e+04 2.17e-05 3.52e-03 -5.7 4.97e-03 - 1.00e+00 7.97e-0
1h 1
19 1.4736948e+04 8.51e-09 1.09e-06 -5.7 1.01e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.4736932e+04 8.96e-09 1.93e-05 -8.6 3.68e-03 - 1.00e+00 9.83e-0
1h 1
21 1.4736931e+04 1.38e-12 6.47e-11 -8.6 6.13e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.4736931426946862e+01 1.4736931426946861e+0
4
Dual infeasibility......: 6.4720552744981005e-11 6.4720552744981005e-0
8
Constraint violation....: 1.3783418850721318e-12 1.3783418850721318e-1
2
Complementarity.........: 3.3864103036909963e-09 3.3864103036909964e-0
6
Overall NLP error.......: 3.3864103036909963e-09 3.3864103036909964e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4547453e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.98e-04 9.80e-0
3h 1
2 8.4252030e+02 1.27e+04 5.24e+01 -1.0 1.14e+04 - 3.11e-05 1.10e-0
4h 1
3 7.3828784e+02 1.26e+04 5.25e+01 -1.0 1.26e+04 - 1.44e-05 6.79e-0
3h 1
4 5.8291355e+02 1.23e+04 5.23e+01 -1.0 1.26e+04 - 7.40e-03 2.02e-0
2h 1
5 2.1644339e+04 6.31e-02 8.13e+01 -1.0 1.23e+04 - 6.10e-02 1.00e+0
0h 1
6 1.5478391e+04 5.79e-02 3.40e+01 -1.0 6.33e+01 - 5.63e-01 7.54e-0
2f 1
7 1.3645356e+04 3.62e-02 1.31e+01 -1.0 3.98e+01 - 6.02e-01 5.11e-0
1f 1
8 1.4328738e+04 4.32e-03 7.49e-01 -1.0 9.09e+00 - 9.62e-01 1.00e+0
0f 1
9 1.3456165e+04 1.83e-03 1.05e-01 -1.7 1.17e+01 - 9.73e-01 9.22e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3313507e+04 1.22e-03 3.77e-01 -2.5 6.15e+00 - 7.74e-01 1.00e+0
0h 1
11 1.3249532e+04 1.72e-02 6.43e-02 -2.5 3.90e+00 - 9.63e-01 9.24e-0
1h 1
12 1.3261121e+04 5.77e-04 1.30e-02 -2.5 4.80e-01 - 1.00e+00 1.00e+0
0h 1
13 1.3236152e+04 2.83e-04 5.44e-02 -3.8 8.03e+00 - 9.92e-01 8.75e-0
1h 1
14 1.3234423e+04 1.22e-06 1.22e-04 -3.8 1.00e+00 - 1.00e+00 1.00e+0
0h 1
15 1.3233083e+04 3.41e-07 2.11e-03 -5.7 4.46e-01 - 1.00e+00 9.78e-0
1h 1
16 1.3233068e+04 3.85e-11 2.13e-08 -5.7 9.86e-03 - 1.00e+00 1.00e+0
0f 1
17 1.3233051e+04 6.30e-11 4.40e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.3233050930991549e+01 1.3233050930991549e+0
4
Dual infeasibility......: 4.3997099019062988e-09 4.3997099019062988e-0
6
Constraint violation....: 6.3005614614475292e-11 6.3005614614475292e-1
1
Complementarity.........: 3.3480054803914732e-09 3.3480054803914732e-0
6
Overall NLP error.......: 4.3997099019062988e-09 4.3997099019062988e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6595295e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 4.93e-04 9.80e-0
3h 1
2 8.6315996e+02 1.11e+04 5.24e+01 -1.0 1.09e+04 - 9.14e-05 1.01e-0
4h 1
3 8.4949747e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 3.90e-06 8.20e-0
4f 1
4 4.9486813e+02 1.09e+04 5.25e+01 -1.0 1.11e+04 - 9.00e-04 2.20e-0
2h 1
5 2.2854292e+04 5.99e-02 8.02e+01 -1.0 1.09e+04 - 5.07e-02 1.00e+0
0h 1
6 1.4466438e+04 5.59e-02 5.30e+01 -1.0 7.27e+01 - 3.29e-01 6.07e-0
2f 1
7 1.2864675e+04 3.01e-02 2.74e+01 -1.0 3.90e+01 - 4.76e-01 4.36e-0
1f 1
8 1.2339750e+04 1.42e-02 2.53e+00 -1.0 1.09e+01 - 9.19e-01 1.00e+0
0f 1
9 1.2647992e+04 4.24e-04 9.26e-02 -1.0 4.26e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2081711e+04 6.45e-04 4.19e-01 -2.5 7.83e+00 - 8.85e-01 7.10e-0
1f 1
11 1.2001794e+04 2.65e-04 3.54e-01 -2.5 2.72e+00 - 8.81e-01 1.00e+0
0h 1
12 1.1995515e+04 6.97e-04 4.67e-01 -2.5 1.50e+00 - 1.00e+00 1.65e-0
1h 2
13 1.1973329e+04 1.23e-03 1.29e-02 -2.5 1.02e+00 - 1.00e+00 1.00e+0
0h 1
14 1.1956979e+04 1.27e-03 3.45e-02 -3.8 2.68e+00 - 7.93e-01 1.00e+0
0h 1
15 1.1953903e+04 2.38e-03 9.10e-04 -3.8 4.08e-02 - 1.00e+00 1.00e+0
0h 1
16 1.1954259e+04 4.22e-05 1.57e-04 -3.8 1.53e-02 - 1.00e+00 1.00e+0
0h 1
17 1.1952933e+04 1.04e-04 3.43e-04 -5.7 1.49e-01 - 9.51e-01 9.75e-0
1h 1
18 1.1952921e+04 2.27e-05 4.04e-03 -5.7 3.65e-03 - 1.00e+00 7.83e-0
1h 1
19 1.1952924e+04 8.08e-09 1.19e-06 -5.7 7.91e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.1952909e+04 8.86e-09 2.06e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
21 1.1952909e+04 1.47e-12 7.01e-11 -8.6 3.09e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.1952909040398495e+01 1.1952909040398496e+0
4
Dual infeasibility......: 7.0083197365819368e-11 7.0083197365819375e-0
8
Constraint violation....: 1.4691581284864696e-12 1.4691581284864696e-1
2
Complementarity.........: 2.5093455277556278e-09 2.5093455277556279e-0
6
Overall NLP error.......: 2.5093455277556278e-09 2.5093455277556279e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3006359e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 2.02e-03 9.80e-0
3h 1
2 9.2722762e+02 9.19e+03 5.23e+01 -1.0 8.88e+03 - 6.77e-05 1.02e-0
4h 1
3 9.0058749e+02 9.18e+03 5.23e+01 -1.0 9.18e+03 - 5.63e-06 1.42e-0
3f 1
4 4.9463665e+02 8.97e+03 5.24e+01 -1.0 9.18e+03 - 1.64e-03 2.27e-0
2h 1
5 2.1164031e+04 7.23e-02 7.69e+01 -1.0 8.97e+03 - 7.85e-02 1.00e+0
0h 1
6 1.3562973e+04 6.54e-02 2.35e+01 -1.0 8.38e+00 - 6.64e-01 8.73e-0
2f 1
7 1.2324131e+04 3.29e-02 9.64e+00 -1.0 7.01e+00 - 6.84e-01 1.00e+0
0f 1
8 1.2476105e+04 1.68e-02 6.52e-01 -1.0 2.39e+00 - 9.95e-01 4.91e-0
1f 2
9 1.2182671e+04 6.71e-03 2.78e-01 -1.7 9.98e+00 - 1.00e+00 8.44e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2122153e+04 1.23e-03 8.86e-02 -1.7 1.11e+01 - 1.00e+00 1.00e+0
0f 1
11 1.1995228e+04 3.35e-04 9.60e-02 -2.5 1.72e+01 - 9.85e-01 8.95e-0
1f 1
12 1.1986791e+04 4.66e-06 1.02e-03 -2.5 1.79e+00 - 1.00e+00 1.00e+0
0f 1
13 1.1965361e+04 5.87e-06 5.32e-03 -3.8 2.68e+00 - 1.00e+00 9.75e-0
1f 1
14 1.1965205e+04 1.30e-08 6.21e-06 -3.8 6.52e-02 - 1.00e+00 1.00e+0
0f 1
15 1.1964013e+04 1.73e-08 3.04e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0f 1
16 1.1963999e+04 1.28e-12 4.22e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.1963999147623934e+01 1.1963999147623934e+0
4
Dual infeasibility......: 4.2180144353167175e-10 4.2180144353167175e-0
7
Constraint violation....: 1.2796014248195320e-12 1.2796014248195320e-1
2
Complementarity.........: 2.5909993217456908e-09 2.5909993217456908e-0
6
Overall NLP error.......: 2.5909993217456908e-09 2.5909993217456908e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3706637e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.96e-03 9.81e-0
3h 1
2 8.2366254e+02 6.67e+03 5.23e+01 -1.0 6.58e+03 - 9.11e-06 5.45e-0
3h 1
3 4.6848420e+02 6.53e+03 5.22e+01 -1.0 6.67e+03 - 6.24e-03 2.15e-0
2h 1
4 1.7276842e+04 7.98e-02 8.09e+01 -1.0 6.53e+03 - 4.26e-02 1.00e+0
0h 1
5 1.1180606e+04 7.49e-02 5.39e+01 -1.0 1.43e+01 - 3.29e-01 5.84e-0
2f 1
6 1.0320723e+04 1.80e-02 1.83e+01 -1.0 8.01e+00 - 6.63e-01 6.88e-0
1f 1
7 1.0331202e+04 8.42e-03 1.78e-01 -1.0 2.86e+00 - 9.91e-01 1.00e+0
0f 1
8 9.9916850e+03 1.38e-03 1.20e-01 -1.7 7.70e+00 - 9.72e-01 1.00e+0
0f 1
9 9.8366200e+03 1.32e-03 1.99e-01 -2.5 4.40e+00 - 9.07e-01 8.03e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.8154906e+03 3.58e-05 8.86e-03 -2.5 2.26e+00 - 1.00e+00 1.00e+0
0f 1
11 9.7858704e+03 2.47e-06 6.78e-04 -3.8 1.33e+01 - 1.00e+00 1.00e+0
0f 1
12 9.7842138e+03 1.82e-08 3.76e-06 -5.7 7.40e-01 - 1.00e+00 1.00e+0
0h 1
13 9.7841926e+03 1.72e-12 4.06e-10 -8.6 9.20e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 13
(scaled) (unscaled)
Objective...............: 9.7841925977200592e+00 9.7841925977200590e+0
3
Dual infeasibility......: 4.0628385274412449e-10 4.0628385274412449e-0
7
Constraint violation....: 1.7237045124574024e-12 1.7237045124574024e-1
2
Complementarity.........: 3.0033718270838077e-09 3.0033718270838074e-0
6
Overall NLP error.......: 3.0033718270838077e-09 3.0033718270838074e-0
6
Number of objective function evaluations = 14
Number of objective gradient evaluations = 14
Number of equality constraint evaluations = 14
Number of inequality constraint evaluations = 14
Number of equality constraint Jacobian evaluations = 14
Number of inequality constraint Jacobian evaluations = 14
Number of Lagrangian Hessian evaluations = 13
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3002852e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 2.02e-03 9.81e-0
3h 1
2 9.2665255e+02 4.77e+03 5.23e+01 -1.0 3.78e+03 - 3.07e-05 1.25e-0
4h 1
3 4.3498590e+02 4.67e+03 5.24e+01 -1.0 4.77e+03 - 3.22e-05 2.12e-0
2f 1
4 1.2082041e+04 8.33e-02 7.86e+01 -1.0 4.67e+03 - 3.26e-02 1.00e+0
0h 1
5 9.1245038e+03 7.96e-02 2.66e+01 -1.0 1.08e+01 - 6.13e-01 4.30e-0
2f 1
6 7.9979442e+03 1.30e-02 1.10e+01 -1.0 9.06e+00 - 6.51e-01 8.24e-0
1f 1
7 8.1341013e+03 8.57e-03 1.54e-01 -1.0 2.78e+00 - 9.85e-01 9.38e-0
1f 1
8 7.7563670e+03 2.58e-03 1.37e+00 -1.7 5.76e+00 - 2.94e-01 1.00e+0
0f 1
9 7.7223527e+03 2.19e-04 6.22e-01 -1.7 6.57e+00 - 7.04e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.7337902e+03 1.13e-04 1.82e-01 -1.7 1.22e+01 - 8.07e-01 1.00e+0
0f 1
11 7.5808319e+03 3.96e-04 1.61e-02 -2.5 1.59e+01 - 9.63e-01 9.35e-0
1f 1
12 7.5540499e+03 1.09e-04 1.59e-01 -3.8 9.99e+00 - 9.94e-01 7.67e-0
1h 1
13 7.5478975e+03 2.41e-07 1.45e-04 -3.8 2.41e+00 - 1.00e+00 1.00e+0
0f 1
14 7.5465631e+03 1.80e-08 2.97e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
15 7.5465477e+03 1.30e-12 4.24e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 7.5465477383286546e+00 7.5465477383286543e+0
3
Dual infeasibility......: 4.2366807980142679e-10 4.2366807980142679e-0
7
Constraint violation....: 1.3001683063507130e-12 1.3001683063507130e-1
2
Complementarity.........: 3.5577696134318445e-09 3.5577696134318443e-0
6
Overall NLP error.......: 3.5577696134318445e-09 3.5577696134318443e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9465052e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3h 1
2 8.8961066e+02 3.24e+03 5.24e+01 -1.0 1.65e+03 - 3.15e-05 1.94e-0
4h 1
3 3.3049321e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 1.10e-04 2.31e-0
2f 1
4 1.5661028e+04 6.29e-02 8.00e+01 -1.0 3.17e+03 - 4.12e-02 1.00e+0
0h 1
5 7.0966213e+03 5.93e-02 5.59e+01 -1.0 4.98e+01 - 2.95e-01 5.19e-0
2f 1
6 5.7201217e+03 2.49e-02 2.72e+01 -1.0 2.33e+01 - 5.16e-01 5.36e-0
1f 1
7 5.1215761e+03 9.32e-03 1.31e+00 -1.0 8.82e+00 - 9.35e-01 7.62e-0
1f 1
8 5.4190355e+03 3.08e-04 8.42e-02 -1.0 3.70e+00 - 9.98e-01 1.00e+0
0f 1
9 4.8033652e+03 2.09e-03 8.11e-02 -2.5 5.89e+00 - 8.62e-01 8.49e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.6319948e+03 2.20e-03 3.43e-01 -2.5 2.21e+00 - 1.00e+00 7.80e-0
1f 1
11 4.6055449e+03 1.52e-04 4.72e-03 -2.5 5.56e-01 - 1.00e+00 1.00e+0
0h 1
12 4.5784269e+03 2.24e-05 4.27e-02 -3.8 1.07e+01 - 1.00e+00 8.84e-0
1h 1
13 4.5760808e+03 5.69e-08 5.99e-04 -3.8 1.24e+00 - 1.00e+00 1.00e+0
0f 1
14 4.5743301e+03 4.25e-08 5.43e-05 -5.7 5.94e-01 - 1.00e+00 9.98e-0
1f 1
15 4.5743305e+03 1.88e-12 1.31e-08 -5.7 1.22e-03 - 1.00e+00 1.00e+0
0f 1
16 4.5743102e+03 2.57e-12 3.30e-06 -8.6 7.37e-03 - 1.00e+00 9.99e-0
1f 1
17 4.5743102e+03 7.11e-15 4.85e-14 -8.6 4.06e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 4.5743102057494678e+00 4.5743102057494680e+0
3
Dual infeasibility......: 4.8518894919208332e-14 4.8518894919208332e-1
1
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.6472566265052557e-09 2.6472566265052556e-0
6
Overall NLP error.......: 2.6472566265052557e-09 2.6472566265052556e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8055761e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.81e-0
3f 1
2 8.7686982e+02 2.00e+03 5.24e+01 -1.0 1.46e+03 - 5.63e-05 1.36e-0
4h 1
3 2.9368501e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 5.20e-05 2.28e-0
2f 1
4 1.4297701e+04 6.09e-02 7.94e+01 -1.0 1.95e+03 - 5.25e-02 1.00e+0
0h 1
5 5.5715643e+03 5.67e-02 5.36e+01 -1.0 6.49e+01 - 3.13e-01 6.17e-0
2f 1
6 4.1854190e+03 3.04e-02 2.68e+01 -1.0 3.22e+01 - 4.92e-01 4.30e-0
1f 1
7 3.3694030e+03 1.34e-02 2.18e+00 -1.0 1.10e+01 - 9.20e-01 9.27e-0
1f 1
8 3.8356226e+03 4.21e-04 1.12e-01 -1.0 4.99e+00 - 1.00e+00 1.00e+0
0f 1
9 3.1540976e+03 1.17e-03 7.93e-01 -1.7 3.91e+01 - 5.67e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.1748332e+03 9.93e-06 1.09e-02 -1.7 1.51e+00 - 1.00e+00 1.00e+0
0h 1
11 3.0765684e+03 2.21e-05 6.69e-01 -3.8 4.04e+01 - 9.63e-01 6.84e-0
1f 1
12 3.0448184e+03 3.94e-04 1.54e-01 -3.8 1.24e+01 - 7.01e-01 1.00e+0
0f 1
13 3.0404019e+03 2.49e-03 5.30e-03 -3.8 6.41e-02 - 1.00e+00 1.00e+0
0h 1
14 3.0406394e+03 2.30e-05 9.33e-05 -3.8 7.29e-03 - 1.00e+00 1.00e+0
0h 1
15 3.0392707e+03 1.32e-04 1.14e-03 -5.7 2.97e-01 - 9.17e-01 1.00e+0
0h 1
16 3.0392294e+03 3.20e-05 6.94e-06 -5.7 8.34e-03 - 1.00e+00 1.00e+0
0h 1
17 3.0392340e+03 2.67e-07 3.58e-06 -5.7 7.46e-04 - 1.00e+00 1.00e+0
0h 1
18 3.0392190e+03 3.06e-08 3.51e-05 -8.6 3.68e-03 - 1.00e+00 9.56e-0
1h 1
19 3.0392184e+03 4.70e-12 5.51e-11 -8.6 1.63e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 3.0392183921389879e+00 3.0392183921389878e+0
3
Dual infeasibility......: 5.5118476332392382e-11 5.5118476332392382e-0
8
Constraint violation....: 4.7039039330343257e-12 4.7039039330343257e-1
2
Complementarity.........: 2.9656613878036933e-09 2.9656613878036933e-0
6
Overall NLP error.......: 2.9656613878036933e-09 2.9656613878036933e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2252293e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 3.31e-04 9.88e-0
3h 1
2 7.9742303e+02 9.17e+02 5.24e+01 -1.0 8.18e+02 - 9.71e-05 9.16e-0
4h 1
3 2.4312288e+02 8.97e+02 5.26e+01 -1.0 9.17e+02 - 9.08e-04 2.09e-0
2h 1
4 1.2260850e+04 5.54e-02 8.24e+01 -1.0 8.98e+02 - 3.89e-02 1.00e+0
0h 1
5 3.8743081e+03 5.28e-02 5.49e+01 -1.0 7.96e+01 - 3.31e-01 5.07e-0
2f 1
6 1.9080741e+03 3.72e-02 2.92e+01 -1.0 3.93e+01 - 4.71e-01 5.03e-0
1f 1
7 4.6563841e+03 1.22e-02 2.61e+01 -1.0 2.04e+01 - 4.03e-01 1.00e+0
0h 1
8 1.8744334e+03 1.17e-02 9.66e-01 -1.0 2.51e+01 - 9.88e-01 8.98e-0
1f 1
9 1.6954233e+03 5.10e-04 6.26e-02 -1.7 6.76e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5627878e+03 1.96e-03 2.19e-01 -2.5 1.25e+01 - 7.43e-01 1.00e+0
0f 1
11 1.5309769e+03 3.67e-03 1.04e-01 -2.5 2.12e+00 - 1.00e+00 9.19e-0
1h 1
12 1.5388648e+03 1.31e-04 3.49e-03 -2.5 1.16e+00 - 1.00e+00 1.00e+0
0h 1
13 1.5037418e+03 1.63e-04 2.17e-02 -3.8 1.88e+01 - 9.93e-01 9.32e-0
1h 1
14 1.5022722e+03 7.65e-07 7.15e-05 -3.8 1.24e+00 - 1.00e+00 1.00e+0
0f 1
15 1.5003196e+03 3.77e-07 1.78e-04 -5.7 1.04e+00 - 1.00e+00 9.96e-0
1h 1
16 1.5003172e+03 3.80e-11 2.94e-09 -5.7 1.11e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.29e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5002932826845494e+00 1.5002932826845495e+0
3
Dual infeasibility......: 2.1737076380150467e-09 2.1737076380150467e-0
6
Constraint violation....: 6.2995483829375587e-11 6.2995483829375587e-1
1
Complementarity.........: 2.8882173926699636e-09 2.8882173926699634e-0
6
Overall NLP error.......: 2.8882173926699636e-09 2.8882173926699634e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.78e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5000575e+02 7.50e+01 9.04e+01 -1.0 2.59e+01 - 3.83e-04 3.52e-0
2f 1
2 1.1818546e+04 5.63e-02 8.12e+01 -1.0 2.87e+01 - 4.64e-02 1.00e+0
0h 1
3 3.1583161e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.65e-0
2f 1
4 1.0154149e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8164779e+03 7.28e-03 1.55e+01 -1.0 1.92e+01 - 6.10e-01 1.00e+0
0h 1
6 1.1189268e+03 5.40e-03 4.04e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8232674e+02 9.97e-04 2.09e-01 -1.7 5.71e+00 - 1.00e+00 8.88e-0
1h 1
8 7.2806667e+02 8.48e-04 1.34e-02 -1.7 3.45e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0978200e+02 1.50e-03 1.13e-01 -3.8 4.49e+00 - 7.71e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8216668e+02 2.17e-03 7.27e-02 -3.8 2.11e+00 - 8.07e-01 7.39e-0
1h 1
11 5.8336969e+02 9.23e-05 4.64e-02 -3.8 3.15e-02 - 1.00e+00 9.57e-0
1h 1
12 5.8368715e+02 2.81e-07 1.30e-05 -3.8 3.37e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278926e+02 4.12e-07 5.35e-04 -5.7 3.47e-02 - 1.00e+00 9.91e-0
1h 1
14 5.8278859e+02 4.35e-11 3.51e-09 -5.7 2.16e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.65e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753111869790e-01 5.8277753111869788e+0
2
Dual infeasibility......: 2.6458543387249642e-09 2.6458543387249642e-0
6
Constraint violation....: 6.3002103534159914e-11 6.3002103534159914e-1
1
Complementarity.........: 2.8882674692952914e-09 2.8882674692952913e-0
6
Overall NLP error.......: 2.8882674692952914e-09 2.8882674692952913e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1582576e+02 1.09e+02 1.13e+02 -1.0 3.76e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1398370e+04 5.38e-02 8.36e+01 -1.0 4.53e+01 - 3.10e-02 1.00e+0
0h 1
3 2.7845901e+03 5.17e-02 6.49e+01 -1.0 8.43e+01 - 2.27e-01 4.32e-0
2f 1
4 9.8152882e+02 4.24e-02 3.38e+01 -1.0 3.41e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5906778e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.22e-01 1.00e+0
0h 1
6 9.4490441e+02 1.01e-02 8.72e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6264654e+02 4.59e-04 6.60e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536437e+02 1.94e-03 1.94e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379715e+02 3.25e-03 6.12e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140238e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388159e+02 1.57e-04 1.69e-02 -3.8 7.57e-01 - 9.93e-01 9.41e-0
1h 1
12 5.8370191e+02 7.28e-07 6.65e-05 -3.8 8.62e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278679e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.06e-09 -5.7 3.40e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148938172e-01 5.8277753148938166e+0
2
Dual infeasibility......: 2.0880117295399207e-09 2.0880117295399207e-0
6
Constraint violation....: 6.2994012783867959e-11 6.2994012783867959e-1
1
Complementarity.........: 2.8882094420493767e-09 2.8882094420493764e-0
6
Overall NLP error.......: 2.8882094420493767e-09 2.8882094420493764e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.78e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5000575e+02 7.50e+01 9.04e+01 -1.0 2.59e+01 - 3.83e-04 3.52e-0
2f 1
2 1.1818546e+04 5.63e-02 8.12e+01 -1.0 2.87e+01 - 4.64e-02 1.00e+0
0h 1
3 3.1583161e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.65e-0
2f 1
4 1.0154149e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8164779e+03 7.28e-03 1.55e+01 -1.0 1.92e+01 - 6.10e-01 1.00e+0
0h 1
6 1.1189268e+03 5.40e-03 4.04e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8232674e+02 9.97e-04 2.09e-01 -1.7 5.71e+00 - 1.00e+00 8.88e-0
1h 1
8 7.2806667e+02 8.48e-04 1.34e-02 -1.7 3.45e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0978200e+02 1.50e-03 1.13e-01 -3.8 4.49e+00 - 7.71e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8216668e+02 2.17e-03 7.27e-02 -3.8 2.11e+00 - 8.07e-01 7.39e-0
1h 1
11 5.8336969e+02 9.23e-05 4.64e-02 -3.8 3.15e-02 - 1.00e+00 9.57e-0
1h 1
12 5.8368715e+02 2.81e-07 1.30e-05 -3.8 3.37e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278926e+02 4.12e-07 5.35e-04 -5.7 3.47e-02 - 1.00e+00 9.91e-0
1h 1
14 5.8278859e+02 4.35e-11 3.51e-09 -5.7 2.16e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.65e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753111869790e-01 5.8277753111869788e+0
2
Dual infeasibility......: 2.6458543387249642e-09 2.6458543387249642e-0
6
Constraint violation....: 6.3002103534159914e-11 6.3002103534159914e-1
1
Complementarity.........: 2.8882674692952914e-09 2.8882674692952913e-0
6
Overall NLP error.......: 2.8882674692952914e-09 2.8882674692952913e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.28e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9792022e+02 4.09e+01 5.94e+01 -1.0 1.43e+01 - 6.99e-04 4.23e-0
2f 1
2 1.2226208e+04 6.07e-02 7.87e+01 -1.0 1.80e+01 - 7.07e-02 1.00e+0
0h 1
3 3.6198120e+03 5.54e-02 5.15e+01 -1.0 5.46e+01 - 3.33e-01 7.86e-0
2f 1
4 2.3518136e+03 2.93e-02 2.28e+01 -1.0 2.71e+01 - 5.45e-01 4.46e-0
1f 1
5 1.7557842e+03 8.50e-03 1.17e+00 -1.0 9.97e+00 - 9.27e-01 7.68e-0
1f 1
6 2.0288429e+03 3.41e-04 8.15e-02 -1.0 3.36e+00 - 1.00e+00 1.00e+0
0h 1
7 1.4017677e+03 2.08e-03 8.13e-02 -2.5 4.88e+00 - 8.66e-01 8.50e-0
1f 1
8 1.2221186e+03 2.16e-03 2.04e-01 -2.5 1.05e+00 - 1.00e+00 8.34e-0
1f 1
9 1.2056881e+03 8.29e-05 3.94e-03 -2.5 1.47e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1964862e+03 4.50e-05 1.20e+00 -3.8 9.56e-02 - 1.00e+00 4.86e-0
1h 1
11 1.1944260e+03 3.81e-07 1.16e-01 -3.8 4.16e-02 - 9.65e-01 1.00e+0
0f 1
12 1.1933751e+03 2.37e-08 2.01e-03 -3.8 3.32e-02 - 1.00e+00 1.00e+0
0H 1
13 1.1935802e+03 1.35e-05 3.08e-04 -3.8 4.28e-03 - 1.00e+00 1.00e+0
0f 1
14 1.1929524e+03 2.10e-06 6.04e-02 -5.7 1.24e-02 - 7.79e-01 9.70e-0
1h 1
15 1.1927877e+03 1.23e-05 2.01e-04 -5.7 5.02e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1927934e+03 2.14e-08 1.78e-06 -5.7 2.27e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1927802e+03 2.61e-08 2.54e-06 -8.6 2.38e-04 - 9.83e-01 9.85e-0
1h 1
18 1.1927801e+03 4.57e-13 3.48e-11 -8.6 2.60e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1927800689113008e+00 1.1927800689113008e+0
3
Dual infeasibility......: 3.4834174111665573e-11 3.4834174111665573e-0
8
Constraint violation....: 4.5663473002832689e-13 4.5663473002832689e-1
3
Complementarity.........: 2.5123551817565588e-09 2.5123551817565586e-0
6
Overall NLP error.......: 2.5123551817565588e-09 2.5123551817565586e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 40
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 20
inequality constraints with only lower bounds: 11
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2226548e+02 9.17e+02 5.24e+01 -1.0 9.19e+02 - 3.31e-04 9.89e-0
3h 1
2 7.9567419e+02 9.17e+02 5.24e+01 -1.0 8.24e+02 - 1.08e-04 9.71e-0
4h 1
3 2.4325600e+02 8.97e+02 5.26e+01 -1.0 9.17e+02 - 9.56e-04 2.09e-0
2h 1
4 1.2231736e+04 5.55e-02 8.38e+01 -1.0 8.98e+02 - 2.32e-02 1.00e+0
0h 1
5 3.9591307e+03 5.36e-02 6.86e+01 -1.0 8.19e+01 - 1.86e-01 3.68e-0
2f 1
6 1.9812308e+03 4.37e-02 3.67e+01 -1.0 3.39e+01 - 4.72e-01 5.47e-0
1f 1
7 2.6523735e+03 1.86e-02 2.12e+01 -1.0 1.93e+01 - 3.72e-01 2.50e-0
1f 3
8 1.9462783e+03 7.68e-03 4.04e-01 -1.0 1.01e+01 - 9.83e-01 1.00e+0
0f 1
9 1.6820695e+03 1.34e-03 2.81e-01 -1.7 4.79e+00 - 1.00e+00 8.75e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7931170e+03 9.77e-04 1.28e-02 -1.7 1.58e+02 - 1.00e+00 1.00e+0
0f 1
11 1.5333032e+03 1.40e-03 9.44e-02 -3.8 1.63e+02 - 7.94e-01 9.28e-0
1f 1
12 1.5036001e+03 1.58e-03 7.61e-02 -3.8 9.00e+00 - 8.37e-01 7.54e-0
1h 1
13 1.5021321e+03 3.35e-06 8.58e-04 -3.8 2.12e+00 - 1.00e+00 1.00e+0
0h 1
14 1.5003347e+03 2.74e-07 7.38e-04 -5.7 1.04e+00 - 1.00e+00 9.87e-0
1h 1
15 1.5003172e+03 3.71e-11 6.81e-09 -5.7 2.81e-01 - 1.00e+00 1.00e+0
0f 1
16 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.29e-02 - 1.00e+00 1.00e+0
0h 1
1 8.6492449e+02 9.17e+02 5.24e+01 -1.0 9.19e+02 - 4.97e-04 9.89e-0
3h 1
2 8.3429719e+02 9.16e+02 5.24e+01 -1.0 8.37e+02 - 1.07e-04 1.13e-0
3h 1
3 2.6334808e+02 8.96e+02 5.25e+01 -1.0 9.16e+02 - 1.12e-03 2.18e-0
2h 1
4 1.2547951e+04 6.03e-02 8.25e+01 -1.0 8.97e+02 - 2.44e-02 1.00e+0
0h 1
5 4.4093479e+03 5.78e-02 6.61e+01 -1.0 6.99e+01 - 2.02e-01 3.77e-0
2f 1
6 2.4528855e+03 3.38e-02 3.55e+01 -1.0 3.12e+01 - 4.78e-01 6.14e-0
1f 1
7 2.2633860e+03 7.17e-03 2.37e+00 -1.0 7.75e+00 - 9.39e-01 1.00e+0
0f 1
65 1.619694e+04 1.632511e+04 5.272658e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2434425e+02 1.57e+04 5.24e+01 -1.0 1.59e+04 - 3.31e-04 9.80e-0
3h 1
2 8.2149280e+02 1.57e+04 5.24e+01 -1.0 1.51e+04 - 4.66e-05 1.03e-0
4h 1
3 7.9665173e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 6.19e-06 2.00e-0
3h 1
4 5.7865025e+02 1.54e+04 5.26e+01 -1.0 1.57e+04 - 2.13e-03 2.05e-0
2h 1
5 2.6522796e+04 5.65e-02 8.25e+01 -1.0 1.54e+04 - 4.06e-02 1.00e+0
0h 1
6 1.8648968e+04 5.35e-02 4.91e+01 -1.0 7.53e+01 - 4.00e-01 5.29e-0
2f 1
7 1.6722158e+04 3.63e-02 2.56e+01 -1.0 3.97e+01 - 4.81e-01 4.97e-0
1f 1
8 1.7056229e+04 2.33e-02 1.08e+01 -1.0 1.98e+01 - 4.13e-01 1.25e-0
1f 4
9 1.6827857e+04 5.93e-03 3.12e-01 -1.0 4.46e+00 - 9.80e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6520014e+04 1.39e-03 3.97e-01 -1.7 5.50e+00 - 1.00e+00 8.27e-0
1f 1
11 1.6497488e+04 8.52e-04 1.54e-02 -1.7 3.67e+01 - 1.00e+00 1.00e+0
0f 1
12 1.6361097e+04 1.22e-03 4.94e-02 -2.5 3.44e+01 - 9.17e-01 1.00e+0
0f 1
13 1.6344593e+04 1.28e-03 1.54e-02 -2.5 1.08e+00 - 1.00e+00 1.00e+0
0h 1
14 1.6328315e+04 2.27e-04 1.07e-01 -3.8 5.36e+00 - 1.00e+00 8.32e-0
1h 1
15 1.6326332e+04 4.53e-07 1.40e-04 -3.8 8.98e-01 - 1.00e+00 1.00e+0
0h 1
16 1.6325119e+04 4.02e-07 1.63e-04 -5.7 2.97e-01 - 1.00e+00 9.97e-0
1h 1
17 1.6325120e+04 3.89e-11 2.95e-09 -5.7 3.89e-02 - 1.00e+00 1.00e+0
0f 1
18 1.6325105e+04 6.24e-11 2.67e-06 -8.6 3.68e-03 - 1.00e+00 9.96e-0
1h 1
19 1.6325105e+04 1.78e-15 3.72e-14 -8.6 6.74e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.6325105277925182e+01 1.6325105277925182e+0
4
Dual infeasibility......: 3.7158818547129653e-14 3.7158818547129653e-1
1
Constraint violation....: 1.7763568394002505e-15 1.7763568394002505e-1
5
Complementarity.........: 4.9546069100784513e-09 4.9546069100784512e-0
6
Overall NLP error.......: 4.9546069100784513e-09 4.9546069100784512e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9225661e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.64e-04 9.80e-0
3f 1
2 7.8942228e+02 1.50e+04 5.25e+01 -1.0 1.48e+04 - 9.52e-05 1.00e-0
4h 1
3 7.8170942e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 2.83e-06 5.80e-0
4f 1
4 5.2281563e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 6.18e-04 2.03e-0
2h 1
5 2.6203228e+04 5.40e-02 8.38e+01 -1.0 1.47e+04 - 3.24e-02 1.00e+0
0h 1
6 1.7690203e+04 5.18e-02 6.38e+01 -1.0 8.06e+01 - 2.42e-01 4.50e-0
2f 1
7 1.5948437e+04 4.29e-02 3.26e+01 -1.0 3.30e+01 - 4.86e-01 4.64e-0
1f 1
8 1.6265612e+04 2.68e-02 1.43e+01 -1.0 1.79e+01 - 4.33e-01 1.25e-0
1f 4
9 1.6015509e+04 6.01e-03 1.46e-01 -1.0 4.94e+00 - 9.92e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5733624e+04 1.19e-03 2.76e-01 -1.7 4.61e+00 - 1.00e+00 8.68e-0
1f 1
11 1.5708922e+04 7.68e-04 1.10e-02 -1.7 1.57e+01 - 1.00e+00 1.00e+0
0f 1
12 1.5584125e+04 1.33e-03 8.93e-02 -3.8 1.99e+01 - 7.99e-01 9.32e-0
1f 1
13 1.5559913e+04 1.47e-03 6.38e-02 -3.8 1.70e+00 - 8.49e-01 7.73e-0
1h 1
14 1.5560166e+04 2.69e-06 7.40e-04 -3.8 3.04e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5559221e+04 3.16e-07 6.09e-04 -5.7 1.49e-01 - 1.00e+00 9.88e-0
1h 1
16 1.5559215e+04 3.95e-11 6.17e-09 -5.7 1.23e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5559202e+04 6.30e-11 2.09e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5559202156743618e+01 1.5559202156743619e+0
4
Dual infeasibility......: 2.0878337866303544e-09 2.0878337866303544e-0
6
Constraint violation....: 6.2996149963190362e-11 6.2996149963190362e-1
1
Complementarity.........: 2.8881089270352592e-09 2.8881089270352592e-0
6
Overall NLP error.......: 2.8881089270352592e-09 2.8881089270352592e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9899820e+02 1.39e+04 5.25e+01 -1.0 1.40e+04 - 2.76e-04 9.80e-0
3h 1
2 7.9604464e+02 1.39e+04 5.25e+01 -1.0 1.27e+04 - 3.23e-05 1.09e-0
4h 1
3 7.1488513e+02 1.38e+04 5.25e+01 -1.0 1.39e+04 - 1.26e-05 5.64e-0
3h 1
4 5.7077934e+02 1.35e+04 5.25e+01 -1.0 1.38e+04 - 6.07e-03 1.96e-0
2h 1
5 2.2884968e+04 5.78e-02 8.38e+01 -1.0 1.35e+04 - 3.99e-02 1.00e+0
0h 1
6 1.6477769e+04 5.48e-02 3.92e+01 -1.0 6.21e+01 - 5.27e-01 5.55e-0
2f 1
7 1.4836230e+04 4.06e-02 1.78e+01 -1.0 3.47e+01 - 5.39e-01 4.61e-0
1f 1
8 1.5215199e+04 2.36e-02 4.55e+00 -1.0 1.00e+01 - 6.25e-01 2.50e-0
1f 3
9 1.4977889e+04 4.89e-03 1.07e-01 -1.0 4.79e+00 - 9.93e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4676684e+04 1.06e-03 3.07e-01 -1.7 1.86e+01 - 1.00e+00 8.52e-0
1f 1
11 1.4671201e+04 6.14e-04 1.71e-02 -1.7 4.30e+01 - 9.50e-01 1.00e+0
0f 1
12 1.4508092e+04 1.34e-03 9.37e-02 -3.8 5.96e+01 - 7.95e-01 9.31e-0
1f 1
13 1.4481673e+04 1.50e-03 6.78e-02 -3.8 4.10e+00 - 8.50e-01 7.71e-0
1h 1
14 1.4481317e+04 3.19e-06 7.58e-04 -3.8 9.37e-01 - 1.00e+00 1.00e+0
0h 1
15 1.4480078e+04 3.10e-07 5.99e-04 -5.7 4.46e-01 - 1.00e+00 9.89e-0
1h 1
16 1.4480068e+04 3.87e-11 6.21e-09 -5.7 7.48e-02 - 1.00e+00 1.00e+0
0f 1
17 1.4480052e+04 6.30e-11 2.10e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.4480051784948836e+01 1.4480051784948835e+0
4
Dual infeasibility......: 2.0963402023885803e-09 2.0963402023885803e-0
6
Constraint violation....: 6.2996274863280632e-11 6.2996274863280632e-1
1
Complementarity.........: 3.3308653304707756e-09 3.3308653304707754e-0
6
Overall NLP error.......: 3.3308653304707756e-09 3.3308653304707754e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9354451e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 7.31e-04 9.81e-0
3h 1
2 8.9045637e+02 1.26e+04 5.24e+01 -1.0 1.02e+04 - 2.02e-05 1.23e-0
4h 1
3 8.5895810e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 2.79e-05 2.12e-0
3h 1
4 5.6112988e+02 1.23e+04 5.24e+01 -1.0 1.26e+04 - 2.13e-03 2.20e-0
2h 1
5 2.4136369e+04 6.50e-02 8.10e+01 -1.0 1.23e+04 - 3.80e-02 1.00e+0
0h 1
6 1.6424102e+04 6.15e-02 5.46e+01 -1.0 4.77e+01 - 3.20e-01 5.05e-0
2f 1
7 1.5026401e+04 2.47e-02 2.60e+01 -1.0 2.35e+01 - 5.26e-01 5.51e-0
1f 1
8 1.4485094e+04 7.49e-03 1.24e+00 -1.0 8.43e+00 - 9.37e-01 7.66e-0
1f 1
9 1.4777012e+04 2.43e-04 8.31e-02 -1.0 3.21e+00 - 9.59e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4153565e+04 2.12e-03 7.97e-02 -2.5 4.54e+00 - 8.62e-01 8.51e-0
1f 1
11 1.3984945e+04 2.16e-03 3.17e-01 -2.5 2.03e+00 - 1.00e+00 7.87e-0
1f 1
12 1.3960324e+04 1.61e-04 4.71e-03 -2.5 1.44e+00 - 1.00e+00 1.00e+0
0h 1
13 1.3935970e+04 3.37e-05 8.41e-02 -3.8 9.42e+00 - 1.00e+00 8.16e-0
1h 1
14 1.3932553e+04 1.00e-07 5.84e-04 -3.8 1.21e+00 - 1.00e+00 1.00e+0
0f 1
15 1.3931018e+04 3.69e-08 3.80e-04 -5.7 4.24e-01 - 1.00e+00 9.92e-0
1f 1
16 1.3931015e+04 1.90e-12 1.59e-08 -5.7 2.57e-04 - 1.00e+00 1.00e+0
0f 1
17 1.3930996e+04 2.56e-12 9.37e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.3930996276708443e+01 1.3930996276708443e+0
4
Dual infeasibility......: 9.3723060296863717e-09 9.3723060296863717e-0
6
Constraint violation....: 2.5572599593459699e-12 2.5572599593459699e-1
2
Complementarity.........: 4.6907763937880592e-09 4.6907763937880594e-0
6
Overall NLP error.......: 9.3723060296863717e-09 9.3723060296863717e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6662389e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 4.97e-04 9.80e-0
3h 1
2 8.6375901e+02 1.11e+04 5.24e+01 -1.0 1.04e+04 - 4.51e-05 1.05e-0
4h 1
3 8.1247867e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 9.09e-06 3.08e-0
3h 1
4 5.1271376e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 3.39e-03 2.10e-0
2h 1
5 2.1781269e+04 6.25e-02 8.04e+01 -1.0 1.09e+04 - 5.65e-02 1.00e+0
0h 1
6 1.4355473e+04 5.79e-02 4.85e+01 -1.0 6.64e+01 - 3.84e-01 6.77e-0
2f 1
7 1.2780687e+04 3.04e-02 2.34e+01 -1.0 3.79e+01 - 5.09e-01 4.42e-0
1f 1
8 1.2333284e+04 1.27e-02 2.11e+00 -1.0 1.05e+01 - 9.22e-01 1.00e+0
0f 1
9 1.2590751e+04 3.91e-04 7.29e-02 -1.0 4.30e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2099307e+04 5.08e-04 6.40e-01 -2.5 7.12e+00 - 8.93e-01 6.41e-0
1f 1
11 1.2017941e+04 2.37e-04 3.82e-01 -2.5 2.45e+00 - 8.88e-01 1.00e+0
0h 1
12 1.1994709e+04 6.02e-03 2.19e-01 -2.5 1.69e+00 - 1.00e+00 6.03e-0
1h 1
13 1.1985170e+04 7.03e-04 5.56e-03 -2.5 4.75e-01 - 1.00e+00 1.00e+0
0f 1
14 1.1966692e+04 1.15e-03 2.92e-02 -3.8 5.36e+00 - 8.09e-01 1.00e+0
0h 1
15 1.1963688e+04 2.25e-03 1.06e-03 -3.8 4.73e-02 - 1.00e+00 1.00e+0
0h 1
16 1.1964070e+04 4.49e-05 1.48e-04 -3.8 1.50e-02 - 1.00e+00 1.00e+0
0h 1
17 1.1962598e+04 1.05e-04 4.27e-04 -5.7 2.97e-01 - 9.51e-01 9.82e-0
1h 1
18 1.1962590e+04 2.18e-05 3.56e-03 -5.7 5.37e-03 - 1.00e+00 7.94e-0
1h 1
19 1.1962593e+04 8.54e-09 1.12e-06 -5.7 1.11e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.1962577e+04 8.97e-09 1.93e-05 -8.6 3.68e-03 - 1.00e+00 9.83e-0
1h 1
21 1.1962577e+04 1.38e-12 6.48e-11 -8.6 6.13e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.1962576507559316e+01 1.1962576507559315e+0
4
Dual infeasibility......: 6.4763639101320557e-11 6.4763639101320557e-0
8
Constraint violation....: 1.3764545059302691e-12 1.3764545059302691e-1
2
Complementarity.........: 3.0782326300486990e-09 3.0782326300486989e-0
6
Overall NLP error.......: 3.0782326300486990e-09 3.0782326300486989e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3005826e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 2.02e-03 9.80e-0
3h 1
2 9.2703232e+02 9.19e+03 5.23e+01 -1.0 8.09e+03 - 2.76e-05 1.12e-0
4h 1
3 7.5783095e+02 9.11e+03 5.23e+01 -1.0 9.19e+03 - 1.67e-05 9.02e-0
3f 1
4 5.7019955e+02 8.91e+03 5.19e+01 -1.0 9.11e+03 - 1.10e-02 2.10e-0
2h 1
5 1.8305219e+04 8.28e-02 7.82e+01 -1.0 8.91e+03 - 8.71e-02 1.00e+0
0h 1
6 1.3289624e+04 7.37e-02 2.12e+01 -1.0 7.99e+00 - 7.08e-01 1.04e-0
1f 1
7 1.2190257e+04 3.47e-02 3.50e+00 -1.0 6.47e+00 - 8.56e-01 9.70e-0
1f 1
8 1.2545395e+04 3.12e-02 3.82e-01 -1.0 2.06e+00 - 9.51e-01 9.51e-0
1f 1
9 1.2157196e+04 4.33e-03 1.19e+00 -1.7 5.78e+00 - 4.42e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2133349e+04 3.56e-04 5.75e-01 -1.7 7.84e+00 - 7.20e-01 1.00e+0
0h 1
11 1.2153029e+04 1.06e-04 8.88e-02 -1.7 1.31e+01 - 8.71e-01 1.00e+0
0f 1
12 1.1994713e+04 3.99e-04 1.79e-02 -2.5 2.07e+01 - 9.75e-01 9.50e-0
1f 1
13 1.1970623e+04 1.02e-04 1.53e-01 -3.8 8.66e+00 - 9.98e-01 7.76e-0
1h 1
14 1.1965350e+04 2.06e-07 1.24e-04 -3.8 1.96e+00 - 1.00e+00 1.00e+0
0f 1
15 1.1964015e+04 1.78e-08 2.99e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
16 1.1963999e+04 1.29e-12 4.23e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.1963999148572221e+01 1.1963999148572220e+0
4
Dual infeasibility......: 4.2340935383629213e-10 4.2340935383629213e-0
7
Constraint violation....: 1.2929934900540729e-12 1.2929934900540729e-1
2
Complementarity.........: 4.4007247395218806e-09 4.4007247395218808e-0
6
Overall NLP error.......: 4.4007247395218806e-09 4.4007247395218808e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2297256e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1839350e+02 6.70e+03 5.23e+01 -1.0 3.55e+03 - 1.59e-05 1.87e-0
4h 1
3 4.2760061e+02 6.55e+03 5.24e+01 -1.0 6.70e+03 - 9.50e-05 2.35e-0
2f 1
4 1.9355175e+04 6.81e-02 7.97e+01 -1.0 6.55e+03 - 3.79e-02 1.00e+0
0h 1
5 1.1061879e+04 6.45e-02 5.90e+01 -1.0 2.11e+01 - 2.57e-01 4.96e-0
2f 1
6 9.8072523e+03 1.56e-02 2.61e+01 -1.0 1.02e+01 - 5.86e-01 7.85e-0
1f 1
7 9.7742726e+03 7.07e-03 2.93e-01 -1.0 1.99e+00 - 9.89e-01 1.00e+0
0f 1
8 9.3946958e+03 1.63e-03 9.33e-02 -1.7 4.64e+00 - 1.00e+00 9.64e-0
1f 1
9 9.2433018e+03 1.79e-03 5.23e-01 -2.5 6.41e+00 - 1.00e+00 7.49e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.2120625e+03 3.25e-04 1.02e-01 -2.5 1.60e+00 - 1.00e+00 8.95e-0
1h 1
11 9.2152286e+03 1.17e-05 4.05e-03 -2.5 1.68e-01 - 1.00e+00 1.00e+0
0f 1
12 9.1851601e+03 1.05e-05 7.92e-03 -3.8 1.07e+01 - 1.00e+00 9.61e-0
1f 1
13 9.1844595e+03 1.57e-08 1.35e-05 -3.8 4.10e-01 - 1.00e+00 1.00e+0
0f 1
14 9.1828192e+03 1.79e-08 5.06e-06 -5.7 5.94e-01 - 1.00e+00 1.00e+0
0f 1
15 9.1828008e+03 6.40e-13 4.11e-10 -8.6 7.36e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 9.1828007898872563e+00 9.1828007898872565e+0
3
Dual infeasibility......: 4.1142373289193766e-10 4.1142373289193766e-0
7
Constraint violation....: 6.4032112945255903e-13 6.4032112945255903e-1
3
Complementarity.........: 2.8813104947689003e-09 2.8813104947689001e-0
6
Overall NLP error.......: 2.8813104947689003e-09 2.8813104947689001e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0885267e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0522538e+02 4.77e+03 5.23e+01 -1.0 3.40e+03 - 2.93e-05 1.39e-0
4h 1
3 3.7446895e+02 4.66e+03 5.24e+01 -1.0 4.77e+03 - 4.82e-05 2.34e-0
2f 1
4 1.7343624e+04 6.51e-02 8.03e+01 -1.0 4.66e+03 - 3.33e-02 1.00e+0
0h 1
5 8.8835455e+03 6.19e-02 6.15e+01 -1.0 3.76e+01 - 2.33e-01 4.52e-0
2f 1
6 7.5996542e+03 2.03e-02 2.88e+01 -1.0 1.63e+01 - 5.42e-01 6.20e-0
1f 1
7 7.1823993e+03 5.79e-03 8.85e-01 -1.0 5.30e+00 - 9.57e-01 7.82e-0
1f 1
8 7.4476292e+03 1.69e-04 6.59e-02 -1.0 5.07e+00 - 1.00e+00 1.00e+0
0f 1
9 6.8807135e+03 2.12e-03 8.08e-02 -2.5 3.11e+00 - 8.55e-01 8.48e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.7194676e+03 2.16e-03 4.17e-01 -2.5 9.54e-01 - 1.00e+00 7.62e-0
1f 1
11 6.6937539e+03 1.24e-04 4.69e-03 -2.5 2.11e-01 - 1.00e+00 1.00e+0
0h 1
12 6.6728230e+03 3.32e-05 1.46e-01 -3.8 8.04e+00 - 1.00e+00 7.62e-0
1h 1
13 6.6674261e+03 1.25e-07 3.38e-04 -3.8 1.91e+00 - 1.00e+00 1.00e+0
0f 1
14 6.6659052e+03 2.85e-08 9.90e-04 -5.7 4.46e-01 - 1.00e+00 9.85e-0
1h 1
15 6.6658878e+03 1.92e-12 1.39e-08 -5.7 6.69e-03 - 1.00e+00 1.00e+0
0f 1
16 6.6658693e+03 2.63e-12 4.48e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.6658693430871345e+00 6.6658693430871344e+0
3
Dual infeasibility......: 4.4776953083125821e-09 4.4776953083125821e-0
6
Constraint violation....: 2.6308746847725217e-12 2.6308746847725217e-1
2
Complementarity.........: 3.6084978179569209e-09 3.6084978179569209e-0
6
Overall NLP error.......: 4.4776953083125821e-09 4.4776953083125821e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6647742e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 4.97e-04 9.81e-0
3h 1
2 8.6258607e+02 3.24e+03 5.24e+01 -1.0 2.21e+03 - 3.91e-05 1.45e-0
4h 1
3 3.1400433e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 5.82e-05 2.24e-0
2f 1
4 1.5420372e+04 5.91e-02 8.12e+01 -1.0 3.17e+03 - 3.49e-02 1.00e+0
0h 1
5 6.7290069e+03 5.61e-02 6.00e+01 -1.0 7.11e+01 - 2.59e-01 4.63e-0
2f 1
6 4.9141783e+03 2.50e-02 3.24e+01 -1.0 3.47e+01 - 4.68e-01 5.32e-0
1f 1
7 4.4464852e+03 1.14e-02 2.56e+00 -1.0 9.40e+00 - 9.28e-01 1.00e+0
0f 1
8 4.7445322e+03 5.19e-04 7.22e-02 -1.0 2.72e+00 - 9.99e-01 1.00e+0
0f 1
9 4.1967829e+03 5.77e-04 4.25e-01 -2.5 7.14e+00 - 8.93e-01 7.24e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.1292521e+03 1.97e-04 2.34e-01 -2.5 2.25e+00 - 9.13e-01 1.00e+0
0h 1
11 4.1116438e+03 2.84e-04 9.33e-02 -2.5 9.70e-01 - 1.00e+00 7.64e-0
1H 1
12 4.1091626e+03 3.40e-04 1.77e-03 -2.5 1.24e-01 - 1.00e+00 1.00e+0
0f 1
13 4.0879671e+03 1.22e-03 3.19e-02 -3.8 8.05e+00 - 7.96e-01 1.00e+0
0h 1
14 4.0846007e+03 2.79e-03 1.11e-03 -3.8 4.90e-02 - 1.00e+00 1.00e+0
0h 1
15 4.0849547e+03 3.93e-05 1.31e-04 -3.8 1.35e-02 - 1.00e+00 1.00e+0
0h 1
16 4.0833586e+03 1.01e-04 3.52e-04 -5.7 4.46e-01 - 9.51e-01 9.77e-0
1h 1
17 4.0833414e+03 2.19e-05 3.67e-03 -5.7 1.03e-02 - 1.00e+00 7.83e-0
1h 1
18 4.0833430e+03 8.57e-09 1.21e-06 -5.7 2.23e-03 - 1.00e+00 1.00e+0
0f 1
19 4.0833247e+03 9.02e-09 1.92e-05 -8.6 5.53e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 4.0833244e+03 1.37e-12 6.48e-11 -8.6 9.17e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 4.0833243956414842e+00 4.0833243956414840e+0
3
Dual infeasibility......: 6.4813000219466765e-11 6.4813000219466765e-0
8
Constraint violation....: 1.3689049893628180e-12 1.3689049893628180e-1
2
Complementarity.........: 2.8485211053932312e-09 2.8485211053932309e-0
6
Overall NLP error.......: 2.8485211053932312e-09 2.8485211053932309e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4518010e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 3.98e-04 9.82e-0
3f 1
2 8.4053439e+02 2.00e+03 5.24e+01 -1.0 1.16e+03 - 4.81e-05 1.71e-0
4h 1
3 2.7515086e+02 1.95e+03 5.26e+01 -1.0 2.00e+03 - 9.15e-05 2.18e-0
2f 1
4 1.3963174e+04 5.67e-02 8.10e+01 -1.0 1.95e+03 - 4.46e-02 1.00e+0
0h 1
5 5.1649115e+03 5.33e-02 5.37e+01 -1.0 8.21e+01 - 3.29e-01 5.49e-0
2f 1
6 3.0153640e+03 3.34e-02 2.96e+01 -1.0 4.25e+01 - 4.59e-01 5.39e-0
1f 1
7 5.0682681e+03 9.22e-03 1.68e+01 -1.0 2.43e+01 - 5.84e-01 1.00e+0
0h 1
8 3.0866652e+03 7.53e-03 4.18e-01 -1.0 2.11e+01 - 9.67e-01 1.00e+0
0f 1
9 2.7842089e+03 9.65e-04 1.52e-01 -1.7 5.21e+00 - 1.00e+00 9.18e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.6509577e+03 1.61e-03 2.68e-01 -2.5 6.06e+00 - 7.51e-01 1.00e+0
0f 1
11 2.5991909e+03 4.55e-03 3.98e-02 -2.5 2.90e+00 - 1.00e+00 1.00e+0
0h 1
12 2.6091275e+03 2.07e-04 6.15e-03 -2.5 4.69e-01 - 1.00e+00 1.00e+0
0h 1
13 2.5823276e+03 2.56e-04 4.27e-02 -3.8 8.05e+00 - 9.87e-01 8.86e-0
1h 1
14 2.5808180e+03 1.93e-06 1.65e-04 -3.8 9.08e-01 - 1.00e+00 1.00e+0
0h 1
15 2.5794755e+03 3.20e-07 2.10e-03 -5.7 4.46e-01 - 1.00e+00 9.78e-0
1h 1
16 2.5794604e+03 3.72e-11 2.11e-08 -5.7 9.89e-03 - 1.00e+00 1.00e+0
0f 1
17 2.5794438e+03 6.30e-11 4.40e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 2.5794437879195313e+00 2.5794437879195311e+0
3
Dual infeasibility......: 4.3996163175278726e-09 4.3996163175278726e-0
6
Constraint violation....: 6.3009916728695714e-11 6.3009916728695714e-1
1
Complementarity.........: 3.2947039404167878e-09 3.2947039404167875e-0
6
Overall NLP error.......: 4.3996163175278726e-09 4.3996163175278726e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 40
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 20
inequality constraints with only lower bounds: 11
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0688634e+02 9.17e+02 5.23e+01 -1.0 9.19e+02 - 9.83e-04 9.89e-0
3h 1
2 8.4746252e+02 9.15e+02 5.23e+01 -1.0 8.77e+02 - 1.02e-04 2.23e-0
3h 1
3 2.8698787e+02 8.95e+02 5.24e+01 -1.0 9.16e+02 - 2.21e-03 2.22e-0
2h 1
4 1.2509830e+04 6.77e-02 8.17e+01 -1.0 8.95e+02 - 2.59e-02 1.00e+0
0h 1
5 4.9671490e+03 6.48e-02 6.34e+01 -1.0 3.80e+01 - 2.25e-01 4.00e-0
2f 1
6 3.7182175e+03 2.10e-02 2.91e+01 -1.0 1.64e+01 - 5.50e-01 6.20e-0
1f 1
7 3.2994538e+03 5.82e-03 9.54e-01 -1.0 5.34e+00 - 9.57e-01 7.83e-0
1f 1
8 3.5664865e+03 1.70e-04 6.59e-02 -1.0 5.33e+00 - 9.92e-01 1.00e+0
0f 1
9 3.0073496e+03 2.11e-03 8.20e-02 -2.5 1.07e+01 - 8.55e-01 8.45e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8486853e+03 2.16e-03 4.22e-01 -2.5 5.05e+00 - 1.00e+00 7.60e-0
1f 1
11 2.8240211e+03 1.29e-04 4.45e-03 -2.5 1.67e+00 - 1.00e+00 1.00e+0
0h 1
12 2.7934709e+03 3.20e-05 1.18e-01 -3.8 1.94e+01 - 1.00e+00 7.83e-0
1h 1
13 2.7864346e+03 1.10e-07 3.74e-04 -3.8 3.92e+00 - 1.00e+00 1.00e+0
0f 1
14 2.7843219e+03 3.07e-08 9.49e-04 -5.7 1.04e+00 - 1.00e+00 9.85e-0
1f 1
15 2.7842972e+03 1.89e-12 1.60e-08 -5.7 1.41e-02 - 1.00e+00 1.00e+0
0f 1
16 2.7842714e+03 2.63e-12 5.21e-09 -8.6 1.29e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 2.7842713974688462e+00 2.7842713974688463e+0
3
Dual infeasibility......: 5.2107598102523733e-09 5.2107598102523733e-0
6
Constraint violation....: 2.6311244849530624e-12 2.6311244849530624e-1
2
Complementarity.........: 3.7934832880220970e-09 3.7934832880220971e-0
6
Overall NLP error.......: 5.2107598102523733e-09 5.2107598102523733e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933498e-01 5.8277753147933493e+0
2
Dual infeasibility......: 2.1031320943161440e-09 2.1031320943161440e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896910881e-09 2.8882108896910880e-0
6
Overall NLP error.......: 2.8882108896910881e-09 2.8882108896910880e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933498e-01 5.8277753147933493e+0
2
Dual infeasibility......: 2.1031320943161440e-09 2.1031320943161440e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896910881e-09 2.8882108896910880e-0
6
Overall NLP error.......: 2.8882108896910881e-09 2.8882108896910880e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254149561e-01 6.4890146254149556e+0
2
Dual infeasibility......: 4.9126604770984245e-09 4.9126604770984245e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646095252295117e-09 4.3646095252295114e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126604770984245e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.06e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.45e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281623726e+00 1.6104063281623726e+0
3
Dual infeasibility......: 2.4573533733583358e-12 2.4573533733583358e-0
9
Constraint violation....: 7.4511524312314355e-16 7.4511524312314355e-1
6
Complementarity.........: 2.5062163910051674e-09 2.5062163910051674e-0
6
Overall NLP error.......: 2.5062163910051674e-09 2.5062163910051674e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 40
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 20
inequality constraints with only lower bounds: 11
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2156789e+02 9.17e+02 5.24e+01 -1.0 9.19e+02 - 3.29e-04 9.89e-0
3h 1
2 7.8891343e+02 9.16e+02 5.24e+01 -1.0 8.41e+02 - 1.06e-04 1.19e-0
3h 1
3 2.4333781e+02 8.97e+02 5.26e+01 -1.0 9.17e+02 - 1.20e-03 2.08e-0
2h 1
4 1.2107660e+04 5.56e-02 8.25e+01 -1.0 8.97e+02 - 3.92e-02 1.00e+0
0h 1
5 3.8558296e+03 5.30e-02 5.38e+01 -1.0 7.85e+01 - 3.44e-01 5.11e-0
2f 1
6 1.9054378e+03 3.72e-02 2.85e+01 -1.0 3.93e+01 - 4.74e-01 5.00e-0
1f 1
7 2.5866541e+03 2.02e-02 1.46e+01 -1.0 2.02e+01 - 4.06e-01 2.50e-0
1f 3
8 1.9834753e+03 6.92e-03 3.16e-01 -1.0 7.40e+00 - 9.82e-01 1.00e+0
0f 1
9 1.6893657e+03 1.29e-03 2.80e-01 -1.7 5.30e+00 - 1.00e+00 8.69e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7944810e+03 8.94e-04 1.27e-02 -1.7 1.58e+02 - 1.00e+00 1.00e+0
0f 1
11 1.5337675e+03 1.41e-03 9.55e-02 -3.8 1.64e+02 - 7.92e-01 9.29e-0
1f 1
12 1.5038847e+03 1.59e-03 7.88e-02 -3.8 9.57e+00 - 8.40e-01 7.54e-0
1h 1
13 1.5022927e+03 3.34e-06 8.47e-04 -3.8 2.31e+00 - 1.00e+00 1.00e+0
0h 1
14 1.5003387e+03 2.78e-07 6.92e-04 -5.7 1.19e+00 - 1.00e+00 9.87e-0
1h 1
15 1.5003191e+03 3.67e-11 6.69e-09 -5.7 2.65e-01 - 1.00e+00 1.00e+0
0f 1
16 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.47e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.5002932851901896e+00 1.5002932851901896e+0
3
Dual infeasibility......: 2.1691145262600227e-09 2.1691145262600227e-0
6
Constraint violation....: 6.2998870009600694e-11 6.2998870009600694e-1
1
Complementarity.........: 2.8881015306272932e-09 2.8881015306272933e-0
6
Overall NLP error.......: 2.8881015306272932e-09 2.8881015306272933e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6422697e+02 9.17e+02 5.24e+01 -1.0 9.19e+02 - 4.93e-04 9.89e-0
3h 1
2 8.2502435e+02 9.16e+02 5.24e+01 -1.0 8.55e+02 - 1.04e-04 1.45e-0
3h 1
3 2.6352439e+02 8.96e+02 5.25e+01 -1.0 9.16e+02 - 1.46e-03 2.17e-0
2h 1
4 1.2381382e+04 6.05e-02 8.03e+01 -1.0 8.96e+02 - 5.20e-02 1.00e+0
0h 1
5 4.2326112e+03 5.64e-02 5.20e+01 -1.0 7.11e+01 - 3.41e-01 6.22e-0
2f 1
6 2.6330516e+03 3.02e-02 2.66e+01 -1.0 3.88e+01 - 4.83e-01 4.38e-0
1f 1
7 2.1329948e+03 1.38e-02 2.44e+00 -1.0 1.08e+01 - 9.19e-01 1.00e+0
0f 1
66 1.488840e+04 1.632511e+04 5.327700e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2433855e+02 1.57e+04 5.24e+01 -1.0 1.59e+04 - 3.31e-04 9.80e-0
3h 1
2 8.2143045e+02 1.57e+04 5.24e+01 -1.0 1.45e+04 - 3.13e-05 1.08e-0
4h 1
3 7.5765063e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 1.13e-05 5.14e-0
3h 1
4 6.2358013e+02 1.53e+04 5.24e+01 -1.0 1.57e+04 - 5.48e-03 1.99e-0
2h 1
5 2.5164541e+04 5.93e-02 8.27e+01 -1.0 1.53e+04 - 4.62e-02 1.00e+0
0h 1
6 1.8512406e+04 5.54e-02 4.14e+01 -1.0 6.54e+01 - 4.89e-01 6.05e-0
2f 1
7 1.6712126e+04 3.80e-02 1.93e+01 -1.0 3.86e+01 - 5.29e-01 4.88e-0
1f 1
8 1.7250153e+04 1.45e-02 2.73e+00 -1.0 6.93e+00 - 7.66e-01 5.00e-0
1f 2
9 1.6880862e+04 3.35e-03 7.58e-02 -1.0 4.77e+00 - 9.88e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6518720e+04 1.32e-03 5.85e-01 -2.5 6.95e+00 - 9.18e-01 7.01e-0
1f 1
11 1.6359550e+04 3.19e-03 1.77e-01 -2.5 7.18e+00 - 7.53e-01 1.00e+0
0f 1
12 1.6342931e+04 2.08e-03 2.25e-01 -2.5 1.33e+00 - 1.00e+00 8.37e-0
1h 1
13 1.6352416e+04 1.29e-04 3.38e-03 -2.5 4.87e-01 - 1.00e+00 1.00e+0
0f 1
14 1.6327280e+04 1.62e-04 2.14e-02 -3.8 8.04e+00 - 9.91e-01 9.30e-0
1h 1
15 1.6326482e+04 7.73e-07 7.21e-05 -3.8 5.59e-01 - 1.00e+00 1.00e+0
0f 1
16 1.6325122e+04 3.77e-07 1.78e-04 -5.7 4.46e-01 - 1.00e+00 9.96e-0
1h 1
17 1.6325122e+04 3.80e-11 2.94e-09 -5.7 1.74e-02 - 1.00e+00 1.00e+0
0f 1
18 1.6325106e+04 5.70e-11 2.91e-05 -8.6 5.50e-03 - 1.00e+00 9.55e-0
1h 1
19 1.6325105e+04 1.27e-13 4.39e-12 -8.6 3.02e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.6325105279854348e+01 1.6325105279854348e+0
4
Dual infeasibility......: 4.3930546392374638e-12 4.3930546392374638e-0
9
Constraint violation....: 1.2692624729027102e-13 1.2692624729027102e-1
3
Complementarity.........: 6.8796508336627865e-09 6.8796508336627866e-0
6
Overall NLP error.......: 6.8796508336627865e-09 6.8796508336627866e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4158785e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 3.83e-04 9.80e-0
3h 1
2 8.3874404e+02 1.50e+04 5.24e+01 -1.0 1.43e+04 - 4.60e-05 1.04e-0
4h 1
3 8.3759596e+02 1.50e+04 5.24e+01 -1.0 1.48e+04 - 6.65e-06 8.69e-0
5h 1
4 8.3615366e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 9.17e-05 1.11e-0
4h 1
5 5.5754904e+02 1.46e+04 5.26e+01 -1.0 1.50e+04 - 2.05e-04 2.17e-0
2f 1
6 2.6799284e+04 5.65e-02 8.13e+01 -1.0 1.46e+04 - 4.34e-02 1.00e+0
0h 1
7 1.8102473e+04 5.31e-02 5.32e+01 -1.0 8.15e+01 - 3.39e-01 5.40e-0
2f 1
8 1.5984440e+04 3.37e-02 2.92e+01 -1.0 4.21e+01 - 4.61e-01 5.32e-0
1f 1
9 1.6548147e+04 1.85e-02 1.19e+01 -1.0 2.05e+01 - 4.91e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6144072e+04 5.36e-03 6.46e-01 -1.0 5.18e+00 - 9.57e-01 1.00e+0
0h 1
11 1.5788316e+04 1.48e-03 5.02e-01 -1.7 7.09e+00 - 1.00e+00 7.91e-0
1f 1
12 1.5722783e+04 9.11e-04 2.19e-02 -1.7 2.03e+01 - 1.00e+00 1.00e+0
0f 1
13 1.5586559e+04 1.48e-03 1.02e-01 -3.8 2.22e+01 - 7.72e-01 9.13e-0
1f 1
14 1.5558875e+04 2.21e-03 1.08e-01 -3.8 2.09e+00 - 8.24e-01 7.29e-0
1h 1
15 1.5560019e+04 5.63e-05 1.77e-02 -3.8 2.08e-01 - 1.00e+00 9.84e-0
1h 1
16 1.5560262e+04 3.09e-07 4.27e-06 -3.8 4.50e-02 - 1.00e+00 1.00e+0
0f 1
17 1.5559217e+04 4.13e-07 5.39e-04 -5.7 1.49e-01 - 1.00e+00 9.91e-0
1h 1
18 1.5559215e+04 4.36e-11 3.50e-09 -5.7 4.62e-03 - 1.00e+00 1.00e+0
0f 1
19 1.5559202e+04 6.30e-11 2.65e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.5559202156360930e+01 1.5559202156360931e+0
4
Dual infeasibility......: 2.6490853567993446e-09 2.6490853567993446e-0
6
Constraint violation....: 6.3002034145220875e-11 6.3002034145220875e-1
1
Complementarity.........: 2.8882677715654726e-09 2.8882677715654724e-0
6
Overall NLP error.......: 2.8882677715654726e-09 2.8882677715654724e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2170342e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.24e-04 9.80e-0
3h 1
2 8.1865793e+02 1.39e+04 5.24e+01 -1.0 1.19e+04 - 2.45e-05 1.16e-0
4h 1
3 8.1591051e+02 1.39e+04 5.24e+01 -1.0 1.38e+04 - 2.07e-05 1.91e-0
4h 1
4 7.8532045e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 2.09e-04 2.17e-0
3h 1
5 5.4142278e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 2.42e-03 2.05e-0
2f 1
6 2.4429500e+04 5.67e-02 8.27e+01 -1.0 1.36e+04 - 4.07e-02 1.00e+0
0h 1
7 1.6761572e+04 5.37e-02 4.79e+01 -1.0 7.35e+01 - 4.16e-01 5.34e-0
2f 1
8 1.4872244e+04 3.69e-02 2.46e+01 -1.0 3.91e+01 - 4.88e-01 4.91e-0
1f 1
9 1.5182189e+04 2.37e-02 9.50e+00 -1.0 1.81e+01 - 4.38e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4977849e+04 5.88e-03 2.47e-01 -1.0 4.36e+00 - 9.82e-01 1.00e+0
0h 1
11 1.4672619e+04 1.36e-03 7.01e-02 -1.7 5.33e+00 - 8.19e-01 8.30e-0
1f 1
12 1.4547456e+04 1.19e-03 3.00e-01 -2.5 5.08e+00 - 8.09e-01 1.00e+0
0h 1
13 1.4492454e+04 7.40e-03 5.51e-02 -2.5 3.24e+00 - 1.00e+00 9.83e-0
1h 1
14 1.4507966e+04 2.60e-04 6.92e-03 -2.5 1.14e+00 - 1.00e+00 1.00e+0
0f 1
15 1.4481573e+04 1.87e-04 9.69e-03 -3.8 8.15e+00 - 1.00e+00 9.62e-0
1h 1
16 1.4481427e+04 4.29e-07 6.65e-05 -3.8 2.56e-01 - 1.00e+00 1.00e+0
0h 1
17 1.4480069e+04 3.85e-07 1.88e-04 -5.7 4.46e-01 - 1.00e+00 9.96e-0
1h 1
18 1.4480068e+04 3.89e-11 3.08e-09 -5.7 8.38e-02 - 1.00e+00 1.00e+0
0f 1
19 1.4480052e+04 6.30e-11 2.16e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.4480051785267101e+01 1.4480051785267100e+0
4
Dual infeasibility......: 2.1585207670582591e-09 2.1585207670582591e-0
6
Constraint violation....: 6.2994845451136428e-11 6.2994845451136428e-1
1
Complementarity.........: 2.9873716507895641e-09 2.9873716507895641e-0
6
Overall NLP error.......: 2.9873716507895641e-09 2.9873716507895641e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6853404e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.09e-04 9.80e-0
3h 1
2 8.6575083e+02 1.27e+04 5.24e+01 -1.0 1.24e+04 - 9.09e-05 1.01e-0
4h 1
3 8.5482838e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 3.44e-06 7.23e-0
4f 1
4 5.3101317e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 7.83e-04 2.21e-0
2h 1
5 2.4462827e+04 6.01e-02 8.01e+01 -1.0 1.24e+04 - 5.13e-02 1.00e+0
0h 1
6 1.6028522e+04 5.61e-02 5.31e+01 -1.0 7.18e+01 - 3.25e-01 6.11e-0
2f 1
7 1.4479224e+04 3.05e-02 2.74e+01 -1.0 3.81e+01 - 4.78e-01 4.28e-0
1f 1
8 1.4170729e+04 1.46e-02 2.56e+00 -1.0 1.10e+01 - 9.18e-01 5.00e-0
1f 2
9 1.4011987e+04 7.21e-03 1.76e+00 -1.0 7.57e+00 - 1.00e+00 4.99e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4121350e+04 5.31e-04 4.62e-02 -1.0 9.95e+01 - 1.00e+00 1.00e+0
0f 1
11 1.3672908e+04 4.48e-04 9.06e-01 -2.5 9.83e+01 - 9.13e-01 5.95e-0
1f 1
12 1.3559777e+04 1.66e-04 2.14e-01 -2.5 3.93e+01 - 9.34e-01 1.00e+0
0f 1
13 1.3534422e+04 2.78e-03 1.59e-02 -2.5 1.12e+00 - 1.00e+00 1.00e+0
0h 1
14 1.3520943e+04 7.04e-04 2.95e-02 -3.8 2.68e+00 - 8.22e-01 1.00e+0
0h 1
15 1.3518105e+04 1.98e-03 9.92e-04 -3.8 4.26e-02 - 1.00e+00 1.00e+0
0h 1
16 1.3518322e+04 5.26e-05 9.18e-05 -3.8 1.27e-02 - 1.00e+00 1.00e+0
0h 1
17 1.3517029e+04 1.06e-04 4.45e-04 -5.7 1.49e-01 - 9.48e-01 9.84e-0
1h 1
18 1.3517016e+04 2.32e-05 2.72e-03 -5.7 2.33e-03 - 1.00e+00 7.84e-0
1h 1
19 1.3517021e+04 1.15e-08 1.53e-06 -5.7 5.04e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.3517006e+04 1.07e-08 1.92e-05 -8.6 1.84e-03 - 1.00e+00 9.82e-0
1h 1
21 1.3517006e+04 1.39e-12 7.18e-11 -8.6 3.31e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.3517005774588554e+01 1.3517005774588553e+0
4
Dual infeasibility......: 7.1800068102199729e-11 7.1800068102199729e-0
8
Constraint violation....: 1.3943290966267341e-12 1.3943290966267341e-1
2
Complementarity.........: 2.5101447049509407e-09 2.5101447049509405e-0
6
Overall NLP error.......: 2.5101447049509407e-09 2.5101447049509405e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6661550e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 4.97e-04 9.80e-0
3h 1
2 8.6363291e+02 1.11e+04 5.24e+01 -1.0 9.79e+03 - 3.03e-05 1.12e-0
4h 1
3 7.2333574e+02 1.10e+04 5.24e+01 -1.0 1.11e+04 - 1.69e-05 8.42e-0
3h 1
4 5.7808667e+02 1.08e+04 5.22e+01 -1.0 1.10e+04 - 9.34e-03 2.05e-0
2h 1
5 1.9796512e+04 6.72e-02 7.99e+01 -1.0 1.08e+04 - 7.46e-02 1.00e+0
0h 1
6 1.4065448e+04 6.07e-02 2.67e+01 -1.0 5.76e+01 - 6.41e-01 8.95e-0
2f 1
7 1.2504239e+04 3.06e-02 3.42e+00 -1.0 3.47e+01 - 8.19e-01 4.95e-0
1f 1
8 1.2326032e+04 8.78e-03 4.28e-01 -1.0 9.08e+00 - 9.42e-01 1.00e+0
0f 1
9 1.2079566e+04 2.22e-03 5.39e-01 -1.7 3.96e+00 - 5.93e-01 7.47e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2079771e+04 1.54e-04 9.51e-01 -1.7 8.42e+00 - 5.63e-01 1.00e+0
0f 1
11 1.2079176e+04 5.70e-05 2.41e-01 -1.7 1.37e+01 - 6.85e-01 1.00e+0
0f 1
12 1.2098655e+04 1.41e-05 1.27e-03 -1.7 1.89e+01 - 9.95e-01 1.00e+0
0f 1
13 1.1993260e+04 6.19e-05 2.08e-02 -2.5 3.68e+01 - 1.00e+00 9.81e-0
1f 1
14 1.1968522e+04 2.92e-03 7.60e-02 -3.8 8.85e+00 - 6.49e-01 9.93e-0
1h 1
15 1.1963732e+04 5.75e-03 1.15e-02 -3.8 6.65e-02 - 8.47e-01 1.00e+0
0h 1
16 1.1964251e+04 7.06e-05 4.95e-04 -3.8 1.62e-02 - 1.00e+00 1.00e+0
0h 1
17 1.1962580e+04 1.36e-04 8.89e-04 -5.7 4.46e-01 - 9.38e-01 1.00e+0
0h 1
18 1.1962584e+04 3.99e-05 5.36e-03 -5.7 1.55e-03 - 1.00e+00 7.07e-0
1h 1
19 1.1962595e+04 1.40e-08 1.62e-06 -5.7 1.06e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.1962577e+04 9.49e-09 2.23e-05 -8.6 5.53e-03 - 1.00e+00 9.82e-0
1h 1
21 1.1962577e+04 1.60e-12 8.14e-11 -8.6 9.90e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.1962576507618726e+01 1.1962576507618725e+0
4
Dual infeasibility......: 8.1420995905457852e-11 8.1420995905457846e-0
8
Constraint violation....: 1.6038281813735011e-12 1.6038281813735011e-1
2
Complementarity.........: 3.0317692008007331e-09 3.0317692008007329e-0
6
Overall NLP error.......: 3.0317692008007331e-09 3.0317692008007329e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891839e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0614875e+02 9.19e+03 5.23e+01 -1.0 8.94e+03 - 8.31e-05 1.02e-0
4h 1
3 8.8589053e+02 9.18e+03 5.23e+01 -1.0 9.18e+03 - 4.99e-06 1.11e-0
3f 1
4 4.8290407e+02 8.97e+03 5.24e+01 -1.0 9.18e+03 - 1.26e-03 2.28e-0
2h 1
5 2.1194856e+04 6.67e-02 7.66e+01 -1.0 8.97e+03 - 8.32e-02 1.00e+0
0h 1
6 1.3110859e+04 6.01e-02 3.76e+01 -1.0 2.89e+01 - 4.83e-01 9.02e-0
2f 1
7 1.1611939e+04 1.94e-02 1.53e+01 -1.0 1.53e+01 - 6.18e-01 7.42e-0
1f 1
8 1.1669715e+04 5.64e-03 1.25e+00 -1.0 2.10e+00 - 9.91e-01 5.00e-0
1f 2
9 1.1851856e+04 3.17e-04 6.99e-02 -1.0 2.45e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1303065e+04 2.21e-03 9.19e-02 -2.5 2.21e+01 - 8.56e-01 8.21e-0
1f 1
11 1.1134535e+04 2.12e-03 4.58e-01 -2.5 3.77e+00 - 1.00e+00 7.49e-0
1f 1
12 1.1105283e+04 1.58e-04 4.78e-03 -2.5 9.43e-01 - 1.00e+00 1.00e+0
0h 1
13 1.1088904e+04 4.25e-05 1.63e-01 -3.8 2.68e+00 - 1.00e+00 7.50e-0
1h 1
14 1.1084573e+04 1.45e-07 3.58e-04 -3.8 6.70e-01 - 1.00e+00 1.00e+0
0f 1
15 1.1083348e+04 2.78e-08 9.22e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 1.1083335e+04 1.87e-12 1.33e-08 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
17 1.1083321e+04 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.1083320752611073e+01 1.1083320752611073e+0
4
Dual infeasibility......: 4.4776952149653162e-09 4.4776952149653162e-0
6
Constraint violation....: 2.6309301959237530e-12 2.6309301959237530e-1
2
Complementarity.........: 3.6085004294478621e-09 3.6085004294478619e-0
6
Overall NLP error.......: 4.4776952149653162e-09 4.4776952149653162e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2296054e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1571270e+02 6.70e+03 5.23e+01 -1.0 4.60e+03 - 1.30e-05 3.15e-0
4h 1
3 4.2797948e+02 6.55e+03 5.24e+01 -1.0 6.70e+03 - 2.24e-04 2.35e-0
2h 1
4 1.9299628e+04 6.83e-02 7.77e+01 -1.0 6.55e+03 - 6.26e-02 1.00e+0
0h 1
5 1.1011211e+04 6.30e-02 4.17e+01 -1.0 1.59e+01 - 4.45e-01 7.15e-0
2f 1
6 9.6133739e+03 1.74e-02 1.83e+01 -1.0 9.77e+00 - 6.18e-01 9.11e-0
1f 1
7 9.8840102e+03 2.09e-03 1.66e-01 -1.0 2.94e+00 - 9.91e-01 1.00e+0
0f 1
8 9.4106138e+03 1.73e-03 1.03e-01 -1.7 8.33e+00 - 1.00e+00 1.00e+0
0f 1
9 9.2373073e+03 2.02e-03 3.90e-01 -2.5 5.16e+00 - 1.00e+00 7.86e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.2145210e+03 2.75e-04 8.28e-02 -2.5 1.09e+00 - 1.00e+00 9.10e-0
1h 1
11 9.2179467e+03 1.04e-05 3.29e-03 -2.5 9.90e-02 - 1.00e+00 1.00e+0
0f 1
12 9.1855792e+03 1.00e-05 9.82e-03 -3.8 1.34e+01 - 1.00e+00 9.56e-0
1f 1
13 9.1846100e+03 1.55e-08 1.45e-05 -3.8 5.87e-01 - 1.00e+00 1.00e+0
0f 1
14 9.1828211e+03 1.79e-08 5.06e-06 -5.7 7.43e-01 - 1.00e+00 1.00e+0
0f 1
15 9.1828008e+03 6.40e-13 4.11e-10 -8.6 9.20e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 9.1828007917959731e+00 9.1828007917959731e+0
3
Dual infeasibility......: 4.1130968152638741e-10 4.1130968152638741e-0
7
Constraint violation....: 6.4021010715009652e-13 6.4021010715009652e-1
3
Complementarity.........: 2.9035659154439903e-09 2.9035659154439903e-0
6
Overall NLP error.......: 2.9035659154439903e-09 2.9035659154439903e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8772454e+02 4.77e+03 5.24e+01 -1.0 4.82e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8463069e+02 4.77e+03 5.24e+01 -1.0 4.12e+03 - 4.65e-05 1.15e-0
4h 1
3 6.9026580e+02 4.73e+03 5.24e+01 -1.0 4.77e+03 - 2.20e-05 8.53e-0
3f 1
4 4.0829894e+02 4.63e+03 5.20e+01 -1.0 4.73e+03 - 1.12e-02 2.07e-0
2h 1
5 1.3286166e+04 7.24e-02 7.77e+01 -1.0 4.63e+03 - 9.89e-02 1.00e+0
0h 1
6 7.8843061e+03 6.35e-02 2.09e+01 -1.0 4.48e+01 - 7.03e-01 1.14e-0
1f 1
7 6.3730708e+03 2.46e-02 2.05e+00 -1.0 2.21e+01 - 9.31e-01 6.56e-0
1f 1
8 6.5551437e+03 3.66e-03 1.36e+00 -1.0 3.60e+00 - 4.18e-01 1.00e+0
0f 1
9 6.7389187e+03 4.85e-04 9.97e-01 -1.0 6.00e+00 - 5.63e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0749298e+03 1.79e-03 1.27e-01 -1.7 3.63e+00 - 9.28e-01 1.00e+0
0f 1
11 5.9427710e+03 1.18e-03 1.78e-01 -2.5 3.12e+00 - 8.82e-01 6.72e-0
1f 1
12 5.9424509e+03 1.26e-06 7.34e-03 -2.5 3.69e+00 - 1.00e+00 1.00e+0
0h 1
13 5.9215682e+03 3.72e-06 5.85e-02 -3.8 5.80e+00 - 9.53e-01 8.91e-0
1f 1
14 5.9183954e+03 5.54e-04 6.77e-04 -3.8 6.28e-01 - 1.00e+00 1.00e+0
0f 1
15 5.9173097e+03 5.09e-05 1.05e-02 -5.7 2.97e-01 - 8.33e-01 1.00e+0
0h 1
16 5.9171983e+03 3.29e-05 3.63e-05 -5.7 9.25e-03 - 1.00e+00 1.00e+0
0h 1
17 5.9172013e+03 5.85e-07 6.22e-06 -5.7 1.16e-03 - 1.00e+00 1.00e+0
0h 1
18 5.9171874e+03 4.03e-08 8.22e-05 -8.6 3.68e-03 - 1.00e+00 9.43e-0
1h 1
19 5.9171866e+03 7.65e-12 6.97e-11 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 5.9171865514632067e+00 5.9171865514632063e+0
3
Dual infeasibility......: 6.9688949088684439e-11 6.9688949088684439e-0
8
Constraint violation....: 7.6462169928959156e-12 7.6462169928959156e-1
2
Complementarity.........: 3.3347617910270412e-09 3.3347617910270409e-0
6
Overall NLP error.......: 3.3347617910270412e-09 3.3347617910270409e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6642462e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 4.97e-04 9.81e-0
3h 1
2 8.6166973e+02 3.24e+03 5.24e+01 -1.0 1.78e+03 - 3.43e-05 1.80e-0
4h 1
3 3.1407266e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 9.62e-05 2.24e-0
2f 1
4 1.5404000e+04 5.91e-02 8.11e+01 -1.0 3.17e+03 - 3.62e-02 1.00e+0
0h 1
5 6.7204816e+03 5.60e-02 5.89e+01 -1.0 7.11e+01 - 2.71e-01 4.74e-0
2f 1
6 4.9268594e+03 2.53e-02 3.18e+01 -1.0 3.51e+01 - 4.68e-01 5.22e-0
1f 1
7 4.4315069e+03 1.19e-02 2.56e+00 -1.0 9.58e+00 - 9.27e-01 1.00e+0
0f 1
8 4.7750401e+03 6.02e-04 6.78e-02 -1.0 2.91e+00 - 9.97e-01 1.00e+0
0f 1
9 4.1958337e+03 6.59e-04 3.54e-01 -2.5 7.48e+00 - 8.90e-01 7.46e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.1311832e+03 2.03e-04 2.33e-01 -2.5 3.62e+00 - 9.11e-01 1.00e+0
0h 1
11 4.1149292e+03 1.80e-04 1.07e-01 -2.5 9.31e-01 - 1.00e+00 7.31e-0
1H 1
12 4.1119663e+03 3.45e-04 2.18e-03 -2.5 1.46e-01 - 1.00e+00 1.00e+0
0f 1
13 4.0880964e+03 1.22e-03 3.17e-02 -3.8 1.07e+01 - 7.97e-01 1.00e+0
0h 1
14 4.0847468e+03 2.76e-03 1.10e-03 -3.8 4.88e-02 - 1.00e+00 1.00e+0
0h 1
15 4.0851060e+03 3.91e-05 1.31e-04 -3.8 1.37e-02 - 1.00e+00 1.00e+0
0h 1
16 4.0833633e+03 1.01e-04 3.57e-04 -5.7 5.94e-01 - 9.51e-01 9.77e-0
1h 1
17 4.0833439e+03 2.19e-05 3.67e-03 -5.7 1.35e-02 - 1.00e+00 7.84e-0
1h 1
18 4.0833449e+03 8.57e-09 1.20e-06 -5.7 2.92e-03 - 1.00e+00 1.00e+0
0f 1
19 4.0833247e+03 9.02e-09 1.93e-05 -8.6 7.37e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 4.0833244e+03 1.37e-12 6.48e-11 -8.6 1.22e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 4.0833243956749214e+00 4.0833243956749216e+0
3
Dual infeasibility......: 6.4815378152153253e-11 6.4815378152153253e-0
8
Constraint violation....: 1.3692380562702056e-12 1.3692380562702056e-1
2
Complementarity.........: 3.1591728661258728e-09 3.1591728661258727e-0
6
Overall NLP error.......: 3.1591728661258728e-09 3.1591728661258727e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8038781e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.82e-0
3h 1
2 8.7405326e+02 2.00e+03 5.24e+01 -1.0 1.17e+03 - 4.28e-05 2.39e-0
4h 1
3 8.4458602e+02 1.99e+03 5.24e+01 -1.0 1.99e+03 - 1.65e-04 1.15e-0
3h 1
4 2.9615894e+02 1.95e+03 5.25e+01 -1.0 1.99e+03 - 1.31e-03 2.21e-0
2f 1
5 1.3635598e+04 6.24e-02 7.94e+01 -1.0 1.95e+03 - 5.84e-02 1.00e+0
0h 1
6 5.4864213e+03 5.78e-02 5.12e+01 -1.0 6.24e+01 - 3.41e-01 6.79e-0
2f 1
7 4.1281367e+03 3.11e-02 2.44e+01 -1.0 3.17e+01 - 5.11e-01 4.26e-0
1f 1
8 3.3955832e+03 1.03e-02 1.86e+00 -1.0 1.09e+01 - 9.21e-01 8.98e-0
1f 1
9 3.7897833e+03 2.86e-04 1.52e-01 -1.0 4.70e+00 - 9.44e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.1209608e+03 1.21e-03 1.04e+00 -1.7 2.38e+01 - 4.22e-01 9.93e-0
1f 1
11 3.1949608e+03 4.65e-05 2.46e-02 -1.7 9.79e+00 - 1.00e+00 1.00e+0
0f 1
12 3.0704155e+03 5.11e-05 1.64e-01 -2.5 2.97e+01 - 1.00e+00 8.68e-0
1f 1
13 3.0643748e+03 8.29e-05 2.55e-03 -2.5 9.40e-01 - 1.00e+00 1.00e+0
0f 1
14 3.0433022e+03 2.56e-04 7.45e-02 -3.8 9.88e+00 - 7.80e-01 9.73e-0
1h 1
15 3.0407858e+03 1.58e-03 2.51e-02 -3.8 4.91e-01 - 9.26e-02 1.00e+0
0f 1
16 3.0408432e+03 3.40e-05 1.15e-05 -3.8 3.86e-02 - 1.00e+00 1.00e+0
0h 1
17 3.0392743e+03 1.65e-04 1.33e-03 -5.7 4.54e-01 - 9.09e-01 1.00e+0
0h 1
18 3.0392317e+03 4.34e-05 1.14e-05 -5.7 9.70e-03 - 1.00e+00 1.00e+0
0h 1
19 3.0392348e+03 1.07e-06 6.83e-06 -5.7 1.50e-03 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 3.0392193e+03 7.90e-08 7.19e-05 -8.6 5.53e-03 - 1.00e+00 9.42e-0
1h 1
21 3.0392184e+03 8.13e-12 9.41e-11 -8.6 3.22e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 3.0392183926582721e+00 3.0392183926582720e+0
3
Dual infeasibility......: 9.4121612049240311e-11 9.4121612049240311e-0
8
Constraint violation....: 8.1288309417004712e-12 8.1288309417004712e-1
2
Complementarity.........: 2.7304102187026648e-09 2.7304102187026648e-0
6
Overall NLP error.......: 2.7304102187026648e-09 2.7304102187026648e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 40
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 20
inequality constraints with only lower bounds: 11
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6492412e+02 9.17e+02 5.24e+01 -1.0 9.19e+02 - 4.97e-04 9.89e-0
3h 1
2 8.2552091e+02 9.16e+02 5.24e+01 -1.0 8.55e+02 - 1.04e-04 1.46e-0
3h 1
3 2.6387997e+02 8.96e+02 5.25e+01 -1.0 9.16e+02 - 1.47e-03 2.17e-0
2h 1
4 1.2384702e+04 6.06e-02 8.03e+01 -1.0 8.96e+02 - 5.22e-02 1.00e+0
0h 1
5 4.2399598e+03 5.65e-02 5.20e+01 -1.0 7.08e+01 - 3.41e-01 6.24e-0
2f 1
6 2.6549968e+03 3.03e-02 2.65e+01 -1.0 3.86e+01 - 4.84e-01 4.36e-0
1f 1
7 2.1303652e+03 1.40e-02 2.43e+00 -1.0 1.08e+01 - 9.19e-01 1.00e+0
0f 1
8 2.4414493e+03 3.98e-04 7.93e-02 -1.0 4.22e+00 - 9.94e-01 1.00e+0
0f 1
9 1.8914333e+03 6.09e-04 4.65e-01 -2.5 8.02e+00 - 8.88e-01 6.96e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8248634e+03 2.40e-04 3.62e-01 -2.5 1.15e+01 - 8.86e-01 1.00e+0
0h 1
11 1.8165650e+03 7.74e-04 4.11e-01 -2.5 1.72e+00 - 1.00e+00 2.38e-0
1h 2
12 1.7973393e+03 8.03e-04 1.01e-02 -2.5 1.34e+00 - 1.00e+00 1.00e+0
0h 1
13 1.7623890e+03 1.23e-03 3.34e-02 -3.8 2.15e+01 - 7.94e-01 1.00e+0
0h 1
14 1.7592262e+03 2.55e-03 9.69e-04 -3.8 5.46e-02 - 1.00e+00 1.00e+0
0h 1
15 1.7595595e+03 4.48e-05 1.23e-04 -3.8 1.45e-02 - 1.00e+00 1.00e+0
0h 1
16 1.7572351e+03 1.02e-04 3.49e-04 -5.7 1.19e+00 - 9.51e-01 9.76e-0
1h 1
17 1.7572031e+03 2.26e-05 3.70e-03 -5.7 2.80e-02 - 1.00e+00 7.80e-0
1h 1
18 1.7572008e+03 8.69e-09 1.24e-06 -5.7 6.15e-03 - 1.00e+00 1.00e+0
0f 1
19 1.7571734e+03 9.04e-09 1.92e-05 -8.6 1.47e-02 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7571729e+03 1.37e-12 6.49e-11 -8.6 2.44e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.7571729285155233e+00 1.7571729285155234e+0
3
Dual infeasibility......: 6.4899926404693332e-11 6.4899926404693339e-0
8
Constraint violation....: 1.3667955656160302e-12 1.3667955656160302e-1
2
Complementarity.........: 2.5092441239336471e-09 2.5092441239336473e-0
6
Overall NLP error.......: 2.5092441239336471e-09 2.5092441239336473e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.04e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.57e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235660171e+00 1.6104063235660171e+0
3
Dual infeasibility......: 2.4574009793760635e-12 2.4574009793760635e-0
9
Constraint violation....: 7.5703172614159067e-16 7.5703172614159067e-1
6
Complementarity.........: 2.5062163919681798e-09 2.5062163919681799e-0
6
Overall NLP error.......: 2.5062163919681798e-09 2.5062163919681799e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318724481455e-09 2.1031318724481455e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896894379e-09 2.8882108896894380e-0
6
Overall NLP error.......: 2.8882108896894379e-09 2.8882108896894380e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101521e-01 6.4890146112101525e+0
2
Dual infeasibility......: 4.9126605618489413e-09 4.9126605618489413e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984918224e-09 4.3646094984918221e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605618489413e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.04e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.57e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235660171e+00 1.6104063235660171e+0
3
Dual infeasibility......: 2.4574009793760635e-12 2.4574009793760635e-0
9
Constraint violation....: 7.5703172614159067e-16 7.5703172614159067e-1
6
Complementarity.........: 2.5062163919681798e-09 2.5062163919681799e-0
6
Overall NLP error.......: 2.5062163919681798e-09 2.5062163919681799e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 42
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 21
inequality constraints with only lower bounds: 12
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2200714e+02 9.17e+02 5.24e+01 -1.0 9.18e+02 - 3.31e-04 9.90e-0
3h 1
2 7.8010851e+02 9.16e+02 5.24e+01 -1.0 8.58e+02 - 1.15e-04 1.53e-0
3h 1
3 2.4431317e+02 8.97e+02 5.26e+01 -1.0 9.16e+02 - 1.55e-03 2.07e-0
2h 1
4 1.1939245e+04 5.60e-02 8.25e+01 -1.0 8.97e+02 - 3.99e-02 1.00e+0
0h 1
5 3.8457183e+03 5.32e-02 5.18e+01 -1.0 7.71e+01 - 3.68e-01 5.19e-0
2f 1
6 1.9024420e+03 3.68e-02 2.73e+01 -1.0 3.95e+01 - 4.77e-01 4.99e-0
1f 1
7 2.5789659e+03 2.03e-02 1.38e+01 -1.0 2.01e+01 - 4.09e-01 2.50e-0
1f 3
8 1.9890222e+03 6.85e-03 3.05e-01 -1.0 7.20e+00 - 9.82e-01 1.00e+0
0f 1
9 1.6909203e+03 1.30e-03 2.86e-01 -1.7 5.37e+00 - 1.00e+00 8.66e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8151128e+03 8.81e-04 1.23e-02 -1.7 1.78e+02 - 1.00e+00 1.00e+0
0f 1
11 1.5352317e+03 1.41e-03 9.62e-02 -3.8 1.84e+02 - 7.91e-01 9.29e-0
1f 1
12 1.5043468e+03 1.61e-03 7.96e-02 -3.8 1.09e+01 - 8.40e-01 7.53e-0
1h 1
13 1.5024425e+03 3.35e-06 8.53e-04 -3.8 2.64e+00 - 1.00e+00 1.00e+0
0h 1
14 1.5003425e+03 2.76e-07 6.93e-04 -5.7 1.34e+00 - 1.00e+00 9.87e-0
1h 1
15 1.5003209e+03 3.64e-11 6.71e-09 -5.7 2.53e-01 - 1.00e+00 1.00e+0
0f 1
16 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.66e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.5002932874428685e+00 1.5002932874428684e+0
3
Dual infeasibility......: 2.1734498505776642e-09 2.1734498505776642e-0
6
Constraint violation....: 6.2999147565356850e-11 6.2999147565356850e-1
1
Complementarity.........: 3.0748995733025994e-09 3.0748995733025992e-0
6
Overall NLP error.......: 3.0748995733025994e-09 3.0748995733025992e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6471232e+02 9.17e+02 5.24e+01 -1.0 9.18e+02 - 4.97e-04 9.90e-0
3h 1
2 8.1209417e+02 9.16e+02 5.24e+01 -1.0 8.71e+02 - 1.14e-04 1.95e-0
3h 1
3 2.6481235e+02 8.96e+02 5.25e+01 -1.0 9.16e+02 - 1.98e-03 2.15e-0
2h 1
4 1.2150276e+04 6.12e-02 8.03e+01 -1.0 8.96e+02 - 5.34e-02 1.00e+0
0h 1
5 4.2145491e+03 5.69e-02 5.11e+01 -1.0 6.95e+01 - 3.52e-01 6.39e-0
2f 1
6 2.6321385e+03 3.03e-02 2.57e+01 -1.0 3.84e+01 - 4.90e-01 4.37e-0
1f 1
7 2.1293462e+03 1.36e-02 2.34e+00 -1.0 1.08e+01 - 9.20e-01 1.00e+0
0f 1
67 1.330535e+04 1.632511e+04 5.386510e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6794703e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.80e-0
3f 1
2 7.6502059e+02 1.57e+04 5.25e+01 -1.0 1.45e+04 - 3.26e-05 1.07e-0
4h 1
3 7.0467679e+02 1.57e+04 5.26e+01 -1.0 1.57e+04 - 1.09e-05 4.79e-0
3h 1
4 5.8464540e+02 1.54e+04 5.26e+01 -1.0 1.57e+04 - 5.10e-03 1.93e-0
2h 1
5 2.4827042e+04 6.31e-02 8.49e+01 -1.0 1.54e+04 - 3.35e-02 1.00e+0
0h 1
6 1.8159630e+04 6.02e-02 5.15e+01 -1.0 6.21e+01 - 3.96e-01 4.92e-0
2f 1
7 1.6670031e+04 4.56e-02 2.38e+01 -1.0 2.93e+01 - 5.32e-01 4.29e-0
1f 1
8 1.7215654e+04 2.76e-02 8.96e+00 -1.0 1.50e+01 - 4.96e-01 2.50e-0
1f 3
9 1.6795893e+04 5.68e-03 1.03e-01 -1.0 5.87e+00 - 9.92e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6503844e+04 9.81e-04 1.05e-01 -1.7 1.07e+01 - 9.50e-01 8.95e-0
1f 1
11 1.6383337e+04 1.59e-03 2.02e-01 -2.5 4.99e+00 - 8.09e-01 1.00e+0
0f 1
12 1.6342427e+04 2.95e-03 3.98e-02 -2.5 2.66e+00 - 1.00e+00 9.84e-0
1h 1
13 1.6352526e+04 1.55e-04 4.51e-03 -2.5 2.12e+00 - 1.00e+00 1.00e+0
0f 1
14 1.6326848e+04 1.68e-04 1.08e-02 -3.8 8.04e+00 - 9.96e-01 9.57e-0
1h 1
15 1.6326479e+04 5.53e-07 6.35e-05 -3.8 3.47e-01 - 1.00e+00 1.00e+0
0h 1
16 1.6325121e+04 3.82e-07 1.41e-04 -5.7 4.46e-01 - 1.00e+00 9.97e-0
1h 1
17 1.6325122e+04 3.86e-11 3.16e-09 -5.7 3.06e-02 - 1.00e+00 1.00e+0
0f 1
18 1.6325106e+04 5.98e-11 1.47e-05 -8.6 5.52e-03 - 1.00e+00 9.76e-0
1h 1
19 1.6325105e+04 3.62e-14 1.18e-12 -8.6 1.44e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.6325105280139166e+01 1.6325105280139165e+0
4
Dual infeasibility......: 1.1822506458895922e-12 1.1822506458895922e-0
9
Constraint violation....: 3.6193270602780103e-14 3.6193270602780103e-1
4
Complementarity.........: 7.1634835133358931e-09 7.1634835133358934e-0
6
Overall NLP error.......: 7.1634835133358931e-09 7.1634835133358934e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.1743324e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 3.14e-04 9.80e-0
3h 1
2 8.1457102e+02 1.50e+04 5.24e+01 -1.0 1.43e+04 - 4.70e-05 1.03e-0
4h 1
3 8.0810014e+02 1.50e+04 5.24e+01 -1.0 1.49e+04 - 6.49e-06 4.88e-0
4f 1
4 7.9975166e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 4.95e-04 6.51e-0
4h 1
5 5.5173509e+02 1.46e+04 5.26e+01 -1.0 1.50e+04 - 1.32e-03 2.10e-0
2f 1
6 2.5834448e+04 5.58e-02 8.29e+01 -1.0 1.46e+04 - 3.83e-02 1.00e+0
0h 1
7 1.7841984e+04 5.31e-02 5.35e+01 -1.0 7.63e+01 - 3.52e-01 5.07e-0
2f 1
8 1.5957267e+04 3.86e-02 2.78e+01 -1.0 3.81e+01 - 4.81e-01 4.90e-0
1f 1
9 1.6288444e+04 2.39e-02 1.21e+01 -1.0 1.94e+01 - 4.16e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6043043e+04 6.14e-03 2.50e-01 -1.0 4.99e+00 - 9.85e-01 1.00e+0
0h 1
11 1.5744583e+04 1.36e-03 3.55e-01 -1.7 5.09e+00 - 1.00e+00 8.40e-0
1f 1
12 1.5719305e+04 8.17e-04 1.38e-02 -1.7 2.60e+01 - 1.00e+00 1.00e+0
0f 1
13 1.5591118e+04 1.25e-03 4.26e-02 -3.8 3.35e+01 - 7.91e-01 8.53e-0
1f 1
14 1.5560309e+04 1.71e-03 5.05e-02 -3.8 2.03e+00 - 8.39e-01 7.81e-0
1h 1
15 1.5560086e+04 3.93e-06 9.21e-04 -3.8 3.70e-02 - 1.00e+00 1.00e+0
0h 1
16 1.5559222e+04 2.19e-07 8.27e-04 -5.7 1.50e-01 - 1.00e+00 9.86e-0
1h 1
17 1.5559215e+04 3.33e-11 7.17e-09 -5.7 2.73e-01 - 1.00e+00 1.00e+0
0f 1
18 1.5559202e+04 6.30e-11 2.14e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5559202156636930e+01 1.5559202156636929e+0
4
Dual infeasibility......: 2.1392475665169296e-09 2.1392475665169296e-0
6
Constraint violation....: 6.2998967154115348e-11 6.2998967154115348e-1
1
Complementarity.........: 2.8880880563524757e-09 2.8880880563524756e-0
6
Overall NLP error.......: 2.8880880563524757e-09 2.8880880563524756e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9470816e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 7.46e-04 9.80e-0
3h 1
2 8.9167822e+02 1.39e+04 5.24e+01 -1.0 1.14e+04 - 1.97e-05 1.21e-0
4h 1
3 8.8735363e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 2.57e-05 3.17e-0
4h 1
4 8.0165004e+02 1.38e+04 5.24e+01 -1.0 1.39e+04 - 3.39e-04 6.37e-0
3h 1
5 6.5039933e+02 1.35e+04 5.22e+01 -1.0 1.38e+04 - 6.98e-03 2.09e-0
2f 1
6 2.3516882e+04 7.03e-02 7.75e+01 -1.0 1.35e+04 - 9.29e-02 1.00e+0
0h 1
7 1.7282323e+04 6.23e-02 3.19e+01 -1.0 4.17e+01 - 5.64e-01 1.04e-0
1f 1
8 1.5851159e+04 2.90e-02 6.07e+00 -1.0 1.99e+01 - 7.86e-01 6.29e-0
1f 1
9 1.5831190e+04 6.03e-03 1.80e+00 -1.0 3.06e+00 - 7.74e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6110735e+04 6.79e-04 1.49e+00 -1.0 3.14e+00 - 3.05e-01 1.00e+0
0f 1
11 1.6078006e+04 4.32e-05 2.88e-01 -1.0 4.47e+00 - 7.16e-01 1.00e+0
0f 1
12 1.5469340e+04 2.03e-03 2.92e-01 -1.7 2.93e+00 - 8.37e-01 1.00e+0
0f 1
13 1.5425762e+04 7.53e-04 2.04e-01 -1.7 1.27e+01 - 8.18e-01 1.00e+0
0h 1
14 1.5452420e+04 8.62e-06 1.20e-01 -1.7 2.58e+01 - 6.82e-01 1.00e+0
0h 1
15 1.5267836e+04 5.03e-04 2.50e-02 -2.5 3.66e+01 - 9.74e-01 9.42e-0
1f 1
16 1.5227456e+04 1.45e-04 7.58e-02 -3.8 1.51e+01 - 9.65e-01 8.76e-0
1h 1
17 1.5225126e+04 2.34e-07 8.44e-01 -3.8 1.64e+00 - 6.26e-01 1.00e+0
0h 1
18 1.5225032e+04 6.70e-09 1.85e-04 -3.8 3.18e-03 - 1.00e+00 1.00e+0
0h 1
19 1.5223628e+04 2.24e-08 2.56e-02 -5.7 4.46e-01 - 1.00e+00 9.10e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5223511e+04 4.15e-11 2.67e-07 -5.7 3.99e-02 - 1.00e+00 1.00e+0
0f 1
21 1.5223493e+04 2.64e-12 2.59e-06 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0h 1
22 1.5223493e+04 4.83e-15 4.29e-14 -8.6 2.26e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.5223492585863379e+01 1.5223492585863380e+0
4
Dual infeasibility......: 4.2941573321304718e-14 4.2941573321304718e-1
1
Constraint violation....: 4.8298055954014335e-15 4.8298055954014335e-1
5
Complementarity.........: 2.6258115611268330e-09 2.6258115611268328e-0
6
Overall NLP error.......: 2.6258115611268330e-09 2.6258115611268328e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8072599e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.97e-04 9.80e-0
3h 1
2 8.7789674e+02 1.27e+04 5.24e+01 -1.0 1.20e+04 - 4.34e-05 1.05e-0
4h 1
3 8.3561363e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 8.17e-06 2.82e-0
3h 1
4 5.5734101e+02 1.23e+04 5.24e+01 -1.0 1.26e+04 - 3.08e-03 2.14e-0
2h 1
5 2.3596821e+04 6.41e-02 7.95e+01 -1.0 1.23e+04 - 6.27e-02 1.00e+0
0h 1
6 1.6062798e+04 5.90e-02 4.83e+01 -1.0 5.93e+01 - 3.77e-01 7.30e-0
2f 1
7 1.4705084e+04 3.09e-02 2.18e+01 -1.0 3.10e+01 - 5.36e-01 4.36e-0
1f 1
8 1.4067839e+04 7.81e-03 1.50e+00 -1.0 1.07e+01 - 9.23e-01 8.67e-0
1f 1
9 1.4407710e+04 1.93e-04 5.57e-02 -1.0 4.34e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3755607e+04 1.35e-03 1.22e-01 -2.5 5.99e+00 - 8.78e-01 8.25e-0
1f 1
11 1.3730291e+04 1.47e-05 1.77e-02 -2.5 6.44e-01 - 1.00e+00 1.00e+0
0h 1
12 1.3696042e+04 1.20e-03 3.58e-02 -3.8 5.36e+00 - 6.98e-01 1.00e+0
0f 1
13 1.3694116e+04 9.36e-04 1.70e-03 -3.8 3.36e-02 - 9.46e-01 1.00e+0
0h 1
14 1.3694240e+04 1.23e-04 1.25e-04 -3.8 1.60e-02 - 1.00e+00 1.00e+0
0h 1
15 1.3692881e+04 1.40e-04 1.17e-03 -5.7 2.97e-01 - 9.15e-01 1.00e+0
0h 1
16 1.3692836e+04 3.59e-05 7.65e-06 -5.7 8.83e-03 - 1.00e+00 1.00e+0
0h 1
17 1.3692841e+04 4.56e-07 4.84e-06 -5.7 9.77e-04 - 1.00e+00 1.00e+0
0h 1
18 1.3692826e+04 3.72e-08 4.96e-05 -8.6 3.68e-03 - 1.00e+00 9.48e-0
1h 1
19 1.3692826e+04 6.76e-12 6.77e-11 -8.6 1.92e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.3692825537957058e+01 1.3692825537957056e+0
4
Dual infeasibility......: 6.7734069392261582e-11 6.7734069392261582e-0
8
Constraint violation....: 6.7637007106213787e-12 6.7637007106213787e-1
2
Complementarity.........: 3.7834328314940288e-09 3.7834328314940288e-0
6
Overall NLP error.......: 3.7834328314940288e-09 3.7834328314940288e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2301496e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.51e-03 9.80e-0
3h 1
2 9.2012933e+02 1.11e+04 5.23e+01 -1.0 1.02e+04 - 3.26e-05 1.08e-0
4h 1
3 8.3424142e+02 1.11e+04 5.23e+01 -1.0 1.11e+04 - 1.17e-05 5.22e-0
3h 1
4 5.7283736e+02 1.08e+04 5.22e+01 -1.0 1.11e+04 - 5.95e-03 2.13e-0
2h 1
5 2.1532475e+04 7.53e-02 7.76e+01 -1.0 1.08e+04 - 8.36e-02 1.00e+0
0h 1
6 1.5215064e+04 6.76e-02 2.23e+01 -1.0 1.30e+01 - 6.84e-01 9.54e-0
2f 1
7 1.3955436e+04 2.05e-02 7.03e+00 -1.0 9.59e+00 - 7.22e-01 8.73e-0
1f 1
8 1.4214931e+04 1.09e-02 1.48e-01 -1.0 2.63e+00 - 9.91e-01 9.34e-0
1f 1
9 1.3824998e+04 2.88e-03 1.27e+00 -1.7 1.21e+01 - 3.24e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3790770e+04 2.45e-04 3.50e-01 -1.7 1.07e+01 - 8.23e-01 1.00e+0
0h 1
11 1.3800489e+04 1.31e-04 2.83e-03 -1.7 1.27e+01 - 1.00e+00 1.00e+0
0h 1
12 1.3625843e+04 5.07e-04 2.07e-02 -3.8 3.64e+01 - 8.40e-01 8.41e-0
1f 1
13 1.3606791e+04 1.61e-04 2.23e-01 -3.8 5.75e+00 - 9.93e-01 7.11e-0
1h 1
14 1.3601605e+04 3.45e-07 3.51e-04 -3.8 1.66e+00 - 1.00e+00 1.00e+0
0h 1
15 1.3600267e+04 1.96e-08 4.29e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
16 1.3600252e+04 8.28e-13 4.94e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.3600252146657823e+01 1.3600252146657822e+0
4
Dual infeasibility......: 4.9355818300693662e-10 4.9355818300693662e-0
7
Constraint violation....: 8.2792106503859486e-13 8.2792106503859486e-1
3
Complementarity.........: 4.2419088788699020e-09 4.2419088788699022e-0
6
Overall NLP error.......: 4.2419088788699020e-09 4.2419088788699022e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8776327e+02 9.19e+03 5.24e+01 -1.0 9.28e+03 - 6.64e-04 9.80e-0
3h 1
2 8.8487848e+02 9.19e+03 5.24e+01 -1.0 8.49e+03 - 4.35e-05 1.07e-0
4h 1
3 8.1017700e+02 9.15e+03 5.24e+01 -1.0 9.19e+03 - 1.14e-05 4.07e-0
3h 1
4 4.8829987e+02 8.96e+03 5.23e+01 -1.0 9.15e+03 - 4.62e-03 2.12e-0
2h 1
5 1.9624072e+04 6.67e-02 7.88e+01 -1.0 8.96e+03 - 7.36e-02 1.00e+0
0h 1
6 1.2613352e+04 6.06e-02 4.34e+01 -1.0 5.13e+01 - 4.30e-01 8.42e-0
2f 1
7 1.1287964e+04 2.91e-02 1.67e+01 -1.0 2.55e+01 - 6.00e-01 4.84e-0
1f 1
8 1.0844638e+04 5.12e-03 9.75e-01 -1.0 9.16e+00 - 9.34e-01 7.59e-0
1f 1
9 1.1096445e+04 1.87e-04 6.07e-02 -1.0 4.66e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.0465431e+04 2.23e-03 8.01e-02 -2.5 4.76e+00 - 8.70e-01 8.69e-0
1f 1
11 1.0359674e+04 1.08e-03 4.55e-01 -2.5 7.61e-01 - 1.00e+00 6.04e-0
1f 1
12 1.0359707e+04 2.49e-06 8.14e-03 -2.5 1.53e-01 - 1.00e+00 1.00e+0
0h 1
13 1.0339422e+04 6.17e-06 2.39e-02 -3.8 5.36e+00 - 9.14e-01 8.89e-0
1f 1
14 1.0335906e+04 4.60e-04 4.72e-04 -3.8 5.91e-01 - 1.00e+00 1.00e+0
0f 1
15 1.0334764e+04 6.26e-05 1.12e-02 -5.7 2.97e-01 - 8.14e-01 1.00e+0
0h 1
16 1.0334651e+04 3.51e-05 3.92e-05 -5.7 9.55e-03 - 1.00e+00 1.00e+0
0h 1
17 1.0334652e+04 1.18e-06 1.11e-05 -5.7 1.44e-03 - 1.00e+00 9.97e-0
1h 1
18 1.0334638e+04 2.43e-09 9.98e-08 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
19 1.0334638e+04 3.43e-15 3.66e-14 -8.6 2.12e-07 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.0334637968588273e+01 1.0334637968588273e+0
4
Dual infeasibility......: 3.6596001679493479e-14 3.6596001679493479e-1
1
Constraint violation....: 3.4250867115402734e-15 3.4250867115402734e-1
5
Complementarity.........: 2.5275806295225975e-09 2.5275806295225974e-0
6
Overall NLP error.......: 2.5275806295225975e-09 2.5275806295225974e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3707629e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 2.45e-03 9.81e-0
3h 1
2 8.5523139e+02 6.68e+03 5.23e+01 -1.0 6.53e+03 - 7.68e-06 3.82e-0
3h 1
3 4.5403987e+02 6.54e+03 5.23e+01 -1.0 6.68e+03 - 4.34e-03 2.17e-0
2h 1
4 1.7781600e+04 7.81e-02 8.07e+01 -1.0 6.54e+03 - 4.36e-02 1.00e+0
0h 1
5 1.1209962e+04 7.33e-02 5.55e+01 -1.0 1.53e+01 - 3.07e-01 5.81e-0
2f 1
6 1.0338040e+04 1.80e-02 1.97e+01 -1.0 7.87e+00 - 6.50e-01 6.82e-0
1f 1
7 1.0329594e+04 8.92e-03 1.89e-01 -1.0 2.93e+00 - 9.91e-01 1.00e+0
0f 1
8 9.9909835e+03 1.40e-03 1.12e-01 -1.7 6.88e+00 - 9.68e-01 1.00e+0
0f 1
9 9.8391522e+03 1.26e-03 1.77e-01 -2.5 2.92e+00 - 8.78e-01 7.86e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.8125230e+03 6.43e-05 8.27e-03 -2.5 1.55e+00 - 1.00e+00 9.89e-0
1f 1
11 9.7857397e+03 2.38e-06 7.13e-04 -3.8 1.06e+01 - 1.00e+00 1.00e+0
0f 1
12 9.7842120e+03 2.13e-08 3.77e-06 -5.7 5.92e-01 - 1.00e+00 1.00e+0
0h 1
13 9.7841926e+03 1.77e-12 4.08e-10 -8.6 7.36e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 13
(scaled) (unscaled)
Objective...............: 9.7841925911029435e+00 9.7841925911029430e+0
3
Dual infeasibility......: 4.0756762786788744e-10 4.0756762786788744e-0
7
Constraint violation....: 1.7683771114107572e-12 1.7683771114107572e-1
2
Complementarity.........: 2.8663194818563036e-09 2.8663194818563035e-0
6
Overall NLP error.......: 2.8663194818563036e-09 2.8663194818563035e-0
6
Number of objective function evaluations = 14
Number of objective gradient evaluations = 14
Number of equality constraint evaluations = 14
Number of inequality constraint evaluations = 14
Number of equality constraint Jacobian evaluations = 14
Number of inequality constraint Jacobian evaluations = 14
Number of Lagrangian Hessian evaluations = 13
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8769624e+02 4.77e+03 5.24e+01 -1.0 4.82e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8418913e+02 4.77e+03 5.24e+01 -1.0 3.56e+03 - 3.31e-05 1.33e-0
4h 1
3 3.6133643e+02 4.66e+03 5.25e+01 -1.0 4.77e+03 - 4.21e-05 2.30e-0
2f 1
4 1.7154392e+04 6.18e-02 8.10e+01 -1.0 4.66e+03 - 3.09e-02 1.00e+0
0h 1
5 8.5606749e+03 5.89e-02 6.28e+01 -1.0 5.79e+01 - 2.24e-01 4.28e-0
2f 1
6 7.0723371e+03 2.48e-02 3.20e+01 -1.0 2.57e+01 - 4.96e-01 5.40e-0
1f 1
7 6.3632320e+03 1.23e-02 2.18e+00 -1.0 9.60e+00 - 9.29e-01 8.90e-0
1f 1
8 6.7901981e+03 4.37e-04 9.60e-02 -1.0 4.08e+00 - 9.97e-01 1.00e+0
0f 1
9 6.0056331e+03 2.23e-03 2.19e-01 -2.5 5.68e+00 - 8.65e-01 9.64e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.9387448e+03 1.04e-03 6.18e-01 -2.5 1.28e+00 - 1.00e+00 5.72e-0
1h 1
11 5.9432414e+03 3.94e-06 8.27e-03 -2.5 5.96e-01 - 1.00e+00 1.00e+0
0h 1
12 5.9223333e+03 4.93e-06 4.05e-02 -3.8 8.04e+00 - 9.21e-01 8.83e-0
1f 1
13 5.9186052e+03 4.67e-04 5.93e-04 -3.8 9.39e-01 - 1.00e+00 1.00e+0
0f 1
14 5.9173166e+03 6.39e-05 1.15e-02 -5.7 4.46e-01 - 8.12e-01 1.00e+0
0h 1
15 5.9172009e+03 3.63e-05 4.14e-05 -5.7 9.71e-03 - 1.00e+00 1.00e+0
0h 1
16 5.9172026e+03 1.61e-06 4.52e-05 -5.7 1.47e-03 - 1.00e+00 9.88e-0
1h 1
17 5.9172051e+03 3.53e-08 5.15e-07 -5.7 2.92e-04 - 1.00e+00 1.00e+0
0f 1
18 5.9171869e+03 3.96e-08 7.27e-06 -8.6 5.53e-03 - 9.97e-01 9.81e-0
1h 1
19 5.9171866e+03 5.33e-13 2.97e-11 -8.6 1.06e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 5.9171865529268075e+00 5.9171865529268071e+0
3
Dual infeasibility......: 2.9739302444130658e-11 2.9739302444130658e-0
8
Constraint violation....: 5.3290705182007514e-13 5.3290705182007514e-1
3
Complementarity.........: 3.1845911741412112e-09 3.1845911741412109e-0
6
Overall NLP error.......: 3.1845911741412112e-09 3.1845911741412109e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6637182e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 4.97e-04 9.82e-0
3h 1
2 8.6042939e+02 3.24e+03 5.24e+01 -1.0 1.84e+03 - 3.26e-05 2.28e-0
4h 1
3 3.1417401e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 1.47e-04 2.23e-0
2f 1
4 1.5379505e+04 5.92e-02 8.10e+01 -1.0 3.17e+03 - 3.78e-02 1.00e+0
0h 1
5 6.7093918e+03 5.60e-02 5.74e+01 -1.0 7.11e+01 - 2.87e-01 4.89e-0
2f 1
6 4.9418778e+03 2.59e-02 3.09e+01 -1.0 3.57e+01 - 4.68e-01 5.10e-0
1f 1
7 4.4134385e+03 1.24e-02 2.54e+00 -1.0 9.80e+00 - 9.26e-01 1.00e+0
0f 1
8 4.8172359e+03 7.35e-04 6.16e-02 -1.0 3.06e+00 - 9.96e-01 1.00e+0
0f 1
9 4.2456064e+03 7.96e-04 2.08e-01 -1.7 5.73e+01 - 1.00e+00 8.91e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2840502e+03 9.46e-05 2.83e-02 -1.7 4.60e+01 - 1.00e+00 1.00e+0
0f 1
11 4.1196181e+03 7.26e-05 1.88e-02 -2.5 8.67e+01 - 1.00e+00 9.81e-0
1f 1
12 4.0897107e+03 2.83e-03 7.72e-02 -3.8 1.47e+01 - 6.58e-01 9.88e-0
1h 1
13 4.0847021e+03 5.96e-03 1.14e-02 -3.8 1.62e-01 - 8.54e-01 1.00e+0
0h 1
14 4.0853459e+03 9.90e-05 6.44e-04 -3.8 1.90e-02 - 1.00e+00 1.00e+0
0h 1
15 4.0833342e+03 1.53e-04 9.39e-04 -5.7 7.43e-01 - 9.35e-01 1.00e+0
0h 1
16 4.0833362e+03 4.82e-05 6.07e-03 -5.7 1.40e-03 - 1.00e+00 6.86e-0
1h 1
17 4.0833469e+03 1.22e-08 2.27e-06 -5.7 1.20e-04 - 1.00e+00 1.00e+0
0f 1
18 4.0833248e+03 9.68e-09 2.17e-05 -8.6 9.21e-03 - 1.00e+00 9.82e-0
1h 1
19 4.0833244e+03 1.63e-12 8.01e-11 -8.6 1.62e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 4.0833243975727678e+00 4.0833243975727678e+0
3
Dual infeasibility......: 8.0052835197042964e-11 8.0052835197042964e-0
8
Constraint violation....: 1.6303625116620424e-12 1.6303625116620424e-1
2
Complementarity.........: 2.9542366813389705e-09 2.9542366813389703e-0
6
Overall NLP error.......: 2.9542366813389705e-09 2.9542366813389703e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4538520e+02 2.00e+03 5.24e+01 -1.0 2.02e+03 - 3.98e-04 9.81e-0
3f 1
2 8.4231260e+02 2.00e+03 5.24e+01 -1.0 1.79e+03 - 1.02e-04 1.10e-0
4h 1
3 7.1124430e+02 1.99e+03 5.24e+01 -1.0 2.00e+03 - 2.16e-05 5.05e-0
3f 1
4 2.8981165e+02 1.95e+03 5.20e+01 -1.0 1.99e+03 - 1.05e-02 2.03e-0
2f 1
5 1.0201295e+04 6.58e-02 8.06e+01 -1.0 1.95e+03 - 7.71e-02 1.00e+0
0h 1
6 4.6339951e+03 5.92e-02 2.35e+01 -1.0 5.97e+01 - 6.87e-01 9.29e-0
2f 1
7 2.9806183e+03 3.57e-02 5.61e+00 -1.0 3.57e+01 - 7.27e-01 5.16e-0
1f 1
8 3.4333562e+03 5.70e-03 3.60e-01 -1.0 6.59e+00 - 9.67e-01 1.00e+0
0h 1
9 2.8155728e+03 1.00e-03 1.73e-01 -1.7 9.11e+00 - 1.00e+00 8.65e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.6595013e+03 1.27e-03 3.83e-01 -2.5 6.48e+00 - 7.67e-01 1.00e+0
0h 1
11 2.5900984e+03 2.05e-02 6.76e-02 -2.5 4.11e+00 - 9.30e-01 9.07e-0
1h 1
12 2.6017435e+03 7.28e-04 1.17e-02 -2.5 4.90e-01 - 1.00e+00 1.00e+0
0h 1
13 2.5815687e+03 2.61e-04 5.66e-02 -3.8 2.69e+00 - 9.94e-01 8.74e-0
1h 1
14 2.5805166e+03 1.09e-06 1.27e-04 -3.8 3.36e-01 - 1.00e+00 1.00e+0
0h 1
15 2.5794652e+03 3.43e-07 2.10e-03 -5.7 1.49e-01 - 1.00e+00 9.78e-0
1h 1
16 2.5794567e+03 3.85e-11 2.12e-08 -5.7 3.27e-03 - 1.00e+00 1.00e+0
0f 1
17 2.5794438e+03 6.30e-11 4.40e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 2.5794437870909337e+00 2.5794437870909337e+0
3
Dual infeasibility......: 4.3996645724951283e-09 4.3996645724951283e-0
6
Constraint violation....: 6.3006364015016914e-11 6.3006364015016914e-1
1
Complementarity.........: 3.3091807434589007e-09 3.3091807434589006e-0
6
Overall NLP error.......: 4.3996645724951283e-09 4.3996645724951283e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 42
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 21
inequality constraints with only lower bounds: 12
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2131289e+02 9.17e+02 5.24e+01 -1.0 9.18e+02 - 3.29e-04 9.90e-0
3h 1
2 7.7950410e+02 9.16e+02 5.24e+01 -1.0 8.58e+02 - 1.15e-04 1.53e-0
3h 1
3 2.4400436e+02 8.97e+02 5.26e+01 -1.0 9.16e+02 - 1.55e-03 2.07e-0
2h 1
4 1.1934830e+04 5.60e-02 8.25e+01 -1.0 8.97e+02 - 3.97e-02 1.00e+0
0h 1
5 3.8404551e+03 5.32e-02 5.21e+01 -1.0 7.71e+01 - 3.65e-01 5.18e-0
2f 1
6 1.9022860e+03 3.70e-02 2.74e+01 -1.0 3.94e+01 - 4.77e-01 4.99e-0
1f 1
7 2.5777755e+03 2.03e-02 1.39e+01 -1.0 2.00e+01 - 4.09e-01 2.50e-0
1f 3
8 1.9868206e+03 6.87e-03 2.97e-01 -1.0 7.24e+00 - 9.82e-01 1.00e+0
0f 1
9 1.6901341e+03 1.29e-03 2.82e-01 -1.7 5.32e+00 - 1.00e+00 8.67e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8150014e+03 8.77e-04 1.22e-02 -1.7 1.78e+02 - 1.00e+00 1.00e+0
0f 1
11 1.5352401e+03 1.41e-03 9.59e-02 -3.8 1.84e+02 - 7.92e-01 9.29e-0
1f 1
12 1.5043435e+03 1.60e-03 7.86e-02 -3.8 1.09e+01 - 8.40e-01 7.54e-0
1h 1
13 1.5024433e+03 3.32e-06 8.47e-04 -3.8 2.62e+00 - 1.00e+00 1.00e+0
0h 1
14 1.5003424e+03 2.78e-07 6.89e-04 -5.7 1.34e+00 - 1.00e+00 9.87e-0
1h 1
15 1.5003209e+03 3.66e-11 6.69e-09 -5.7 2.58e-01 - 1.00e+00 1.00e+0
0f 1
16 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.66e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.5002932874454673e+00 1.5002932874454673e+0
3
Dual infeasibility......: 2.1691376345423629e-09 2.1691376345423629e-0
6
Constraint violation....: 6.2998606331632345e-11 6.2998606331632345e-1
1
Complementarity.........: 3.0781916501479911e-09 3.0781916501479911e-0
6
Overall NLP error.......: 3.0781916501479911e-09 3.0781916501479911e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.30e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9751584e+02 4.12e+01 5.97e+01 -1.0 1.43e+01 - 6.95e-04 4.22e-0
2f 1
2 1.2223579e+04 6.06e-02 7.87e+01 -1.0 1.80e+01 - 7.03e-02 1.00e+0
0h 1
3 3.6164329e+03 5.54e-02 5.16e+01 -1.0 5.49e+01 - 3.32e-01 7.83e-0
2f 1
4 2.3465759e+03 2.94e-02 2.29e+01 -1.0 2.73e+01 - 5.43e-01 4.44e-0
1f 1
5 1.7431179e+03 8.60e-03 1.20e+00 -1.0 1.00e+01 - 9.27e-01 7.72e-0
1f 1
6 2.0194697e+03 3.35e-04 8.12e-02 -1.0 3.41e+00 - 1.00e+00 1.00e+0
0h 1
7 1.3873651e+03 2.09e-03 7.98e-02 -2.5 4.93e+00 - 8.66e-01 8.53e-0
1f 1
8 1.2080061e+03 2.16e-03 1.82e-01 -2.5 1.03e+00 - 1.00e+00 8.44e-0
1f 1
9 1.1988998e+03 4.22e-05 5.38e-03 -2.5 1.17e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1918825e+03 2.25e-05 1.70e+00 -3.8 9.21e-02 - 1.00e+00 4.93e-0
1h 1
11 1.1891315e+03 1.19e-06 8.07e-02 -3.8 7.42e-02 - 9.39e-01 1.00e+0
0f 1
12 1.1886810e+03 2.78e-05 1.65e-01 -3.8 2.29e-02 - 1.00e+00 4.53e-0
1h 2
13 1.1884729e+03 3.40e-06 1.12e-04 -3.8 1.09e-02 - 1.00e+00 1.00e+0
0h 1
14 1.1877427e+03 8.14e-06 5.29e-02 -5.7 1.33e-02 - 7.07e-01 9.87e-0
1h 1
15 1.1875708e+03 1.88e-05 2.10e-04 -5.7 6.61e-03 - 9.83e-01 1.00e+0
0f 1
16 1.1875745e+03 1.46e-08 1.81e-06 -5.7 1.77e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1875626e+03 1.42e-08 4.70e-05 -8.6 1.74e-04 - 9.92e-01 9.58e-0
1h 1
18 1.1875621e+03 4.32e-12 5.60e-11 -8.6 7.32e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1875621140398982e+00 1.1875621140398982e+0
3
Dual infeasibility......: 5.6018888717082778e-11 5.6018888717082778e-0
8
Constraint violation....: 4.3187675657918589e-12 4.3187675657918589e-1
2
Complementarity.........: 2.5123508014394570e-09 2.5123508014394568e-0
6
Overall NLP error.......: 2.5123508014394570e-09 2.5123508014394568e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1561990e+02 1.10e+02 1.13e+02 -1.0 3.77e+01 - 2.63e-04 3.01e-0
2f 1
2 1.1395437e+04 5.38e-02 8.36e+01 -1.0 4.54e+01 - 3.09e-02 1.00e+0
0h 1
3 2.7818473e+03 5.17e-02 6.49e+01 -1.0 8.43e+01 - 2.26e-01 4.31e-0
2f 1
4 9.8126369e+02 4.25e-02 3.38e+01 -1.0 3.40e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5879967e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.22e-01 1.00e+0
0h 1
6 9.4485133e+02 1.01e-02 8.69e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6262771e+02 4.58e-04 6.61e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536142e+02 1.94e-03 1.93e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379469e+02 3.25e-03 6.08e-02 -2.5 2.05e+00 - 1.00e+00 9.48e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140268e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388113e+02 1.57e-04 1.68e-02 -3.8 7.57e-01 - 9.93e-01 9.42e-0
1h 1
12 5.8370190e+02 7.27e-07 6.65e-05 -3.8 8.51e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278678e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.07e-09 -5.7 3.35e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148963440e-01 5.8277753148963438e+0
2
Dual infeasibility......: 2.0876318721983723e-09 2.0876318721983723e-0
6
Constraint violation....: 6.2994290339624115e-11 6.2994290339624115e-1
1
Complementarity.........: 2.8882094049232493e-09 2.8882094049232494e-0
6
Overall NLP error.......: 2.8882094049232493e-09 2.8882094049232494e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.80e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.4972529e+02 7.53e+01 9.06e+01 -1.0 2.60e+01 - 3.82e-04 3.51e-0
2f 1
2 1.1815582e+04 5.63e-02 8.12e+01 -1.0 2.88e+01 - 4.62e-02 1.00e+0
0h 1
3 3.1559622e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.63e-0
2f 1
4 1.0148156e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8314570e+03 7.32e-03 1.59e+01 -1.0 1.90e+01 - 6.01e-01 1.00e+0
0h 1
6 1.1120368e+03 5.45e-03 4.06e-01 -1.0 1.74e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8120635e+02 9.75e-04 2.00e-01 -1.7 5.70e+00 - 1.00e+00 8.93e-0
1h 1
8 7.2710036e+02 8.62e-04 1.28e-02 -1.7 3.47e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0943241e+02 1.50e-03 1.12e-01 -3.8 4.46e+00 - 7.72e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8221633e+02 2.13e-03 7.61e-02 -3.8 2.08e+00 - 8.09e-01 7.38e-0
1h 1
11 5.8339431e+02 6.73e-05 3.41e-02 -3.8 3.03e-02 - 1.00e+00 9.68e-0
1h 1
12 5.8368702e+02 2.73e-07 1.03e-05 -3.8 4.17e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278914e+02 4.12e-07 5.08e-04 -5.7 3.46e-02 - 1.00e+00 9.92e-0
1h 1
14 5.8278859e+02 4.34e-11 3.43e-09 -5.7 2.59e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.61e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753114388453e-01 5.8277753114388452e+0
2
Dual infeasibility......: 2.6079492087230195e-09 2.6079492087230195e-0
6
Constraint violation....: 6.3001326378042677e-11 6.3001326378042677e-1
1
Complementarity.........: 2.8882618207786524e-09 2.8882618207786523e-0
6
Overall NLP error.......: 2.8882618207786524e-09 2.8882618207786523e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.30e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9751584e+02 4.12e+01 5.97e+01 -1.0 1.43e+01 - 6.95e-04 4.22e-0
2f 1
2 1.2223579e+04 6.06e-02 7.87e+01 -1.0 1.80e+01 - 7.03e-02 1.00e+0
0h 1
3 3.6164329e+03 5.54e-02 5.16e+01 -1.0 5.49e+01 - 3.32e-01 7.83e-0
2f 1
4 2.3465759e+03 2.94e-02 2.29e+01 -1.0 2.73e+01 - 5.43e-01 4.44e-0
1f 1
5 1.7431179e+03 8.60e-03 1.20e+00 -1.0 1.00e+01 - 9.27e-01 7.72e-0
1f 1
6 2.0194697e+03 3.35e-04 8.12e-02 -1.0 3.41e+00 - 1.00e+00 1.00e+0
0h 1
7 1.3873651e+03 2.09e-03 7.98e-02 -2.5 4.93e+00 - 8.66e-01 8.53e-0
1f 1
8 1.2080061e+03 2.16e-03 1.82e-01 -2.5 1.03e+00 - 1.00e+00 8.44e-0
1f 1
9 1.1988998e+03 4.22e-05 5.38e-03 -2.5 1.17e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1918825e+03 2.25e-05 1.70e+00 -3.8 9.21e-02 - 1.00e+00 4.93e-0
1h 1
11 1.1891315e+03 1.19e-06 8.07e-02 -3.8 7.42e-02 - 9.39e-01 1.00e+0
0f 1
12 1.1886810e+03 2.78e-05 1.65e-01 -3.8 2.29e-02 - 1.00e+00 4.53e-0
1h 2
13 1.1884729e+03 3.40e-06 1.12e-04 -3.8 1.09e-02 - 1.00e+00 1.00e+0
0h 1
14 1.1877427e+03 8.14e-06 5.29e-02 -5.7 1.33e-02 - 7.07e-01 9.87e-0
1h 1
15 1.1875708e+03 1.88e-05 2.10e-04 -5.7 6.61e-03 - 9.83e-01 1.00e+0
0f 1
16 1.1875745e+03 1.46e-08 1.81e-06 -5.7 1.77e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1875626e+03 1.42e-08 4.70e-05 -8.6 1.74e-04 - 9.92e-01 9.58e-0
1h 1
18 1.1875621e+03 4.32e-12 5.60e-11 -8.6 7.32e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1875621140398982e+00 1.1875621140398982e+0
3
Dual infeasibility......: 5.6018888717082778e-11 5.6018888717082778e-0
8
Constraint violation....: 4.3187675657918589e-12 4.3187675657918589e-1
2
Complementarity.........: 2.5123508014394570e-09 2.5123508014394568e-0
6
Overall NLP error.......: 2.5123508014394570e-09 2.5123508014394568e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 44
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 22
inequality constraints with only lower bounds: 13
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2105481e+02 9.17e+02 5.24e+01 -1.0 9.17e+02 - 3.29e-04 9.91e-0
3h 1
2 7.8065809e+02 9.16e+02 5.24e+01 -1.0 8.56e+02 - 1.27e-04 1.48e-0
3h 1
3 2.4395135e+02 8.97e+02 5.26e+01 -1.0 9.16e+02 - 1.48e-03 2.07e-0
2h 1
4 1.1962075e+04 5.59e-02 8.39e+01 -1.0 8.97e+02 - 2.37e-02 1.00e+0
0h 1
5 3.9299416e+03 5.39e-02 6.76e+01 -1.0 7.98e+01 - 1.98e-01 3.75e-0
2f 1
6 1.9766077e+03 4.39e-02 3.59e+01 -1.0 3.41e+01 - 4.75e-01 5.40e-0
1f 1
7 2.6430489e+03 1.90e-02 2.06e+01 -1.0 1.92e+01 - 3.77e-01 2.50e-0
1f 3
8 1.9466472e+03 7.67e-03 3.73e-01 -1.0 9.95e+00 - 9.84e-01 1.00e+0
0f 1
9 1.6817735e+03 1.32e-03 2.74e-01 -1.7 4.75e+00 - 1.00e+00 8.77e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8384474e+03 9.53e-04 5.82e-02 -1.7 2.03e+02 - 8.47e-01 1.00e+0
0f 1
11 1.5561412e+03 1.16e-03 5.20e-02 -2.5 1.82e+02 - 9.18e-01 1.00e+0
0f 1
12 1.5401708e+03 1.24e-03 1.54e-02 -2.5 1.09e+00 - 1.00e+00 1.00e+0
0h 1
13 1.5073898e+03 2.19e-04 1.04e-01 -3.8 2.50e+01 - 1.00e+00 8.35e-0
1h 1
14 1.5025667e+03 5.22e-07 1.33e-04 -3.8 3.75e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5003221e+03 4.01e-07 1.61e-04 -5.7 1.33e+00 - 1.00e+00 9.97e-0
1h 1
16 1.5003209e+03 3.89e-11 2.95e-09 -5.7 4.50e-02 - 1.00e+00 1.00e+0
0f 1
17 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.66e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5002932872773149e+00 1.5002932872773149e+0
3
Dual infeasibility......: 2.1694086650069918e-09 2.1694086650069918e-0
6
Constraint violation....: 6.2995580973890242e-11 6.2995580973890242e-1
1
Complementarity.........: 2.8882197045934635e-09 2.8882197045934635e-0
6
Overall NLP error.......: 2.8882197045934635e-09 2.8882197045934635e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
1 8.6380599e+02 9.17e+02 5.24e+01 -1.0 9.17e+02 - 4.93e-04 9.91e-0
3h 1
2 8.1484758e+02 9.16e+02 5.24e+01 -1.0 8.67e+02 - 1.26e-04 1.82e-0
3h 1
3 2.6425757e+02 8.96e+02 5.25e+01 -1.0 9.16e+02 - 1.81e-03 2.15e-0
2h 1
4 1.2212863e+04 6.09e-02 8.27e+01 -1.0 8.96e+02 - 2.49e-02 1.00e+0
0h 1
5 4.3707543e+03 5.83e-02 6.49e+01 -1.0 6.82e+01 - 2.17e-01 3.86e-0
2f 1
6 2.4142201e+03 3.46e-02 3.47e+01 -1.0 3.16e+01 - 4.80e-01 6.11e-0
1f 1
68 1.457550e+04 1.632511e+04 5.442089e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1154264e+02 1.57e+04 5.50e+01 -1.0 1.59e+04 - 1.75e-04 9.80e-0
3h 1
2 7.0856654e+02 1.57e+04 5.50e+01 -1.0 1.38e+04 - 2.58e-05 1.13e-0
4h 1
3 7.0116920e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 1.70e-05 5.97e-0
4h 1
4 4.8498409e+02 1.54e+04 5.40e+01 -1.0 1.57e+04 - 6.08e-04 1.87e-0
2h 1
5 2.6445026e+04 7.61e-02 8.73e+01 -1.0 1.54e+04 - 2.08e-02 1.00e+0
0h 1
6 1.7905395e+04 7.36e-02 7.63e+01 -1.0 7.94e+01 - 1.35e-01 3.56e-0
2f 1
7 1.6636940e+04 4.63e-02 3.56e+01 -1.0 1.93e+01 - 5.27e-01 3.81e-0
1f 1
8 1.7141484e+04 3.51e-02 1.23e+01 -1.0 1.35e+01 - 5.62e-01 2.50e-0
1f 3
9 1.6797687e+04 7.60e-03 2.95e-01 -1.0 1.28e+00 - 9.81e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6496975e+04 7.06e-04 1.48e+00 -1.7 5.60e+00 - 2.26e-01 9.19e-0
1f 1
11 1.6487385e+04 1.49e-04 5.40e-01 -1.7 4.33e+00 - 7.18e-01 1.00e+0
0f 1
12 1.6477053e+04 1.45e-04 1.95e-01 -1.7 1.23e+01 - 5.30e-01 1.00e+0
0f 1
13 1.6378738e+04 8.18e-04 6.96e-02 -2.5 4.55e+00 - 9.13e-01 1.00e+0
0f 1
14 1.6347865e+04 1.59e-03 1.67e-02 -2.5 6.31e+00 - 1.00e+00 1.00e+0
0h 1
15 1.6328835e+04 2.82e-04 1.08e-01 -3.8 9.29e+00 - 1.00e+00 8.32e-0
1h 1
16 1.6326484e+04 5.07e-07 1.27e-04 -3.8 1.35e+00 - 1.00e+00 1.00e+0
0h 1
17 1.6325120e+04 4.03e-07 1.02e-04 -5.7 4.44e-01 - 1.00e+00 9.98e-0
1h 1
18 1.6325122e+04 3.82e-11 3.01e-09 -5.7 6.57e-02 - 1.00e+00 1.00e+0
0f 1
19 1.6325106e+04 5.99e-11 1.43e-05 -8.6 5.52e-03 - 1.00e+00 9.77e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325105e+04 3.50e-14 1.13e-12 -8.6 1.51e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.6325105280062314e+01 1.6325105280062313e+0
4
Dual infeasibility......: 1.1299104856867351e-12 1.1299104856867351e-0
9
Constraint violation....: 3.5027536426923689e-14 3.5027536426923689e-1
4
Complementarity.........: 7.0841126998588229e-09 7.0841126998588229e-0
6
Overall NLP error.......: 7.0841126998588229e-09 7.0841126998588229e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.4941815e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.08e-04 9.80e-0
3f 1
2 7.4648225e+02 1.50e+04 5.25e+01 -1.0 1.38e+04 - 3.30e-05 1.08e-0
4h 1
3 7.4437345e+02 1.50e+04 5.25e+01 -1.0 1.49e+04 - 1.15e-05 1.57e-0
4h 1
4 7.4307086e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 1.67e-04 9.92e-0
5h 1
5 4.9128808e+02 1.47e+04 5.28e+01 -1.0 1.50e+04 - 2.71e-04 1.96e-0
2f 1
6 2.6013278e+04 6.58e-02 8.55e+01 -1.0 1.47e+04 - 2.76e-02 1.00e+0
0h 1
7 1.7379737e+04 6.33e-02 7.03e+01 -1.0 7.94e+01 - 1.85e-01 4.12e-0
2f 1
8 1.5905884e+04 4.54e-02 3.41e+01 -1.0 2.55e+01 - 5.09e-01 4.16e-0
1f 1
9 1.6187520e+04 3.37e-02 1.27e+01 -1.0 1.52e+01 - 4.96e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6018443e+04 5.45e-03 2.08e-01 -1.0 2.48e+00 - 9.88e-01 1.00e+0
0h 1
11 1.5729969e+04 9.21e-04 2.25e-01 -1.7 4.76e+00 - 1.00e+00 8.87e-0
1f 1
12 1.5719115e+04 7.65e-04 9.26e-03 -1.7 2.98e+01 - 1.00e+00 1.00e+0
0f 1
13 1.5596041e+04 1.08e-03 1.99e-02 -3.8 3.97e+01 - 8.05e-01 8.13e-0
1f 1
14 1.5560785e+04 1.63e-03 3.14e-02 -3.8 2.15e+00 - 8.48e-01 8.06e-0
1h 1
15 1.5560077e+04 3.77e-06 8.53e-04 -3.8 6.02e-02 - 1.00e+00 1.00e+0
0h 1
16 1.5559222e+04 2.21e-07 7.96e-04 -5.7 1.50e-01 - 1.00e+00 9.86e-0
1h 1
17 1.5559215e+04 3.35e-11 6.82e-09 -5.7 2.47e-01 - 1.00e+00 1.00e+0
0f 1
18 1.5559202e+04 6.30e-11 2.06e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5559202156675015e+01 1.5559202156675015e+0
4
Dual infeasibility......: 2.0613586107558158e-09 2.0613586107558158e-0
6
Constraint violation....: 6.2997121408336909e-11 6.2997121408336909e-1
1
Complementarity.........: 2.8880902606834005e-09 2.8880902606834003e-0
6
Overall NLP error.......: 2.8880902606834005e-09 2.8880902606834003e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6706278e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 5.00e-04 9.80e-0
3h 1
2 8.6423393e+02 1.39e+04 5.24e+01 -1.0 1.32e+04 - 4.45e-05 1.04e-0
4h 1
3 8.3022131e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 7.28e-06 2.45e-0
3h 1
4 5.7314457e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 2.64e-03 2.13e-0
2h 1
5 2.4873762e+04 6.18e-02 8.03e+01 -1.0 1.36e+04 - 5.49e-02 1.00e+0
0h 1
6 1.7170711e+04 5.74e-02 5.00e+01 -1.0 6.79e+01 - 3.65e-01 6.56e-0
2f 1
7 1.5600368e+04 3.05e-02 2.47e+01 -1.0 3.80e+01 - 4.99e-01 4.38e-0
1f 1
8 1.5106848e+04 1.33e-02 2.24e+00 -1.0 1.07e+01 - 9.21e-01 1.00e+0
0f 1
9 1.5395964e+04 3.86e-04 8.25e-02 -1.0 4.24e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4874887e+04 5.36e-04 5.58e-01 -2.5 7.30e+00 - 8.90e-01 6.66e-0
1f 1
11 1.4797233e+04 2.23e-04 3.77e-01 -2.5 2.40e+00 - 8.89e-01 1.00e+0
0h 1
12 1.4774735e+04 6.18e-03 2.14e-01 -2.5 1.62e+00 - 1.00e+00 6.03e-0
1h 1
13 1.4765550e+04 6.82e-04 5.55e-03 -2.5 4.58e-01 - 1.00e+00 1.00e+0
0f 1
14 1.4747131e+04 1.11e-03 2.82e-02 -3.8 5.36e+00 - 8.12e-01 1.00e+0
0h 1
15 1.4744186e+04 2.16e-03 1.07e-03 -3.8 4.60e-02 - 1.00e+00 1.00e+0
0h 1
16 1.4744562e+04 4.56e-05 1.39e-04 -3.8 1.53e-02 - 1.00e+00 1.00e+0
0h 1
17 1.4743093e+04 1.06e-04 4.52e-04 -5.7 2.97e-01 - 9.50e-01 9.84e-0
1h 1
18 1.4743085e+04 2.24e-05 3.39e-03 -5.7 4.74e-03 - 1.00e+00 7.90e-0
1h 1
19 1.4743089e+04 9.13e-09 1.15e-06 -5.7 9.94e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.4743072e+04 9.12e-09 1.89e-05 -8.6 3.68e-03 - 1.00e+00 9.83e-0
1h 1
21 1.4743072e+04 1.35e-12 6.39e-11 -8.6 6.17e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.4743071865416026e+01 1.4743071865416025e+0
4
Dual infeasibility......: 6.3927568793339876e-11 6.3927568793339882e-0
8
Constraint violation....: 1.3501422202466529e-12 1.3501422202466529e-1
2
Complementarity.........: 2.6493176864515420e-09 2.6493176864515420e-0
6
Overall NLP error.......: 2.6493176864515420e-09 2.6493176864515420e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4548237e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.98e-04 9.80e-0
3h 1
2 8.4261832e+02 1.27e+04 5.24e+01 -1.0 1.20e+04 - 4.62e-05 1.04e-0
4h 1
3 8.0309467e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 7.81e-06 2.58e-0
3h 1
4 5.2937834e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 2.80e-03 2.08e-0
2h 1
5 2.3335798e+04 5.94e-02 8.14e+01 -1.0 1.24e+04 - 4.97e-02 1.00e+0
0h 1
6 1.5690537e+04 5.54e-02 4.84e+01 -1.0 7.33e+01 - 3.95e-01 6.13e-0
2f 1
7 1.3663628e+04 3.60e-02 2.49e+01 -1.0 4.16e+01 - 4.90e-01 5.24e-0
1f 1
8 1.4305428e+04 1.31e-02 2.79e+00 -1.0 1.59e+01 - 7.96e-01 5.00e-0
1f 2
9 1.3827023e+04 4.20e-03 1.76e-01 -1.0 7.73e+00 - 9.59e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3455833e+04 1.11e-03 3.89e-01 -1.7 5.64e+00 - 1.00e+00 8.15e-0
1f 1
11 1.3431557e+04 4.90e-04 2.48e-02 -1.7 3.49e+01 - 1.00e+00 1.00e+0
0f 1
12 1.3269592e+04 1.39e-03 1.20e-01 -3.8 3.98e+01 - 7.60e-01 9.23e-0
1f 1
13 1.3232163e+04 2.74e-03 2.16e-02 -3.8 3.01e+00 - 8.07e-01 8.28e-0
1h 1
14 1.3233886e+04 3.09e-04 1.34e-01 -3.8 5.17e-01 - 1.00e+00 9.07e-0
1h 1
15 1.3234267e+04 4.98e-07 2.20e-05 -3.8 2.38e-01 - 1.00e+00 1.00e+0
0f 1
16 1.3233079e+04 4.18e-07 2.33e-03 -5.7 2.97e-01 - 1.00e+00 9.77e-0
1h 1
17 1.3233066e+04 4.90e-11 2.26e-08 -5.7 5.81e-02 - 1.00e+00 1.00e+0
0f 1
18 1.3233051e+04 6.30e-11 4.40e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.3233050932370656e+01 1.3233050932370656e+0
4
Dual infeasibility......: 4.3985739764762292e-09 4.3985739764762292e-0
6
Constraint violation....: 6.2987046134388436e-11 6.2987046134388436e-1
1
Complementarity.........: 4.3669577825160506e-09 4.3669577825160508e-0
6
Overall NLP error.......: 4.3985739764762292e-09 4.3985739764762292e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6571625e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 4.92e-04 9.80e-0
3h 1
2 8.6292301e+02 1.11e+04 5.24e+01 -1.0 1.09e+04 - 9.15e-05 1.01e-0
4h 1
3 8.4926251e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 3.90e-06 8.20e-0
4f 1
4 4.9468884e+02 1.09e+04 5.25e+01 -1.0 1.11e+04 - 9.00e-04 2.20e-0
2h 1
5 2.2852100e+04 5.99e-02 8.02e+01 -1.0 1.09e+04 - 5.06e-02 1.00e+0
0h 1
6 1.4463802e+04 5.59e-02 5.30e+01 -1.0 7.28e+01 - 3.29e-01 6.06e-0
2f 1
7 1.2856986e+04 3.00e-02 2.75e+01 -1.0 3.91e+01 - 4.76e-01 4.36e-0
1f 1
8 1.2340816e+04 1.41e-02 2.54e+00 -1.0 1.09e+01 - 9.19e-01 1.00e+0
0f 1
9 1.2641228e+04 4.35e-04 9.14e-02 -1.0 4.29e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2079944e+04 6.35e-04 4.28e-01 -2.5 7.83e+00 - 8.86e-01 7.07e-0
1f 1
11 1.1998678e+04 2.74e-04 3.55e-01 -2.5 2.77e+00 - 8.80e-01 1.00e+0
0h 1
12 1.1992901e+04 6.81e-04 4.87e-01 -2.5 1.53e+00 - 1.00e+00 1.47e-0
1h 2
13 1.1970037e+04 1.36e-03 1.35e-02 -2.5 1.05e+00 - 1.00e+00 1.00e+0
0h 1
14 1.1953569e+04 1.29e-03 3.49e-02 -3.8 2.68e+00 - 7.93e-01 1.00e+0
0h 1
15 1.1950531e+04 2.33e-03 8.95e-04 -3.8 4.07e-02 - 1.00e+00 1.00e+0
0h 1
16 1.1950900e+04 4.08e-05 1.74e-04 -3.8 1.56e-02 - 1.00e+00 1.00e+0
0h 1
17 1.1949565e+04 1.06e-04 3.52e-04 -5.7 1.49e-01 - 9.51e-01 9.76e-0
1h 1
18 1.1949555e+04 2.27e-05 4.14e-03 -5.7 3.59e-03 - 1.00e+00 7.86e-0
1h 1
19 1.1949558e+04 7.89e-09 1.18e-06 -5.7 7.69e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.1949543e+04 8.80e-09 2.14e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
21 1.1949543e+04 1.53e-12 7.32e-11 -8.6 3.12e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.1949542645402188e+01 1.1949542645402187e+0
4
Dual infeasibility......: 7.3241462386418484e-11 7.3241462386418491e-0
8
Constraint violation....: 1.5262235919522027e-12 1.5262235919522027e-1
2
Complementarity.........: 2.5094410815652646e-09 2.5094410815652644e-0
6
Overall NLP error.......: 2.5094410815652646e-09 2.5094410815652644e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0890313e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0580412e+02 9.19e+03 5.23e+01 -1.0 7.60e+03 - 2.53e-05 1.20e-0
4h 1
3 6.0977284e+02 9.04e+03 5.24e+01 -1.0 9.19e+03 - 2.50e-05 1.62e-0
2h 1
4 7.3775471e+02 8.79e+03 5.16e+01 -1.0 9.04e+03 - 1.91e-02 2.80e-0
2h 1
5 1.6473469e+04 8.05e-02 7.71e+01 -1.0 8.79e+03 - 1.08e-01 1.00e+0
0h 1
6 1.2523403e+04 6.93e-02 1.94e+01 -1.0 2.11e+01 - 7.28e-01 1.32e-0
1f 1
7 1.1378990e+04 1.42e-02 9.47e-01 -1.0 1.26e+01 - 9.48e-01 8.00e-0
1f 1
8 1.1688198e+04 1.32e-02 6.78e-01 -1.0 5.96e+00 - 2.80e-01 9.06e-0
1f 1
9 1.1277556e+04 2.88e-03 2.86e-01 -1.7 2.77e+00 - 8.71e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1255349e+04 8.07e-04 4.23e-01 -1.7 9.47e+00 - 7.11e-01 1.00e+0
0h 1
11 1.1289776e+04 9.70e-06 1.39e-01 -1.7 1.87e+01 - 7.59e-01 1.00e+0
0f 1
12 1.1127637e+04 4.70e-04 3.05e-02 -2.5 2.04e+01 - 9.74e-01 9.34e-0
1f 1
13 1.1113095e+04 2.28e-05 2.06e-03 -2.5 7.76e+00 - 1.00e+00 1.00e+0
0f 1
14 1.1088291e+04 1.29e-05 6.10e-02 -3.8 8.10e+00 - 1.00e+00 8.44e-0
1f 1
15 1.1084886e+04 5.04e-08 2.75e-04 -3.8 1.26e+00 - 1.00e+00 1.00e+0
0f 1
16 1.1083359e+04 2.99e-08 1.20e-03 -5.7 4.46e-01 - 1.00e+00 9.83e-0
1f 1
17 1.1083339e+04 2.25e-12 1.57e-08 -5.7 7.58e-03 - 1.00e+00 1.00e+0
0f 1
18 1.1083321e+04 2.63e-12 4.48e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1083320755197393e+01 1.1083320755197394e+0
4
Dual infeasibility......: 4.4777018206461995e-09 4.4777018206461995e-0
6
Constraint violation....: 2.6313257128762757e-12 2.6313257128762757e-1
2
Complementarity.........: 3.6907245241192806e-09 3.6907245241192806e-0
6
Overall NLP error.......: 4.4777018206461995e-09 4.4777018206461995e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2296054e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1571270e+02 6.70e+03 5.23e+01 -1.0 4.60e+03 - 1.30e-05 3.15e-0
4h 1
3 4.2797948e+02 6.55e+03 5.24e+01 -1.0 6.70e+03 - 2.24e-04 2.35e-0
2h 1
4 1.9299628e+04 6.83e-02 7.77e+01 -1.0 6.55e+03 - 6.26e-02 1.00e+0
0h 1
5 1.1011211e+04 6.30e-02 4.17e+01 -1.0 1.59e+01 - 4.45e-01 7.15e-0
2f 1
6 9.6133739e+03 1.74e-02 1.83e+01 -1.0 9.77e+00 - 6.18e-01 9.11e-0
1f 1
7 9.8840102e+03 2.09e-03 1.66e-01 -1.0 2.94e+00 - 9.91e-01 1.00e+0
0f 1
8 9.4106147e+03 1.73e-03 1.03e-01 -1.7 8.33e+00 - 1.00e+00 1.00e+0
0f 1
9 9.2373075e+03 2.02e-03 3.90e-01 -2.5 5.16e+00 - 1.00e+00 7.86e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.2145210e+03 2.75e-04 8.28e-02 -2.5 1.09e+00 - 1.00e+00 9.10e-0
1h 1
11 9.2179467e+03 1.04e-05 3.29e-03 -2.5 9.89e-02 - 1.00e+00 1.00e+0
0f 1
12 9.1855792e+03 1.00e-05 9.82e-03 -3.8 1.34e+01 - 1.00e+00 9.56e-0
1f 1
13 9.1846100e+03 1.55e-08 1.45e-05 -3.8 5.87e-01 - 1.00e+00 1.00e+0
0f 1
14 9.1828211e+03 1.79e-08 5.06e-06 -5.7 7.43e-01 - 1.00e+00 1.00e+0
0f 1
15 9.1828008e+03 6.40e-13 4.11e-10 -8.6 9.20e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 9.1828007918852244e+00 9.1828007918852236e+0
3
Dual infeasibility......: 4.1130989776796961e-10 4.1130989776796961e-0
7
Constraint violation....: 6.4026561830132778e-13 6.4026561830132778e-1
3
Complementarity.........: 2.8652631885400837e-09 2.8652631885400837e-0
6
Overall NLP error.......: 2.8652631885400837e-09 2.8652631885400837e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8772454e+02 4.77e+03 5.24e+01 -1.0 4.82e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8463069e+02 4.77e+03 5.24e+01 -1.0 4.12e+03 - 4.65e-05 1.15e-0
4h 1
3 6.9026570e+02 4.73e+03 5.24e+01 -1.0 4.77e+03 - 2.20e-05 8.53e-0
3f 1
4 4.0829897e+02 4.63e+03 5.20e+01 -1.0 4.73e+03 - 1.12e-02 2.07e-0
2h 1
5 1.3286165e+04 7.24e-02 7.77e+01 -1.0 4.63e+03 - 9.89e-02 1.00e+0
0h 1
6 7.8843059e+03 6.35e-02 2.09e+01 -1.0 4.48e+01 - 7.03e-01 1.14e-0
1f 1
7 6.3730707e+03 2.46e-02 2.05e+00 -1.0 2.21e+01 - 9.31e-01 6.56e-0
1f 1
8 6.5551437e+03 3.66e-03 1.27e+00 -1.0 3.60e+00 - 4.57e-01 1.00e+0
0f 1
9 6.7380314e+03 4.74e-04 1.02e+00 -1.0 6.42e+00 - 5.47e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.7247055e+03 8.55e-05 1.36e-01 -1.0 1.32e+01 - 6.21e-01 1.00e+0
0f 1
11 6.1037908e+03 1.85e-03 7.56e-02 -1.7 3.35e+00 - 1.00e+00 1.00e+0
0f 1
12 5.9470751e+03 1.19e-03 2.42e-01 -2.5 2.06e+01 - 9.57e-01 6.69e-0
1f 1
13 5.9425267e+03 1.67e-06 7.43e-03 -2.5 6.76e+00 - 1.00e+00 1.00e+0
0h 1
14 5.9217796e+03 3.88e-06 5.57e-02 -3.8 5.36e+00 - 9.44e-01 8.87e-0
1f 1
15 5.9184134e+03 5.28e-04 6.09e-04 -3.8 6.04e-01 - 1.00e+00 1.00e+0
0f 1
16 5.9173073e+03 5.34e-05 1.05e-02 -5.7 2.97e-01 - 8.30e-01 1.00e+0
0h 1
17 5.9171985e+03 3.22e-05 3.57e-05 -5.7 9.14e-03 - 1.00e+00 1.00e+0
0h 1
18 5.9172014e+03 5.63e-07 5.99e-06 -5.7 1.13e-03 - 1.00e+00 1.00e+0
0h 1
19 5.9171874e+03 3.93e-08 8.01e-05 -8.6 3.68e-03 - 1.00e+00 9.42e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 5.9171866e+03 7.73e-12 6.96e-11 -8.6 2.12e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 5.9171865517274496e+00 5.9171865517274491e+0
3
Dual infeasibility......: 6.9603313187413837e-11 6.9603313187413837e-0
8
Constraint violation....: 7.7308159873723525e-12 7.7308159873723525e-1
2
Complementarity.........: 3.2040567679070756e-09 3.2040567679070757e-0
6
Overall NLP error.......: 3.2040567679070756e-09 3.2040567679070757e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2280559e+02 3.24e+03 5.23e+01 -1.0 3.27e+03 - 1.51e-03 9.82e-0
3h 1
2 8.7858780e+02 3.24e+03 5.23e+01 -1.0 3.07e+03 - 2.27e-05 1.80e-0
3h 1
3 3.4987166e+02 3.16e+03 5.24e+01 -1.0 3.24e+03 - 1.77e-03 2.26e-0
2h 1
4 1.5175450e+04 7.03e-02 7.68e+01 -1.0 3.17e+03 - 8.03e-02 1.00e+0
0h 1
5 7.4650659e+03 6.35e-02 2.37e+01 -1.0 1.36e+01 - 6.58e-01 8.85e-0
2f 1
6 6.1538524e+03 2.02e-02 9.68e+00 -1.0 9.91e+00 - 6.60e-01 8.87e-0
1f 1
7 6.3688205e+03 5.76e-03 1.23e-01 -1.0 2.80e+00 - 9.91e-01 9.60e-0
1f 1
8 5.9579337e+03 2.74e-03 4.55e-01 -1.7 1.51e+01 - 7.58e-01 1.00e+0
0f 1
9 5.9328236e+03 5.82e-04 7.81e-01 -1.7 3.91e+01 - 4.38e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.9730220e+03 1.32e-05 8.10e-04 -1.7 3.37e+01 - 1.00e+00 1.00e+0
0h 1
11 5.7610846e+03 4.58e-04 2.03e-02 -2.5 7.23e+01 - 9.76e-01 9.63e-0
1f 1
12 5.7317739e+03 1.43e-04 2.08e-01 -3.8 1.85e+01 - 9.94e-01 7.21e-0
1h 1
13 5.7229548e+03 3.39e-07 3.03e-04 -3.8 5.15e+00 - 1.00e+00 1.00e+0
0h 1
14 5.7210223e+03 1.95e-08 4.42e-06 -5.7 8.91e-01 - 1.00e+00 1.00e+0
0h 1
15 5.7210000e+03 7.91e-13 4.80e-10 -8.6 1.10e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.7210000420235652e+00 5.7210000420235647e+0
3
Dual infeasibility......: 4.8013399547385102e-10 4.8013399547385102e-0
7
Constraint violation....: 7.9103390504542404e-13 7.9103390504542404e-1
3
Complementarity.........: 3.7365641444606517e-09 3.7365641444606516e-0
6
Overall NLP error.......: 3.7365641444606517e-09 3.7365641444606516e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4528265e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 3.98e-04 9.81e-0
3f 1
2 8.4160377e+02 2.00e+03 5.24e+01 -1.0 1.48e+03 - 5.91e-05 1.33e-0
4h 1
3 8.3224172e+02 2.00e+03 5.24e+01 -1.0 1.99e+03 - 4.98e-05 3.61e-0
4h 1
4 2.7582867e+02 1.95e+03 6.93e+01 -1.0 2.00e+03 - 4.04e-04 2.17e-0
2f 1
5 1.3772437e+04 5.71e-02 8.11e+01 -1.0 1.95e+03 - 4.53e-02 1.00e+0
0h 1
6 5.1464868e+03 5.36e-02 5.31e+01 -1.0 8.07e+01 - 3.38e-01 5.57e-0
2f 1
7 3.0119742e+03 3.39e-02 2.90e+01 -1.0 4.23e+01 - 4.63e-01 5.38e-0
1f 1
8 4.9722341e+03 8.65e-03 1.59e+01 -1.0 2.30e+01 - 5.99e-01 1.00e+0
0h 1
9 3.1091858e+03 6.68e-03 3.88e-01 -1.0 1.98e+01 - 9.68e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.7875005e+03 1.03e-03 8.62e-02 -1.7 5.39e+00 - 9.47e-01 9.00e-0
1f 1
11 2.6524508e+03 1.31e-03 3.02e-01 -2.5 5.80e+00 - 7.62e-01 1.00e+0
0h 1
12 2.5938399e+03 6.24e-03 4.14e-02 -2.5 3.25e+00 - 1.00e+00 1.00e+0
0h 1
13 2.6039045e+03 2.60e-04 5.70e-03 -2.5 4.52e-01 - 1.00e+00 1.00e+0
0h 1
14 2.5811576e+03 2.40e-04 4.66e-02 -3.8 3.81e+00 - 9.86e-01 8.80e-0
1h 1
15 2.5805180e+03 2.04e-06 1.55e-04 -3.8 5.18e-02 - 1.00e+00 1.00e+0
0h 1
16 2.5794636e+03 3.16e-07 2.12e-03 -5.7 1.54e-01 - 1.00e+00 9.78e-0
1h 1
17 2.5794567e+03 3.68e-11 2.12e-08 -5.7 1.65e-03 - 1.00e+00 1.00e+0
0f 1
18 2.5794438e+03 6.30e-11 4.40e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 2.5794437868149371e+00 2.5794437868149371e+0
3
Dual infeasibility......: 4.3996214553548685e-09 4.3996214553548685e-0
6
Constraint violation....: 6.3010735518176375e-11 6.3010735518176375e-1
1
Complementarity.........: 3.2999064044944248e-09 3.2999064044944249e-0
6
Overall NLP error.......: 4.3996214553548685e-09 4.3996214553548685e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 44
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 22
inequality constraints with only lower bounds: 13
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2105284e+02 9.17e+02 5.24e+01 -1.0 9.17e+02 - 3.29e-04 9.91e-0
3h 1
2 7.8065634e+02 9.16e+02 5.24e+01 -1.0 8.56e+02 - 1.27e-04 1.48e-0
3h 1
3 2.4395047e+02 8.97e+02 5.26e+01 -1.0 9.16e+02 - 1.48e-03 2.07e-0
2h 1
4 1.1962062e+04 5.59e-02 8.39e+01 -1.0 8.97e+02 - 2.37e-02 1.00e+0
0h 1
5 3.9299233e+03 5.39e-02 6.76e+01 -1.0 7.98e+01 - 1.98e-01 3.75e-0
2f 1
6 1.9766038e+03 4.39e-02 3.59e+01 -1.0 3.41e+01 - 4.75e-01 5.40e-0
1f 1
7 2.6430436e+03 1.90e-02 2.06e+01 -1.0 1.92e+01 - 3.77e-01 2.50e-0
1f 3
8 1.9466431e+03 7.67e-03 3.73e-01 -1.0 9.95e+00 - 9.84e-01 1.00e+0
0f 1
9 1.6817716e+03 1.32e-03 2.74e-01 -1.7 4.75e+00 - 1.00e+00 8.77e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8384468e+03 9.53e-04 5.82e-02 -1.7 2.03e+02 - 8.47e-01 1.00e+0
0f 1
11 1.5561412e+03 1.16e-03 5.20e-02 -2.5 1.82e+02 - 9.18e-01 1.00e+0
0f 1
12 1.5401708e+03 1.24e-03 1.54e-02 -2.5 1.09e+00 - 1.00e+00 1.00e+0
0h 1
13 1.5073898e+03 2.19e-04 1.04e-01 -3.8 2.50e+01 - 1.00e+00 8.35e-0
1h 1
14 1.5025667e+03 5.22e-07 1.33e-04 -3.8 3.75e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5003221e+03 4.01e-07 1.61e-04 -5.7 1.33e+00 - 1.00e+00 9.97e-0
1h 1
16 1.5003209e+03 3.89e-11 2.95e-09 -5.7 4.50e-02 - 1.00e+00 1.00e+0
0f 1
17 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.66e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5002932872773227e+00 1.5002932872773226e+0
3
Dual infeasibility......: 2.1693968618057362e-09 2.1693968618057362e-0
6
Constraint violation....: 6.2995816896282975e-11 6.2995816896282975e-1
1
Complementarity.........: 2.8882197035298399e-09 2.8882197035298400e-0
6
Overall NLP error.......: 2.8882197035298399e-09 2.8882197035298400e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.80e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.4975714e+02 7.52e+01 9.06e+01 -1.0 2.60e+01 - 3.82e-04 3.51e-0
2f 1
2 1.1815919e+04 5.63e-02 8.12e+01 -1.0 2.88e+01 - 4.62e-02 1.00e+0
0h 1
3 3.1562302e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.63e-0
2f 1
4 1.0148835e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8297065e+03 7.32e-03 1.59e+01 -1.0 1.90e+01 - 6.02e-01 1.00e+0
0h 1
6 1.1128342e+03 5.45e-03 4.06e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8134046e+02 9.77e-04 2.01e-01 -1.7 5.70e+00 - 1.00e+00 8.92e-0
1h 1
8 7.2720837e+02 8.60e-04 1.29e-02 -1.7 3.47e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0947041e+02 1.50e-03 1.12e-01 -3.8 4.46e+00 - 7.72e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8221078e+02 2.13e-03 7.58e-02 -3.8 2.09e+00 - 8.08e-01 7.38e-0
1h 1
11 5.8339163e+02 7.00e-05 3.54e-02 -3.8 3.04e-02 - 1.00e+00 9.67e-0
1h 1
12 5.8368704e+02 2.74e-07 1.06e-05 -3.8 4.09e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278915e+02 4.12e-07 5.11e-04 -5.7 3.46e-02 - 1.00e+00 9.92e-0
1h 1
14 5.8278859e+02 4.35e-11 3.44e-09 -5.7 2.55e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.61e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753114117836e-01 5.8277753114117832e+0
2
Dual infeasibility......: 2.6120224201554180e-09 2.6120224201554180e-0
6
Constraint violation....: 6.3001451278132947e-11 6.3001451278132947e-1
1
Complementarity.........: 2.8882624190986256e-09 2.8882624190986256e-0
6
Overall NLP error.......: 2.8882624190986256e-09 2.8882624190986256e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1564328e+02 1.10e+02 1.13e+02 -1.0 3.77e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1395770e+04 5.38e-02 8.36e+01 -1.0 4.54e+01 - 3.09e-02 1.00e+0
0h 1
3 2.7821591e+03 5.17e-02 6.49e+01 -1.0 8.43e+01 - 2.26e-01 4.31e-0
2f 1
4 9.8129392e+02 4.25e-02 3.38e+01 -1.0 3.40e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5883016e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.22e-01 1.00e+0
0h 1
6 9.4485731e+02 1.01e-02 8.69e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6262982e+02 4.58e-04 6.61e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536176e+02 1.94e-03 1.93e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379497e+02 3.25e-03 6.08e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140265e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388118e+02 1.57e-04 1.68e-02 -3.8 7.57e-01 - 9.93e-01 9.42e-0
1h 1
12 5.8370190e+02 7.28e-07 6.65e-05 -3.8 8.52e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278678e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.07e-09 -5.7 3.35e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148960543e-01 5.8277753148960539e+0
2
Dual infeasibility......: 2.0876748208095688e-09 2.0876748208095688e-0
6
Constraint violation....: 6.2993762983687418e-11 6.2993762983687418e-1
1
Complementarity.........: 2.8882094091055940e-09 2.8882094091055940e-0
6
Overall NLP error.......: 2.8882094091055940e-09 2.8882094091055940e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.80e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.4975714e+02 7.52e+01 9.06e+01 -1.0 2.60e+01 - 3.82e-04 3.51e-0
2f 1
2 1.1815919e+04 5.63e-02 8.12e+01 -1.0 2.88e+01 - 4.62e-02 1.00e+0
0h 1
3 3.1562302e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.63e-0
2f 1
4 1.0148835e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8297065e+03 7.32e-03 1.59e+01 -1.0 1.90e+01 - 6.02e-01 1.00e+0
0h 1
6 1.1128342e+03 5.45e-03 4.06e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8134046e+02 9.77e-04 2.01e-01 -1.7 5.70e+00 - 1.00e+00 8.92e-0
1h 1
8 7.2720837e+02 8.60e-04 1.29e-02 -1.7 3.47e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0947041e+02 1.50e-03 1.12e-01 -3.8 4.46e+00 - 7.72e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8221078e+02 2.13e-03 7.58e-02 -3.8 2.09e+00 - 8.08e-01 7.38e-0
1h 1
11 5.8339163e+02 7.00e-05 3.54e-02 -3.8 3.04e-02 - 1.00e+00 9.67e-0
1h 1
12 5.8368704e+02 2.74e-07 1.06e-05 -3.8 4.09e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278915e+02 4.12e-07 5.11e-04 -5.7 3.46e-02 - 1.00e+00 9.92e-0
1h 1
14 5.8278859e+02 4.35e-11 3.44e-09 -5.7 2.55e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.61e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753114117836e-01 5.8277753114117832e+0
2
Dual infeasibility......: 2.6120224201554180e-09 2.6120224201554180e-0
6
Constraint violation....: 6.3001451278132947e-11 6.3001451278132947e-1
1
Complementarity.........: 2.8882624190986256e-09 2.8882624190986256e-0
6
Overall NLP error.......: 2.8882624190986256e-09 2.8882624190986256e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.30e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9756175e+02 4.12e+01 5.96e+01 -1.0 1.43e+01 - 6.95e-04 4.22e-0
2f 1
2 1.2223878e+04 6.06e-02 7.87e+01 -1.0 1.80e+01 - 7.03e-02 1.00e+0
0h 1
3 3.6168172e+03 5.54e-02 5.16e+01 -1.0 5.49e+01 - 3.32e-01 7.83e-0
2f 1
4 2.3471779e+03 2.94e-02 2.29e+01 -1.0 2.73e+01 - 5.43e-01 4.45e-0
1f 1
5 1.7445574e+03 8.59e-03 1.20e+00 -1.0 1.00e+01 - 9.27e-01 7.72e-0
1f 1
6 2.0205295e+03 3.36e-04 8.12e-02 -1.0 3.40e+00 - 1.00e+00 1.00e+0
0h 1
7 1.3890067e+03 2.08e-03 8.00e-02 -2.5 4.92e+00 - 8.66e-01 8.53e-0
1f 1
8 1.2096119e+03 2.16e-03 1.85e-01 -2.5 1.04e+00 - 1.00e+00 8.43e-0
1f 1
9 1.1993888e+03 4.76e-05 5.19e-03 -2.5 1.21e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1924611e+03 2.58e-05 1.74e+00 -3.8 9.08e-02 - 1.00e+00 4.80e-0
1h 1
11 1.1897384e+03 1.09e-06 8.58e-02 -3.8 7.11e-02 - 9.42e-01 1.00e+0
0f 1
12 1.1892791e+03 2.57e-05 1.72e-01 -3.8 2.44e-02 - 1.00e+00 4.55e-0
1h 2
13 1.1890586e+03 3.45e-06 1.23e-04 -3.8 1.16e-02 - 1.00e+00 1.00e+0
0h 1
14 1.1883372e+03 7.20e-06 5.48e-02 -5.7 1.33e-02 - 7.09e-01 9.86e-0
1h 1
15 1.1881633e+03 1.85e-05 2.18e-04 -5.7 6.54e-03 - 9.83e-01 1.00e+0
0f 1
16 1.1881673e+03 9.40e-09 1.48e-06 -5.7 1.47e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1881553e+03 1.51e-08 4.06e-05 -8.6 1.74e-04 - 9.92e-01 9.61e-0
1h 1
18 1.1881549e+03 3.82e-12 5.17e-11 -8.6 6.90e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1881548544486766e+00 1.1881548544486766e+0
3
Dual infeasibility......: 5.1697471574772634e-11 5.1697471574772634e-0
8
Constraint violation....: 3.8201664054327011e-12 3.8201664054327011e-1
2
Complementarity.........: 2.5125025646114479e-09 2.5125025646114477e-0
6
Overall NLP error.......: 2.5125025646114479e-09 2.5125025646114477e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 44
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 22
inequality constraints with only lower bounds: 13
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2105284e+02 9.17e+02 5.24e+01 -1.0 9.17e+02 - 3.29e-04 9.91e-0
3h 1
2 7.8064551e+02 9.16e+02 5.24e+01 -1.0 8.56e+02 - 1.27e-04 1.48e-0
3h 1
3 2.4395123e+02 8.97e+02 5.26e+01 -1.0 9.16e+02 - 1.48e-03 2.07e-0
2h 1
4 1.1961872e+04 5.59e-02 8.39e+01 -1.0 8.97e+02 - 2.37e-02 1.00e+0
0h 1
5 3.9298992e+03 5.39e-02 6.76e+01 -1.0 7.98e+01 - 1.98e-01 3.75e-0
2f 1
6 1.9765927e+03 4.39e-02 3.59e+01 -1.0 3.41e+01 - 4.75e-01 5.40e-0
1f 1
7 2.6430320e+03 1.90e-02 2.06e+01 -1.0 1.92e+01 - 3.77e-01 2.50e-0
1f 3
8 1.9466477e+03 7.67e-03 3.73e-01 -1.0 9.95e+00 - 9.84e-01 1.00e+0
0f 1
9 1.6817724e+03 1.32e-03 2.74e-01 -1.7 4.75e+00 - 1.00e+00 8.77e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8384719e+03 9.53e-04 5.86e-02 -1.7 2.03e+02 - 8.46e-01 1.00e+0
0f 1
11 1.5561402e+03 1.16e-03 5.21e-02 -2.5 1.82e+02 - 9.18e-01 1.00e+0
0f 1
12 1.5401715e+03 1.24e-03 1.54e-02 -2.5 1.09e+00 - 1.00e+00 1.00e+0
0h 1
13 1.5073902e+03 2.19e-04 1.04e-01 -3.8 2.50e+01 - 1.00e+00 8.35e-0
1h 1
14 1.5025667e+03 5.23e-07 1.33e-04 -3.8 3.75e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5003221e+03 4.01e-07 1.61e-04 -5.7 1.33e+00 - 1.00e+00 9.97e-0
1h 1
16 1.5003209e+03 3.89e-11 2.95e-09 -5.7 4.50e-02 - 1.00e+00 1.00e+0
0f 1
17 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.66e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5002932872770913e+00 1.5002932872770914e+0
3
Dual infeasibility......: 2.1693971149123098e-09 2.1693971149123098e-0
6
Constraint violation....: 6.2995789140707359e-11 6.2995789140707359e-1
1
Complementarity.........: 2.8882197024678542e-09 2.8882197024678542e-0
6
Overall NLP error.......: 2.8882197024678542e-09 2.8882197024678542e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
1 8.6380402e+02 9.17e+02 5.24e+01 -1.0 9.17e+02 - 4.93e-04 9.91e-0
3h 1
2 8.1483001e+02 9.16e+02 5.24e+01 -1.0 8.67e+02 - 1.26e-04 1.82e-0
3h 1
3 2.6425769e+02 8.96e+02 5.25e+01 -1.0 9.16e+02 - 1.81e-03 2.15e-0
2h 1
4 1.2212584e+04 6.09e-02 8.27e+01 -1.0 8.96e+02 - 2.49e-02 1.00e+0
0h 1
5 4.3706988e+03 5.83e-02 6.49e+01 -1.0 6.82e+01 - 2.17e-01 3.86e-0
2f 1
6 2.4141484e+03 3.46e-02 3.47e+01 -1.0 3.16e+01 - 4.80e-01 6.11e-0
1f 1
69 1.316478e+04 1.632511e+04 5.499156e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1152978e+02 1.57e+04 5.50e+01 -1.0 1.59e+04 - 1.75e-04 9.81e-0
3h 1
2 7.0846241e+02 1.57e+04 5.50e+01 -1.0 1.30e+04 - 2.16e-05 1.20e-0
4h 1
3 7.0465935e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 2.49e-05 3.06e-0
4h 1
4 6.9441018e+02 1.57e+04 5.49e+01 -1.0 1.57e+04 - 3.28e-04 8.59e-0
4h 1
5 4.9855993e+02 1.54e+04 5.39e+01 -1.0 1.57e+04 - 1.25e-03 1.89e-0
2f 1
6 2.5936686e+04 7.61e-02 8.68e+01 -1.0 1.54e+04 - 2.58e-02 1.00e+0
0h 1
7 1.7884780e+04 7.32e-02 7.19e+01 -1.0 6.99e+01 - 1.80e-01 4.07e-0
2f 1
8 1.6630952e+04 4.63e-02 3.32e+01 -1.0 1.99e+01 - 5.33e-01 3.77e-0
1f 1
9 1.7129415e+04 3.51e-02 1.11e+01 -1.0 1.34e+01 - 5.66e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6801262e+04 7.40e-03 8.10e-01 -1.0 1.54e+00 - 9.43e-01 1.00e+0
0f 1
11 1.6819252e+04 2.01e-04 1.95e+00 -1.0 5.49e+00 - 1.85e-01 1.00e+0
0f 1
12 1.6830906e+04 5.93e-06 8.63e-01 -1.0 6.80e+00 - 5.78e-01 1.00e+0
0f 1
13 1.6533497e+04 2.34e-04 4.36e-01 -1.7 4.74e+00 - 9.41e-01 8.14e-0
1f 1
14 1.6501079e+04 7.02e-04 2.33e-01 -1.7 2.68e+01 - 5.34e-01 1.00e+0
0f 1
15 1.6516148e+04 3.03e-05 1.77e-03 -1.7 2.09e+01 - 1.00e+00 1.00e+0
0h 1
16 1.6356512e+04 1.00e-03 4.73e-02 -3.8 7.15e+01 - 8.07e-01 8.76e-0
1f 1
17 1.6326546e+04 1.48e-03 5.31e-01 -3.8 1.95e+00 - 4.49e-02 8.09e-0
1h 1
18 1.6326238e+04 8.28e-05 4.53e-02 -3.8 4.70e-02 - 1.00e+00 9.43e-0
1h 1
19 1.6326465e+04 1.98e-07 1.39e-05 -3.8 6.41e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325121e+04 4.09e-07 1.75e-04 -5.7 4.48e-01 - 1.00e+00 9.96e-0
1h 1
21 1.6325122e+04 4.17e-11 3.46e-09 -5.7 6.49e-04 - 1.00e+00 1.00e+0
0f 1
22 1.6325106e+04 5.98e-11 1.46e-05 -8.6 5.52e-03 - 1.00e+00 9.76e-0
1h 1
23 1.6325105e+04 3.59e-14 1.17e-12 -8.6 1.24e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 23
(scaled) (unscaled)
Objective...............: 1.6325105280121967e+01 1.6325105280121967e+0
4
Dual infeasibility......: 1.1650522302923244e-12 1.1650522302923244e-0
9
Constraint violation....: 3.5915714846623814e-14 3.5915714846623814e-1
4
Complementarity.........: 7.1457243474403017e-09 7.1457243474403017e-0
6
Overall NLP error.......: 7.1457243474403017e-09 7.1457243474403017e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 24
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 24
Number of inequality constraint Jacobian evaluations = 24
Number of Lagrangian Hessian evaluations = 23
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9875301e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.75e-04 9.80e-0
3h 1
2 7.9573361e+02 1.50e+04 5.25e+01 -1.0 1.30e+04 - 2.48e-05 1.14e-0
4h 1
3 7.9443842e+02 1.50e+04 5.25e+01 -1.0 1.48e+04 - 1.88e-05 9.62e-0
5h 1
4 7.9376442e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 1.13e-04 5.10e-0
5h 1
5 5.2378620e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 1.65e-04 2.07e-0
2f 1
6 2.6460008e+04 5.37e-02 8.35e+01 -1.0 1.47e+04 - 3.30e-02 1.00e+0
0h 1
7 1.7755441e+04 5.15e-02 6.36e+01 -1.0 8.26e+01 - 2.41e-01 4.53e-0
2f 1
8 1.5954794e+04 4.20e-02 3.30e+01 -1.0 3.42e+01 - 4.80e-01 4.74e-0
1f 1
9 1.6280229e+04 2.57e-02 1.49e+01 -1.0 1.85e+01 - 4.23e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6017221e+04 6.14e-03 2.28e-01 -1.0 5.27e+00 - 9.88e-01 1.00e+0
0h 1
11 1.5732419e+04 1.24e-03 2.90e-01 -1.7 4.59e+00 - 1.00e+00 8.64e-0
1f 1
12 1.5726207e+04 7.90e-04 1.12e-02 -1.7 3.53e+01 - 1.00e+00 1.00e+0
0f 1
13 1.5595992e+04 1.13e-03 2.02e-02 -3.8 4.55e+01 - 7.98e-01 8.14e-0
1f 1
14 1.5560745e+04 1.70e-03 3.28e-02 -3.8 2.17e+00 - 8.42e-01 8.01e-0
1h 1
15 1.5560060e+04 4.15e-06 9.12e-04 -3.8 4.10e-02 - 1.00e+00 1.00e+0
0h 1
16 1.5559222e+04 1.98e-07 8.77e-04 -5.7 1.50e-01 - 1.00e+00 9.85e-0
1h 1
17 1.5559215e+04 3.22e-11 7.22e-09 -5.7 2.20e-01 - 1.00e+00 1.00e+0
0f 1
18 1.5559202e+04 6.30e-11 2.10e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5559202156643918e+01 1.5559202156643918e+0
4
Dual infeasibility......: 2.0959610999702283e-09 2.0959610999702283e-0
6
Constraint violation....: 6.2998176120210303e-11 6.2998176120210303e-1
1
Complementarity.........: 2.8880847418029066e-09 2.8880847418029067e-0
6
Overall NLP error.......: 2.8880847418029066e-09 2.8880847418029067e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.0178451e+02 1.39e+04 5.25e+01 -1.0 1.40e+04 - 2.81e-04 9.80e-0
3h 1
2 7.9883194e+02 1.39e+04 5.25e+01 -1.0 1.26e+04 - 3.23e-05 1.09e-0
4h 1
3 7.1744277e+02 1.38e+04 5.25e+01 -1.0 1.39e+04 - 1.26e-05 5.66e-0
3h 1
4 5.7263436e+02 1.35e+04 5.24e+01 -1.0 1.38e+04 - 6.09e-03 1.97e-0
2h 1
5 2.2901028e+04 5.80e-02 8.37e+01 -1.0 1.35e+04 - 4.05e-02 1.00e+0
0h 1
6 1.6494818e+04 5.49e-02 3.93e+01 -1.0 6.22e+01 - 5.25e-01 5.61e-0
2f 1
7 1.4838980e+04 4.02e-02 1.78e+01 -1.0 3.51e+01 - 5.39e-01 4.64e-0
1f 1
8 1.5545846e+04 1.60e-02 4.69e+00 -1.0 9.19e+00 - 6.52e-01 5.00e-0
1f 2
9 1.5007004e+04 3.87e-03 8.92e-02 -1.0 6.38e+00 - 9.93e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4658117e+04 1.38e-03 4.84e-01 -2.5 6.50e+00 - 9.25e-01 7.31e-0
1f 1
11 1.4511385e+04 3.35e-03 1.25e-01 -2.5 6.73e+00 - 7.78e-01 1.00e+0
0f 1
12 1.4499177e+04 1.55e-03 1.25e-01 -2.5 9.63e-01 - 1.00e+00 9.02e-0
1h 1
13 1.4507219e+04 1.18e-04 2.18e-03 -2.5 4.30e-01 - 1.00e+00 1.00e+0
0f 1
14 1.4482205e+04 1.53e-04 1.89e-02 -3.8 8.04e+00 - 9.90e-01 9.35e-0
1h 1
15 1.4481427e+04 8.14e-07 6.64e-05 -3.8 5.24e-01 - 1.00e+00 1.00e+0
0h 1
16 1.4480068e+04 3.77e-07 1.45e-04 -5.7 4.46e-01 - 1.00e+00 9.97e-0
1h 1
17 1.4480068e+04 3.81e-11 3.06e-09 -5.7 1.46e-03 - 1.00e+00 1.00e+0
0f 1
18 1.4480052e+04 6.30e-11 2.10e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.4480051786923458e+01 1.4480051786923457e+0
4
Dual infeasibility......: 2.1007956630023051e-09 2.1007956630023051e-0
6
Constraint violation....: 6.2994359728563154e-11 6.2994359728563154e-1
1
Complementarity.........: 3.0010851647030499e-09 3.0010851647030500e-0
6
Overall NLP error.......: 3.0010851647030499e-09 3.0010851647030500e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2426358e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.31e-04 9.80e-0
3h 1
2 8.2129460e+02 1.27e+04 5.24e+01 -1.0 1.14e+04 - 3.19e-05 1.10e-0
4h 1
3 8.0468861e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 1.41e-05 1.07e-0
3h 1
4 5.0022825e+02 1.24e+04 5.26e+01 -1.0 1.26e+04 - 1.08e-03 2.08e-0
2h 1
5 2.3934743e+04 5.55e-02 8.33e+01 -1.0 1.24e+04 - 2.91e-02 1.00e+0
0h 1
6 1.5658676e+04 5.33e-02 6.42e+01 -1.0 7.94e+01 - 2.32e-01 4.21e-0
2f 1
7 1.3684198e+04 4.16e-02 3.43e+01 -1.0 3.60e+01 - 4.71e-01 5.29e-0
1f 1
8 1.4023820e+04 2.19e-02 1.74e+01 -1.0 1.96e+01 - 3.83e-01 1.25e-0
1f 4
9 1.3712692e+04 6.58e-03 4.04e-01 -1.0 6.78e+00 - 9.81e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3420749e+04 1.55e-03 4.11e-01 -1.7 5.11e+00 - 1.00e+00 8.24e-0
1f 1
11 1.3429438e+04 9.11e-04 7.08e-02 -1.7 6.10e+01 - 7.67e-01 1.00e+0
0f 1
12 1.3271224e+04 1.20e-03 6.12e-02 -2.5 5.59e+01 - 9.08e-01 1.00e+0
0f 1
13 1.3253185e+04 1.30e-03 1.63e-02 -2.5 1.28e+00 - 1.00e+00 1.00e+0
0h 1
14 1.3236132e+04 2.35e-04 1.11e-01 -3.8 6.27e+00 - 1.00e+00 8.29e-0
1h 1
15 1.3234269e+04 7.32e-07 1.45e-04 -3.8 7.04e-01 - 1.00e+00 1.00e+0
0h 1
16 1.3233063e+04 3.98e-07 1.64e-04 -5.7 2.92e-01 - 1.00e+00 9.97e-0
1h 1
17 1.3233066e+04 3.89e-11 2.96e-09 -5.7 5.10e-02 - 1.00e+00 1.00e+0
0f 1
18 1.3233051e+04 6.30e-11 2.17e-09 -8.6 3.69e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.3233050933629496e+01 1.3233050933629496e+0
4
Dual infeasibility......: 2.1733160269749658e-09 2.1733160269749658e-0
6
Constraint violation....: 6.2995858529646398e-11 6.2995858529646398e-1
1
Complementarity.........: 3.2977312993352408e-09 3.2977312993352407e-0
6
Overall NLP error.......: 3.2977312993352408e-09 3.2977312993352407e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1202326e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.08e-03 9.80e-0
3h 1
2 9.0917648e+02 1.11e+04 5.23e+01 -1.0 1.03e+04 - 3.76e-05 1.07e-0
4h 1
3 8.4234287e+02 1.11e+04 5.23e+01 -1.0 1.11e+04 - 1.05e-05 4.10e-0
3h 1
4 5.5434167e+02 1.08e+04 5.23e+01 -1.0 1.11e+04 - 4.60e-03 2.15e-0
2h 1
5 2.1866528e+04 7.11e-02 7.73e+01 -1.0 1.08e+04 - 8.51e-02 1.00e+0
0h 1
6 1.5008207e+04 6.38e-02 3.05e+01 -1.0 2.31e+01 - 5.78e-01 9.51e-0
2f 1
7 1.3484685e+04 1.54e-02 1.08e+01 -1.0 1.39e+01 - 6.76e-01 8.28e-0
1f 1
8 1.3850791e+04 1.49e-03 9.42e-02 -1.0 3.86e+00 - 9.92e-01 1.00e+0
0f 1
9 1.3388857e+04 1.78e-03 7.72e-01 -1.7 9.61e+00 - 5.60e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3343933e+04 4.07e-04 4.77e-01 -1.7 1.26e+01 - 7.13e-01 1.00e+0
0h 1
11 1.3349312e+04 7.01e-05 1.49e-03 -1.7 1.23e+01 - 1.00e+00 1.00e+0
0h 1
12 1.3174498e+04 5.38e-04 2.29e-02 -3.8 3.50e+01 - 8.38e-01 8.34e-0
1f 1
13 1.3149613e+04 1.61e-04 1.03e-01 -3.8 5.78e+00 - 9.85e-01 7.83e-0
1h 1
14 1.3145959e+04 2.68e-07 2.98e-02 -3.8 1.26e+00 - 9.70e-01 1.00e+0
0h 1
15 1.3145908e+04 2.78e-09 1.02e-05 -3.8 2.18e-04 - 1.00e+00 1.00e+0
0h 1
16 1.3144579e+04 1.84e-08 1.07e-03 -5.7 2.97e-01 - 1.00e+00 9.85e-0
1f 1
17 1.3144564e+04 1.82e-12 8.07e-09 -5.7 4.38e-03 - 1.00e+00 1.00e+0
0f 1
18 1.3144548e+04 2.63e-12 2.56e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.3144547706641736e+01 1.3144547706641737e+0
4
Dual infeasibility......: 2.5627315610358707e-09 2.5627315610358707e-0
6
Constraint violation....: 2.6307775402578670e-12 2.6307775402578670e-1
2
Complementarity.........: 4.1411098006444001e-09 4.1411098006443998e-0
6
Overall NLP error.......: 4.1411098006444001e-09 4.1411098006443998e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8777320e+02 9.19e+03 5.24e+01 -1.0 9.28e+03 - 6.64e-04 9.80e-0
3h 1
2 8.8499164e+02 9.19e+03 5.24e+01 -1.0 8.96e+03 - 8.88e-05 1.02e-0
4h 1
3 8.6604553e+02 9.18e+03 5.24e+01 -1.0 9.18e+03 - 4.81e-06 1.03e-0
3f 1
4 4.6753384e+02 8.97e+03 5.24e+01 -1.0 9.18e+03 - 1.16e-03 2.24e-0
2h 1
5 2.1019834e+04 6.31e-02 7.87e+01 -1.0 8.97e+03 - 6.27e-02 1.00e+0
0h 1
6 1.2779542e+04 5.82e-02 5.04e+01 -1.0 5.68e+01 - 3.45e-01 7.15e-0
2f 1
7 1.1474093e+04 2.98e-02 2.31e+01 -1.0 2.74e+01 - 5.30e-01 4.48e-0
1f 1
8 1.0826912e+04 8.86e-03 1.29e+00 -1.0 1.03e+01 - 9.25e-01 7.95e-0
1f 1
9 1.1132672e+04 2.56e-04 7.50e-02 -1.0 3.69e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.0462579e+04 2.14e-03 9.04e-02 -2.5 5.27e+00 - 8.69e-01 8.83e-0
1f 1
11 1.0356962e+04 1.11e-03 4.48e-01 -2.5 8.53e-01 - 1.00e+00 6.12e-0
1f 1
12 1.0357041e+04 2.64e-06 8.39e-03 -2.5 1.73e-01 - 1.00e+00 1.00e+0
0h 1
13 1.0339021e+04 7.22e-06 6.55e-03 -3.8 2.68e+00 - 9.00e-01 8.93e-0
1f 1
14 1.0335760e+04 4.68e-04 3.83e-04 -3.8 2.86e-01 - 1.00e+00 1.00e+0
0f 1
15 1.0334765e+04 6.30e-05 1.15e-02 -5.7 1.49e-01 - 8.13e-01 1.00e+0
0h 1
16 1.0334649e+04 3.63e-05 4.09e-05 -5.7 9.71e-03 - 1.00e+00 1.00e+0
0h 1
17 1.0334650e+04 1.61e-06 3.43e-05 -5.7 1.54e-03 - 1.00e+00 9.90e-0
1h 1
18 1.0334653e+04 3.53e-08 5.13e-07 -5.7 2.92e-04 - 1.00e+00 1.00e+0
0f 1
19 1.0334638e+04 3.96e-08 7.26e-06 -8.6 1.84e-03 - 9.97e-01 9.81e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.0334638e+04 5.32e-13 2.97e-11 -8.6 3.54e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.0334637966969122e+01 1.0334637966969121e+0
4
Dual infeasibility......: 2.9731376972386614e-11 2.9731376972386614e-0
8
Constraint violation....: 5.3179682879544998e-13 5.3179682879544998e-1
3
Complementarity.........: 2.5100786379102897e-09 2.5100786379102896e-0
6
Overall NLP error.......: 2.5100786379102897e-09 2.5100786379102896e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2296054e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1571270e+02 6.70e+03 5.23e+01 -1.0 4.60e+03 - 1.30e-05 3.15e-0
4h 1
3 4.2797948e+02 6.55e+03 5.24e+01 -1.0 6.70e+03 - 2.24e-04 2.35e-0
2h 1
4 1.9299628e+04 6.83e-02 7.77e+01 -1.0 6.55e+03 - 6.26e-02 1.00e+0
0h 1
5 1.1011211e+04 6.30e-02 4.17e+01 -1.0 1.59e+01 - 4.45e-01 7.15e-0
2f 1
6 9.6133739e+03 1.74e-02 1.83e+01 -1.0 9.77e+00 - 6.18e-01 9.11e-0
1f 1
7 9.8840102e+03 2.09e-03 1.66e-01 -1.0 2.94e+00 - 9.91e-01 1.00e+0
0f 1
8 9.4106164e+03 1.73e-03 1.03e-01 -1.7 8.33e+00 - 1.00e+00 1.00e+0
0f 1
9 9.2373078e+03 2.02e-03 3.90e-01 -2.5 5.16e+00 - 1.00e+00 7.86e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.2145210e+03 2.75e-04 8.28e-02 -2.5 1.09e+00 - 1.00e+00 9.10e-0
1h 1
11 9.2179467e+03 1.04e-05 3.29e-03 -2.5 9.89e-02 - 1.00e+00 1.00e+0
0f 1
12 9.1855792e+03 1.00e-05 9.82e-03 -3.8 1.34e+01 - 1.00e+00 9.56e-0
1f 1
13 9.1846100e+03 1.55e-08 1.45e-05 -3.8 5.87e-01 - 1.00e+00 1.00e+0
0f 1
14 9.1828211e+03 1.79e-08 5.06e-06 -5.7 7.43e-01 - 1.00e+00 1.00e+0
0f 1
15 9.1828008e+03 6.40e-13 4.11e-10 -8.6 9.20e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 9.1828007874601809e+00 9.1828007874601808e+0
3
Dual infeasibility......: 4.1131000251333442e-10 4.1131000251333442e-0
7
Constraint violation....: 6.4037664060379029e-13 6.4037664060379029e-1
3
Complementarity.........: 2.7917135236622967e-09 2.7917135236622967e-0
6
Overall NLP error.......: 2.7917135236622967e-09 2.7917135236622967e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8769624e+02 4.77e+03 5.24e+01 -1.0 4.82e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8418913e+02 4.77e+03 5.24e+01 -1.0 3.56e+03 - 3.31e-05 1.33e-0
4h 1
3 3.6133643e+02 4.66e+03 5.25e+01 -1.0 4.77e+03 - 4.21e-05 2.30e-0
2f 1
4 1.7154392e+04 6.18e-02 8.10e+01 -1.0 4.66e+03 - 3.09e-02 1.00e+0
0h 1
5 8.5606749e+03 5.89e-02 6.28e+01 -1.0 5.79e+01 - 2.24e-01 4.28e-0
2f 1
6 7.0723371e+03 2.48e-02 3.20e+01 -1.0 2.57e+01 - 4.96e-01 5.40e-0
1f 1
7 6.3632320e+03 1.23e-02 2.18e+00 -1.0 9.60e+00 - 9.29e-01 8.90e-0
1f 1
8 6.7901981e+03 4.37e-04 9.56e-02 -1.0 4.08e+00 - 9.97e-01 1.00e+0
0f 1
9 6.0055432e+03 2.23e-03 2.19e-01 -2.5 5.68e+00 - 8.65e-01 9.64e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.9387021e+03 1.04e-03 6.18e-01 -2.5 1.36e+00 - 1.00e+00 5.72e-0
1h 1
11 5.9432405e+03 3.94e-06 8.27e-03 -2.5 6.38e-01 - 1.00e+00 1.00e+0
0h 1
12 5.9223332e+03 4.93e-06 4.05e-02 -3.8 8.04e+00 - 9.21e-01 8.83e-0
1f 1
13 5.9186051e+03 4.67e-04 5.93e-04 -3.8 9.39e-01 - 1.00e+00 1.00e+0
0f 1
14 5.9173166e+03 6.39e-05 1.15e-02 -5.7 4.46e-01 - 8.12e-01 1.00e+0
0h 1
15 5.9172009e+03 3.63e-05 4.14e-05 -5.7 9.71e-03 - 1.00e+00 1.00e+0
0h 1
16 5.9172026e+03 1.61e-06 4.52e-05 -5.7 1.47e-03 - 1.00e+00 9.88e-0
1h 1
17 5.9172051e+03 3.53e-08 5.15e-07 -5.7 2.92e-04 - 1.00e+00 1.00e+0
0f 1
18 5.9171869e+03 3.96e-08 7.27e-06 -8.6 5.53e-03 - 9.97e-01 9.81e-0
1h 1
19 5.9171866e+03 5.33e-13 2.97e-11 -8.6 1.06e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 5.9171865525150746e+00 5.9171865525150743e+0
3
Dual infeasibility......: 2.9739362024055936e-11 2.9739362024055936e-0
8
Constraint violation....: 5.3312909642500017e-13 5.3312909642500017e-1
3
Complementarity.........: 3.5980246503655888e-09 3.5980246503655887e-0
6
Overall NLP error.......: 3.5980246503655888e-09 3.5980246503655887e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9465052e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3h 1
2 8.8961066e+02 3.24e+03 5.24e+01 -1.0 1.65e+03 - 3.15e-05 1.94e-0
4h 1
3 3.3049321e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 1.10e-04 2.31e-0
2f 1
4 1.5661028e+04 6.29e-02 8.00e+01 -1.0 3.17e+03 - 4.12e-02 1.00e+0
0h 1
5 7.0966213e+03 5.93e-02 5.59e+01 -1.0 4.98e+01 - 2.95e-01 5.19e-0
2f 1
6 5.7201217e+03 2.49e-02 2.72e+01 -1.0 2.33e+01 - 5.16e-01 5.36e-0
1f 1
7 5.1215760e+03 9.32e-03 1.31e+00 -1.0 8.82e+00 - 9.35e-01 7.62e-0
1f 1
8 5.4190355e+03 3.08e-04 8.41e-02 -1.0 3.70e+00 - 9.98e-01 1.00e+0
0f 1
9 4.8035437e+03 2.09e-03 8.11e-02 -2.5 6.11e+00 - 8.62e-01 8.49e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.6320386e+03 2.20e-03 3.43e-01 -2.5 2.04e+00 - 1.00e+00 7.81e-0
1f 1
11 4.6055460e+03 1.52e-04 4.72e-03 -2.5 5.02e-01 - 1.00e+00 1.00e+0
0h 1
12 4.5784262e+03 2.24e-05 4.27e-02 -3.8 1.07e+01 - 1.00e+00 8.84e-0
1h 1
13 4.5760808e+03 5.69e-08 5.99e-04 -3.8 1.23e+00 - 1.00e+00 1.00e+0
0f 1
14 4.5743301e+03 4.25e-08 5.47e-05 -5.7 5.94e-01 - 1.00e+00 9.98e-0
1f 1
15 4.5743305e+03 1.88e-12 1.31e-08 -5.7 1.23e-03 - 1.00e+00 1.00e+0
0f 1
16 4.5743102e+03 2.57e-12 3.30e-06 -8.6 7.37e-03 - 1.00e+00 9.99e-0
1f 1
17 4.5743102e+03 5.46e-15 4.88e-14 -8.6 4.19e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 4.5743102019667568e+00 4.5743102019667567e+0
3
Dual infeasibility......: 4.8809109699393803e-14 4.8809109699393803e-1
1
Constraint violation....: 5.4552629756077997e-15 5.4552629756077997e-1
5
Complementarity.........: 2.6212403664111993e-09 2.6212403664111994e-0
6
Overall NLP error.......: 2.6212403664111993e-09 2.6212403664111994e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4518010e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 3.98e-04 9.82e-0
3f 1
2 8.4054114e+02 2.00e+03 5.24e+01 -1.0 1.16e+03 - 4.82e-05 1.70e-0
4h 1
3 8.3317378e+02 2.00e+03 5.24e+01 -1.0 1.99e+03 - 9.16e-05 2.84e-0
4h 1
4 7.8686902e+02 1.99e+03 5.24e+01 -1.0 2.00e+03 - 3.71e-04 1.80e-0
3h 1
5 2.8089936e+02 1.95e+03 5.22e+01 -1.0 1.99e+03 - 7.75e-03 2.12e-0
2f 1
6 1.0855648e+04 6.43e-02 8.12e+01 -1.0 1.95e+03 - 6.78e-02 1.00e+0
0h 1
7 4.7554745e+03 5.85e-02 2.48e+01 -1.0 6.27e+01 - 6.73e-01 8.21e-0
2f 1
8 2.9797889e+03 3.37e-02 5.75e+00 -1.0 3.80e+01 - 7.33e-01 5.17e-0
1f 1
9 3.5282670e+03 5.41e-03 6.51e-01 -1.0 8.10e+00 - 9.45e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8125369e+03 1.30e-03 2.39e-01 -1.7 9.98e+00 - 7.83e-01 8.88e-0
1f 1
11 2.7626728e+03 3.80e-04 2.50e-01 -1.7 5.68e+00 - 7.90e-01 1.00e+0
0h 1
12 2.7746708e+03 2.01e-04 8.48e-02 -1.7 3.15e+01 - 7.22e-01 1.00e+0
0h 1
13 2.6345102e+03 1.01e-03 7.44e-02 -2.5 2.93e+01 - 8.98e-01 1.00e+0
0f 1
14 2.6011354e+03 1.98e-03 1.75e-02 -2.5 7.92e+00 - 1.00e+00 1.00e+0
0h 1
15 2.5823425e+03 5.21e-04 1.78e-01 -3.8 6.46e+00 - 1.00e+00 7.56e-0
1h 1
16 2.5804598e+03 8.43e-07 3.76e-04 -3.8 5.90e-01 - 1.00e+00 1.00e+0
0h 1
17 2.5794608e+03 3.16e-07 2.17e-03 -5.7 1.08e-01 - 1.00e+00 9.78e-0
1h 1
18 2.5794567e+03 3.62e-11 2.17e-08 -5.7 5.42e-04 - 1.00e+00 1.00e+0
0f 1
19 2.5794438e+03 6.30e-11 4.40e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 2.5794437865395472e+00 2.5794437865395471e+0
3
Dual infeasibility......: 4.3996847240272775e-09 4.3996847240272775e-0
6
Constraint violation....: 6.3013386175647668e-11 6.3013386175647668e-1
1
Complementarity.........: 3.2944285636181219e-09 3.2944285636181220e-0
6
Overall NLP error.......: 4.3996847240272775e-09 4.3996847240272775e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 44
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 22
inequality constraints with only lower bounds: 13
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6380286e+02 9.17e+02 5.24e+01 -1.0 9.17e+02 - 4.93e-04 9.91e-0
3h 1
2 8.1482929e+02 9.16e+02 5.24e+01 -1.0 8.67e+02 - 1.26e-04 1.82e-0
3h 1
3 2.6425710e+02 8.96e+02 5.25e+01 -1.0 9.16e+02 - 1.81e-03 2.15e-0
2h 1
4 1.2212579e+04 6.09e-02 8.27e+01 -1.0 8.96e+02 - 2.49e-02 1.00e+0
0h 1
5 4.3706855e+03 5.83e-02 6.49e+01 -1.0 6.82e+01 - 2.17e-01 3.86e-0
2f 1
6 2.4141050e+03 3.46e-02 3.47e+01 -1.0 3.16e+01 - 4.80e-01 6.11e-0
1f 1
7 2.2755669e+03 6.65e-03 2.26e+00 -1.0 7.48e+00 - 9.41e-01 1.00e+0
0f 1
8 2.2403946e+03 6.61e-04 6.60e-02 -1.0 4.90e+00 - 9.91e-01 1.00e+0
0f 1
9 1.8710278e+03 3.54e-04 9.04e-01 -2.5 8.30e+00 - 9.18e-01 5.92e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8081764e+03 1.79e-04 1.77e-01 -2.5 1.47e+01 - 9.37e-01 1.00e+0
0f 1
11 1.7879918e+03 3.82e-03 2.47e-02 -2.5 2.42e+00 - 1.00e+00 1.00e+0
0h 1
12 1.7520721e+03 7.52e-04 3.88e-02 -3.8 2.49e+01 - 7.92e-01 1.00e+0
0h 1
13 1.7496859e+03 1.94e-03 1.35e-03 -3.8 3.80e-01 - 9.71e-01 1.00e+0
0h 1
14 1.7498860e+03 4.55e-05 1.76e-04 -3.8 1.22e-02 - 1.00e+00 1.00e+0
0h 1
15 1.7474237e+03 1.01e-04 2.79e-04 -5.7 1.34e+00 - 9.51e-01 9.70e-0
1h 1
16 1.7473811e+03 2.39e-05 4.37e-03 -5.7 3.86e-02 - 1.00e+00 7.63e-0
1h 1
17 1.7473750e+03 8.65e-09 1.32e-06 -5.7 9.15e-03 - 1.00e+00 1.00e+0
0f 1
18 1.7473458e+03 8.95e-09 2.08e-05 -8.6 1.66e-02 - 1.00e+00 9.83e-0
1h 1
19 1.7473453e+03 1.48e-12 7.15e-11 -8.6 2.78e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.7473452922762700e+00 1.7473452922762699e+0
3
Dual infeasibility......: 7.1533401212078410e-11 7.1533401212078410e-0
8
Constraint violation....: 1.4754863997268330e-12 1.4754863997268330e-1
2
Complementarity.........: 2.6825284151735784e-09 2.6825284151735782e-0
6
Overall NLP error.......: 2.6825284151735784e-09 2.6825284151735782e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.04e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.57e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235598043e+00 1.6104063235598042e+0
3
Dual infeasibility......: 2.4574773528015475e-12 2.4574773528015475e-0
9
Constraint violation....: 7.5704787270714771e-16 7.5704787270714771e-1
6
Complementarity.........: 2.5062163919694826e-09 2.5062163919694827e-0
6
Overall NLP error.......: 2.5062163919694826e-09 2.5062163919694827e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933520e-01 5.8277753147933515e+0
2
Dual infeasibility......: 2.1031316504577506e-09 2.1031316504577506e-0
6
Constraint violation....: 6.2994387484138770e-11 6.2994387484138770e-1
1
Complementarity.........: 2.8882108897047610e-09 2.8882108897047608e-0
6
Overall NLP error.......: 2.8882108897047610e-09 2.8882108897047608e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146111909519e-01 6.4890146111909519e+0
2
Dual infeasibility......: 4.9126605687656006e-09 4.9126605687656006e-0
6
Constraint violation....: 6.2123811650494076e-09 6.2123811650494076e-0
9
Complementarity.........: 4.3646094984483491e-09 4.3646094984483490e-0
6
Overall NLP error.......: 6.2123811650494076e-09 4.9126605687656006e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.04e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.57e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235598043e+00 1.6104063235598042e+0
3
Dual infeasibility......: 2.4574773528015475e-12 2.4574773528015475e-0
9
Constraint violation....: 7.5704787270714771e-16 7.5704787270714771e-1
6
Complementarity.........: 2.5062163919694826e-09 2.5062163919694827e-0
6
Overall NLP error.......: 2.5062163919694826e-09 2.5062163919694827e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 44
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 22
inequality constraints with only lower bounds: 13
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2105112e+02 9.17e+02 5.24e+01 -1.0 9.17e+02 - 3.29e-04 9.91e-0
3h 1
2 7.6829843e+02 9.16e+02 5.24e+01 -1.0 8.70e+02 - 1.25e-04 1.93e-0
3h 1
3 2.4484691e+02 8.97e+02 5.26e+01 -1.0 9.16e+02 - 1.96e-03 2.06e-0
2h 1
4 1.1735178e+04 5.64e-02 8.26e+01 -1.0 8.97e+02 - 4.03e-02 1.00e+0
0h 1
5 3.8223043e+03 5.34e-02 4.99e+01 -1.0 7.56e+01 - 3.91e-01 5.26e-0
2f 1
6 1.8981277e+03 3.66e-02 2.60e+01 -1.0 3.95e+01 - 4.81e-01 4.96e-0
1f 1
7 2.5666007e+03 2.04e-02 1.29e+01 -1.0 1.98e+01 - 4.13e-01 2.50e-0
1f 3
8 1.9910959e+03 6.80e-03 2.74e-01 -1.0 7.03e+00 - 9.83e-01 1.00e+0
0f 1
9 1.6911287e+03 1.29e-03 2.84e-01 -1.7 5.72e+00 - 1.00e+00 8.65e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8355366e+03 8.57e-04 1.15e-02 -1.7 1.98e+02 - 1.00e+00 1.00e+0
0f 1
11 1.5574952e+03 1.19e-03 4.82e-02 -2.5 1.77e+02 - 9.20e-01 1.00e+0
0f 1
12 1.5425337e+03 1.26e-03 1.50e-02 -2.5 1.72e+00 - 1.00e+00 1.00e+0
0h 1
13 1.5081601e+03 2.21e-04 1.04e-01 -3.8 2.69e+01 - 1.00e+00 8.35e-0
1h 1
14 1.5027237e+03 4.36e-07 1.34e-04 -3.8 4.38e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5003257e+03 4.02e-07 1.60e-04 -5.7 1.49e+00 - 1.00e+00 9.97e-0
1h 1
16 1.5003228e+03 3.89e-11 2.95e-09 -5.7 4.00e-02 - 1.00e+00 1.00e+0
0f 1
17 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.84e-02 - 1.00e+00 1.00e+0
0f 1
1 8.6380240e+02 9.17e+02 5.24e+01 -1.0 9.17e+02 - 4.93e-04 9.91e-0
3h 1
2 7.9470952e+02 9.15e+02 5.24e+01 -1.0 8.82e+02 - 1.23e-04 2.56e-0
3h 1
3 2.6577091e+02 8.96e+02 5.25e+01 -1.0 9.15e+02 - 2.61e-03 2.12e-0
2h 1
4 1.1862589e+04 6.17e-02 8.04e+01 -1.0 8.96e+02 - 5.47e-02 1.00e+0
0h 1
5 4.1754423e+03 5.73e-02 4.98e+01 -1.0 6.82e+01 - 3.67e-01 6.55e-0
2f 1
6 2.5820664e+03 3.03e-02 2.47e+01 -1.0 3.84e+01 - 4.98e-01 4.41e-0
1f 1
70 1.347607e+04 1.632511e+04 5.556644e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6791917e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.81e-0
3h 1
2 7.6469947e+02 1.57e+04 5.25e+01 -1.0 1.19e+04 - 1.83e-05 1.30e-0
4h 1
3 7.6170802e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 3.58e-05 2.37e-0
4h 1
4 7.5628031e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 2.70e-04 4.42e-0
4h 1
5 5.2607697e+02 1.54e+04 5.27e+01 -1.0 1.57e+04 - 7.49e-04 2.00e-0
2f 1
6 2.6596897e+04 6.11e-02 8.48e+01 -1.0 1.54e+04 - 2.97e-02 1.00e+0
0h 1
7 1.8263345e+04 5.87e-02 6.67e+01 -1.0 7.78e+01 - 2.19e-01 4.32e-0
2f 1
8 1.6691416e+04 4.51e-02 3.29e+01 -1.0 2.87e+01 - 5.02e-01 4.35e-0
1f 1
9 1.6985688e+04 3.08e-02 1.31e+01 -1.0 1.61e+01 - 4.69e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6780978e+04 5.31e-03 3.40e-01 -1.0 3.77e+00 - 9.81e-01 1.00e+0
0h 1
11 1.6495265e+04 1.04e-03 1.24e+00 -1.7 4.60e+00 - 3.74e-01 8.80e-0
1f 1
12 1.6482938e+04 1.83e-04 8.94e-01 -1.7 3.59e+00 - 5.12e-01 1.00e+0
0f 1
13 1.6471128e+04 9.52e-05 2.17e-01 -1.7 6.79e+00 - 7.25e-01 1.00e+0
0f 1
14 1.6486409e+04 1.84e-05 9.34e-02 -1.7 1.87e+01 - 5.49e-01 1.00e+0
0f 1
15 1.6378085e+04 9.01e-04 5.56e-02 -2.5 1.27e+01 - 9.21e-01 1.00e+0
0f 1
16 1.6348405e+04 1.20e-03 1.29e-02 -2.5 9.36e+00 - 1.00e+00 1.00e+0
0h 1
17 1.6328373e+04 2.05e-04 9.08e-02 -3.8 9.38e+00 - 1.00e+00 8.48e-0
1h 1
18 1.6326483e+04 5.78e-07 1.06e-04 -3.8 9.50e-01 - 1.00e+00 1.00e+0
0h 1
19 1.6325119e+04 4.01e-07 1.10e-04 -5.7 4.45e-01 - 1.00e+00 9.97e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325122e+04 3.81e-11 2.99e-09 -5.7 2.86e-03 - 1.00e+00 1.00e+0
0f 1
21 1.6325106e+04 5.98e-11 1.47e-05 -8.6 5.52e-03 - 1.00e+00 9.76e-0
1h 1
22 1.6325105e+04 3.60e-14 1.18e-12 -8.6 1.38e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.6325105280136203e+01 1.6325105280136202e+0
4
Dual infeasibility......: 1.1831553215464895e-12 1.1831553215464895e-0
9
Constraint violation....: 3.6040614936894144e-14 3.6040614936894144e-1
4
Complementarity.........: 7.1605426896224462e-09 7.1605426896224460e-0
6
Overall NLP error.......: 7.1605426896224462e-09 7.1605426896224460e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6807293e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.29e-04 9.80e-0
3h 1
2 7.6505086e+02 1.50e+04 5.25e+01 -1.0 1.30e+04 - 2.53e-05 1.14e-0
4h 1
3 7.6362719e+02 1.50e+04 5.25e+01 -1.0 1.48e+04 - 1.84e-05 1.05e-0
4h 1
4 7.6291792e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 1.23e-04 5.36e-0
5h 1
5 5.0213784e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 1.77e-04 2.00e-0
2f 1
6 2.6220223e+04 6.05e-02 8.47e+01 -1.0 1.47e+04 - 2.92e-02 1.00e+0
0h 1
7 1.7518519e+04 5.82e-02 6.83e+01 -1.0 8.14e+01 - 2.00e-01 4.23e-0
2f 1
8 1.5926077e+04 4.47e-02 3.40e+01 -1.0 2.87e+01 - 4.98e-01 4.38e-0
1f 1
9 1.6224214e+04 3.04e-02 1.38e+01 -1.0 1.63e+01 - 4.65e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6014044e+04 5.29e-03 2.18e-01 -1.0 3.71e+00 - 9.88e-01 1.00e+0
0h 1
11 1.5728921e+04 1.03e-03 2.42e-01 -1.7 4.60e+00 - 1.00e+00 8.81e-0
1f 1
12 1.5725110e+04 7.63e-04 9.82e-03 -1.7 3.56e+01 - 1.00e+00 1.00e+0
0f 1
13 1.5596911e+04 1.08e-03 1.99e-02 -3.8 4.64e+01 - 8.03e-01 8.07e-0
1f 1
14 1.5560828e+04 1.66e-03 2.92e-02 -3.8 2.19e+00 - 8.46e-01 8.07e-0
1h 1
15 1.5560066e+04 3.96e-06 8.76e-04 -3.8 3.05e-02 - 1.00e+00 1.00e+0
0h 1
16 1.5559222e+04 2.08e-07 8.34e-04 -5.7 1.50e-01 - 1.00e+00 9.86e-0
1h 1
17 1.5559215e+04 3.27e-11 6.99e-09 -5.7 1.10e-01 - 1.00e+00 1.00e+0
0f 1
18 1.5559202e+04 6.30e-11 2.07e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5559202156659561e+01 1.5559202156659561e+0
4
Dual infeasibility......: 2.0693478656810443e-09 2.0693478656810443e-0
6
Constraint violation....: 6.2997523864183336e-11 6.2997523864183336e-1
1
Complementarity.........: 2.8880874848086388e-09 2.8880874848086389e-0
6
Overall NLP error.......: 2.8880874848086388e-09 2.8880874848086389e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.7386924e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 5.44e-04 9.80e-0
3h 1
2 8.7084959e+02 1.39e+04 5.24e+01 -1.0 1.16e+04 - 2.19e-05 1.18e-0
4h 1
3 8.6798746e+02 1.39e+04 5.24e+01 -1.0 1.38e+04 - 2.30e-05 2.06e-0
4h 1
4 8.3103502e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 2.26e-04 2.70e-0
3h 1
5 5.8497246e+02 1.36e+04 5.24e+01 -1.0 1.39e+04 - 2.99e-03 2.13e-0
2f 1
6 2.4710550e+04 6.32e-02 8.00e+01 -1.0 1.36e+04 - 5.93e-02 1.00e+0
0h 1
7 1.7219022e+04 5.84e-02 4.86e+01 -1.0 6.33e+01 - 3.78e-01 7.01e-0
2f 1
8 1.5775337e+04 3.12e-02 2.28e+01 -1.0 3.47e+01 - 5.20e-01 4.30e-0
1f 1
9 1.5133909e+04 1.37e-02 2.02e+00 -1.0 1.08e+01 - 9.21e-01 9.89e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5537860e+04 2.50e-04 5.06e-01 -1.0 5.36e+00 - 7.97e-01 1.00e+0
0f 1
11 1.4945565e+04 7.23e-04 1.61e-01 -1.7 6.65e+00 - 7.59e-01 7.98e-0
1f 1
12 1.4882522e+04 3.88e-05 2.00e-01 -2.5 1.19e+00 - 9.62e-01 1.00e+0
0h 1
13 1.4861672e+04 2.52e-03 2.22e-02 -2.5 2.49e+00 - 1.00e+00 1.00e+0
0f 1
14 1.4844295e+04 4.03e-04 3.64e-02 -3.8 7.64e+00 - 8.43e-01 1.00e+0
0h 1
15 1.4842113e+04 1.27e-03 9.16e-04 -3.8 5.22e-02 - 1.00e+00 1.00e+0
0h 1
16 1.4840750e+04 1.83e-04 4.11e-04 -5.7 4.46e-01 - 9.16e-01 9.53e-0
1h 1
17 1.4840631e+04 4.99e-05 5.61e-05 -5.7 2.07e-02 - 1.00e+00 1.00e+0
0h 1
18 1.4840628e+04 2.65e-06 1.42e-04 -5.7 1.59e-03 - 1.00e+00 9.70e-0
1h 1
19 1.4840632e+04 3.41e-08 2.79e-06 -5.7 2.66e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.4840614e+04 2.93e-08 9.48e-05 -8.6 5.53e-03 - 1.00e+00 9.46e-0
1h 1
21 1.4840613e+04 8.91e-12 1.36e-09 -8.6 2.96e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.4840612649671957e+01 1.4840612649671957e+0
4
Dual infeasibility......: 1.3629991573040645e-09 1.3629991573040644e-0
6
Constraint violation....: 8.9145357762276944e-12 8.9145357762276944e-1
2
Complementarity.........: 2.9876680129074781e-09 2.9876680129074783e-0
6
Overall NLP error.......: 2.9876680129074781e-09 2.9876680129074783e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1596505e+02 1.27e+04 5.23e+01 -1.0 1.28e+04 - 1.20e-03 9.81e-0
3h 1
2 9.1273120e+02 1.26e+04 5.23e+01 -1.0 9.38e+03 - 1.53e-05 1.33e-0
4h 1
3 9.0919716e+02 1.26e+04 5.23e+01 -1.0 1.26e+04 - 3.83e-05 2.38e-0
4h 1
4 9.0210462e+02 1.26e+04 5.23e+01 -1.0 1.26e+04 - 2.73e-04 4.83e-0
4h 1
5 5.6956378e+02 1.23e+04 5.24e+01 -1.0 1.26e+04 - 7.86e-04 2.32e-0
2f 1
6 2.4815749e+04 6.78e-02 7.65e+01 -1.0 1.23e+04 - 8.14e-02 1.00e+0
0h 1
7 1.6739034e+04 6.12e-02 3.12e+01 -1.0 2.05e+01 - 5.62e-01 8.87e-0
2f 1
8 1.5211466e+04 1.70e-02 1.33e+01 -1.0 1.27e+01 - 6.31e-01 8.72e-0
1f 1
9 1.5551005e+04 1.29e-03 2.59e-01 -1.0 3.88e+00 - 9.81e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5070413e+04 1.96e-03 1.23e+00 -1.7 3.46e+00 - 3.08e-01 1.00e+0
0f 1
11 1.5024768e+04 2.56e-04 7.25e-01 -1.7 4.59e+00 - 6.40e-01 1.00e+0
0h 1
12 1.5022466e+04 1.09e-04 2.79e-01 -1.7 1.02e+01 - 6.68e-01 1.00e+0
0f 1
13 1.5035608e+04 5.30e-06 4.86e-02 -1.7 1.71e+01 - 8.11e-01 1.00e+0
0h 1
14 1.4867960e+04 4.75e-04 2.20e-02 -2.5 2.73e+01 - 9.66e-01 9.53e-0
1f 1
15 1.4840269e+04 1.61e-04 1.42e-01 -3.8 1.08e+01 - 9.85e-01 7.39e-0
1h 1
16 1.4835410e+04 3.85e-07 6.68e-04 -3.8 1.47e+00 - 1.00e+00 1.00e+0
0h 1
17 1.4834110e+04 2.61e-08 2.78e-06 -5.7 2.36e-01 - 1.00e+00 1.00e+0
0h 1
18 1.4834096e+04 1.31e-12 1.14e-09 -8.6 1.90e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.4834096304273324e+01 1.4834096304273324e+0
4
Dual infeasibility......: 1.1412513768992815e-09 1.1412513768992815e-0
6
Constraint violation....: 1.3082382399609571e-12 1.3082382399609571e-1
2
Complementarity.........: 3.2928618766732585e-09 3.2928618766732583e-0
6
Overall NLP error.......: 3.2928618766732585e-09 3.2928618766732583e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2301496e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.51e-03 9.80e-0
3h 1
2 9.2012933e+02 1.11e+04 5.23e+01 -1.0 1.02e+04 - 3.26e-05 1.08e-0
4h 1
3 8.3424149e+02 1.11e+04 5.23e+01 -1.0 1.11e+04 - 1.17e-05 5.22e-0
3h 1
4 5.7283730e+02 1.08e+04 5.22e+01 -1.0 1.11e+04 - 5.95e-03 2.13e-0
2h 1
5 2.1532477e+04 7.53e-02 7.76e+01 -1.0 1.08e+04 - 8.36e-02 1.00e+0
0h 1
6 1.5215064e+04 6.76e-02 2.23e+01 -1.0 1.30e+01 - 6.84e-01 9.54e-0
2f 1
7 1.3955436e+04 2.05e-02 7.03e+00 -1.0 9.59e+00 - 7.22e-01 8.73e-0
1f 1
8 1.4214932e+04 1.09e-02 1.48e-01 -1.0 2.63e+00 - 9.86e-01 9.34e-0
1f 1
9 1.3821332e+04 2.89e-03 1.34e+00 -1.7 8.75e+00 - 2.86e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3785693e+04 2.31e-04 4.76e-01 -1.7 8.72e+00 - 7.64e-01 1.00e+0
0h 1
11 1.3797476e+04 1.28e-04 3.41e-02 -1.7 1.36e+01 - 9.56e-01 1.00e+0
0h 1
12 1.3629424e+04 4.99e-04 1.93e-02 -2.5 2.58e+01 - 9.69e-01 9.56e-0
1f 1
13 1.3607608e+04 1.62e-04 2.17e-01 -3.8 7.13e+00 - 9.93e-01 7.12e-0
1h 1
14 1.3601604e+04 3.70e-07 3.67e-04 -3.8 2.06e+00 - 1.00e+00 1.00e+0
0h 1
15 1.3600267e+04 1.98e-08 4.19e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
16 1.3600252e+04 1.93e-12 2.35e-08 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
17 1.3600252e+04 3.55e-15 5.74e-04 -9.0 5.41e-06 - 5.92e-01 1.00e+0
0f 1
18 1.3600252e+04 7.44e-16 9.33e-15 -9.0 4.08e-06 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.3600252141380727e+01 1.3600252141380726e+0
4
Dual infeasibility......: 9.3258734068513149e-15 9.3258734068513149e-1
2
Constraint violation....: 7.4377773177731471e-16 7.4377773177731471e-1
6
Complementarity.........: 1.2270071370243939e-09 1.2270071370243939e-0
6
Overall NLP error.......: 1.2270071370243939e-09 1.2270071370243939e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891076e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0602418e+02 9.19e+03 5.23e+01 -1.0 8.41e+03 - 3.92e-05 1.08e-0
4h 1
3 8.1828328e+02 9.14e+03 5.24e+01 -1.0 9.19e+03 - 1.24e-05 4.81e-0
3h 1
4 5.0911011e+02 8.95e+03 5.22e+01 -1.0 9.14e+03 - 5.53e-03 2.13e-0
2h 1
5 1.9574030e+04 7.15e-02 7.74e+01 -1.0 8.95e+03 - 8.67e-02 1.00e+0
0h 1
6 1.2972291e+04 6.39e-02 3.14e+01 -1.0 2.60e+01 - 5.69e-01 9.74e-0
2f 1
7 1.1456842e+04 1.98e-02 1.02e+01 -1.0 1.50e+01 - 6.92e-01 7.89e-0
1f 1
8 1.1617387e+04 7.35e-03 8.73e-01 -1.0 3.38e+00 - 9.91e-01 5.00e-0
1f 2
9 1.1301379e+04 1.11e-02 8.81e-01 -1.7 9.16e+00 - 2.92e-01 8.28e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1286731e+04 6.48e-04 7.46e-01 -1.7 9.55e+00 - 6.89e-01 1.00e+0
0f 1
11 1.1284700e+04 1.24e-04 5.51e-02 -1.7 1.30e+01 - 9.29e-01 1.00e+0
0h 1
12 1.1115570e+04 6.07e-04 2.56e-02 -2.5 2.37e+01 - 9.59e-01 9.67e-0
1f 1
13 1.1087389e+04 1.57e-04 7.52e-02 -3.8 7.32e+00 - 9.79e-01 8.38e-0
1h 1
14 1.1084767e+04 2.04e-07 1.18e-01 -3.8 1.20e+00 - 9.08e-01 1.00e+0
0h 1
15 1.1084687e+04 4.92e-09 3.23e-05 -3.8 1.62e-04 - 1.00e+00 1.00e+0
0h 1
16 1.1083373e+04 1.92e-08 3.88e-03 -5.7 2.97e-01 - 1.00e+00 9.68e-0
1f 1
17 1.1083337e+04 5.75e-12 2.62e-08 -5.7 9.60e-03 - 1.00e+00 1.00e+0
0f 1
18 1.1083321e+04 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1083320758186865e+01 1.1083320758186865e+0
4
Dual infeasibility......: 4.4780423073169889e-09 4.4780423073169889e-0
6
Constraint violation....: 2.6338792258329136e-12 2.6338792258329136e-1
2
Complementarity.........: 4.1513023842780484e-09 4.1513023842780484e-0
6
Overall NLP error.......: 4.4780423073169889e-09 4.4780423073169889e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2297256e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1839350e+02 6.70e+03 5.23e+01 -1.0 3.55e+03 - 1.59e-05 1.87e-0
4h 1
3 4.2760061e+02 6.55e+03 5.24e+01 -1.0 6.70e+03 - 9.50e-05 2.35e-0
2f 1
4 1.9355175e+04 6.81e-02 7.97e+01 -1.0 6.55e+03 - 3.79e-02 1.00e+0
0h 1
5 1.1061879e+04 6.45e-02 5.90e+01 -1.0 2.11e+01 - 2.57e-01 4.96e-0
2f 1
6 9.8072523e+03 1.56e-02 2.61e+01 -1.0 1.02e+01 - 5.86e-01 7.85e-0
1f 1
7 9.7742726e+03 7.07e-03 2.93e-01 -1.0 1.99e+00 - 9.89e-01 1.00e+0
0f 1
8 9.3946958e+03 1.63e-03 9.33e-02 -1.7 4.64e+00 - 1.00e+00 9.64e-0
1f 1
9 9.2433018e+03 1.79e-03 5.23e-01 -2.5 6.41e+00 - 1.00e+00 7.49e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.2120625e+03 3.25e-04 1.02e-01 -2.5 1.60e+00 - 1.00e+00 8.95e-0
1h 1
11 9.2152286e+03 1.17e-05 4.05e-03 -2.5 1.68e-01 - 1.00e+00 1.00e+0
0f 1
12 9.1851601e+03 1.05e-05 7.92e-03 -3.8 1.07e+01 - 1.00e+00 9.61e-0
1f 1
13 9.1844595e+03 1.57e-08 1.35e-05 -3.8 4.10e-01 - 1.00e+00 1.00e+0
0f 1
14 9.1828192e+03 1.79e-08 5.06e-06 -5.7 5.94e-01 - 1.00e+00 1.00e+0
0f 1
15 9.1828008e+03 6.40e-13 4.11e-10 -8.6 7.36e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 9.1828007899017390e+00 9.1828007899017393e+0
3
Dual infeasibility......: 4.1142354754927034e-10 4.1142354754927034e-0
7
Constraint violation....: 6.4015459599886526e-13 6.4015459599886526e-1
3
Complementarity.........: 2.7965527631277805e-09 2.7965527631277803e-0
6
Overall NLP error.......: 2.7965527631277805e-09 2.7965527631277803e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0885267e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0522538e+02 4.77e+03 5.23e+01 -1.0 3.40e+03 - 2.93e-05 1.39e-0
4h 1
3 3.7446895e+02 4.66e+03 5.24e+01 -1.0 4.77e+03 - 4.82e-05 2.34e-0
2f 1
4 1.7343624e+04 6.51e-02 8.03e+01 -1.0 4.66e+03 - 3.33e-02 1.00e+0
0h 1
5 8.8835455e+03 6.19e-02 6.15e+01 -1.0 3.76e+01 - 2.33e-01 4.52e-0
2f 1
6 7.5996542e+03 2.03e-02 2.88e+01 -1.0 1.63e+01 - 5.42e-01 6.20e-0
1f 1
7 7.1823993e+03 5.79e-03 8.85e-01 -1.0 5.30e+00 - 9.57e-01 7.82e-0
1f 1
8 7.4476292e+03 1.69e-04 6.59e-02 -1.0 5.07e+00 - 1.00e+00 1.00e+0
0f 1
9 6.8807542e+03 2.12e-03 8.08e-02 -2.5 3.15e+00 - 8.55e-01 8.48e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.7194703e+03 2.16e-03 4.17e-01 -2.5 9.54e-01 - 1.00e+00 7.62e-0
1f 1
11 6.6937548e+03 1.24e-04 4.69e-03 -2.5 2.10e-01 - 1.00e+00 1.00e+0
0h 1
12 6.6728222e+03 3.31e-05 1.45e-01 -3.8 8.04e+00 - 1.00e+00 7.62e-0
1h 1
13 6.6674261e+03 1.25e-07 3.38e-04 -3.8 1.91e+00 - 1.00e+00 1.00e+0
0f 1
14 6.6659052e+03 2.85e-08 9.91e-04 -5.7 4.46e-01 - 1.00e+00 9.85e-0
1h 1
15 6.6658878e+03 1.92e-12 1.39e-08 -5.7 6.69e-03 - 1.00e+00 1.00e+0
0f 1
16 6.6658693e+03 2.63e-12 4.48e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.6658693435969791e+00 6.6658693435969790e+0
3
Dual infeasibility......: 4.4776953204226122e-09 4.4776953204226122e-0
6
Constraint violation....: 2.6310550960140233e-12 2.6310550960140233e-1
2
Complementarity.........: 3.6084978101454929e-09 3.6084978101454929e-0
6
Overall NLP error.......: 4.4776953204226122e-09 4.4776953204226122e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2284101e+02 3.24e+03 5.23e+01 -1.0 3.27e+03 - 1.51e-03 9.82e-0
3h 1
2 9.0926076e+02 3.24e+03 5.23e+01 -1.0 2.65e+03 - 2.26e-05 5.44e-0
4h 1
3 3.4654879e+02 3.17e+03 5.24e+01 -1.0 3.24e+03 - 4.65e-04 2.33e-0
2h 1
4 1.5727761e+04 6.86e-02 7.64e+01 -1.0 3.17e+03 - 7.94e-02 1.00e+0
0h 1
5 7.5065615e+03 6.21e-02 2.55e+01 -1.0 1.38e+01 - 6.32e-01 8.66e-0
2f 1
6 6.1545521e+03 2.15e-02 1.11e+01 -1.0 9.93e+00 - 6.46e-01 9.10e-0
1f 1
7 6.3910865e+03 3.11e-03 1.12e-01 -1.0 2.98e+00 - 9.91e-01 9.82e-0
1f 1
8 5.9621858e+03 2.65e-03 1.97e-01 -1.7 1.35e+01 - 9.32e-01 1.00e+0
0f 1
9 5.7872189e+03 1.70e-03 8.10e-02 -2.5 1.11e+00 - 8.01e-01 7.48e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.7524858e+03 4.17e-04 1.11e-01 -2.5 3.09e-01 - 1.00e+00 9.05e-0
1h 1
11 5.7564148e+03 1.35e-05 5.03e-03 -2.5 2.87e-02 - 1.00e+00 1.00e+0
0f 1
12 5.7233911e+03 1.12e-05 6.48e-03 -3.8 1.34e+01 - 1.00e+00 9.69e-0
1f 1
13 5.7228091e+03 1.60e-08 1.24e-05 -3.8 4.11e-01 - 1.00e+00 1.00e+0
0f 1
14 5.7210203e+03 1.79e-08 5.06e-06 -5.7 7.43e-01 - 1.00e+00 1.00e+0
0f 1
15 5.7210000e+03 6.41e-13 4.12e-10 -8.6 9.18e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.7210000440875355e+00 5.7210000440875356e+0
3
Dual infeasibility......: 4.1156842432418431e-10 4.1156842432418431e-0
7
Constraint violation....: 6.4054317405748407e-13 6.4054317405748407e-1
3
Complementarity.........: 2.8076856738387866e-09 2.8076856738387865e-0
6
Overall NLP error.......: 2.8076856738387866e-09 2.8076856738387865e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8038781e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.82e-0
3h 1
2 8.7407120e+02 2.00e+03 5.24e+01 -1.0 1.17e+03 - 4.29e-05 2.38e-0
4h 1
3 8.6721394e+02 2.00e+03 5.24e+01 -1.0 1.99e+03 - 1.65e-04 2.68e-0
4h 1
4 8.4034566e+02 1.99e+03 5.23e+01 -1.0 2.00e+03 - 4.28e-04 1.06e-0
3h 1
5 2.9740809e+02 1.95e+03 5.21e+01 -1.0 1.99e+03 - 7.85e-03 2.22e-0
2f 1
6 1.1239199e+04 6.96e-02 7.81e+01 -1.0 1.95e+03 - 9.71e-02 1.00e+0
0h 1
7 5.0495843e+03 6.13e-02 2.17e+01 -1.0 5.33e+01 - 6.94e-01 1.09e-0
1f 1
8 3.5423566e+03 2.62e-02 2.66e+00 -1.0 2.48e+01 - 9.36e-01 5.89e-0
1f 1
9 3.5033885e+03 5.84e-03 6.93e-01 -1.0 4.79e+00 - 7.53e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.0989080e+03 8.48e-04 4.20e-01 -1.7 7.82e+00 - 7.25e-01 9.53e-0
1f 1
11 3.1579455e+03 5.46e-05 5.64e-01 -1.7 5.35e+00 - 7.86e-01 1.00e+0
0f 1
12 3.1669729e+03 8.39e-05 1.20e-02 -1.7 3.03e+01 - 8.88e-01 1.00e+0
0f 1
13 3.0874906e+03 3.28e-05 6.42e-01 -2.5 3.12e+01 - 1.00e+00 7.33e-0
1f 1
14 3.0624038e+03 1.23e-04 6.18e-03 -2.5 1.45e+01 - 1.00e+00 1.00e+0
0f 1
15 3.0450175e+03 2.10e-04 2.58e-02 -3.8 8.86e+00 - 7.70e-01 8.37e-0
1h 1
16 3.0405445e+03 1.75e-03 7.12e-04 -3.8 1.87e-01 - 9.82e-01 1.00e+0
0h 1
17 3.0404639e+03 1.03e-04 4.74e-05 -3.8 3.18e-02 - 1.00e+00 1.00e+0
0h 1
18 3.0392905e+03 1.22e-04 7.58e-04 -5.7 1.60e-01 - 9.20e-01 9.76e-0
1h 1
19 3.0392259e+03 3.41e-05 7.18e-06 -5.7 8.67e-03 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 3.0392322e+03 1.76e-07 3.43e-06 -5.7 6.01e-04 - 1.00e+00 1.00e+0
0h 1
21 3.0392189e+03 2.53e-08 3.32e-05 -8.6 1.84e-03 - 1.00e+00 9.57e-0
1h 1
22 3.0392184e+03 4.46e-12 5.13e-11 -8.6 7.84e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 3.0392183935200503e+00 3.0392183935200501e+0
3
Dual infeasibility......: 5.1312048970707869e-11 5.1312048970707869e-0
8
Constraint violation....: 4.4551029532158282e-12 4.4551029532158282e-1
2
Complementarity.........: 2.5094405047237230e-09 2.5094405047237228e-0
6
Overall NLP error.......: 2.5094405047237230e-09 2.5094405047237228e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 44
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 22
inequality constraints with only lower bounds: 13
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2174925e+02 9.17e+02 5.24e+01 -1.0 9.17e+02 - 3.31e-04 9.91e-0
3h 1
2 7.6886174e+02 9.16e+02 5.24e+01 -1.0 8.71e+02 - 1.25e-04 1.94e-0
3h 1
3 2.4516007e+02 8.97e+02 5.26e+01 -1.0 9.16e+02 - 1.97e-03 2.06e-0
2h 1
4 1.1738953e+04 5.64e-02 8.25e+01 -1.0 8.97e+02 - 4.05e-02 1.00e+0
0h 1
5 3.8274434e+03 5.35e-02 4.96e+01 -1.0 7.56e+01 - 3.95e-01 5.28e-0
2f 1
6 1.8982125e+03 3.64e-02 2.58e+01 -1.0 3.96e+01 - 4.81e-01 4.97e-0
1f 1
7 2.5676289e+03 2.04e-02 1.28e+01 -1.0 1.98e+01 - 4.13e-01 2.50e-0
1f 3
8 1.9933474e+03 6.77e-03 2.81e-01 -1.0 6.99e+00 - 9.82e-01 1.00e+0
0f 1
9 1.6919043e+03 1.30e-03 2.88e-01 -1.7 5.57e+00 - 1.00e+00 8.64e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8356545e+03 8.61e-04 1.16e-02 -1.7 1.98e+02 - 1.00e+00 1.00e+0
0f 1
11 1.5574744e+03 1.19e-03 4.85e-02 -2.5 1.77e+02 - 9.19e-01 1.00e+0
0f 1
12 1.5425213e+03 1.27e-03 1.51e-02 -2.5 1.72e+00 - 1.00e+00 1.00e+0
0h 1
13 1.5081902e+03 2.24e-04 1.05e-01 -3.8 2.69e+01 - 1.00e+00 8.34e-0
1h 1
14 1.5027236e+03 4.34e-07 1.36e-04 -3.8 4.40e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5003258e+03 4.02e-07 1.62e-04 -5.7 1.49e+00 - 1.00e+00 9.97e-0
1h 1
16 1.5003228e+03 3.89e-11 2.94e-09 -5.7 4.01e-02 - 1.00e+00 1.00e+0
0f 1
17 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.84e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5002932898053478e+00 1.5002932898053477e+0
3
Dual infeasibility......: 2.1737246970040710e-09 2.1737246970040710e-0
6
Constraint violation....: 6.2996025063100092e-11 6.2996025063100092e-1
1
Complementarity.........: 2.8882202108118133e-09 2.8882202108118133e-0
6
Overall NLP error.......: 2.8882202108118133e-09 2.8882202108118133e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.27e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9794086e+02 4.09e+01 5.94e+01 -1.0 1.43e+01 - 6.99e-04 4.23e-0
2f 1
2 1.2226342e+04 6.07e-02 7.87e+01 -1.0 1.80e+01 - 7.07e-02 1.00e+0
0h 1
3 3.6199842e+03 5.54e-02 5.15e+01 -1.0 5.46e+01 - 3.33e-01 7.86e-0
2f 1
4 2.3520770e+03 2.93e-02 2.28e+01 -1.0 2.71e+01 - 5.45e-01 4.46e-0
1f 1
5 1.7564299e+03 8.50e-03 1.17e+00 -1.0 9.97e+00 - 9.27e-01 7.68e-0
1f 1
6 2.0293237e+03 3.42e-04 8.15e-02 -1.0 3.36e+00 - 1.00e+00 1.00e+0
0h 1
7 1.4024995e+03 2.08e-03 8.14e-02 -2.5 4.87e+00 - 8.66e-01 8.50e-0
1f 1
8 1.2228371e+03 2.16e-03 2.05e-01 -2.5 1.05e+00 - 1.00e+00 8.33e-0
1f 1
9 1.2061446e+03 8.46e-05 3.88e-03 -2.5 1.48e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1966948e+03 4.55e-05 1.14e+00 -3.8 9.63e-02 - 1.00e+00 4.92e-0
1h 1
11 1.1946878e+03 3.57e-07 1.15e-01 -3.8 4.00e-02 - 9.67e-01 1.00e+0
0f 1
12 1.1936429e+03 1.87e-08 1.90e-03 -3.8 3.32e-02 - 1.00e+00 1.00e+0
0H 1
13 1.1938443e+03 1.23e-05 2.92e-04 -3.8 4.00e-03 - 1.00e+00 1.00e+0
0f 1
14 1.1932199e+03 1.95e-06 6.19e-02 -5.7 1.24e-02 - 7.78e-01 9.69e-0
1h 1
15 1.1930537e+03 1.23e-05 2.07e-04 -5.7 5.02e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1930596e+03 2.50e-08 2.00e-06 -5.7 2.46e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1930464e+03 2.69e-08 5.80e-06 -8.6 2.42e-04 - 9.83e-01 9.87e-0
1h 1
18 1.1930463e+03 3.47e-13 3.38e-11 -8.6 2.30e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1930462531354846e+00 1.1930462531354847e+0
3
Dual infeasibility......: 3.3797769127042612e-11 3.3797769127042612e-0
8
Constraint violation....: 3.4705571749782393e-13 3.4705571749782393e-1
3
Complementarity.........: 2.5122233996868829e-09 2.5122233996868829e-0
6
Overall NLP error.......: 2.5122233996868829e-09 2.5122233996868829e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1583626e+02 1.09e+02 1.13e+02 -1.0 3.76e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1398519e+04 5.38e-02 8.36e+01 -1.0 4.53e+01 - 3.10e-02 1.00e+0
0h 1
3 2.7847299e+03 5.17e-02 6.48e+01 -1.0 8.43e+01 - 2.27e-01 4.32e-0
2f 1
4 9.8154229e+02 4.24e-02 3.38e+01 -1.0 3.41e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5908144e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.22e-01 1.00e+0
0h 1
6 9.4490715e+02 1.01e-02 8.73e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6264752e+02 4.59e-04 6.60e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536452e+02 1.94e-03 1.94e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379727e+02 3.25e-03 6.12e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140237e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388161e+02 1.57e-04 1.69e-02 -3.8 7.57e-01 - 9.93e-01 9.41e-0
1h 1
12 5.8370191e+02 7.28e-07 6.65e-05 -3.8 8.62e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278679e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.06e-09 -5.7 3.41e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148936873e-01 5.8277753148936870e+0
2
Dual infeasibility......: 2.0880315340401303e-09 2.0880315340401303e-0
6
Constraint violation....: 6.2994040539443574e-11 6.2994040539443574e-1
1
Complementarity.........: 2.8882094439463301e-09 2.8882094439463300e-0
6
Overall NLP error.......: 2.8882094439463301e-09 2.8882094439463300e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.77e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5002006e+02 7.50e+01 9.04e+01 -1.0 2.59e+01 - 3.83e-04 3.52e-0
2f 1
2 1.1818697e+04 5.63e-02 8.12e+01 -1.0 2.87e+01 - 4.64e-02 1.00e+0
0h 1
3 3.1584359e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.65e-0
2f 1
4 1.0154456e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8157400e+03 7.28e-03 1.55e+01 -1.0 1.93e+01 - 6.10e-01 1.00e+0
0h 1
6 1.1192706e+03 5.40e-03 4.04e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8238042e+02 9.98e-04 2.09e-01 -1.7 5.71e+00 - 1.00e+00 8.88e-0
1h 1
8 7.2811692e+02 8.47e-04 1.34e-02 -1.7 3.45e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0980077e+02 1.50e-03 1.13e-01 -3.8 4.49e+00 - 7.71e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8216410e+02 2.17e-03 7.25e-02 -3.8 2.11e+00 - 8.07e-01 7.40e-0
1h 1
11 5.8336838e+02 9.36e-05 4.70e-02 -3.8 3.16e-02 - 1.00e+00 9.56e-0
1h 1
12 5.8368715e+02 2.81e-07 1.32e-05 -3.8 3.33e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278927e+02 4.12e-07 5.37e-04 -5.7 3.47e-02 - 1.00e+00 9.91e-0
1h 1
14 5.8278859e+02 4.36e-11 3.51e-09 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.65e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753111732578e-01 5.8277753111732579e+0
2
Dual infeasibility......: 2.6479196850404990e-09 2.6479196850404990e-0
6
Constraint violation....: 6.3002270067613608e-11 6.3002270067613608e-1
1
Complementarity.........: 2.8882677822036414e-09 2.8882677822036413e-0
6
Overall NLP error.......: 2.8882677822036414e-09 2.8882677822036413e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.27e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9794086e+02 4.09e+01 5.94e+01 -1.0 1.43e+01 - 6.99e-04 4.23e-0
2f 1
2 1.2226342e+04 6.07e-02 7.87e+01 -1.0 1.80e+01 - 7.07e-02 1.00e+0
0h 1
3 3.6199842e+03 5.54e-02 5.15e+01 -1.0 5.46e+01 - 3.33e-01 7.86e-0
2f 1
4 2.3520770e+03 2.93e-02 2.28e+01 -1.0 2.71e+01 - 5.45e-01 4.46e-0
1f 1
5 1.7564299e+03 8.50e-03 1.17e+00 -1.0 9.97e+00 - 9.27e-01 7.68e-0
1f 1
6 2.0293237e+03 3.42e-04 8.15e-02 -1.0 3.36e+00 - 1.00e+00 1.00e+0
0h 1
7 1.4024995e+03 2.08e-03 8.14e-02 -2.5 4.87e+00 - 8.66e-01 8.50e-0
1f 1
8 1.2228371e+03 2.16e-03 2.05e-01 -2.5 1.05e+00 - 1.00e+00 8.33e-0
1f 1
9 1.2061446e+03 8.46e-05 3.88e-03 -2.5 1.48e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1966948e+03 4.55e-05 1.14e+00 -3.8 9.63e-02 - 1.00e+00 4.92e-0
1h 1
11 1.1946878e+03 3.57e-07 1.15e-01 -3.8 4.00e-02 - 9.67e-01 1.00e+0
0f 1
12 1.1936429e+03 1.87e-08 1.90e-03 -3.8 3.32e-02 - 1.00e+00 1.00e+0
0H 1
13 1.1938443e+03 1.23e-05 2.92e-04 -3.8 4.00e-03 - 1.00e+00 1.00e+0
0f 1
14 1.1932199e+03 1.95e-06 6.19e-02 -5.7 1.24e-02 - 7.78e-01 9.69e-0
1h 1
15 1.1930537e+03 1.23e-05 2.07e-04 -5.7 5.02e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1930596e+03 2.50e-08 2.00e-06 -5.7 2.46e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1930464e+03 2.69e-08 5.80e-06 -8.6 2.42e-04 - 9.83e-01 9.87e-0
1h 1
18 1.1930463e+03 3.47e-13 3.38e-11 -8.6 2.30e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1930462531354846e+00 1.1930462531354847e+0
3
Dual infeasibility......: 3.3797769127042612e-11 3.3797769127042612e-0
8
Constraint violation....: 3.4705571749782393e-13 3.4705571749782393e-1
3
Complementarity.........: 2.5122233996868829e-09 2.5122233996868829e-0
6
Overall NLP error.......: 2.5122233996868829e-09 2.5122233996868829e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 46
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 23
inequality constraints with only lower bounds: 14
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2149196e+02 9.17e+02 5.24e+01 -1.0 9.16e+02 - 3.31e-04 9.92e-0
3h 1
2 7.7240760e+02 9.16e+02 5.24e+01 -1.0 8.67e+02 - 1.37e-04 1.80e-0
3h 1
3 2.4492363e+02 8.97e+02 5.26e+01 -1.0 9.16e+02 - 1.81e-03 2.06e-0
2h 1
4 1.1809298e+04 5.63e-02 8.39e+01 -1.0 8.97e+02 - 2.40e-02 1.00e+0
0h 1
5 3.9226269e+03 5.42e-02 6.69e+01 -1.0 7.84e+01 - 2.06e-01 3.79e-0
2f 1
6 1.9755209e+03 4.39e-02 3.55e+01 -1.0 3.44e+01 - 4.76e-01 5.38e-0
1f 1
7 2.6399566e+03 1.91e-02 2.02e+01 -1.0 1.91e+01 - 3.78e-01 2.50e-0
1f 3
8 1.9495207e+03 7.66e-03 3.68e-01 -1.0 9.86e+00 - 9.84e-01 1.00e+0
0f 1
9 1.6827495e+03 1.34e-03 2.78e-01 -1.7 4.78e+00 - 1.00e+00 8.75e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8617008e+03 9.47e-04 9.45e-02 -1.7 2.26e+02 - 7.48e-01 1.00e+0
0f 1
11 1.5588381e+03 1.17e-03 5.56e-02 -2.5 2.02e+02 - 9.15e-01 1.00e+0
0f 1
12 1.5430621e+03 1.26e-03 1.60e-02 -2.5 1.09e+00 - 1.00e+00 1.00e+0
0h 1
13 1.5080625e+03 2.24e-04 1.07e-01 -3.8 2.77e+01 - 1.00e+00 8.33e-0
1h 1
14 1.5027147e+03 6.03e-07 1.38e-04 -3.8 4.24e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5003243e+03 3.99e-07 1.64e-04 -5.7 1.48e+00 - 1.00e+00 9.97e-0
1h 1
16 1.5003228e+03 3.89e-11 2.96e-09 -5.7 4.48e-02 - 1.00e+00 1.00e+0
0f 1
17 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.84e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5002932895793173e+00 1.5002932895793172e+0
3
Dual infeasibility......: 2.1737237122232377e-09 2.1737237122232377e-0
6
Constraint violation....: 6.2995816896282975e-11 6.2995816896282975e-1
1
Complementarity.........: 2.8882199873762583e-09 2.8882199873762583e-0
6
Overall NLP error.......: 2.8882199873762583e-09 2.8882199873762583e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6428923e+02 9.17e+02 5.24e+01 -1.0 9.16e+02 - 4.97e-04 9.92e-0
3h 1
2 8.0273095e+02 9.15e+02 5.24e+01 -1.0 8.78e+02 - 1.35e-04 2.28e-0
3h 1
3 2.6556468e+02 8.96e+02 5.25e+01 -1.0 9.15e+02 - 2.29e-03 2.14e-0
2h 1
4 1.2005358e+04 6.15e-02 8.28e+01 -1.0 8.96e+02 - 2.53e-02 1.00e+0
0h 1
5 4.3589381e+03 5.89e-02 6.40e+01 -1.0 6.66e+01 - 2.29e-01 3.92e-0
2f 1
6 2.4313630e+03 3.42e-02 3.39e+01 -1.0 3.17e+01 - 4.83e-01 6.04e-0
1f 1
71 1.833280e+04 1.632511e+04 5.612917e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1152978e+02 1.57e+04 5.50e+01 -1.0 1.59e+04 - 1.75e-04 9.81e-0
3h 1
2 7.0846235e+02 1.57e+04 5.50e+01 -1.0 1.30e+04 - 2.15e-05 1.20e-0
4h 1
3 7.0356366e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 2.49e-05 3.95e-0
4h 1
4 6.8994917e+02 1.57e+04 5.49e+01 -1.0 1.57e+04 - 4.16e-04 1.15e-0
3h 1
5 5.0586379e+02 1.54e+04 5.39e+01 -1.0 1.57e+04 - 1.70e-03 1.90e-0
2f 1
6 2.5673579e+04 7.60e-02 8.67e+01 -1.0 1.54e+04 - 2.61e-02 1.00e+0
0h 1
7 1.7882590e+04 7.31e-02 7.07e+01 -1.0 6.75e+01 - 1.94e-01 4.12e-0
2f 1
8 1.6632011e+04 4.66e-02 3.25e+01 -1.0 2.01e+01 - 5.34e-01 3.78e-0
1f 1
9 1.7128713e+04 3.51e-02 1.08e+01 -1.0 1.33e+01 - 5.65e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6801399e+04 7.30e-03 1.08e+00 -1.0 1.76e+00 - 9.23e-01 1.00e+0
0f 1
11 1.6818045e+04 2.05e-04 1.87e+00 -1.0 4.54e+00 - 2.27e-01 1.00e+0
0f 1
12 1.6828106e+04 5.97e-06 8.43e-01 -1.0 5.42e+00 - 5.71e-01 1.00e+0
0f 1
13 1.6530530e+04 2.33e-04 4.15e-01 -1.7 4.74e+00 - 9.30e-01 8.13e-0
1f 1
14 1.6494529e+04 6.77e-04 2.67e-01 -1.7 2.25e+01 - 5.05e-01 1.00e+0
0f 1
15 1.6510269e+04 3.45e-05 1.88e-03 -1.7 2.24e+01 - 1.00e+00 1.00e+0
0h 1
16 1.6360012e+04 9.79e-04 4.09e-02 -2.5 5.45e+01 - 9.31e-01 1.00e+0
0f 1
17 1.6348865e+04 1.02e-03 2.88e-01 -2.5 7.22e+00 - 4.73e-01 1.00e+0
0h 1
18 1.6352840e+04 5.07e-05 9.12e-04 -2.5 5.51e-01 - 1.00e+00 1.00e+0
0h 1
19 1.6326850e+04 1.54e-04 1.46e-02 -3.8 8.84e+00 - 9.87e-01 9.42e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6326480e+04 9.67e-07 6.51e-05 -3.8 1.33e-01 - 1.00e+00 1.00e+0
0h 1
21 1.6325120e+04 3.74e-07 1.23e-04 -5.7 4.48e-01 - 1.00e+00 9.97e-0
1h 1
22 1.6325122e+04 3.79e-11 3.09e-09 -5.7 1.63e-03 - 1.00e+00 1.00e+0
0f 1
23 1.6325106e+04 5.98e-11 1.45e-05 -8.6 5.52e-03 - 1.00e+00 9.76e-0
1h 1
24 1.6325105e+04 3.50e-14 1.16e-12 -8.6 4.27e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 24
(scaled) (unscaled)
Objective...............: 1.6325105280104218e+01 1.6325105280104217e+0
4
Dual infeasibility......: 1.1553687739593860e-12 1.1553687739593860e-0
9
Constraint violation....: 3.4985903063500245e-14 3.4985903063500245e-1
4
Complementarity.........: 7.1273912627022373e-09 7.1273912627022373e-0
6
Overall NLP error.......: 7.1273912627022373e-09 7.1273912627022373e-0
6
Number of objective function evaluations = 27
Number of objective gradient evaluations = 25
Number of equality constraint evaluations = 27
Number of inequality constraint evaluations = 27
Number of equality constraint Jacobian evaluations = 25
Number of inequality constraint Jacobian evaluations = 25
Number of Lagrangian Hessian evaluations = 24
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9874481e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.75e-04 9.81e-0
3h 1
2 7.9561345e+02 1.50e+04 5.25e+01 -1.0 1.21e+04 - 2.06e-05 1.23e-0
4h 1
3 7.9445015e+02 1.50e+04 5.25e+01 -1.0 1.48e+04 - 2.79e-05 8.63e-0
5h 1
4 7.9388891e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 1.13e-04 4.25e-0
5h 1
5 5.2373507e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 1.56e-04 2.07e-0
2f 1
6 2.6462847e+04 5.37e-02 8.35e+01 -1.0 1.47e+04 - 3.30e-02 1.00e+0
0h 1
7 1.7755646e+04 5.15e-02 6.36e+01 -1.0 8.26e+01 - 2.41e-01 4.52e-0
2f 1
8 1.5954804e+04 4.20e-02 3.30e+01 -1.0 3.42e+01 - 4.80e-01 4.74e-0
1f 1
9 1.6280272e+04 2.57e-02 1.49e+01 -1.0 1.85e+01 - 4.23e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6017189e+04 6.14e-03 2.27e-01 -1.0 5.27e+00 - 9.88e-01 1.00e+0
0h 1
11 1.5732135e+04 1.24e-03 2.90e-01 -1.7 4.59e+00 - 1.00e+00 8.64e-0
1f 1
12 1.5732294e+04 7.90e-04 1.12e-02 -1.7 4.17e+01 - 1.00e+00 1.00e+0
0f 1
13 1.5599538e+04 1.00e-03 1.88e-02 -2.5 4.74e+01 - 9.28e-01 9.07e-0
1f 1
14 1.5561036e+04 1.73e-03 2.65e-02 -3.8 2.28e+00 - 8.44e-01 8.10e-0
1h 1
15 1.5560046e+04 1.52e-05 8.46e-03 -3.8 4.05e-02 - 1.00e+00 9.90e-0
1h 1
16 1.5560261e+04 1.79e-07 5.24e-06 -3.8 2.07e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5559214e+04 4.09e-07 1.96e-04 -5.7 1.50e-01 - 1.00e+00 9.96e-0
1h 1
18 1.5559215e+04 4.18e-11 3.42e-09 -5.7 8.80e-04 - 1.00e+00 1.00e+0
0f 1
19 1.5559202e+04 6.30e-11 2.10e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.5559202156633038e+01 1.5559202156633039e+0
4
Dual infeasibility......: 2.0961922395626254e-09 2.0961922395626254e-0
6
Constraint violation....: 6.2993651961384955e-11 6.2993651961384955e-1
1
Complementarity.........: 2.8882029690074956e-09 2.8882029690074956e-0
6
Overall NLP error.......: 2.8882029690074956e-09 2.8882029690074956e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.0180177e+02 1.39e+04 5.25e+01 -1.0 1.40e+04 - 2.81e-04 9.80e-0
3h 1
2 7.9884921e+02 1.39e+04 5.25e+01 -1.0 1.26e+04 - 3.23e-05 1.09e-0
4h 1
3 7.1745858e+02 1.38e+04 5.25e+01 -1.0 1.39e+04 - 1.26e-05 5.66e-0
3h 1
4 5.7264595e+02 1.35e+04 5.24e+01 -1.0 1.38e+04 - 6.09e-03 1.97e-0
2h 1
5 2.2901127e+04 5.80e-02 8.37e+01 -1.0 1.35e+04 - 4.05e-02 1.00e+0
0h 1
6 1.6494924e+04 5.49e-02 3.93e+01 -1.0 6.22e+01 - 5.25e-01 5.61e-0
2f 1
7 1.4838997e+04 4.02e-02 1.78e+01 -1.0 3.51e+01 - 5.39e-01 4.64e-0
1f 1
8 1.5545569e+04 1.60e-02 4.69e+00 -1.0 9.18e+00 - 6.52e-01 5.00e-0
1f 2
9 1.5007036e+04 3.87e-03 8.91e-02 -1.0 6.38e+00 - 9.93e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4658133e+04 1.38e-03 4.84e-01 -2.5 6.50e+00 - 9.25e-01 7.31e-0
1f 1
11 1.4511392e+04 3.35e-03 1.25e-01 -2.5 6.73e+00 - 7.78e-01 1.00e+0
0f 1
12 1.4499177e+04 1.55e-03 1.25e-01 -2.5 9.63e-01 - 1.00e+00 9.02e-0
1h 1
13 1.4507219e+04 1.18e-04 2.18e-03 -2.5 4.30e-01 - 1.00e+00 1.00e+0
0f 1
14 1.4482205e+04 1.53e-04 1.89e-02 -3.8 8.04e+00 - 9.90e-01 9.35e-0
1h 1
15 1.4481427e+04 8.14e-07 6.64e-05 -3.8 5.24e-01 - 1.00e+00 1.00e+0
0h 1
16 1.4480068e+04 3.77e-07 1.45e-04 -5.7 4.46e-01 - 1.00e+00 9.97e-0
1h 1
17 1.4480068e+04 3.81e-11 3.06e-09 -5.7 1.46e-03 - 1.00e+00 1.00e+0
0f 1
18 1.4480052e+04 6.30e-11 2.10e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.4480051787462367e+01 1.4480051787462367e+0
4
Dual infeasibility......: 2.1008232604008706e-09 2.1008232604008706e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882105892264648e-09 2.8882105892264648e-0
6
Overall NLP error.......: 2.8882105892264648e-09 2.8882105892264648e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2429019e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.31e-04 9.80e-0
3f 1
2 8.2146507e+02 1.27e+04 5.24e+01 -1.0 1.24e+04 - 9.42e-05 1.01e-0
4h 1
3 8.1068079e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 3.37e-06 6.96e-0
4f 1
4 4.9730483e+02 1.24e+04 5.26e+01 -1.0 1.26e+04 - 7.53e-04 2.10e-0
2h 1
5 2.4069911e+04 5.53e-02 8.24e+01 -1.0 1.24e+04 - 3.87e-02 1.00e+0
0h 1
6 1.5613335e+04 5.27e-02 5.56e+01 -1.0 8.02e+01 - 3.23e-01 5.03e-0
2f 1
7 1.3641917e+04 3.73e-02 2.96e+01 -1.0 3.93e+01 - 4.70e-01 5.04e-0
1f 1
8 1.3986623e+04 2.27e-02 1.37e+01 -1.0 2.05e+01 - 4.02e-01 1.25e-0
1f 4
9 1.3731868e+04 6.02e-03 3.89e-01 -1.0 4.91e+00 - 9.79e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3426119e+04 1.43e-03 4.06e-01 -1.7 5.53e+00 - 1.00e+00 8.25e-0
1f 1
11 1.3385057e+04 9.11e-04 1.45e-02 -1.7 1.80e+01 - 1.00e+00 1.00e+0
0f 1
12 1.3257082e+04 1.44e-03 9.78e-02 -3.8 1.99e+01 - 7.88e-01 9.29e-0
1f 1
13 1.3233557e+04 1.62e-03 8.51e-02 -3.8 1.71e+00 - 8.43e-01 7.51e-0
1h 1
14 1.3234003e+04 3.33e-06 8.54e-04 -3.8 3.44e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3233070e+04 2.80e-07 6.75e-04 -5.7 1.49e-01 - 1.00e+00 9.87e-0
1h 1
16 1.3233064e+04 3.64e-11 6.70e-09 -5.7 2.74e-01 - 1.00e+00 1.00e+0
0f 1
17 1.3233051e+04 6.30e-11 2.17e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.3233050935320486e+01 1.3233050935320485e+0
4
Dual infeasibility......: 2.1730898547933118e-09 2.1730898547933118e-0
6
Constraint violation....: 6.2998786742873847e-11 6.2998786742873847e-1
1
Complementarity.........: 2.8881016377576666e-09 2.8881016377576666e-0
6
Overall NLP error.......: 2.8881016377576666e-09 2.8881016377576666e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8378768e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 6.25e-04 9.80e-0
3h 1
2 8.8093900e+02 1.11e+04 5.24e+01 -1.0 1.04e+04 - 4.34e-05 1.06e-0
4h 1
3 8.2713051e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 9.35e-06 3.27e-0
3h 1
4 5.2651184e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 3.61e-03 2.13e-0
2h 1
5 2.1890413e+04 6.51e-02 7.92e+01 -1.0 1.09e+04 - 6.66e-02 1.00e+0
0h 1
6 1.4547152e+04 5.96e-02 4.67e+01 -1.0 5.60e+01 - 3.94e-01 7.69e-0
2f 1
7 1.3213525e+04 3.03e-02 2.00e+01 -1.0 2.87e+01 - 5.58e-01 4.50e-0
1f 1
8 1.2642944e+04 5.21e-03 1.13e+00 -1.0 1.03e+01 - 9.26e-01 8.12e-0
1f 1
9 1.2937802e+04 1.52e-04 5.60e-02 -1.0 3.78e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2251411e+04 1.77e-03 9.79e-02 -2.5 5.46e+00 - 8.76e-01 9.02e-0
1f 1
11 1.2241289e+04 7.44e-06 1.18e-02 -2.5 3.55e-01 - 1.00e+00 1.00e+0
0h 1
12 1.2215221e+04 1.33e-04 8.11e-02 -3.8 5.36e+00 - 7.91e-01 9.55e-0
1f 1
13 1.2211674e+04 9.93e-04 1.68e-03 -3.8 2.39e-01 - 9.49e-01 1.00e+0
0h 1
14 1.2211703e+04 9.03e-05 1.12e-04 -3.8 1.40e-02 - 1.00e+00 1.00e+0
0h 1
15 1.2210370e+04 1.25e-04 2.32e-03 -5.7 2.97e-01 - 8.86e-01 1.00e+0
0h 1
16 1.2210322e+04 3.32e-05 8.09e-06 -5.7 8.68e-03 - 1.00e+00 1.00e+0
0h 1
17 1.2210325e+04 5.09e-07 4.09e-06 -5.7 1.05e-03 - 1.00e+00 1.00e+0
0h 1
18 1.2210311e+04 3.65e-08 2.73e-05 -8.6 3.68e-03 - 1.00e+00 9.60e-0
1h 1
19 1.2210310e+04 3.46e-12 3.98e-11 -8.6 1.46e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.2210310013871569e+01 1.2210310013871569e+0
4
Dual infeasibility......: 3.9801432702096900e-11 3.9801432702096900e-0
8
Constraint violation....: 3.4597880116393753e-12 3.4597880116393753e-1
2
Complementarity.........: 2.7278658596632976e-09 2.7278658596632976e-0
6
Overall NLP error.......: 2.7278658596632976e-09 2.7278658596632976e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891076e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0602418e+02 9.19e+03 5.23e+01 -1.0 8.41e+03 - 3.92e-05 1.08e-0
4h 1
3 8.1828321e+02 9.14e+03 5.24e+01 -1.0 9.19e+03 - 1.24e-05 4.81e-0
3h 1
4 5.0911014e+02 8.95e+03 5.22e+01 -1.0 9.14e+03 - 5.53e-03 2.13e-0
2h 1
5 1.9574029e+04 7.15e-02 7.74e+01 -1.0 8.95e+03 - 8.67e-02 1.00e+0
0h 1
6 1.2972291e+04 6.39e-02 3.14e+01 -1.0 2.60e+01 - 5.69e-01 9.74e-0
2f 1
7 1.1456842e+04 1.98e-02 1.02e+01 -1.0 1.50e+01 - 6.92e-01 7.89e-0
1f 1
8 1.1617387e+04 7.35e-03 8.73e-01 -1.0 3.38e+00 - 9.92e-01 5.00e-0
1f 2
9 1.1301964e+04 1.11e-02 7.37e-01 -1.7 9.82e+00 - 3.82e-01 8.28e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1284697e+04 6.86e-04 7.30e-01 -1.7 1.09e+01 - 6.81e-01 1.00e+0
0f 1
11 1.1286200e+04 1.09e-04 1.07e-02 -1.7 1.28e+01 - 9.87e-01 1.00e+0
0h 1
12 1.1112800e+04 6.16e-04 2.63e-02 -2.5 2.66e+01 - 9.68e-01 9.76e-0
1f 1
13 1.1087180e+04 1.53e-04 7.73e-02 -3.8 6.17e+00 - 9.83e-01 8.33e-0
1h 1
14 1.1084766e+04 1.94e-07 1.09e-01 -3.8 1.03e+00 - 9.14e-01 1.00e+0
0h 1
15 1.1084687e+04 4.67e-09 3.04e-05 -3.8 1.55e-04 - 1.00e+00 1.00e+0
0h 1
16 1.1083373e+04 1.92e-08 3.89e-03 -5.7 2.97e-01 - 1.00e+00 9.68e-0
1f 1
17 1.1083337e+04 5.76e-12 2.63e-08 -5.7 9.61e-03 - 1.00e+00 1.00e+0
0f 1
18 1.1083321e+04 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1083320753504559e+01 1.1083320753504559e+0
4
Dual infeasibility......: 4.4780432007584479e-09 4.4780432007584479e-0
6
Constraint violation....: 2.6338167757877784e-12 2.6338167757877784e-1
2
Complementarity.........: 3.6085483693989444e-09 3.6085483693989443e-0
6
Overall NLP error.......: 4.4780432007584479e-09 4.4780432007584479e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2298458e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1944863e+02 6.71e+03 5.23e+01 -1.0 4.84e+03 - 2.16e-05 1.37e-0
4h 1
3 4.2746489e+02 6.55e+03 5.24e+01 -1.0 6.71e+03 - 4.40e-05 2.36e-0
2f 1
4 1.9375137e+04 6.81e-02 8.01e+01 -1.0 6.55e+03 - 3.23e-02 1.00e+0
0h 1
5 1.1073105e+04 6.48e-02 6.20e+01 -1.0 2.30e+01 - 2.26e-01 4.46e-0
2f 1
6 9.8597986e+03 1.54e-02 2.76e+01 -1.0 1.04e+01 - 5.80e-01 7.55e-0
1f 1
7 9.7407089e+03 8.27e-03 3.90e-01 -1.0 2.06e+00 - 9.86e-01 1.00e+0
0f 1
8 9.3846978e+03 1.66e-03 1.00e-01 -1.7 3.27e+00 - 1.00e+00 9.75e-0
1f 1
9 9.2396015e+03 1.75e-03 5.24e-01 -2.5 4.91e+00 - 1.00e+00 7.49e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.2091546e+03 3.14e-04 9.62e-02 -2.5 1.22e+00 - 1.00e+00 8.96e-0
1h 1
11 9.2123965e+03 1.16e-05 4.01e-03 -2.5 1.27e-01 - 1.00e+00 1.00e+0
0f 1
12 9.1849124e+03 1.05e-05 7.99e-03 -3.8 8.04e+00 - 1.00e+00 9.61e-0
1f 1
13 9.1843091e+03 1.57e-08 1.36e-05 -3.8 3.09e-01 - 1.00e+00 1.00e+0
0f 1
14 9.1828174e+03 1.79e-08 5.06e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0f 1
15 9.1828008e+03 6.40e-13 4.11e-10 -8.6 5.52e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 9.1828007881797635e+00 9.1828007881797639e+0
3
Dual infeasibility......: 4.1141860201484714e-10 4.1141860201484714e-0
7
Constraint violation....: 6.4037664060379029e-13 6.4037664060379029e-1
3
Complementarity.........: 2.6197519901402875e-09 2.6197519901402873e-0
6
Overall NLP error.......: 2.6197519901402875e-09 2.6197519901402873e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0882880e+02 4.77e+03 5.23e+01 -1.0 4.81e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0434947e+02 4.77e+03 5.23e+01 -1.0 2.68e+03 - 2.39e-05 1.77e-0
4h 1
3 3.7454299e+02 4.66e+03 5.24e+01 -1.0 4.77e+03 - 8.76e-05 2.34e-0
2f 1
4 1.7328207e+04 6.52e-02 8.01e+01 -1.0 4.66e+03 - 3.59e-02 1.00e+0
0h 1
5 8.8756218e+03 6.18e-02 5.99e+01 -1.0 3.67e+01 - 2.49e-01 4.75e-0
2f 1
6 7.5823595e+03 1.99e-02 2.80e+01 -1.0 1.63e+01 - 5.44e-01 6.25e-0
1f 1
7 7.1823255e+03 5.26e-03 8.31e-01 -1.0 5.07e+00 - 9.59e-01 7.94e-0
1f 1
8 7.4507207e+03 1.50e-04 6.10e-02 -1.0 5.80e+00 - 1.00e+00 1.00e+0
0f 1
9 6.8803436e+03 2.15e-03 8.62e-02 -2.5 5.09e+00 - 8.55e-01 8.54e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.7212093e+03 2.16e-03 4.08e-01 -2.5 9.22e-01 - 1.00e+00 7.65e-0
1f 1
11 6.6966327e+03 1.20e-04 4.68e-03 -2.5 2.02e-01 - 1.00e+00 1.00e+0
0h 1
12 6.6735660e+03 3.20e-05 1.43e-01 -3.8 1.07e+01 - 1.00e+00 7.63e-0
1h 1
13 6.6675769e+03 1.22e-07 3.35e-04 -3.8 2.53e+00 - 1.00e+00 1.00e+0
0f 1
14 6.6659095e+03 2.86e-08 1.00e-03 -5.7 5.94e-01 - 1.00e+00 9.85e-0
1f 1
15 6.6658896e+03 1.94e-12 1.40e-08 -5.7 8.99e-03 - 1.00e+00 1.00e+0
0f 1
16 6.6658693e+03 2.63e-12 4.48e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.6658693449782787e+00 6.6658693449782786e+0
3
Dual infeasibility......: 4.4776953203264739e-09 4.4776953203264739e-0
6
Constraint violation....: 2.6307844791517709e-12 2.6307844791517709e-1
2
Complementarity.........: 3.6084974667863047e-09 3.6084974667863047e-0
6
Overall NLP error.......: 4.4776953203264739e-09 4.4776953203264739e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9473874e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3h 1
2 8.9143292e+02 3.24e+03 5.24e+01 -1.0 2.62e+03 - 4.85e-05 1.23e-0
4h 1
3 5.1813136e+02 3.19e+03 5.24e+01 -1.0 3.24e+03 - 3.31e-05 1.54e-0
2f 1
4 4.4981157e+02 3.11e+03 5.12e+01 -1.0 3.19e+03 - 2.40e-02 2.62e-0
2f 1
5 9.7252430e+03 8.18e-02 7.70e+01 -1.0 3.11e+03 - 1.16e-01 1.00e+0
0h 1
6 6.1329447e+03 7.03e-02 1.96e+01 -1.0 2.92e+01 - 7.30e-01 1.45e-0
1f 1
7 4.8587701e+03 1.43e-02 8.63e-01 -1.0 1.60e+01 - 9.43e-01 8.10e-0
1f 1
8 5.2613063e+03 6.24e-03 7.15e-01 -1.0 4.92e+00 - 3.40e-01 9.43e-0
1f 1
9 4.7818878e+03 2.29e-03 2.14e-01 -1.7 4.04e+00 - 8.91e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.7588874e+03 8.53e-04 4.13e-01 -1.7 8.80e+00 - 6.55e-01 1.00e+0
0f 1
11 4.7821764e+03 4.69e-06 9.59e-02 -1.7 1.27e+01 - 8.55e-01 1.00e+0
0h 1
12 4.6131206e+03 4.93e-04 2.70e-02 -2.5 1.94e+01 - 9.75e-01 9.41e-0
1f 1
13 4.5775436e+03 1.42e-04 7.54e-02 -3.8 9.15e+00 - 9.71e-01 8.80e-0
1h 1
14 4.5758000e+03 2.32e-07 8.93e-01 -3.8 1.12e+00 - 6.13e-01 1.00e+0
0h 1
15 4.5757000e+03 6.60e-09 1.93e-04 -3.8 1.38e-04 - 1.00e+00 1.00e+0
0h 1
16 4.5744339e+03 2.26e-08 2.69e-02 -5.7 2.97e-01 - 1.00e+00 9.07e-0
1f 1
17 4.5743268e+03 4.39e-11 2.93e-07 -5.7 2.75e-02 - 1.00e+00 1.00e+0
0f 1
18 4.5743102e+03 2.64e-12 3.14e-06 -8.6 3.68e-03 - 1.00e+00 9.99e-0
1h 1
19 4.5743102e+03 1.62e-15 4.79e-14 -8.6 2.07e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 4.5743102024177489e+00 4.5743102024177488e+0
3
Dual infeasibility......: 4.7931010757526225e-14 4.7931010757526225e-1
1
Constraint violation....: 1.6187232667623963e-15 1.6187232667623963e-1
5
Complementarity.........: 2.5683558250702230e-09 2.5683558250702228e-0
6
Overall NLP error.......: 2.5683558250702230e-09 2.5683558250702228e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4538520e+02 2.00e+03 5.24e+01 -1.0 2.02e+03 - 3.98e-04 9.81e-0
3f 1
2 8.4231260e+02 2.00e+03 5.24e+01 -1.0 1.79e+03 - 1.02e-04 1.10e-0
4h 1
3 7.1124430e+02 1.99e+03 5.24e+01 -1.0 2.00e+03 - 2.16e-05 5.05e-0
3f 1
4 2.8981165e+02 1.95e+03 5.20e+01 -1.0 1.99e+03 - 1.05e-02 2.03e-0
2f 1
5 1.0201295e+04 6.58e-02 8.06e+01 -1.0 1.95e+03 - 7.71e-02 1.00e+0
0h 1
6 4.6339951e+03 5.92e-02 2.35e+01 -1.0 5.97e+01 - 6.87e-01 9.29e-0
2f 1
7 2.9806183e+03 3.57e-02 5.61e+00 -1.0 3.57e+01 - 7.27e-01 5.16e-0
1f 1
8 3.4333562e+03 5.70e-03 3.60e-01 -1.0 6.59e+00 - 9.67e-01 1.00e+0
0h 1
9 2.8155728e+03 1.00e-03 1.73e-01 -1.7 9.11e+00 - 1.00e+00 8.65e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.6595013e+03 1.27e-03 3.83e-01 -2.5 6.48e+00 - 7.67e-01 1.00e+0
0h 1
11 2.5900984e+03 2.05e-02 6.76e-02 -2.5 4.11e+00 - 9.30e-01 9.07e-0
1h 1
12 2.6017435e+03 7.28e-04 1.17e-02 -2.5 4.90e-01 - 1.00e+00 1.00e+0
0h 1
13 2.5815687e+03 2.61e-04 5.66e-02 -3.8 2.69e+00 - 9.94e-01 8.74e-0
1h 1
14 2.5805166e+03 1.09e-06 1.27e-04 -3.8 3.36e-01 - 1.00e+00 1.00e+0
0h 1
15 2.5794652e+03 3.43e-07 2.10e-03 -5.7 1.49e-01 - 1.00e+00 9.78e-0
1h 1
16 2.5794567e+03 3.85e-11 2.12e-08 -5.7 3.27e-03 - 1.00e+00 1.00e+0
0f 1
17 2.5794438e+03 6.30e-11 4.40e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 2.5794437892985336e+00 2.5794437892985334e+0
3
Dual infeasibility......: 4.3996645736352346e-09 4.3996645736352346e-0
6
Constraint violation....: 6.3005697881202138e-11 6.3005697881202138e-1
1
Complementarity.........: 3.3091808044825283e-09 3.3091808044825282e-0
6
Overall NLP error.......: 4.3996645736352346e-09 4.3996645736352346e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 46
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 23
inequality constraints with only lower bounds: 14
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0639075e+02 9.17e+02 5.23e+01 -1.0 9.16e+02 - 9.01e-04 9.92e-0
3h 1
2 7.3779473e+02 9.11e+02 5.24e+01 -1.0 9.04e+02 - 1.33e-04 6.55e-0
3h 1
3 3.0581802e+02 8.92e+02 5.22e+01 -1.0 9.12e+02 - 6.51e-03 2.13e-0
2h 1
4 1.1141718e+04 7.41e-02 8.21e+01 -1.0 8.92e+02 - 2.97e-02 1.00e+0
0h 1
5 5.0287564e+03 7.04e-02 5.54e+01 -1.0 2.16e+01 - 3.24e-01 4.64e-0
2f 1
6 3.5246683e+03 1.91e-02 2.48e+01 -1.0 1.65e+01 - 5.79e-01 8.09e-0
1f 1
7 3.3314636e+03 4.56e-03 1.01e+00 -1.0 5.19e+00 - 9.58e-01 8.74e-0
1f 1
8 3.6231330e+03 1.29e-04 4.58e-02 -1.0 7.28e+00 - 9.91e-01 1.00e+0
0f 1
9 2.9887922e+03 2.67e-03 1.32e-01 -2.5 1.32e+01 - 8.50e-01 9.03e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8480531e+03 2.15e-03 3.71e-01 -2.5 8.07e+00 - 1.00e+00 7.77e-0
1f 1
11 2.8331853e+03 9.44e-05 4.39e-03 -2.5 2.89e+00 - 1.00e+00 1.00e+0
0h 1
12 2.7951356e+03 2.40e-05 1.01e-01 -3.8 2.77e+01 - 1.00e+00 7.98e-0
1f 1
13 2.7870320e+03 9.37e-08 3.54e-04 -3.8 5.20e+00 - 1.00e+00 1.00e+0
0f 1
14 2.7844825e+03 3.14e-08 1.04e-03 -5.7 1.48e+00 - 1.00e+00 9.84e-0
1f 1
15 2.7844498e+03 2.03e-12 1.69e-08 -5.7 2.14e-02 - 1.00e+00 1.00e+0
0f 1
16 2.7844185e+03 2.63e-12 5.21e-09 -8.6 1.84e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 2.7844184685030977e+00 2.7844184685030978e+0
3
Dual infeasibility......: 5.2064432468911975e-09 5.2064432468911975e-0
6
Constraint violation....: 2.6315685741629125e-12 2.6315685741629125e-1
2
Complementarity.........: 3.7923902518890006e-09 3.7923902518890007e-0
6
Overall NLP error.......: 5.2064432468911975e-09 5.2064432468911975e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933498e-01 5.8277753147933493e+0
2
Dual infeasibility......: 2.1031318722715391e-09 2.1031318722715391e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896910881e-09 2.8882108896910880e-0
6
Overall NLP error.......: 2.8882108896910881e-09 2.8882108896910880e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933498e-01 5.8277753147933493e+0
2
Dual infeasibility......: 2.1031318722715391e-09 2.1031318722715391e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896910881e-09 2.8882108896910880e-0
6
Overall NLP error.......: 2.8882108896910881e-09 2.8882108896910880e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254149839e-01 6.4890146254149840e+0
2
Dual infeasibility......: 4.9126604805797299e-09 4.9126604805797299e-0
6
Constraint violation....: 6.2123814981163150e-09 6.2123814981163150e-0
9
Complementarity.........: 4.3646095252364568e-09 4.3646095252364563e-0
6
Overall NLP error.......: 6.2123814981163150e-09 4.9126604805797299e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.06e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.11e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281623782e+00 1.6104063281623780e+0
3
Dual infeasibility......: 2.4577141957817820e-12 2.4577141957817820e-0
9
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5062163910051641e-09 2.5062163910051640e-0
6
Overall NLP error.......: 2.5062163910051641e-09 2.5062163910051640e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 40
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 20
inequality constraints with only lower bounds: 11
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2157154e+02 9.17e+02 5.24e+01 -1.0 9.19e+02 - 3.29e-04 9.89e-0
3h 1
2 7.8891678e+02 9.16e+02 5.24e+01 -1.0 8.41e+02 - 1.06e-04 1.19e-0
3h 1
3 2.4333942e+02 8.97e+02 5.26e+01 -1.0 9.17e+02 - 1.20e-03 2.08e-0
2h 1
4 1.2107686e+04 5.56e-02 8.25e+01 -1.0 8.97e+02 - 3.92e-02 1.00e+0
0h 1
5 3.8558579e+03 5.30e-02 5.38e+01 -1.0 7.85e+01 - 3.44e-01 5.11e-0
2f 1
6 1.9054389e+03 3.72e-02 2.85e+01 -1.0 3.93e+01 - 4.74e-01 5.00e-0
1f 1
7 2.5866611e+03 2.02e-02 1.46e+01 -1.0 2.02e+01 - 4.06e-01 2.50e-0
1f 3
8 1.9834865e+03 6.92e-03 3.16e-01 -1.0 7.40e+00 - 9.82e-01 1.00e+0
0f 1
9 1.6893698e+03 1.29e-03 2.80e-01 -1.7 5.30e+00 - 1.00e+00 8.69e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7944815e+03 8.94e-04 1.27e-02 -1.7 1.58e+02 - 1.00e+00 1.00e+0
0f 1
11 1.5337674e+03 1.41e-03 9.55e-02 -3.8 1.64e+02 - 7.92e-01 9.29e-0
1f 1
12 1.5038847e+03 1.59e-03 7.89e-02 -3.8 9.57e+00 - 8.40e-01 7.54e-0
1h 1
13 1.5022927e+03 3.34e-06 8.47e-04 -3.8 2.31e+00 - 1.00e+00 1.00e+0
0h 1
14 1.5003387e+03 2.78e-07 6.92e-04 -5.7 1.19e+00 - 1.00e+00 9.87e-0
1h 1
15 1.5003191e+03 3.67e-11 6.69e-09 -5.7 2.65e-01 - 1.00e+00 1.00e+0
0f 1
16 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.47e-02 - 1.00e+00 1.00e+0
0h 1
1 8.6423062e+02 9.17e+02 5.24e+01 -1.0 9.19e+02 - 4.93e-04 9.89e-0
3h 1
2 8.2502697e+02 9.16e+02 5.24e+01 -1.0 8.55e+02 - 1.04e-04 1.45e-0
3h 1
3 2.6352625e+02 8.96e+02 5.25e+01 -1.0 9.16e+02 - 1.46e-03 2.17e-0
2h 1
4 1.2381400e+04 6.05e-02 8.03e+01 -1.0 8.96e+02 - 5.20e-02 1.00e+0
0h 1
5 4.2326496e+03 5.64e-02 5.20e+01 -1.0 7.11e+01 - 3.41e-01 6.22e-0
2f 1
6 2.6331673e+03 3.02e-02 2.66e+01 -1.0 3.88e+01 - 4.83e-01 4.38e-0
1f 1
7 2.1329787e+03 1.38e-02 2.44e+00 -1.0 1.08e+01 - 9.19e-01 1.00e+0
0f 1
72 1.404864e+04 1.632511e+04 5.714140e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2432143e+02 1.57e+04 5.24e+01 -1.0 1.59e+04 - 3.31e-04 9.81e-0
3h 1
2 8.2109478e+02 1.57e+04 5.24e+01 -1.0 1.17e+04 - 1.72e-05 1.33e-0
4h 1
3 8.1762608e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 3.85e-05 2.78e-0
4h 1
4 8.1133322e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 3.14e-04 5.17e-0
4h 1
5 5.6853534e+02 1.54e+04 5.26e+01 -1.0 1.57e+04 - 8.77e-04 2.11e-0
2f 1
6 2.6961630e+04 5.56e-02 8.24e+01 -1.0 1.54e+04 - 3.93e-02 1.00e+0
0h 1
7 1.8687959e+04 5.30e-02 5.38e+01 -1.0 7.87e+01 - 3.44e-01 5.11e-0
2f 1
8 1.6730812e+04 3.71e-02 2.85e+01 -1.0 3.94e+01 - 4.73e-01 5.02e-0
1f 1
9 1.7072368e+04 2.29e-02 1.29e+01 -1.0 2.03e+01 - 4.05e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6824896e+04 6.00e-03 3.66e-01 -1.0 4.79e+00 - 9.79e-01 1.00e+0
0h 1
11 1.6518395e+04 1.42e-03 5.69e-01 -1.7 5.52e+00 - 6.37e-01 8.25e-0
1f 1
12 1.6484550e+04 3.49e-04 8.36e-01 -1.7 5.66e+00 - 3.75e-01 1.00e+0
0f 1
13 1.6477807e+04 8.32e-05 1.88e-01 -1.7 8.25e+00 - 7.42e-01 1.00e+0
0h 1
14 1.6373985e+04 9.95e-04 8.69e-02 -2.5 3.39e+00 - 8.96e-01 1.00e+0
0f 1
15 1.6347869e+04 1.67e-03 1.84e-02 -2.5 3.54e+00 - 1.00e+00 1.00e+0
0h 1
16 1.6328845e+04 3.19e-04 1.26e-01 -3.8 9.65e+00 - 1.00e+00 8.16e-0
1h 1
17 1.6326479e+04 5.74e-07 1.52e-04 -3.8 1.23e+00 - 1.00e+00 1.00e+0
0h 1
18 1.6325120e+04 4.01e-07 1.60e-04 -5.7 4.43e-01 - 1.00e+00 9.97e-0
1h 1
19 1.6325122e+04 3.88e-11 2.94e-09 -5.7 3.13e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325106e+04 5.98e-11 1.53e-05 -8.6 5.52e-03 - 1.00e+00 9.76e-0
1h 1
21 1.6325105e+04 3.49e-14 1.21e-12 -8.6 5.44e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.6325105280078898e+01 1.6325105280078897e+0
4
Dual infeasibility......: 1.2089011863985792e-12 1.2089011863985792e-0
9
Constraint violation....: 3.4944269700076802e-14 3.4944269700076802e-1
4
Complementarity.........: 7.1011735098089005e-09 7.1011735098089006e-0
6
Overall NLP error.......: 7.1011735098089005e-09 7.1011735098089006e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9223071e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.64e-04 9.80e-0
3h 1
2 7.8920976e+02 1.50e+04 5.25e+01 -1.0 1.30e+04 - 2.49e-05 1.14e-0
4h 1
3 7.8778563e+02 1.50e+04 5.25e+01 -1.0 1.48e+04 - 1.87e-05 1.06e-0
4h 1
4 7.8707193e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 1.23e-04 5.40e-0
5h 1
5 5.1922280e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 1.78e-04 2.05e-0
2f 1
6 2.6397621e+04 5.37e-02 8.38e+01 -1.0 1.47e+04 - 3.20e-02 1.00e+0
0h 1
7 1.7703111e+04 5.16e-02 6.47e+01 -1.0 8.24e+01 - 2.31e-01 4.45e-0
2f 1
8 1.5949299e+04 4.28e-02 3.33e+01 -1.0 3.30e+01 - 4.84e-01 4.66e-0
1f 1
9 1.6268718e+04 2.66e-02 1.47e+01 -1.0 1.80e+01 - 4.31e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6014614e+04 6.01e-03 2.28e-01 -1.0 5.00e+00 - 9.88e-01 1.00e+0
0h 1
11 1.5730839e+04 1.19e-03 2.76e-01 -1.7 4.54e+00 - 1.00e+00 8.69e-0
1f 1
12 1.5726584e+04 7.77e-04 1.08e-02 -1.7 3.60e+01 - 1.00e+00 1.00e+0
0f 1
13 1.5596512e+04 1.11e-03 2.01e-02 -3.8 4.66e+01 - 7.99e-01 8.10e-0
1f 1
14 1.5560786e+04 1.69e-03 3.08e-02 -3.8 2.19e+00 - 8.42e-01 8.03e-0
1h 1
15 1.5560059e+04 4.12e-06 9.04e-04 -3.8 3.04e-02 - 1.00e+00 1.00e+0
0h 1
16 1.5559222e+04 1.99e-07 8.71e-04 -5.7 1.50e-01 - 1.00e+00 9.85e-0
1h 1
17 1.5559215e+04 3.22e-11 7.18e-09 -5.7 1.43e-01 - 1.00e+00 1.00e+0
0f 1
18 1.5559202e+04 6.30e-11 2.09e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5559202156647295e+01 1.5559202156647294e+0
4
Dual infeasibility......: 2.0878040746580818e-09 2.0878040746580818e-0
6
Constraint violation....: 6.2998065097907840e-11 6.2998065097907840e-1
1
Complementarity.........: 2.8880851111374693e-09 2.8880851111374694e-0
6
Overall NLP error.......: 2.8880851111374693e-09 2.8880851111374694e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9898919e+02 1.39e+04 5.25e+01 -1.0 1.40e+04 - 2.76e-04 9.80e-0
3h 1
2 7.9593562e+02 1.39e+04 5.25e+01 -1.0 1.19e+04 - 2.50e-05 1.16e-0
4h 1
3 7.9308279e+02 1.39e+04 5.25e+01 -1.0 1.38e+04 - 2.02e-05 1.97e-0
4h 1
4 7.6237298e+02 1.39e+04 5.25e+01 -1.0 1.39e+04 - 2.14e-04 2.16e-0
3h 1
5 5.2666754e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 2.43e-03 2.01e-0
2f 1
6 2.4226454e+04 5.55e-02 8.37e+01 -1.0 1.36e+04 - 3.56e-02 1.00e+0
0h 1
7 1.6591608e+04 5.30e-02 5.55e+01 -1.0 7.26e+01 - 3.38e-01 4.90e-0
2f 1
8 1.4862774e+04 4.21e-02 2.78e+01 -1.0 3.46e+01 - 4.97e-01 4.64e-0
1f 1
9 1.5172987e+04 2.67e-02 1.13e+01 -1.0 1.76e+01 - 4.40e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4945460e+04 6.07e-03 1.47e-01 -1.0 4.76e+00 - 9.91e-01 1.00e+0
0h 1
11 1.4659036e+04 1.23e-03 1.28e-01 -1.7 6.57e+00 - 9.22e-01 8.61e-0
1f 1
12 1.4540012e+04 1.51e-03 2.25e-01 -2.5 4.94e+00 - 8.13e-01 1.00e+0
0h 1
13 1.4497101e+04 3.27e-03 4.06e-02 -2.5 2.58e+00 - 1.00e+00 9.64e-0
1h 1
14 1.4507601e+04 1.61e-04 5.26e-03 -2.5 6.22e-01 - 1.00e+00 1.00e+0
0f 1
15 1.4481731e+04 1.74e-04 1.13e-02 -3.8 8.15e+00 - 9.96e-01 9.56e-0
1h 1
16 1.4481426e+04 5.49e-07 6.57e-05 -3.8 3.03e-01 - 1.00e+00 1.00e+0
0f 1
17 1.4480068e+04 3.82e-07 1.53e-04 -5.7 4.46e-01 - 1.00e+00 9.97e-0
1h 1
18 1.4480068e+04 3.86e-11 3.13e-09 -5.7 1.65e-02 - 1.00e+00 1.00e+0
0f 1
19 1.4480052e+04 6.30e-11 2.10e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.4480051787438372e+01 1.4480051787438371e+0
4
Dual infeasibility......: 2.0965456915028877e-09 2.0965456915028877e-0
6
Constraint violation....: 6.2994123806170421e-11 6.2994123806170421e-1
1
Complementarity.........: 2.8882086100607458e-09 2.8882086100607456e-0
6
Overall NLP error.......: 2.8882086100607458e-09 2.8882086100607456e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2305643e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.28e-04 9.80e-0
3h 1
2 8.2017457e+02 1.27e+04 5.24e+01 -1.0 1.20e+04 - 4.72e-05 1.04e-0
4h 1
3 8.1874019e+02 1.26e+04 5.24e+01 -1.0 1.25e+04 - 7.77e-06 9.17e-0
5h 1
4 8.1686409e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 9.75e-05 1.22e-0
4h 1
5 4.9297281e+02 1.24e+04 5.26e+01 -1.0 1.26e+04 - 2.23e-04 2.12e-0
2f 1
6 2.4301535e+04 5.48e-02 8.24e+01 -1.0 1.24e+04 - 3.78e-02 1.00e+0
0h 1
7 1.5623767e+04 5.24e-02 5.77e+01 -1.0 8.22e+01 - 2.97e-01 4.92e-0
2f 1
8 1.3644383e+04 3.77e-02 3.10e+01 -1.0 3.89e+01 - 4.67e-01 5.05e-0
1f 1
9 1.3991561e+04 2.26e-02 1.46e+01 -1.0 2.06e+01 - 3.99e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3727149e+04 6.07e-03 3.97e-01 -1.0 5.13e+00 - 9.79e-01 1.00e+0
0h 1
11 1.3423647e+04 1.43e-03 4.00e-01 -1.7 5.46e+00 - 1.00e+00 8.27e-0
1f 1
12 1.3386280e+04 9.19e-04 1.39e-02 -1.7 2.01e+01 - 1.00e+00 1.00e+0
0f 1
13 1.3255956e+04 1.43e-03 9.70e-02 -3.8 2.28e+01 - 7.89e-01 9.29e-0
1f 1
14 1.3233287e+04 1.60e-03 8.33e-02 -3.8 1.70e+00 - 8.43e-01 7.53e-0
1h 1
15 1.3234004e+04 3.31e-06 8.45e-04 -3.8 4.73e-02 - 1.00e+00 1.00e+0
0h 1
16 1.3233070e+04 2.83e-07 6.73e-04 -5.7 1.49e-01 - 1.00e+00 9.87e-0
1h 1
17 1.3233064e+04 3.68e-11 6.67e-09 -5.7 2.98e-01 - 1.00e+00 1.00e+0
0f 1
18 1.3233051e+04 6.30e-11 2.17e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.3233050935313369e+01 1.3233050935313368e+0
4
Dual infeasibility......: 2.1656183312146167e-09 2.1656183312146167e-0
6
Constraint violation....: 6.2998786742873847e-11 6.2998786742873847e-1
1
Complementarity.........: 2.8881019626515093e-09 2.8881019626515094e-0
6
Overall NLP error.......: 2.8881019626515093e-09 2.8881019626515094e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8320317e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 6.19e-04 9.80e-0
3h 1
2 8.8022902e+02 1.11e+04 5.24e+01 -1.0 9.73e+03 - 2.88e-05 1.13e-0
4h 1
3 7.2767623e+02 1.10e+04 5.24e+01 -1.0 1.11e+04 - 1.77e-05 9.25e-0
3h 1
4 6.0128418e+02 1.08e+04 5.21e+01 -1.0 1.10e+04 - 1.03e-02 2.07e-0
2h 1
5 1.9753842e+04 7.06e-02 7.83e+01 -1.0 1.08e+04 - 9.14e-02 1.00e+0
0h 1
6 1.4204986e+04 6.25e-02 2.12e+01 -1.0 4.93e+01 - 6.99e-01 1.06e-0
1f 1
7 1.2722135e+04 2.50e-02 2.55e+00 -1.0 2.51e+01 - 9.34e-01 5.90e-0
1f 1
8 1.2712818e+04 5.69e-03 1.14e+00 -1.0 4.15e+00 - 5.50e-01 1.00e+0
0f 1
9 1.2939754e+04 5.64e-04 8.41e-01 -1.0 8.94e+00 - 5.56e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2277505e+04 1.70e-03 1.93e-01 -1.7 4.32e+00 - 8.92e-01 1.00e+0
0f 1
11 1.2243233e+04 1.08e-03 2.31e+00 -2.5 3.13e+00 - 1.00e+00 3.83e-0
1h 1
12 1.2226387e+04 1.24e-05 6.17e-03 -2.5 6.72e+00 - 1.00e+00 1.00e+0
0f 1
13 1.2206264e+04 1.24e-04 8.19e-02 -3.8 8.04e+00 - 8.13e-01 9.71e-0
1f 1
14 1.2203335e+04 1.18e-03 1.60e-03 -3.8 2.30e-01 - 1.00e+00 1.00e+0
0f 1
15 1.2203377e+04 6.37e-05 6.47e-05 -3.8 1.14e-02 - 1.00e+00 1.00e+0
0h 1
16 1.2201896e+04 1.20e-04 1.93e-03 -5.7 4.46e-01 - 8.97e-01 1.00e+0
0h 1
17 1.2201851e+04 3.06e-05 7.04e-06 -5.7 8.28e-03 - 1.00e+00 1.00e+0
0h 1
18 1.2201856e+04 2.38e-07 3.03e-06 -5.7 7.11e-04 - 1.00e+00 1.00e+0
0h 1
19 1.2201839e+04 3.06e-08 1.87e-05 -8.6 5.53e-03 - 1.00e+00 9.67e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.2201839e+04 2.30e-12 3.29e-11 -8.6 1.82e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.2201838718273988e+01 1.2201838718273988e+0
4
Dual infeasibility......: 3.2879917633347397e-11 3.2879917633347397e-0
8
Constraint violation....: 2.3041568653070499e-12 2.3041568653070499e-1
2
Complementarity.........: 3.4086082398343421e-09 3.4086082398343421e-0
6
Overall NLP error.......: 3.4086082398343421e-09 3.4086082398343421e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8775333e+02 9.19e+03 5.24e+01 -1.0 9.28e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8469544e+02 9.19e+03 5.24e+01 -1.0 7.80e+03 - 2.91e-05 1.17e-0
4h 1
3 6.6462194e+02 9.08e+03 5.24e+01 -1.0 9.19e+03 - 2.18e-05 1.20e-0
2h 1
4 5.9228753e+02 8.88e+03 5.19e+01 -1.0 9.08e+03 - 1.38e-02 2.17e-0
2h 1
5 1.7105308e+04 7.36e-02 7.74e+01 -1.0 8.88e+03 - 1.04e-01 1.00e+0
0h 1
6 1.2211573e+04 6.40e-02 2.02e+01 -1.0 4.24e+01 - 7.12e-01 1.21e-0
1f 1
7 1.0749761e+04 2.49e-02 1.83e+00 -1.0 2.14e+01 - 9.33e-01 6.71e-0
1f 1
8 1.0985588e+04 3.01e-03 1.32e+00 -1.0 4.35e+00 - 3.89e-01 1.00e+0
0f 1
9 1.1156083e+04 5.19e-04 1.07e+00 -1.0 6.95e+00 - 5.49e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1145253e+04 1.26e-04 1.37e-01 -1.0 1.46e+01 - 6.47e-01 1.00e+0
0f 1
11 1.0526359e+04 1.85e-03 9.30e-02 -1.7 4.45e+00 - 9.62e-01 1.00e+0
0f 1
12 1.0370137e+04 1.17e-03 1.66e-01 -2.5 1.77e+01 - 8.95e-01 6.85e-0
1f 1
13 1.0363416e+04 1.85e-06 7.74e-03 -2.5 9.80e+00 - 1.00e+00 1.00e+0
0h 1
14 1.0339607e+04 3.84e-06 5.36e-02 -3.8 8.30e+00 - 9.47e-01 8.90e-0
1f 1
15 1.0336008e+04 5.34e-04 6.20e-04 -3.8 9.07e-01 - 1.00e+00 1.00e+0
0f 1
16 1.0334761e+04 5.22e-05 1.04e-02 -5.7 4.46e-01 - 8.31e-01 1.00e+0
0h 1
17 1.0334652e+04 3.23e-05 3.55e-05 -5.7 9.16e-03 - 1.00e+00 1.00e+0
0h 1
18 1.0334655e+04 5.75e-07 6.04e-06 -5.7 1.15e-03 - 1.00e+00 1.00e+0
0h 1
19 1.0334639e+04 4.01e-08 8.09e-05 -8.6 5.53e-03 - 1.00e+00 9.42e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.0334638e+04 7.76e-12 7.02e-11 -8.6 3.19e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.0334637967094219e+01 1.0334637967094219e+0
4
Dual infeasibility......: 7.0199092653335572e-11 7.0199092653335566e-0
8
Constraint violation....: 7.7553519162165685e-12 7.7553519162165685e-1
2
Complementarity.........: 3.3850248399384201e-09 3.3850248399384200e-0
6
Overall NLP error.......: 3.3850248399384201e-09 3.3850248399384200e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0889707e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0591739e+02 6.71e+03 5.23e+01 -1.0 5.95e+03 - 4.04e-05 1.12e-0
4h 1
3 7.6488226e+02 6.66e+03 5.24e+01 -1.0 6.70e+03 - 1.70e-05 6.81e-0
3h 1
4 4.6074230e+02 6.52e+03 5.21e+01 -1.0 6.66e+03 - 8.31e-03 2.09e-0
2h 1
5 1.6247927e+04 7.43e-02 7.77e+01 -1.0 6.52e+03 - 8.93e-02 1.00e+0
0h 1
6 1.0403222e+04 6.60e-02 2.72e+01 -1.0 2.46e+01 - 6.25e-01 1.03e-0
1f 1
7 8.8840629e+03 1.77e-02 6.66e+00 -1.0 1.48e+01 - 7.64e-01 8.19e-0
1f 1
8 9.0908601e+03 9.00e-03 6.87e-01 -1.0 4.18e+00 - 9.92e-01 4.95e-0
1f 2
9 8.8166156e+03 1.08e-02 9.34e-01 -1.7 1.35e+01 - 2.59e-01 8.25e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.8123776e+03 5.66e-04 5.47e-01 -1.7 1.17e+01 - 7.71e-01 1.00e+0
0f 1
11 8.8069477e+03 1.45e-04 2.33e-03 -1.7 1.26e+01 - 1.00e+00 1.00e+0
0h 1
12 8.6322179e+03 5.84e-04 2.47e-02 -3.8 3.58e+01 - 8.32e-01 8.29e-0
1f 1
13 8.6042656e+03 1.54e-04 7.78e-02 -3.8 6.04e+00 - 9.84e-01 8.39e-0
1h 1
14 8.6017623e+03 2.05e-07 1.16e-01 -3.8 9.71e-01 - 9.10e-01 1.00e+0
0h 1
15 8.6016820e+03 4.87e-09 3.19e-05 -3.8 1.66e-04 - 1.00e+00 1.00e+0
0h 1
16 8.6003684e+03 1.92e-08 3.88e-03 -5.7 2.97e-01 - 1.00e+00 9.68e-0
1f 1
17 8.6003325e+03 5.75e-12 2.62e-08 -5.7 9.60e-03 - 1.00e+00 1.00e+0
0f 1
18 8.6003159e+03 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 8.6003159296176008e+00 8.6003159296176000e+0
3
Dual infeasibility......: 4.4780423456778406e-09 4.4780423456778406e-0
6
Constraint violation....: 2.6336779979097003e-12 2.6336779979097003e-1
2
Complementarity.........: 3.6085482589250685e-09 3.6085482589250686e-0
6
Overall NLP error.......: 4.4780423456778406e-09 4.4780423456778406e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8766795e+02 4.77e+03 5.24e+01 -1.0 4.81e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8353498e+02 4.77e+03 5.24e+01 -1.0 2.95e+03 - 2.75e-05 1.60e-0
4h 1
3 3.6139295e+02 4.66e+03 5.25e+01 -1.0 4.77e+03 - 7.13e-05 2.29e-0
2f 1
4 1.7143198e+04 6.18e-02 8.09e+01 -1.0 4.66e+03 - 3.19e-02 1.00e+0
0h 1
5 8.5555969e+03 5.88e-02 6.21e+01 -1.0 5.76e+01 - 2.31e-01 4.38e-0
2f 1
6 7.0738960e+03 2.50e-02 3.16e+01 -1.0 2.58e+01 - 4.96e-01 5.36e-0
1f 1
7 6.3640765e+03 1.22e-02 2.14e+00 -1.0 9.64e+00 - 9.28e-01 8.84e-0
1f 1
8 6.7865441e+03 4.25e-04 9.13e-02 -1.0 4.06e+00 - 9.97e-01 1.00e+0
0f 1
9 6.0099441e+03 2.23e-03 2.08e-01 -2.5 5.67e+00 - 8.66e-01 9.60e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.9413235e+03 1.05e-03 6.02e-01 -2.5 2.45e+00 - 1.00e+00 5.77e-0
1h 1
11 5.9461424e+03 3.59e-06 8.22e-03 -2.5 1.18e+00 - 1.00e+00 1.00e+0
0h 1
12 5.9228025e+03 5.05e-06 3.85e-02 -3.8 1.07e+01 - 9.20e-01 8.83e-0
1f 1
13 5.9187561e+03 4.66e-04 5.79e-04 -3.8 1.25e+00 - 1.00e+00 1.00e+0
0f 1
14 5.9173185e+03 6.39e-05 1.15e-02 -5.7 5.94e-01 - 8.12e-01 1.00e+0
0h 1
15 5.9172028e+03 3.63e-05 4.14e-05 -5.7 9.71e-03 - 1.00e+00 1.00e+0
0h 1
16 5.9172045e+03 1.60e-06 4.42e-05 -5.7 1.47e-03 - 1.00e+00 9.88e-0
1h 1
17 5.9172070e+03 3.53e-08 5.14e-07 -5.7 2.92e-04 - 1.00e+00 1.00e+0
0f 1
18 5.9171869e+03 3.96e-08 7.28e-06 -8.6 7.37e-03 - 9.97e-01 9.81e-0
1h 1
19 5.9171866e+03 5.33e-13 2.97e-11 -8.6 1.42e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 5.9171865551062801e+00 5.9171865551062801e+0
3
Dual infeasibility......: 2.9739956170310691e-11 2.9739956170310691e-0
8
Constraint violation....: 5.3312909642500017e-13 5.3312909642500017e-1
3
Complementarity.........: 2.8947443819694926e-09 2.8947443819694927e-0
6
Overall NLP error.......: 2.8947443819694926e-09 2.8947443819694927e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6647742e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 4.97e-04 9.81e-0
3h 1
2 8.6258607e+02 3.24e+03 5.24e+01 -1.0 2.21e+03 - 3.91e-05 1.45e-0
4h 1
3 3.1400433e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 5.82e-05 2.24e-0
2f 1
4 1.5420372e+04 5.91e-02 8.12e+01 -1.0 3.17e+03 - 3.49e-02 1.00e+0
0h 1
5 6.7290069e+03 5.61e-02 6.00e+01 -1.0 7.11e+01 - 2.59e-01 4.63e-0
2f 1
6 4.9141782e+03 2.50e-02 3.24e+01 -1.0 3.47e+01 - 4.68e-01 5.32e-0
1f 1
7 4.4464852e+03 1.14e-02 2.56e+00 -1.0 9.40e+00 - 9.28e-01 1.00e+0
0f 1
8 4.7445322e+03 5.19e-04 7.24e-02 -1.0 2.72e+00 - 9.99e-01 1.00e+0
0f 1
9 4.1968167e+03 5.77e-04 4.24e-01 -2.5 7.14e+00 - 8.93e-01 7.24e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.1292537e+03 1.97e-04 2.34e-01 -2.5 2.25e+00 - 9.13e-01 1.00e+0
0h 1
11 4.1116446e+03 2.84e-04 9.33e-02 -2.5 9.70e-01 - 1.00e+00 7.64e-0
1H 1
12 4.1091626e+03 3.40e-04 1.77e-03 -2.5 1.24e-01 - 1.00e+00 1.00e+0
0f 1
13 4.0879671e+03 1.22e-03 3.19e-02 -3.8 8.05e+00 - 7.96e-01 1.00e+0
0h 1
14 4.0846007e+03 2.79e-03 1.11e-03 -3.8 4.90e-02 - 1.00e+00 1.00e+0
0h 1
15 4.0849547e+03 3.93e-05 1.31e-04 -3.8 1.35e-02 - 1.00e+00 1.00e+0
0h 1
16 4.0833586e+03 1.01e-04 3.52e-04 -5.7 4.46e-01 - 9.51e-01 9.77e-0
1h 1
17 4.0833414e+03 2.19e-05 3.67e-03 -5.7 1.03e-02 - 1.00e+00 7.83e-0
1h 1
18 4.0833430e+03 8.57e-09 1.21e-06 -5.7 2.23e-03 - 1.00e+00 1.00e+0
0f 1
19 4.0833247e+03 9.02e-09 1.92e-05 -8.6 5.53e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 4.0833244e+03 1.37e-12 6.48e-11 -8.6 9.17e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 4.0833243946414397e+00 4.0833243946414395e+0
3
Dual infeasibility......: 6.4813002052440273e-11 6.4813002052440280e-0
8
Constraint violation....: 1.3684609001529680e-12 1.3684609001529680e-1
2
Complementarity.........: 2.6432584154197163e-09 2.6432584154197165e-0
6
Overall NLP error.......: 2.6432584154197163e-09 2.6432584154197165e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1583257e+02 2.00e+03 5.23e+01 -1.0 2.01e+03 - 1.20e-03 9.81e-0
3h 1
2 9.1195917e+02 2.00e+03 5.23e+01 -1.0 1.37e+03 - 4.87e-05 1.44e-0
4h 1
3 9.0245136e+02 2.00e+03 5.23e+01 -1.0 1.99e+03 - 6.05e-05 3.74e-0
4h 1
4 3.1367162e+02 1.95e+03 6.85e+01 -1.0 2.00e+03 - 4.28e-04 2.33e-0
2f 1
5 1.4416482e+04 6.71e-02 7.76e+01 -1.0 1.95e+03 - 6.60e-02 1.00e+0
0h 1
6 6.1430447e+03 6.16e-02 3.67e+01 -1.0 2.24e+01 - 5.04e-01 7.45e-0
2f 1
7 4.6853405e+03 1.06e-02 1.63e+01 -1.0 1.30e+01 - 6.04e-01 8.29e-0
1f 1
8 4.7772808e+03 6.06e-03 8.86e-01 -1.0 3.24e+00 - 9.77e-01 5.00e-0
1f 2
9 4.4020890e+03 9.21e-03 1.47e-01 -1.7 3.62e+00 - 9.10e-01 8.42e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2359511e+03 3.47e-03 2.55e-01 -2.5 1.05e+00 - 8.25e-01 7.16e-0
1h 1
11 4.1996146e+03 6.45e-04 2.07e-02 -2.5 3.28e-01 - 1.00e+00 9.90e-0
1h 1
12 4.1828932e+03 6.21e-05 6.31e-02 -3.8 3.78e+00 - 8.60e-01 9.06e-0
1h 1
13 4.1817075e+03 4.88e-08 1.60e-05 -3.8 1.61e-01 - 1.00e+00 1.00e+0
0f 1
14 4.1805042e+03 1.78e-08 1.94e-04 -5.7 1.62e-01 - 1.00e+00 9.96e-0
1f 1
15 4.1805039e+03 1.80e-12 2.35e-09 -5.7 1.10e-03 - 1.00e+00 1.00e+0
0f 1
16 4.1804892e+03 2.63e-12 1.52e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 4.1804891598897864e+00 4.1804891598897866e+0
3
Dual infeasibility......: 1.5189631834344874e-09 1.5189631834344874e-0
6
Constraint violation....: 2.6292856780685270e-12 2.6292856780685270e-1
2
Complementarity.........: 2.8635056790007765e-09 2.8635056790007765e-0
6
Overall NLP error.......: 2.8635056790007765e-09 2.8635056790007765e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 40
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 20
inequality constraints with only lower bounds: 11
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6492412e+02 9.17e+02 5.24e+01 -1.0 9.19e+02 - 4.97e-04 9.89e-0
3h 1
2 8.2552091e+02 9.16e+02 5.24e+01 -1.0 8.55e+02 - 1.04e-04 1.46e-0
3h 1
3 2.6387997e+02 8.96e+02 5.25e+01 -1.0 9.16e+02 - 1.47e-03 2.17e-0
2h 1
4 1.2384702e+04 6.06e-02 8.03e+01 -1.0 8.96e+02 - 5.22e-02 1.00e+0
0h 1
5 4.2399598e+03 5.65e-02 5.20e+01 -1.0 7.08e+01 - 3.41e-01 6.24e-0
2f 1
6 2.6549968e+03 3.03e-02 2.65e+01 -1.0 3.86e+01 - 4.84e-01 4.36e-0
1f 1
7 2.1303652e+03 1.40e-02 2.43e+00 -1.0 1.08e+01 - 9.19e-01 1.00e+0
0f 1
8 2.4414493e+03 3.98e-04 7.93e-02 -1.0 4.22e+00 - 9.94e-01 1.00e+0
0f 1
9 1.8914333e+03 6.09e-04 4.65e-01 -2.5 8.02e+00 - 8.88e-01 6.96e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8248634e+03 2.40e-04 3.62e-01 -2.5 1.15e+01 - 8.86e-01 1.00e+0
0h 1
11 1.8165650e+03 7.74e-04 4.11e-01 -2.5 1.72e+00 - 1.00e+00 2.38e-0
1h 2
12 1.7973393e+03 8.03e-04 1.01e-02 -2.5 1.34e+00 - 1.00e+00 1.00e+0
0h 1
13 1.7623890e+03 1.23e-03 3.34e-02 -3.8 2.15e+01 - 7.94e-01 1.00e+0
0h 1
14 1.7592262e+03 2.55e-03 9.69e-04 -3.8 5.46e-02 - 1.00e+00 1.00e+0
0h 1
15 1.7595595e+03 4.48e-05 1.23e-04 -3.8 1.45e-02 - 1.00e+00 1.00e+0
0h 1
16 1.7572351e+03 1.02e-04 3.49e-04 -5.7 1.19e+00 - 9.51e-01 9.76e-0
1h 1
17 1.7572031e+03 2.26e-05 3.70e-03 -5.7 2.80e-02 - 1.00e+00 7.80e-0
1h 1
18 1.7572008e+03 8.69e-09 1.24e-06 -5.7 6.15e-03 - 1.00e+00 1.00e+0
0f 1
19 1.7571734e+03 9.04e-09 1.92e-05 -8.6 1.47e-02 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7571729e+03 1.37e-12 6.49e-11 -8.6 2.44e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.7571729301021914e+00 1.7571729301021915e+0
3
Dual infeasibility......: 6.4899925917202710e-11 6.4899925917202716e-0
8
Constraint violation....: 1.3667955656160302e-12 1.3667955656160302e-1
2
Complementarity.........: 2.5092441244621010e-09 2.5092441244621010e-0
6
Overall NLP error.......: 2.5092441244621010e-09 2.5092441244621010e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101521e-01 6.4890146112101525e+0
2
Dual infeasibility......: 4.9126605618489413e-09 4.9126605618489413e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984918224e-09 4.3646094984918221e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605618489413e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318724481455e-09 2.1031318724481455e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896894379e-09 2.8882108896894380e-0
6
Overall NLP error.......: 2.8882108896894379e-09 2.8882108896894380e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101521e-01 6.4890146112101525e+0
2
Dual infeasibility......: 4.9126605618489413e-09 4.9126605618489413e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984918224e-09 4.3646094984918221e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605618489413e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.04e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.57e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235660171e+00 1.6104063235660171e+0
3
Dual infeasibility......: 2.4574009793760635e-12 2.4574009793760635e-0
9
Constraint violation....: 7.5703172614159067e-16 7.5703172614159067e-1
6
Complementarity.........: 2.5062163919681798e-09 2.5062163919681799e-0
6
Overall NLP error.......: 2.5062163919681798e-09 2.5062163919681799e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 42
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 21
inequality constraints with only lower bounds: 12
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2200714e+02 9.17e+02 5.24e+01 -1.0 9.18e+02 - 3.31e-04 9.90e-0
3h 1
2 7.8010851e+02 9.16e+02 5.24e+01 -1.0 8.58e+02 - 1.15e-04 1.53e-0
3h 1
3 2.4431317e+02 8.97e+02 5.26e+01 -1.0 9.16e+02 - 1.55e-03 2.07e-0
2h 1
4 1.1939245e+04 5.60e-02 8.25e+01 -1.0 8.97e+02 - 3.99e-02 1.00e+0
0h 1
5 3.8457183e+03 5.32e-02 5.18e+01 -1.0 7.71e+01 - 3.68e-01 5.19e-0
2f 1
6 1.9024420e+03 3.68e-02 2.73e+01 -1.0 3.95e+01 - 4.77e-01 4.99e-0
1f 1
7 2.5789659e+03 2.03e-02 1.38e+01 -1.0 2.01e+01 - 4.09e-01 2.50e-0
1f 3
8 1.9890222e+03 6.85e-03 3.05e-01 -1.0 7.20e+00 - 9.82e-01 1.00e+0
0f 1
9 1.6909203e+03 1.30e-03 2.86e-01 -1.7 5.37e+00 - 1.00e+00 8.66e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8151128e+03 8.81e-04 1.23e-02 -1.7 1.78e+02 - 1.00e+00 1.00e+0
0f 1
11 1.5352317e+03 1.41e-03 9.62e-02 -3.8 1.84e+02 - 7.91e-01 9.29e-0
1f 1
12 1.5043468e+03 1.61e-03 7.96e-02 -3.8 1.09e+01 - 8.40e-01 7.53e-0
1h 1
13 1.5024425e+03 3.35e-06 8.53e-04 -3.8 2.64e+00 - 1.00e+00 1.00e+0
0h 1
14 1.5003425e+03 2.76e-07 6.93e-04 -5.7 1.34e+00 - 1.00e+00 9.87e-0
1h 1
15 1.5003209e+03 3.64e-11 6.71e-09 -5.7 2.53e-01 - 1.00e+00 1.00e+0
0f 1
16 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.66e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.5002932874428689e+00 1.5002932874428689e+0
3
Dual infeasibility......: 2.1734500728662146e-09 2.1734500728662146e-0
6
Constraint violation....: 6.2998620209420153e-11 6.2998620209420153e-1
1
Complementarity.........: 3.0748996846738782e-09 3.0748996846738779e-0
6
Overall NLP error.......: 3.0748996846738782e-09 3.0748996846738779e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6471232e+02 9.17e+02 5.24e+01 -1.0 9.18e+02 - 4.97e-04 9.90e-0
3h 1
2 8.1209417e+02 9.16e+02 5.24e+01 -1.0 8.71e+02 - 1.14e-04 1.95e-0
3h 1
3 2.6481235e+02 8.96e+02 5.25e+01 -1.0 9.16e+02 - 1.98e-03 2.15e-0
2h 1
4 1.2150276e+04 6.12e-02 8.03e+01 -1.0 8.96e+02 - 5.34e-02 1.00e+0
0h 1
5 4.2145491e+03 5.69e-02 5.11e+01 -1.0 6.95e+01 - 3.52e-01 6.39e-0
2f 1
6 2.6321385e+03 3.03e-02 2.57e+01 -1.0 3.84e+01 - 4.90e-01 4.37e-0
1f 1
7 2.1293462e+03 1.36e-02 2.34e+00 -1.0 1.08e+01 - 9.20e-01 1.00e+0
0f 1
73 1.210926e+04 1.632511e+04 5.771211e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2433284e+02 1.57e+04 5.24e+01 -1.0 1.59e+04 - 3.31e-04 9.80e-0
3h 1
2 8.2134514e+02 1.57e+04 5.24e+01 -1.0 1.37e+04 - 2.39e-05 1.14e-0
4h 1
3 6.8351478e+02 1.56e+04 5.25e+01 -1.0 1.57e+04 - 1.82e-05 1.11e-0
2h 1
4 7.5938511e+02 1.52e+04 5.21e+01 -1.0 1.56e+04 - 1.19e-02 2.15e-0
2h 1
5 2.3322052e+04 6.30e-02 8.19e+01 -1.0 1.52e+04 - 6.21e-02 1.00e+0
0h 1
6 1.8253283e+04 5.75e-02 2.47e+01 -1.0 5.40e+01 - 6.79e-01 8.09e-0
2f 1
7 1.6690139e+04 3.64e-02 6.75e+00 -1.0 3.54e+01 - 6.95e-01 4.95e-0
1f 1
8 1.7132672e+04 6.18e-03 5.94e+00 -1.0 1.40e+00 - 5.24e-01 1.00e+0
0f 1
9 1.6811951e+04 7.41e-04 1.82e+00 -1.0 2.90e+00 - 5.89e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6860080e+04 1.34e-04 8.19e-01 -1.0 4.43e+00 - 5.33e-01 1.00e+0
0f 1
11 1.6867298e+04 2.18e-06 2.81e-01 -1.0 9.26e+00 - 6.63e-01 1.00e+0
0f 1
12 1.6567258e+04 2.31e-04 4.38e-01 -1.7 5.28e+00 - 8.86e-01 7.28e-0
1f 1
13 1.6518366e+04 5.97e-04 1.73e-01 -1.7 2.33e+01 - 8.16e-01 1.00e+0
0f 1
14 1.6377219e+04 1.45e-03 9.17e-02 -2.5 2.46e+01 - 8.67e-01 1.00e+0
0f 1
15 1.6349745e+04 1.79e-03 2.15e-02 -2.5 6.89e+00 - 1.00e+00 1.00e+0
0h 1
16 1.6329858e+04 3.43e-04 1.30e-01 -3.8 1.10e+01 - 1.00e+00 8.13e-0
1h 1
17 1.6326632e+04 4.60e-07 1.65e-04 -3.8 2.05e+00 - 1.00e+00 1.00e+0
0h 1
18 1.6325124e+04 4.03e-07 1.63e-04 -5.7 5.94e-01 - 1.00e+00 9.97e-0
1h 1
19 1.6325123e+04 3.91e-11 2.98e-09 -5.7 1.99e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325106e+04 5.81e-11 2.39e-05 -8.6 7.36e-03 - 1.00e+00 9.63e-0
1h 1
21 1.6325105e+04 8.60e-14 2.96e-12 -8.6 1.08e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.6325105282742566e+01 1.6325105282742566e+0
4
Dual infeasibility......: 2.9603023061554051e-12 2.9603023061554051e-0
9
Constraint violation....: 8.5972895469410560e-14 8.5972895469410560e-1
4
Complementarity.........: 9.7722757331383161e-09 9.7722757331383166e-0
6
Overall NLP error.......: 9.7722757331383161e-09 9.7722757331383166e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4157188e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 3.83e-04 9.81e-0
3h 1
2 8.3845130e+02 1.50e+04 5.24e+01 -1.0 1.19e+04 - 1.94e-05 1.25e-0
4h 1
3 8.3726208e+02 1.50e+04 5.24e+01 -1.0 1.48e+04 - 2.97e-05 9.00e-0
5h 1
4 8.3667969e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 1.18e-04 4.49e-0
5h 1
5 5.5741908e+02 1.46e+04 5.26e+01 -1.0 1.50e+04 - 1.64e-04 2.17e-0
2f 1
6 2.6807857e+04 5.65e-02 8.13e+01 -1.0 1.46e+04 - 4.34e-02 1.00e+0
0h 1
7 1.8103336e+04 5.31e-02 5.33e+01 -1.0 8.16e+01 - 3.38e-01 5.40e-0
2f 1
8 1.5984414e+04 3.37e-02 2.92e+01 -1.0 4.21e+01 - 4.61e-01 5.33e-0
1f 1
9 1.6550676e+04 1.85e-02 1.19e+01 -1.0 2.05e+01 - 4.89e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6143947e+04 5.37e-03 6.48e-01 -1.0 5.17e+00 - 9.57e-01 1.00e+0
0h 1
11 1.5787924e+04 1.48e-03 5.00e-01 -1.7 7.10e+00 - 9.99e-01 7.91e-0
1f 1
12 1.5747767e+04 9.12e-04 2.18e-02 -1.7 4.57e+01 - 1.00e+00 1.00e+0
0f 1
13 1.5597889e+04 1.21e-03 2.87e-02 -2.5 4.87e+01 - 9.00e-01 9.47e-0
1f 1
14 1.5575153e+04 2.02e-03 2.49e-02 -2.5 3.03e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5562271e+04 5.02e-04 2.12e-01 -3.8 3.26e+00 - 1.00e+00 7.53e-0
1h 1
16 1.5560269e+04 3.01e-07 2.56e-04 -3.8 5.55e-01 - 1.00e+00 1.00e+0
0h 1
17 1.5559215e+04 3.90e-07 4.55e-04 -5.7 1.48e-01 - 1.00e+00 9.92e-0
1h 1
18 1.5559215e+04 4.10e-11 3.71e-09 -5.7 4.67e-03 - 1.00e+00 1.00e+0
0f 1
19 1.5559202e+04 6.30e-11 2.65e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.5559202156264565e+01 1.5559202156264564e+0
4
Dual infeasibility......: 2.6491067840872027e-09 2.6491067840872027e-0
6
Constraint violation....: 6.3003630090818774e-11 6.3003630090818774e-1
1
Complementarity.........: 2.8882781444299280e-09 2.8882781444299279e-0
6
Overall NLP error.......: 2.8882781444299280e-09 2.8882781444299279e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6398677e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 4.82e-04 9.81e-0
3h 1
2 8.6080988e+02 1.39e+04 5.24e+01 -1.0 1.07e+04 - 1.86e-05 1.29e-0
4h 1
3 8.5890328e+02 1.39e+04 5.24e+01 -1.0 1.38e+04 - 3.40e-05 1.36e-0
4h 1
4 8.4984777e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 1.67e-04 6.55e-0
4h 1
5 5.5735054e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 8.44e-04 2.20e-0
2f 1
6 2.5575384e+04 5.98e-02 8.03e+01 -1.0 1.36e+04 - 5.03e-02 1.00e+0
0h 1
7 1.7214912e+04 5.58e-02 5.28e+01 -1.0 7.33e+01 - 3.32e-01 6.04e-0
2f 1
8 1.5571072e+04 2.97e-02 2.75e+01 -1.0 3.96e+01 - 4.75e-01 4.42e-0
1f 1
9 1.5125762e+04 1.35e-02 2.53e+00 -1.0 1.09e+01 - 9.19e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5362572e+04 5.12e-04 5.91e-02 -1.0 4.60e+00 - 9.86e-01 1.00e+0
0f 1
11 1.4843951e+04 5.58e-04 4.92e-01 -2.5 7.73e+00 - 8.80e-01 6.75e-0
1f 1
12 1.4756238e+04 3.26e-04 3.61e-01 -2.5 4.05e+00 - 8.74e-01 1.00e+0
0h 1
13 1.4754615e+04 6.22e-04 4.27e-01 -2.5 1.02e+00 -2.0 2.38e-01 4.09e-0
2h 2
14 1.4721347e+04 8.74e-04 2.56e-02 -2.5 1.76e+00 - 1.00e+00 9.45e-0
1h 1
15 1.4704762e+04 1.69e-03 5.51e-02 -3.8 8.18e+00 - 7.56e-01 1.00e+0
0h 1
16 1.4700876e+04 3.72e-03 1.01e-03 -3.8 1.09e-01 - 1.00e+00 1.00e+0
0h 1
17 1.4701188e+04 3.54e-05 2.53e-04 -3.8 1.13e-02 - 1.00e+00 1.00e+0
0h 1
18 1.4699646e+04 8.83e-05 2.82e-04 -5.7 4.46e-01 - 9.54e-01 9.36e-0
1h 1
19 1.4699581e+04 2.35e-05 5.08e-03 -5.7 2.83e-02 - 1.00e+00 7.38e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.4699570e+04 7.28e-09 2.58e-06 -5.7 7.42e-03 - 1.00e+00 1.00e+0
0f 1
21 1.4699551e+04 9.22e-09 3.25e-05 -8.6 5.53e-03 - 1.00e+00 9.80e-0
1h 1
22 1.4699551e+04 2.36e-12 1.44e-10 -8.6 1.08e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.4699550845167684e+01 1.4699550845167683e+0
4
Dual infeasibility......: 1.4405908331572169e-10 1.4405908331572170e-0
7
Constraint violation....: 2.3566704143718198e-12 2.3566704143718198e-1
2
Complementarity.........: 2.6337715057104585e-09 2.6337715057104586e-0
6
Overall NLP error.......: 2.6337715057104585e-09 2.6337715057104586e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4547453e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.98e-04 9.80e-0
3h 1
2 8.4252067e+02 1.27e+04 5.24e+01 -1.0 1.14e+04 - 3.11e-05 1.10e-0
4h 1
3 8.4141850e+02 1.26e+04 5.24e+01 -1.0 1.25e+04 - 1.46e-05 7.10e-0
5h 1
4 8.4053648e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 8.40e-05 5.77e-0
5h 1
5 5.0914843e+02 1.24e+04 5.26e+01 -1.0 1.26e+04 - 1.44e-04 2.18e-0
2f 1
6 2.4546224e+04 5.68e-02 8.11e+01 -1.0 1.24e+04 - 4.49e-02 1.00e+0
0h 1
7 1.5811744e+04 5.34e-02 5.35e+01 -1.0 8.16e+01 - 3.33e-01 5.52e-0
2f 1
8 1.3665464e+04 3.36e-02 2.94e+01 -1.0 4.24e+01 - 4.60e-01 5.39e-0
1f 1
9 1.4181170e+04 1.81e-02 8.95e+00 -1.0 2.39e+01 - 5.76e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3820274e+04 5.46e-03 6.08e-01 -1.0 6.27e+00 - 9.51e-01 1.00e+0
0h 1
11 1.3464114e+04 1.51e-03 5.12e-01 -1.7 6.63e+00 - 1.00e+00 7.86e-0
1f 1
12 1.3410524e+04 6.76e-04 2.51e-02 -1.7 2.24e+01 - 1.00e+00 1.00e+0
0f 1
13 1.3269892e+04 1.30e-03 8.80e-02 -3.8 2.62e+01 - 7.67e-01 8.87e-0
1f 1
14 1.3231776e+04 2.77e-03 2.22e-02 -3.8 2.47e+00 - 8.17e-01 8.31e-0
1h 1
15 1.3233643e+04 4.76e-04 1.55e-01 -3.8 7.19e-02 - 1.00e+00 8.94e-0
1h 1
16 1.3234117e+04 6.50e-07 2.87e-05 -3.8 1.01e-01 - 1.00e+00 1.00e+0
0f 1
17 1.3233073e+04 4.21e-07 2.34e-03 -5.7 1.49e-01 - 1.00e+00 9.77e-0
1h 1
18 1.3233064e+04 4.88e-11 2.27e-08 -5.7 2.13e-02 - 1.00e+00 1.00e+0
0f 1
19 1.3233051e+04 6.30e-11 4.40e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.3233050933817214e+01 1.3233050933817214e+0
4
Dual infeasibility......: 4.4003270636104088e-09 4.4003270636104088e-0
6
Constraint violation....: 6.2987295934568976e-11 6.2987295934568976e-1
1
Complementarity.........: 3.6887130063659211e-09 3.6887130063659211e-0
6
Overall NLP error.......: 4.4003270636104088e-09 4.4003270636104088e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2240385e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.47e-03 9.80e-0
3h 1
2 9.1929753e+02 1.11e+04 5.23e+01 -1.0 9.06e+03 - 1.95e-05 1.22e-0
4h 1
3 5.6460126e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 2.60e-05 2.16e-0
2h 1
4 1.8919837e+04 7.98e-02 7.92e+01 -1.0 1.09e+04 - 2.55e-02 1.00e+0
0h 1
5 1.5364598e+04 7.68e-02 3.79e+01 -1.0 1.85e+01 - 4.90e-01 3.64e-0
2f 1
6 1.4174953e+04 1.42e-02 1.66e+01 -1.0 1.27e+01 - 6.01e-01 7.55e-0
1f 1
7 1.4183966e+04 6.58e-03 1.48e+00 -1.0 3.20e+00 - 9.91e-01 4.95e-0
1f 2
8 1.4307611e+04 4.84e-04 9.61e-02 -1.0 3.77e+01 - 8.90e-01 1.00e+0
0f 1
9 1.3821589e+04 2.13e-03 1.67e-01 -2.5 1.68e+01 - 8.56e-01 7.86e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3637125e+04 1.96e-03 5.03e-01 -2.5 1.48e+01 - 1.00e+00 7.31e-0
1f 1
11 1.3601796e+04 3.08e-04 1.07e-01 -2.5 5.60e+00 - 1.00e+00 9.09e-0
1h 1
12 1.3604362e+04 1.13e-05 3.81e-03 -2.5 5.11e-01 - 1.00e+00 1.00e+0
0f 1
13 1.3576970e+04 1.05e-05 9.17e-03 -3.8 8.04e+00 - 1.00e+00 9.57e-0
1f 1
14 1.3576273e+04 1.58e-08 1.50e-05 -3.8 3.41e-01 - 1.00e+00 1.00e+0
0f 1
15 1.3574781e+04 1.80e-08 5.32e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0f 1
16 1.3574765e+04 6.16e-13 4.09e-10 -8.6 5.52e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.3574764828522733e+01 1.3574764828522733e+0
4
Dual infeasibility......: 4.0871486986396137e-10 4.0871486986396137e-0
7
Constraint violation....: 6.1559091157903367e-13 6.1559091157903367e-1
3
Complementarity.........: 3.3896177121151013e-09 3.3896177121151012e-0
6
Overall NLP error.......: 3.3896177121151013e-09 3.3896177121151012e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0889550e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0544003e+02 9.19e+03 5.23e+01 -1.0 6.53e+03 - 1.88e-05 1.39e-0
4h 1
3 4.7820593e+02 8.97e+03 5.24e+01 -1.0 9.19e+03 - 4.54e-05 2.34e-0
2f 1
4 2.1767436e+04 6.51e-02 8.07e+01 -1.0 8.97e+03 - 2.85e-02 1.00e+0
0h 1
5 1.3313724e+04 6.22e-02 6.41e+01 -1.0 3.95e+01 - 2.06e-01 4.10e-0
2f 1
6 1.2046235e+04 2.08e-02 3.03e+01 -1.0 1.63e+01 - 5.38e-01 6.14e-0
1f 1
7 1.1599697e+04 6.95e-03 9.87e-01 -1.0 5.66e+00 - 9.55e-01 7.67e-0
1f 1
8 1.1862526e+04 2.40e-04 7.35e-02 -1.0 4.91e+00 - 9.99e-01 1.00e+0
0f 1
9 1.1304085e+04 2.07e-03 8.44e-02 -2.5 5.53e+00 - 8.56e-01 8.40e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1140969e+04 2.16e-03 4.29e-01 -2.5 1.42e+00 - 1.00e+00 7.58e-0
1f 1
11 1.1113963e+04 1.30e-04 4.70e-03 -2.5 3.63e-01 - 1.00e+00 1.00e+0
0h 1
12 1.1091127e+04 3.49e-05 1.49e-01 -3.8 1.07e+01 - 1.00e+00 7.59e-0
1h 1
13 1.1085027e+04 1.28e-07 3.42e-04 -3.8 2.58e+00 - 1.00e+00 1.00e+0
0f 1
14 1.1083360e+04 2.84e-08 9.74e-04 -5.7 5.94e-01 - 1.00e+00 9.85e-0
1f 1
15 1.1083341e+04 1.89e-12 1.38e-08 -5.7 8.84e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1083321e+04 2.63e-12 4.48e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.1083320759418354e+01 1.1083320759418355e+0
4
Dual infeasibility......: 4.4776950051268795e-09 4.4776950051268795e-0
6
Constraint violation....: 2.6312077516799093e-12 2.6312077516799093e-1
2
Complementarity.........: 4.1989643662597647e-09 4.1989643662597643e-0
6
Overall NLP error.......: 4.4776950051268795e-09 4.4776950051268795e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891119e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0611351e+02 6.71e+03 5.23e+01 -1.0 6.46e+03 - 8.39e-05 1.03e-0
4h 1
3 8.7440044e+02 6.70e+03 5.23e+01 -1.0 6.70e+03 - 6.84e-06 1.53e-0
3f 1
4 4.2534165e+02 6.54e+03 5.24e+01 -1.0 6.70e+03 - 1.83e-03 2.26e-0
2h 1
5 1.8469067e+04 6.74e-02 7.67e+01 -1.0 6.54e+03 - 8.35e-02 1.00e+0
0h 1
6 1.0609292e+04 6.07e-02 3.68e+01 -1.0 2.85e+01 - 4.94e-01 9.10e-0
2f 1
7 9.1070968e+03 1.97e-02 1.46e+01 -1.0 1.53e+01 - 6.26e-01 7.49e-0
1f 1
8 9.1804482e+03 5.62e-03 1.19e+00 -1.0 2.08e+00 - 9.93e-01 5.00e-0
1f 2
9 9.3751841e+03 2.91e-04 6.67e-02 -1.0 2.88e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.8198147e+03 2.22e-03 9.09e-02 -2.5 2.66e+01 - 8.56e-01 8.23e-0
1f 1
11 8.6513288e+03 2.12e-03 4.55e-01 -2.5 4.37e+00 - 1.00e+00 7.50e-0
1f 1
12 8.6223062e+03 1.56e-04 4.78e-03 -2.5 1.09e+00 - 1.00e+00 1.00e+0
0h 1
13 8.6058823e+03 4.18e-05 1.61e-01 -3.8 2.68e+00 - 1.00e+00 7.51e-0
1h 1
14 8.6015687e+03 1.44e-07 3.57e-04 -3.8 6.67e-01 - 1.00e+00 1.00e+0
0f 1
15 8.6003430e+03 2.79e-08 9.26e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 8.6003307e+03 1.87e-12 1.33e-08 -5.7 2.13e-03 - 1.00e+00 1.00e+0
0f 1
17 8.6003159e+03 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 8.6003159320920730e+00 8.6003159320920731e+0
3
Dual infeasibility......: 4.4776952330274467e-09 4.4776952330274467e-0
6
Constraint violation....: 2.6307289680005397e-12 2.6307289680005397e-1
2
Complementarity.........: 3.6085002106305896e-09 3.6085002106305893e-0
6
Overall NLP error.......: 4.4776952330274467e-09 4.4776952330274467e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2997022e+02 4.77e+03 5.23e+01 -1.0 4.81e+03 - 1.96e-03 9.81e-0
3h 1
2 7.5577387e+02 4.74e+03 5.23e+01 -1.0 4.71e+03 - 1.27e-05 7.63e-0
3h 1
3 4.2762045e+02 4.64e+03 5.20e+01 -1.0 4.74e+03 - 9.45e-03 2.11e-0
2h 1
4 1.4309518e+04 8.17e-02 7.89e+01 -1.0 4.64e+03 - 7.63e-02 1.00e+0
0h 1
5 8.9296780e+03 7.37e-02 4.13e+01 -1.0 1.52e+01 - 4.63e-01 9.23e-0
2f 1
6 7.8352721e+03 2.26e-02 1.01e+01 -1.0 8.20e+00 - 7.64e-01 8.36e-0
1f 1
7 8.1785573e+03 2.17e-03 1.16e-01 -1.0 3.10e+00 - 9.91e-01 1.00e+0
0f 1
8 7.7794007e+03 1.44e-03 1.29e-01 -1.7 1.41e+01 - 9.89e-01 1.00e+0
0f 1
9 7.5974958e+03 1.86e-03 3.02e-01 -2.5 1.25e+00 - 9.87e-01 8.09e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.5782501e+03 1.61e-04 4.96e-02 -2.5 2.61e-01 - 1.00e+00 9.37e-0
1f 1
11 7.5811411e+03 6.91e-06 1.30e-03 -2.5 1.39e-02 - 1.00e+00 1.00e+0
0f 1
12 7.5486678e+03 7.63e-06 4.27e-03 -3.8 1.34e+01 - 1.00e+00 9.79e-0
1f 1
13 7.5483552e+03 1.37e-08 6.29e-06 -3.8 2.80e-01 - 1.00e+00 1.00e+0
0f 1
14 7.5465686e+03 1.73e-08 3.04e-06 -5.7 7.43e-01 - 1.00e+00 1.00e+0
0f 1
15 7.5465477e+03 1.28e-12 4.22e-10 -8.6 9.20e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 7.5465477418726588e+00 7.5465477418726587e+0
3
Dual infeasibility......: 4.2179948992260023e-10 4.2179948992260023e-0
7
Constraint violation....: 1.2798234694244570e-12 1.2798234694244570e-1
2
Complementarity.........: 3.6746384824860929e-09 3.6746384824860927e-0
6
Overall NLP error.......: 3.6746384824860929e-09 3.6746384824860927e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2294726e+02 3.24e+03 5.23e+01 -1.0 3.27e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1945201e+02 3.24e+03 5.23e+01 -1.0 2.47e+03 - 3.93e-05 1.30e-0
4h 1
3 3.4573144e+02 3.17e+03 5.24e+01 -1.0 3.24e+03 - 4.04e-05 2.36e-0
2f 1
4 1.5906615e+04 6.81e-02 7.93e+01 -1.0 3.17e+03 - 4.21e-02 1.00e+0
0h 1
5 7.5933645e+03 6.41e-02 5.66e+01 -1.0 2.00e+01 - 2.81e-01 5.33e-0
2f 1
6 6.3092956e+03 1.54e-02 2.51e+01 -1.0 1.01e+01 - 5.90e-01 8.06e-0
1f 1
7 6.3346293e+03 6.22e-03 2.30e-01 -1.0 1.94e+00 - 9.91e-01 1.00e+0
0f 1
8 5.9359407e+03 1.57e-03 8.95e-02 -1.7 4.62e+00 - 1.00e+00 9.66e-0
1f 1
9 5.7772838e+03 1.82e-03 5.17e-01 -2.5 1.14e+00 - 1.00e+00 7.50e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.7447658e+03 3.25e-04 1.02e-01 -2.5 2.94e-01 - 1.00e+00 8.96e-0
1h 1
11 5.7477659e+03 1.16e-05 4.01e-03 -2.5 2.85e-02 - 1.00e+00 1.00e+0
0f 1
12 5.7228582e+03 1.05e-05 8.02e-03 -3.8 5.36e+00 - 1.00e+00 9.61e-0
1f 1
13 5.7223580e+03 1.57e-08 1.36e-05 -3.8 2.04e-01 - 1.00e+00 1.00e+0
0f 1
14 5.7210148e+03 1.79e-08 5.06e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0f 1
15 5.7210000e+03 6.40e-13 4.11e-10 -8.6 3.67e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.7210000385014368e+00 5.7210000385014364e+0
3
Dual infeasibility......: 4.1141761215012212e-10 4.1141761215012212e-0
7
Constraint violation....: 6.4026561830132778e-13 6.4026561830132778e-1
3
Complementarity.........: 2.6504093210620619e-09 2.6504093210620620e-0
6
Overall NLP error.......: 2.6504093210620619e-09 2.6504093210620620e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1583257e+02 2.00e+03 5.23e+01 -1.0 2.01e+03 - 1.20e-03 9.81e-0
3h 1
2 9.1195716e+02 2.00e+03 5.23e+01 -1.0 1.37e+03 - 4.87e-05 1.44e-0
4h 1
3 3.1303385e+02 1.95e+03 5.24e+01 -1.0 2.00e+03 - 6.04e-05 2.36e-0
2f 1
4 1.4608110e+04 6.65e-02 7.72e+01 -1.0 1.95e+03 - 6.92e-02 1.00e+0
0h 1
5 6.1485043e+03 6.09e-02 3.60e+01 -1.0 2.22e+01 - 5.08e-01 7.70e-0
2f 1
6 4.6744427e+03 1.15e-02 1.62e+01 -1.0 1.30e+01 - 6.04e-01 8.35e-0
1f 1
7 4.8737737e+03 2.78e-03 1.37e-01 -1.0 3.28e+00 - 9.92e-01 1.00e+0
0f 1
8 4.4144973e+03 1.77e-03 1.46e-01 -1.7 7.24e+00 - 1.00e+00 1.00e+0
0f 1
9 4.2301484e+03 2.01e-03 3.83e-01 -2.5 2.16e+00 - 1.00e+00 7.84e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2032539e+03 1.87e-04 1.95e-02 -2.5 4.50e-01 - 1.00e+00 9.81e-0
1f 1
11 4.1817214e+03 1.90e-06 1.87e-02 -3.8 5.38e+00 - 9.84e-01 1.00e+0
0h 1
12 4.1818471e+03 1.75e-09 4.85e-06 -3.8 6.74e-03 - 1.00e+00 1.00e+0
0h 1
13 4.1805081e+03 1.80e-08 1.81e-04 -5.7 2.97e-01 - 1.00e+00 9.96e-0
1f 1
14 4.1805058e+03 1.80e-12 2.29e-09 -5.7 1.19e-03 - 1.00e+00 1.00e+0
0f 1
15 4.1804892e+03 2.63e-12 1.52e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 4.1804891673755629e+00 4.1804891673755628e+0
3
Dual infeasibility......: 1.5189628427112492e-09 1.5189628427112492e-0
6
Constraint violation....: 2.6290983279331215e-12 2.6290983279331215e-1
2
Complementarity.........: 2.8635057178417350e-09 2.8635057178417348e-0
6
Overall NLP error.......: 2.8635057178417350e-09 2.8635057178417348e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 42
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 21
inequality constraints with only lower bounds: 12
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2200714e+02 9.17e+02 5.24e+01 -1.0 9.18e+02 - 3.31e-04 9.90e-0
3h 1
2 7.8010851e+02 9.16e+02 5.24e+01 -1.0 8.58e+02 - 1.15e-04 1.53e-0
3h 1
3 2.4431317e+02 8.97e+02 5.26e+01 -1.0 9.16e+02 - 1.55e-03 2.07e-0
2h 1
4 1.1939245e+04 5.60e-02 8.25e+01 -1.0 8.97e+02 - 3.99e-02 1.00e+0
0h 1
5 3.8457183e+03 5.32e-02 5.18e+01 -1.0 7.71e+01 - 3.68e-01 5.19e-0
2f 1
6 1.9024420e+03 3.68e-02 2.73e+01 -1.0 3.95e+01 - 4.77e-01 4.99e-0
1f 1
7 2.5789659e+03 2.03e-02 1.38e+01 -1.0 2.01e+01 - 4.09e-01 2.50e-0
1f 3
8 1.9890222e+03 6.85e-03 3.05e-01 -1.0 7.20e+00 - 9.82e-01 1.00e+0
0f 1
9 1.6909203e+03 1.30e-03 2.86e-01 -1.7 5.37e+00 - 1.00e+00 8.66e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8151128e+03 8.81e-04 1.23e-02 -1.7 1.78e+02 - 1.00e+00 1.00e+0
0f 1
11 1.5352317e+03 1.41e-03 9.62e-02 -3.8 1.84e+02 - 7.91e-01 9.29e-0
1f 1
12 1.5043468e+03 1.61e-03 7.96e-02 -3.8 1.09e+01 - 8.40e-01 7.53e-0
1h 1
13 1.5024425e+03 3.35e-06 8.53e-04 -3.8 2.64e+00 - 1.00e+00 1.00e+0
0h 1
14 1.5003425e+03 2.76e-07 6.93e-04 -5.7 1.34e+00 - 1.00e+00 9.87e-0
1h 1
15 1.5003209e+03 3.64e-11 6.71e-09 -5.7 2.53e-01 - 1.00e+00 1.00e+0
0f 1
16 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.66e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.5002932874428689e+00 1.5002932874428689e+0
3
Dual infeasibility......: 2.1734500728662146e-09 2.1734500728662146e-0
6
Constraint violation....: 6.2998620209420153e-11 6.2998620209420153e-1
1
Complementarity.........: 3.0748996846738782e-09 3.0748996846738779e-0
6
Overall NLP error.......: 3.0748996846738782e-09 3.0748996846738779e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.78e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.4998630e+02 7.50e+01 9.04e+01 -1.0 2.59e+01 - 3.83e-04 3.52e-0
2f 1
2 1.1818341e+04 5.63e-02 8.12e+01 -1.0 2.87e+01 - 4.63e-02 1.00e+0
0h 1
3 3.1581534e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.65e-0
2f 1
4 1.0153733e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8174846e+03 7.29e-03 1.56e+01 -1.0 1.92e+01 - 6.09e-01 1.00e+0
0h 1
6 1.1184585e+03 5.41e-03 4.04e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8225330e+02 9.95e-04 2.08e-01 -1.7 5.71e+00 - 1.00e+00 8.88e-0
1h 1
8 7.2799856e+02 8.49e-04 1.34e-02 -1.7 3.45e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0975665e+02 1.50e-03 1.13e-01 -3.8 4.49e+00 - 7.71e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8217019e+02 2.16e-03 7.30e-02 -3.8 2.11e+00 - 8.07e-01 7.39e-0
1h 1
11 5.8337147e+02 9.05e-05 4.55e-02 -3.8 3.14e-02 - 1.00e+00 9.58e-0
1h 1
12 5.8368714e+02 2.80e-07 1.28e-05 -3.8 3.43e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278925e+02 4.12e-07 5.33e-04 -5.7 3.47e-02 - 1.00e+00 9.91e-0
1h 1
14 5.8278859e+02 4.35e-11 3.50e-09 -5.7 2.19e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.64e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753112054742e-01 5.8277753112054745e+0
2
Dual infeasibility......: 2.6430708407114825e-09 2.6430708407114825e-0
6
Constraint violation....: 6.3001923122918413e-11 6.3001923122918413e-1
1
Complementarity.........: 2.8882670483230666e-09 2.8882670483230667e-0
6
Overall NLP error.......: 2.8882670483230666e-09 2.8882670483230667e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1581149e+02 1.09e+02 1.13e+02 -1.0 3.76e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1398166e+04 5.38e-02 8.36e+01 -1.0 4.53e+01 - 3.10e-02 1.00e+0
0h 1
3 2.7844002e+03 5.17e-02 6.49e+01 -1.0 8.43e+01 - 2.27e-01 4.32e-0
2f 1
4 9.8151051e+02 4.24e-02 3.38e+01 -1.0 3.41e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5904923e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.22e-01 1.00e+0
0h 1
6 9.4490069e+02 1.01e-02 8.72e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6264521e+02 4.59e-04 6.60e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536417e+02 1.94e-03 1.94e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379698e+02 3.25e-03 6.11e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140240e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388155e+02 1.57e-04 1.69e-02 -3.8 7.57e-01 - 9.93e-01 9.41e-0
1h 1
12 5.8370191e+02 7.28e-07 6.65e-05 -3.8 8.61e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278679e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.06e-09 -5.7 3.40e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148939926e-01 5.8277753148939928e+0
2
Dual infeasibility......: 2.0879852486696931e-09 2.0879852486696931e-0
6
Constraint violation....: 6.2994165439533845e-11 6.2994165439533845e-1
1
Complementarity.........: 2.8882094394659597e-09 2.8882094394659598e-0
6
Overall NLP error.......: 2.8882094394659597e-09 2.8882094394659598e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.78e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.4998630e+02 7.50e+01 9.04e+01 -1.0 2.59e+01 - 3.83e-04 3.52e-0
2f 1
2 1.1818341e+04 5.63e-02 8.12e+01 -1.0 2.87e+01 - 4.63e-02 1.00e+0
0h 1
3 3.1581534e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.65e-0
2f 1
4 1.0153733e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8174846e+03 7.29e-03 1.56e+01 -1.0 1.92e+01 - 6.09e-01 1.00e+0
0h 1
6 1.1184585e+03 5.41e-03 4.04e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8225330e+02 9.95e-04 2.08e-01 -1.7 5.71e+00 - 1.00e+00 8.88e-0
1h 1
8 7.2799856e+02 8.49e-04 1.34e-02 -1.7 3.45e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0975665e+02 1.50e-03 1.13e-01 -3.8 4.49e+00 - 7.71e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8217019e+02 2.16e-03 7.30e-02 -3.8 2.11e+00 - 8.07e-01 7.39e-0
1h 1
11 5.8337147e+02 9.05e-05 4.55e-02 -3.8 3.14e-02 - 1.00e+00 9.58e-0
1h 1
12 5.8368714e+02 2.80e-07 1.28e-05 -3.8 3.43e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278925e+02 4.12e-07 5.33e-04 -5.7 3.47e-02 - 1.00e+00 9.91e-0
1h 1
14 5.8278859e+02 4.35e-11 3.50e-09 -5.7 2.19e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.64e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753112054742e-01 5.8277753112054745e+0
2
Dual infeasibility......: 2.6430708407114825e-09 2.6430708407114825e-0
6
Constraint violation....: 6.3001923122918413e-11 6.3001923122918413e-1
1
Complementarity.........: 2.8882670483230666e-09 2.8882670483230667e-0
6
Overall NLP error.......: 2.8882670483230666e-09 2.8882670483230667e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.28e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9789218e+02 4.10e+01 5.94e+01 -1.0 1.43e+01 - 6.99e-04 4.22e-0
2f 1
2 1.2226026e+04 6.07e-02 7.87e+01 -1.0 1.80e+01 - 7.06e-02 1.00e+0
0h 1
3 3.6195782e+03 5.54e-02 5.15e+01 -1.0 5.46e+01 - 3.33e-01 7.86e-0
2f 1
4 2.3514551e+03 2.93e-02 2.28e+01 -1.0 2.71e+01 - 5.44e-01 4.46e-0
1f 1
5 1.7549068e+03 8.51e-03 1.17e+00 -1.0 9.98e+00 - 9.27e-01 7.69e-0
1f 1
6 2.0281901e+03 3.41e-04 8.15e-02 -1.0 3.36e+00 - 1.00e+00 1.00e+0
0h 1
7 1.4007731e+03 2.08e-03 8.12e-02 -2.5 4.88e+00 - 8.66e-01 8.50e-0
1f 1
8 1.2211423e+03 2.16e-03 2.03e-01 -2.5 1.05e+00 - 1.00e+00 8.35e-0
1f 1
9 1.2050803e+03 8.06e-05 4.02e-03 -2.5 1.45e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1961992e+03 4.42e-05 1.28e+00 -3.8 9.48e-02 - 1.00e+00 4.80e-0
1h 1
11 1.1940687e+03 4.17e-07 1.17e-01 -3.8 4.38e-02 - 9.63e-01 1.00e+0
0f 1
12 1.1930118e+03 3.20e-08 2.15e-03 -3.8 3.31e-02 - 1.00e+00 1.00e+0
0H 1
13 1.1932214e+03 1.50e-05 3.30e-04 -3.8 4.66e-03 - 1.00e+00 1.00e+0
0f 1
14 1.1925890e+03 2.30e-06 5.84e-02 -5.7 1.25e-02 - 7.80e-01 9.72e-0
1h 1
15 1.1924263e+03 1.22e-05 1.93e-04 -5.7 5.02e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1924317e+03 1.66e-08 1.47e-06 -5.7 1.97e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1924186e+03 2.51e-08 1.69e-06 -8.6 2.33e-04 - 9.84e-01 9.83e-0
1h 1
18 1.1924184e+03 6.36e-13 3.63e-11 -8.6 3.01e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1924184395055499e+00 1.1924184395055499e+0
3
Dual infeasibility......: 3.6343656984146294e-11 3.6343656984146294e-0
8
Constraint violation....: 6.3593574850528967e-13 6.3593574850528967e-1
3
Complementarity.........: 2.5125223119457245e-09 2.5125223119457244e-0
6
Overall NLP error.......: 2.5125223119457245e-09 2.5125223119457244e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 44
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 22
inequality constraints with only lower bounds: 13
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2174980e+02 9.17e+02 5.24e+01 -1.0 9.17e+02 - 3.31e-04 9.91e-0
3h 1
2 7.8118804e+02 9.16e+02 5.24e+01 -1.0 8.56e+02 - 1.27e-04 1.48e-0
3h 1
3 2.4426540e+02 8.97e+02 5.26e+01 -1.0 9.16e+02 - 1.48e-03 2.07e-0
2h 1
4 1.1965202e+04 5.60e-02 8.39e+01 -1.0 8.97e+02 - 2.37e-02 1.00e+0
0h 1
5 3.9362039e+03 5.40e-02 6.76e+01 -1.0 7.97e+01 - 1.98e-01 3.75e-0
2f 1
6 1.9778911e+03 4.38e-02 3.59e+01 -1.0 3.42e+01 - 4.74e-01 5.41e-0
1f 1
7 2.6448281e+03 1.90e-02 2.06e+01 -1.0 1.92e+01 - 3.76e-01 2.50e-0
1f 3
8 1.9481737e+03 7.67e-03 3.81e-01 -1.0 9.96e+00 - 9.84e-01 1.00e+0
0f 1
9 1.6824853e+03 1.34e-03 2.79e-01 -1.7 4.78e+00 - 1.00e+00 8.75e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8388784e+03 9.58e-04 6.31e-02 -1.7 2.03e+02 - 8.35e-01 1.00e+0
0f 1
11 1.5561146e+03 1.17e-03 5.28e-02 -2.5 1.82e+02 - 9.17e-01 1.00e+0
0f 1
12 1.5401652e+03 1.25e-03 1.56e-02 -2.5 1.09e+00 - 1.00e+00 1.00e+0
0h 1
13 1.5074233e+03 2.21e-04 1.06e-01 -3.8 2.50e+01 - 1.00e+00 8.34e-0
1h 1
14 1.5025664e+03 5.29e-07 1.35e-04 -3.8 3.77e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5003221e+03 4.01e-07 1.63e-04 -5.7 1.33e+00 - 1.00e+00 9.97e-0
1h 1
16 1.5003209e+03 3.89e-11 2.95e-09 -5.7 4.52e-02 - 1.00e+00 1.00e+0
0f 1
17 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.66e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5002932872725288e+00 1.5002932872725287e+0
3
Dual infeasibility......: 2.1737238995873492e-09 2.1737238995873492e-0
6
Constraint violation....: 6.2996038940887900e-11 6.2996038940887900e-1
1
Complementarity.........: 2.8882200798961658e-09 2.8882200798961658e-0
6
Overall NLP error.......: 2.8882200798961658e-09 2.8882200798961658e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6450098e+02 9.17e+02 5.24e+01 -1.0 9.17e+02 - 4.97e-04 9.91e-0
3h 1
2 8.1514470e+02 9.16e+02 5.24e+01 -1.0 8.68e+02 - 1.25e-04 1.83e-0
3h 1
3 2.6462560e+02 8.96e+02 5.25e+01 -1.0 9.16e+02 - 1.83e-03 2.15e-0
2h 1
4 1.2213178e+04 6.10e-02 8.27e+01 -1.0 8.96e+02 - 2.49e-02 1.00e+0
0h 1
5 4.3784850e+03 5.84e-02 6.49e+01 -1.0 6.78e+01 - 2.18e-01 3.86e-0
2f 1
6 2.4401928e+03 3.41e-02 3.46e+01 -1.0 3.15e+01 - 4.81e-01 6.08e-0
1f 1
74 1.739440e+04 1.632511e+04 5.827120e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1156838e+02 1.57e+04 5.50e+01 -1.0 1.59e+04 - 1.75e-04 9.80e-0
3f 1
2 7.0871565e+02 1.57e+04 5.50e+01 -1.0 1.51e+04 - 4.88e-05 1.03e-0
4h 1
3 6.8558075e+02 1.57e+04 5.49e+01 -1.0 1.57e+04 - 5.99e-06 1.87e-0
3h 1
4 5.0453697e+02 1.54e+04 5.39e+01 -1.0 1.57e+04 - 1.99e-03 1.86e-0
2h 1
5 2.5733276e+04 7.61e-02 8.68e+01 -1.0 1.54e+04 - 2.60e-02 1.00e+0
0h 1
6 1.7881486e+04 7.32e-02 7.10e+01 -1.0 6.80e+01 - 1.91e-01 4.11e-0
2f 1
7 1.6631568e+04 4.65e-02 3.26e+01 -1.0 2.00e+01 - 5.34e-01 3.77e-0
1f 1
8 1.7128217e+04 3.51e-02 1.08e+01 -1.0 1.33e+01 - 5.66e-01 2.50e-0
1f 3
9 1.6801685e+04 7.33e-03 1.36e-01 -1.0 1.69e+00 - 9.92e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6502044e+04 7.26e-04 6.18e-02 -1.7 8.07e+00 - 8.99e-01 9.14e-0
1f 1
11 1.6384048e+04 1.43e-03 2.12e-01 -2.5 4.94e+00 - 8.08e-01 1.00e+0
0f 1
12 1.6339164e+04 3.15e-03 4.47e-02 -2.5 4.07e+00 - 1.00e+00 1.00e+0
0h 1
13 1.6349717e+04 1.52e-04 4.51e-03 -2.5 4.46e+00 - 1.00e+00 1.00e+0
0h 1
14 1.6326532e+04 1.66e-04 9.36e-03 -3.8 5.36e+00 - 9.96e-01 9.61e-0
1h 1
15 1.6326328e+04 5.37e-07 6.27e-05 -3.8 2.11e-01 - 1.00e+00 1.00e+0
0h 1
16 1.6325119e+04 3.82e-07 1.34e-04 -5.7 2.97e-01 - 1.00e+00 9.97e-0
1h 1
17 1.6325120e+04 3.86e-11 3.17e-09 -5.7 2.49e-02 - 1.00e+00 1.00e+0
0f 1
18 1.6325105e+04 6.27e-11 1.53e-06 -8.6 3.68e-03 - 1.00e+00 9.98e-0
1h 1
19 1.6325105e+04 3.33e-16 2.51e-14 -8.6 5.66e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.6325105277941187e+01 1.6325105277941188e+0
4
Dual infeasibility......: 2.5059164812657464e-14 2.5059164812657464e-1
1
Constraint violation....: 3.3306690738754696e-16 3.3306690738754696e-1
6
Complementarity.........: 4.9707363791223921e-09 4.9707363791223916e-0
6
Overall NLP error.......: 4.9707363791223921e-09 4.9707363791223916e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.4941815e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.08e-04 9.80e-0
3f 1
2 7.4648219e+02 1.50e+04 5.25e+01 -1.0 1.38e+04 - 3.30e-05 1.08e-0
4h 1
3 7.4064923e+02 1.50e+04 5.25e+01 -1.0 1.49e+04 - 1.14e-05 4.37e-0
4h 1
4 7.3726226e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 4.51e-04 2.64e-0
4h 1
5 5.0052516e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 8.38e-04 1.97e-0
2f 1
6 2.5561785e+04 6.62e-02 8.55e+01 -1.0 1.47e+04 - 2.82e-02 1.00e+0
0h 1
7 1.7362787e+04 6.37e-02 6.85e+01 -1.0 7.52e+01 - 2.06e-01 4.21e-0
2f 1
8 1.5906514e+04 4.59e-02 3.30e+01 -1.0 2.56e+01 - 5.13e-01 4.15e-0
1f 1
9 1.6184696e+04 3.40e-02 1.21e+01 -1.0 1.50e+01 - 4.99e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6018863e+04 5.42e-03 2.38e-01 -1.0 2.64e+00 - 9.86e-01 1.00e+0
0h 1
11 1.5730002e+04 9.27e-04 2.27e-01 -1.7 4.75e+00 - 1.00e+00 8.86e-0
1f 1
12 1.5735839e+04 7.49e-04 9.39e-03 -1.7 4.63e+01 - 1.00e+00 1.00e+0
0f 1
13 1.5590861e+04 1.07e-03 3.52e-02 -2.5 4.89e+01 - 9.35e-01 9.97e-0
1f 1
14 1.5576767e+04 1.06e-03 1.22e-02 -2.5 3.32e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5561399e+04 1.76e-04 8.47e-02 -3.8 3.65e+00 - 1.00e+00 8.54e-0
1h 1
16 1.5560279e+04 5.43e-07 1.06e-04 -3.8 1.89e-01 - 1.00e+00 1.00e+0
0h 1
17 1.5559212e+04 4.00e-07 1.10e-04 -5.7 1.49e-01 - 1.00e+00 9.97e-0
1h 1
18 1.5559215e+04 3.83e-11 3.02e-09 -5.7 1.26e-02 - 1.00e+00 1.00e+0
0f 1
19 1.5559202e+04 6.30e-11 2.06e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.5559202156616308e+01 1.5559202156616308e+0
4
Dual infeasibility......: 2.0615889130701206e-09 2.0615889130701206e-0
6
Constraint violation....: 6.2993721350323995e-11 6.2993721350323995e-1
1
Complementarity.........: 2.8882105866547805e-09 2.8882105866547804e-0
6
Overall NLP error.......: 2.8882105866547805e-09 2.8882105866547804e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2474720e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.32e-04 9.80e-0
3h 1
2 8.2170277e+02 1.39e+04 5.24e+01 -1.0 1.18e+04 - 2.43e-05 1.16e-0
4h 1
3 6.3924028e+02 1.37e+04 5.25e+01 -1.0 1.39e+04 - 2.07e-05 1.28e-0
2h 1
4 7.6039164e+02 1.34e+04 5.21e+01 -1.0 1.37e+04 - 1.38e-02 2.35e-0
2h 1
5 2.1053298e+04 6.36e-02 8.13e+01 -1.0 1.34e+04 - 7.03e-02 1.00e+0
0h 1
6 1.6317345e+04 5.74e-02 2.34e+01 -1.0 5.17e+01 - 6.92e-01 9.06e-0
2f 1
7 1.4844430e+04 3.59e-02 6.08e+00 -1.0 3.39e+01 - 7.06e-01 5.01e-0
1f 1
8 1.5222242e+04 6.10e-03 1.66e-01 -1.0 9.63e-01 - 9.90e-01 1.00e+0
0f 1
9 1.4689555e+04 9.63e-04 9.38e-01 -1.7 1.52e+01 - 2.55e-01 8.81e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4677304e+04 1.65e-04 3.94e-01 -1.7 1.59e+01 - 7.79e-01 1.00e+0
0f 1
11 1.4676792e+04 3.30e-04 6.96e-02 -1.7 2.94e+01 - 7.37e-01 1.00e+0
0h 1
12 1.4533534e+04 1.02e-03 6.81e-02 -2.5 4.10e+01 - 9.02e-01 1.00e+0
0f 1
13 1.4504607e+04 1.63e-03 1.67e-02 -2.5 7.31e+00 - 1.00e+00 1.00e+0
0h 1
14 1.4484489e+04 2.98e-04 1.17e-01 -3.8 1.08e+01 - 1.00e+00 8.24e-0
1h 1
15 1.4481583e+04 1.25e-07 1.41e-04 -3.8 1.91e+00 - 1.00e+00 1.00e+0
0h 1
16 1.4480070e+04 4.08e-07 1.58e-04 -5.7 5.94e-01 - 1.00e+00 9.97e-0
1h 1
17 1.4480070e+04 3.87e-11 2.90e-09 -5.7 2.00e-03 - 1.00e+00 1.00e+0
0f 1
18 1.4480052e+04 6.30e-11 2.18e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.4480051789766359e+01 1.4480051789766358e+0
4
Dual infeasibility......: 2.1765180261795703e-09 2.1765180261795703e-0
6
Constraint violation....: 6.2995983429736668e-11 6.2995983429736668e-1
1
Complementarity.........: 2.8882213313388354e-09 2.8882213313388353e-0
6
Overall NLP error.......: 2.8882213313388354e-09 2.8882213313388353e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.3473218e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.61e-04 9.80e-0
3h 1
2 8.3185891e+02 1.27e+04 5.24e+01 -1.0 1.20e+04 - 4.67e-05 1.04e-0
4h 1
3 8.1880391e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 7.76e-06 8.45e-0
4f 1
4 7.9513607e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 8.56e-04 1.60e-0
3h 1
5 5.2821548e+02 1.24e+04 5.24e+01 -1.0 1.26e+04 - 3.66e-03 2.11e-0
2f 1
6 2.2540300e+04 5.98e-02 8.22e+01 -1.0 1.24e+04 - 4.82e-02 1.00e+0
0h 1
7 1.5534907e+04 5.58e-02 4.40e+01 -1.0 6.87e+01 - 4.54e-01 6.13e-0
2f 1
8 1.3637829e+04 3.70e-02 2.14e+01 -1.0 4.02e+01 - 5.12e-01 5.02e-0
1f 1
9 1.3916652e+04 2.02e-02 4.79e+00 -1.0 8.95e+00 - 7.69e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3768661e+04 4.69e-03 1.26e-01 -1.0 4.87e+00 - 9.67e-01 1.00e+0
0h 1
11 1.3449638e+04 1.23e-03 1.11e-01 -1.7 1.02e+01 - 7.64e-01 7.98e-0
1f 1
12 1.3314920e+04 9.12e-04 3.77e-01 -2.5 5.20e+00 - 8.02e-01 1.00e+0
0f 1
13 1.3243901e+04 9.56e-03 9.16e-02 -2.5 4.04e+00 - 1.00e+00 9.28e-0
1h 1
14 1.3255240e+04 3.18e-04 4.68e-03 -2.5 9.91e-01 - 1.00e+00 1.00e+0
0f 1
15 1.3234478e+04 1.57e-04 3.00e-02 -3.8 3.42e+00 - 9.97e-01 9.15e-0
1h 1
16 1.3234130e+04 7.76e-07 6.46e-05 -3.8 5.27e-02 - 1.00e+00 1.00e+0
0h 1
17 1.3233062e+04 3.75e-07 2.36e-04 -5.7 1.52e-01 - 1.00e+00 9.95e-0
1h 1
18 1.3233064e+04 3.78e-11 2.81e-09 -5.7 3.49e-03 - 1.00e+00 1.00e+0
0f 1
19 1.3233051e+04 6.30e-11 2.30e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.3233050935065762e+01 1.3233050935065761e+0
4
Dual infeasibility......: 2.2985398945598153e-09 2.2985398945598153e-0
6
Constraint violation....: 6.2997745908788261e-11 6.2997745908788261e-1
1
Complementarity.........: 2.8882312076397107e-09 2.8882312076397106e-0
6
Overall NLP error.......: 2.8882312076397107e-09 2.8882312076397106e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6065684e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 4.64e-04 9.80e-0
3f 1
2 8.5785809e+02 1.11e+04 5.24e+01 -1.0 1.09e+04 - 9.20e-05 1.01e-0
4h 1
3 8.4423577e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 3.89e-06 8.15e-0
4f 1
4 4.9087989e+02 1.09e+04 5.25e+01 -1.0 1.11e+04 - 8.94e-04 2.18e-0
2h 1
5 2.2805436e+04 5.93e-02 8.05e+01 -1.0 1.09e+04 - 4.92e-02 1.00e+0
0h 1
6 1.4408318e+04 5.54e-02 5.29e+01 -1.0 7.49e+01 - 3.32e-01 5.94e-0
2f 1
7 1.2685804e+04 2.89e-02 2.79e+01 -1.0 4.05e+01 - 4.71e-01 4.55e-0
1f 1
8 1.2392256e+04 1.23e-02 2.57e+00 -1.0 1.13e+01 - 9.19e-01 1.00e+0
0f 1
9 1.2488372e+04 7.21e-04 6.69e-02 -1.0 5.32e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2046511e+04 4.88e-04 7.02e-01 -2.5 7.38e+00 - 8.99e-01 6.26e-0
1f 1
11 1.1933063e+04 4.64e-04 3.59e-01 -2.5 4.01e+00 - 8.56e-01 1.00e+0
0f 1
12 1.1932827e+04 5.70e-05 1.07e-02 -2.5 1.07e-02 0.0 1.00e+00 1.00e+0
0h 1
13 1.1898163e+04 1.94e-04 1.06e-01 -3.8 1.05e+01 - 6.03e-01 1.61e-0
1f 1
14 1.1885400e+04 4.81e-03 3.91e-02 -3.8 2.25e+00 - 5.71e-01 6.50e-0
1h 1
15 1.1879402e+04 4.23e-03 4.50e-03 -3.8 7.88e-01 - 1.00e+00 8.85e-0
1h 1
16 1.1879231e+04 2.36e-03 2.21e-02 -3.8 9.08e-02 - 1.00e+00 4.42e-0
1f 2
17 1.1879205e+04 8.33e-06 2.53e-04 -3.8 5.07e-02 - 1.00e+00 1.00e+0
0h 1
18 1.1878139e+04 6.21e-05 6.63e-03 -5.7 1.49e-01 - 9.63e-01 7.51e-0
1h 1
19 1.1877852e+04 5.62e-06 6.26e-04 -5.7 3.70e-02 - 9.05e-01 9.81e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.1877849e+04 4.00e-09 3.56e-06 -5.7 7.19e-04 - 1.00e+00 1.00e+0
0f 1
21 1.1877836e+04 5.74e-09 5.93e-04 -8.6 1.84e-03 - 1.00e+00 9.22e-0
1h 1
22 1.1877835e+04 1.31e-11 1.59e-09 -8.6 1.43e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.1877835092565478e+01 1.1877835092565478e+0
4
Dual infeasibility......: 1.5897659474645296e-09 1.5897659474645296e-0
6
Constraint violation....: 1.3052892100517965e-11 1.3052892100517965e-1
1
Complementarity.........: 2.9201896466114657e-09 2.9201896466114658e-0
6
Overall NLP error.......: 2.9201896466114657e-09 2.9201896466114658e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0889550e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0544003e+02 9.19e+03 5.23e+01 -1.0 6.53e+03 - 1.88e-05 1.39e-0
4h 1
3 4.7820593e+02 8.97e+03 5.24e+01 -1.0 9.19e+03 - 4.54e-05 2.34e-0
2f 1
4 2.1767436e+04 6.51e-02 8.07e+01 -1.0 8.97e+03 - 2.85e-02 1.00e+0
0h 1
5 1.3313724e+04 6.22e-02 6.41e+01 -1.0 3.95e+01 - 2.06e-01 4.10e-0
2f 1
6 1.2046235e+04 2.08e-02 3.03e+01 -1.0 1.63e+01 - 5.38e-01 6.14e-0
1f 1
7 1.1599697e+04 6.95e-03 9.87e-01 -1.0 5.66e+00 - 9.55e-01 7.67e-0
1f 1
8 1.1862526e+04 2.40e-04 7.34e-02 -1.0 4.91e+00 - 1.00e+00 1.00e+0
0f 1
9 1.1304379e+04 2.07e-03 8.43e-02 -2.5 5.91e+00 - 8.56e-01 8.40e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1141032e+04 2.16e-03 4.29e-01 -2.5 1.11e+00 - 1.00e+00 7.59e-0
1f 1
11 1.1113965e+04 1.30e-04 4.69e-03 -2.5 2.72e-01 - 1.00e+00 1.00e+0
0h 1
12 1.1091124e+04 3.48e-05 1.49e-01 -3.8 1.07e+01 - 1.00e+00 7.59e-0
1h 1
13 1.1085027e+04 1.28e-07 3.42e-04 -3.8 2.58e+00 - 1.00e+00 1.00e+0
0f 1
14 1.1083360e+04 2.84e-08 9.75e-04 -5.7 5.94e-01 - 1.00e+00 9.85e-0
1f 1
15 1.1083341e+04 1.89e-12 1.38e-08 -5.7 8.84e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1083321e+04 2.63e-12 4.48e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.1083320755986682e+01 1.1083320755986682e+0
4
Dual infeasibility......: 4.4776952538331170e-09 4.4776952538331170e-0
6
Constraint violation....: 2.6309093792420413e-12 2.6309093792420413e-1
2
Complementarity.........: 3.6084983071395973e-09 3.6084983071395971e-0
6
Overall NLP error.......: 4.4776952538331170e-09 4.4776952538331170e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3710605e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 3.06e-03 9.80e-0
3h 1
2 9.3410771e+02 6.71e+03 5.23e+01 -1.0 6.33e+03 - 5.53e-05 1.05e-0
4h 1
3 8.7601628e+02 6.69e+03 5.23e+01 -1.0 6.70e+03 - 8.90e-06 2.62e-0
3f 1
4 4.4078555e+02 6.54e+03 5.23e+01 -1.0 6.69e+03 - 3.32e-03 2.17e-0
2h 1
5 1.7952487e+04 7.75e-02 7.79e+01 -1.0 6.54e+03 - 7.84e-02 1.00e+0
0h 1
6 1.1162158e+04 7.00e-02 2.30e+01 -1.0 4.32e+00 - 6.80e-01 8.97e-0
2f 1
7 1.0161093e+04 3.32e-02 7.43e+00 -1.0 4.23e+00 - 7.42e-01 1.00e+0
0f 1
8 1.0283900e+04 1.70e-02 7.27e-01 -1.0 1.10e+00 - 9.96e-01 4.94e-0
1f 2
9 1.0000013e+04 8.27e-03 3.35e-01 -1.7 1.28e+01 - 1.00e+00 8.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.9361941e+03 1.02e-03 1.04e-01 -1.7 8.95e+00 - 1.00e+00 1.00e+0
0f 1
11 9.8169976e+03 2.77e-04 1.12e-01 -2.5 1.73e+01 - 9.89e-01 8.85e-0
1f 1
12 9.8069007e+03 4.94e-06 1.10e-03 -2.5 1.95e+00 - 1.00e+00 1.00e+0
0f 1
13 9.7851225e+03 5.56e-06 7.61e-04 -3.8 2.68e+00 - 1.00e+00 1.00e+0
0f 1
14 9.7842068e+03 3.44e-09 3.52e-06 -5.7 1.48e-01 - 1.00e+00 1.00e+0
0h 1
15 9.7841926e+03 2.34e-12 4.09e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 9.7841925911700489e+00 9.7841925911700491e+0
3
Dual infeasibility......: 4.0868829584848518e-10 4.0868829584848518e-0
7
Constraint violation....: 2.3424040485053865e-12 2.3424040485053865e-1
2
Complementarity.........: 2.5729802580423078e-09 2.5729802580423075e-0
6
Overall NLP error.......: 2.5729802580423078e-09 2.5729802580423075e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0880494e+02 4.77e+03 5.23e+01 -1.0 4.81e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0291924e+02 4.77e+03 5.23e+01 -1.0 2.79e+03 - 2.15e-05 2.38e-0
4h 1
3 3.7467532e+02 4.66e+03 5.24e+01 -1.0 4.77e+03 - 1.51e-04 2.34e-0
2f 1
4 1.7300257e+04 6.53e-02 7.97e+01 -1.0 4.66e+03 - 4.04e-02 1.00e+0
0h 1
5 8.8617124e+03 6.16e-02 5.71e+01 -1.0 3.53e+01 - 2.79e-01 5.15e-0
2f 1
6 7.5509801e+03 1.93e-02 2.65e+01 -1.0 1.63e+01 - 5.49e-01 6.34e-0
1f 1
7 7.1819282e+03 5.83e-03 7.45e-01 -1.0 4.62e+00 - 9.62e-01 8.21e-0
1f 1
8 7.4584045e+03 1.60e-04 6.01e-02 -1.0 6.90e+00 - 9.98e-01 1.00e+0
0f 1
9 6.8760584e+03 2.23e-03 9.84e-02 -2.5 6.13e+00 - 8.54e-01 8.68e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.7216704e+03 2.17e-03 3.89e-01 -2.5 1.52e+00 - 1.00e+00 7.71e-0
1f 1
11 6.6995732e+03 1.09e-04 4.64e-03 -2.5 3.75e-01 - 1.00e+00 1.00e+0
0h 1
12 6.6742316e+03 2.93e-05 1.37e-01 -3.8 1.34e+01 - 1.00e+00 7.68e-0
1h 1
13 6.6677283e+03 1.17e-07 3.28e-04 -3.8 3.11e+00 - 1.00e+00 1.00e+0
0f 1
14 6.6659139e+03 2.88e-08 1.03e-03 -5.7 7.43e-01 - 1.00e+00 9.85e-0
1f 1
15 6.6658915e+03 1.98e-12 1.42e-08 -5.7 1.14e-02 - 1.00e+00 1.00e+0
0f 1
16 6.6658693e+03 2.63e-12 4.48e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.6658693477208892e+00 6.6658693477208890e+0
3
Dual infeasibility......: 4.4776954836039330e-09 4.4776954836039330e-0
6
Constraint violation....: 2.6308816236664256e-12 2.6308816236664256e-1
2
Complementarity.........: 3.6084966577586264e-09 3.6084966577586263e-0
6
Overall NLP error.......: 4.4776954836039330e-09 4.4776954836039330e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6658302e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 4.97e-04 9.81e-0
3f 1
2 8.6365170e+02 3.24e+03 5.24e+01 -1.0 3.03e+03 - 9.59e-05 1.06e-0
4h 1
3 7.9164439e+02 3.23e+03 5.24e+01 -1.0 3.24e+03 - 1.34e-05 2.94e-0
3f 1
4 3.2269649e+02 3.17e+03 5.24e+01 -1.0 3.23e+03 - 4.33e-03 2.11e-0
2h 1
5 1.3532414e+04 6.35e-02 8.05e+01 -1.0 3.17e+03 - 5.89e-02 1.00e+0
0h 1
6 6.4324764e+03 5.86e-02 4.63e+01 -1.0 6.47e+01 - 4.10e-01 7.06e-0
2f 1
7 4.8641757e+03 3.05e-02 2.15e+01 -1.0 3.76e+01 - 5.25e-01 4.45e-0
1f 1
8 4.4515440e+03 1.21e-02 1.93e+00 -1.0 1.04e+01 - 9.23e-01 1.00e+0
0f 1
9 4.6903276e+03 4.06e-04 6.36e-02 -1.0 4.25e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2205020e+03 5.03e-04 7.11e-01 -2.5 6.93e+00 - 8.96e-01 6.21e-0
1f 1
11 4.1366846e+03 2.39e-04 3.87e-01 -2.5 2.43e+00 - 8.90e-01 1.00e+0
0h 1
12 4.1101121e+03 5.79e-03 1.75e-01 -2.5 1.74e+00 - 1.00e+00 6.83e-0
1h 1
13 4.1031715e+03 5.46e-04 4.14e-03 -2.5 3.56e-01 - 1.00e+00 1.00e+0
0f 1
14 4.0873945e+03 1.16e-03 3.01e-02 -3.8 2.68e+00 - 8.04e-01 1.00e+0
0h 1
15 4.0842958e+03 2.39e-03 1.07e-03 -3.8 4.80e-02 - 1.00e+00 1.00e+0
0h 1
16 4.0846634e+03 4.13e-05 1.38e-04 -3.8 1.45e-02 - 1.00e+00 1.00e+0
0h 1
17 4.0833438e+03 1.04e-04 4.02e-04 -5.7 1.49e-01 - 9.51e-01 9.80e-0
1h 1
18 4.0833356e+03 2.19e-05 3.60e-03 -5.7 2.93e-03 - 1.00e+00 7.90e-0
1h 1
19 4.0833393e+03 8.57e-09 1.14e-06 -5.7 6.15e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 4.0833246e+03 8.99e-09 1.93e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
21 4.0833244e+03 1.37e-12 6.48e-11 -8.6 3.06e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 4.0833243957845227e+00 4.0833243957845225e+0
3
Dual infeasibility......: 6.4795731197971588e-11 6.4795731197971581e-0
8
Constraint violation....: 1.3740120152760937e-12 1.3740120152760937e-1
2
Complementarity.........: 2.5092130209646155e-09 2.5092130209646154e-0
6
Overall NLP error.......: 2.5092130209646155e-09 2.5092130209646154e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1576532e+02 2.00e+03 5.23e+01 -1.0 2.01e+03 - 1.20e-03 9.82e-0
3h 1
2 9.1032142e+02 2.00e+03 5.23e+01 -1.0 1.04e+03 - 3.89e-05 2.06e-0
4h 1
3 3.1311212e+02 1.95e+03 5.24e+01 -1.0 2.00e+03 - 1.27e-04 2.35e-0
2f 1
4 1.4582884e+04 6.66e-02 7.62e+01 -1.0 1.95e+03 - 8.09e-02 1.00e+0
0h 1
5 6.1165383e+03 6.02e-02 3.22e+01 -1.0 2.09e+01 - 5.47e-01 8.74e-0
2f 1
6 4.5880149e+03 1.60e-02 1.42e+01 -1.0 1.27e+01 - 6.20e-01 8.67e-0
1f 1
7 4.8954300e+03 1.60e-03 1.23e-01 -1.0 3.70e+00 - 9.91e-01 1.00e+0
0f 1
8 4.4216927e+03 1.88e-03 1.47e-01 -1.7 9.36e+00 - 1.00e+00 1.00e+0
0f 1
9 4.2329567e+03 2.04e-03 3.71e-01 -2.5 1.60e+00 - 1.00e+00 7.85e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2060804e+03 1.91e-04 1.99e-02 -2.5 3.31e-01 - 1.00e+00 9.80e-0
1h 1
11 4.1818692e+03 1.86e-06 1.85e-02 -3.8 8.06e+00 - 9.84e-01 1.00e+0
0h 1
12 4.1819975e+03 1.74e-09 4.82e-06 -3.8 9.86e-03 - 1.00e+00 1.00e+0
0h 1
13 4.1805106e+03 1.80e-08 1.81e-04 -5.7 4.46e-01 - 1.00e+00 9.96e-0
1f 1
14 4.1805076e+03 1.80e-12 2.29e-09 -5.7 1.79e-03 - 1.00e+00 1.00e+0
0f 1
15 4.1804892e+03 2.63e-12 1.52e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 4.1804891649955938e+00 4.1804891649955935e+0
3
Dual infeasibility......: 1.5189631125573115e-09 1.5189631125573115e-0
6
Constraint violation....: 2.6292718002807192e-12 2.6292718002807192e-1
2
Complementarity.........: 2.8635057229426083e-09 2.8635057229426083e-0
6
Overall NLP error.......: 2.8635057229426083e-09 2.8635057229426083e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 44
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 22
inequality constraints with only lower bounds: 13
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0725216e+02 9.17e+02 5.23e+01 -1.0 9.17e+02 - 9.90e-04 9.91e-0
3h 1
2 7.5451730e+02 9.12e+02 5.23e+01 -1.0 9.02e+02 - 1.22e-04 5.84e-0
3h 1
3 3.0012627e+02 8.93e+02 5.22e+01 -1.0 9.12e+02 - 5.79e-03 2.12e-0
2h 1
4 1.1233520e+04 7.22e-02 8.23e+01 -1.0 8.93e+02 - 2.88e-02 1.00e+0
0h 1
5 4.9108717e+03 6.88e-02 5.64e+01 -1.0 3.07e+01 - 3.14e-01 4.50e-0
2f 1
6 3.6349998e+03 1.93e-02 2.44e+01 -1.0 1.68e+01 - 5.76e-01 6.59e-0
1f 1
7 3.3269675e+03 5.70e-03 7.44e-01 -1.0 4.26e+00 - 9.64e-01 8.57e-0
1f 1
8 3.6158336e+03 1.55e-04 5.67e-02 -1.0 8.19e+00 - 9.91e-01 1.00e+0
0f 1
9 3.0235227e+03 2.35e-03 1.35e-01 -2.5 1.36e+01 - 8.22e-01 8.83e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8791335e+03 1.98e-03 1.37e-01 -2.5 4.85e+00 - 8.75e-01 7.89e-0
1f 1
11 2.8576184e+03 1.49e-04 5.72e-03 -2.5 1.46e+00 - 1.00e+00 1.00e+0
0h 1
12 2.8241579e+03 3.92e-05 1.56e-01 -3.8 2.49e+01 - 1.00e+00 7.55e-0
1h 1
13 2.8148095e+03 1.41e-07 3.54e-04 -3.8 5.74e+00 - 1.00e+00 1.00e+0
0f 1
14 2.8124210e+03 2.79e-08 9.30e-04 -5.7 1.33e+00 - 1.00e+00 9.86e-0
1f 1
15 2.8123932e+03 1.87e-12 1.33e-08 -5.7 1.76e-02 - 1.00e+00 1.00e+0
0f 1
16 2.8123637e+03 2.63e-12 4.48e-09 -8.6 1.66e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 2.8123637244813464e+00 2.8123637244813463e+0
3
Dual infeasibility......: 4.4776955271266034e-09 4.4776955271266034e-0
6
Constraint violation....: 2.6305554956529420e-12 2.6305554956529420e-1
2
Complementarity.........: 3.6085002132224347e-09 3.6085002132224347e-0
6
Overall NLP error.......: 4.4776955271266034e-09 4.4776955271266034e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254210157e-01 6.4890146254210151e+0
2
Dual infeasibility......: 4.9126604771045655e-09 4.9126604771045655e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646095252464019e-09 4.3646095252464021e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126604771045655e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031320944656453e-09 2.1031320944656453e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896915596e-09 2.8882108896915594e-0
6
Overall NLP error.......: 2.8882108896915596e-09 2.8882108896915594e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254210157e-01 6.4890146254210151e+0
2
Dual infeasibility......: 4.9126604771045655e-09 4.9126604771045655e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646095252464019e-09 4.3646095252464021e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126604771045655e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.03e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 6.36e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643337e+00 1.6104063281643337e+0
3
Dual infeasibility......: 2.4577488759212246e-12 2.4577488759212246e-0
9
Constraint violation....: 6.3603173554942194e-15 6.3603173554942194e-1
5
Complementarity.........: 2.5062163910047551e-09 2.5062163910047549e-0
6
Overall NLP error.......: 2.5062163910047551e-09 2.5062163910047549e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2252293e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 3.31e-04 9.88e-0
3h 1
2 7.9742303e+02 9.17e+02 5.24e+01 -1.0 8.18e+02 - 9.71e-05 9.16e-0
4h 1
3 2.4312288e+02 8.97e+02 5.26e+01 -1.0 9.17e+02 - 9.08e-04 2.09e-0
2h 1
4 1.2260850e+04 5.54e-02 8.24e+01 -1.0 8.98e+02 - 3.89e-02 1.00e+0
0h 1
5 3.8743081e+03 5.28e-02 5.49e+01 -1.0 7.96e+01 - 3.31e-01 5.07e-0
2f 1
6 1.9080741e+03 3.72e-02 2.92e+01 -1.0 3.93e+01 - 4.71e-01 5.03e-0
1f 1
7 4.6563841e+03 1.22e-02 2.61e+01 -1.0 2.04e+01 - 4.03e-01 1.00e+0
0h 1
8 1.8744334e+03 1.17e-02 9.66e-01 -1.0 2.51e+01 - 9.88e-01 8.98e-0
1f 1
9 1.6954233e+03 5.10e-04 6.26e-02 -1.7 6.76e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5627878e+03 1.96e-03 2.19e-01 -2.5 1.25e+01 - 7.43e-01 1.00e+0
0f 1
11 1.5309769e+03 3.67e-03 1.04e-01 -2.5 2.12e+00 - 1.00e+00 9.19e-0
1h 1
12 1.5388648e+03 1.31e-04 3.49e-03 -2.5 1.16e+00 - 1.00e+00 1.00e+0
0h 1
13 1.5037418e+03 1.63e-04 2.17e-02 -3.8 1.88e+01 - 9.93e-01 9.32e-0
1h 1
14 1.5022722e+03 7.65e-07 7.15e-05 -3.8 1.24e+00 - 1.00e+00 1.00e+0
0f 1
15 1.5003196e+03 3.77e-07 1.78e-04 -5.7 1.04e+00 - 1.00e+00 9.96e-0
1h 1
16 1.5003172e+03 3.80e-11 2.94e-09 -5.7 1.11e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.29e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5002932826845496e+00 1.5002932826845497e+0
3
Dual infeasibility......: 2.1737078600189940e-09 2.1737078600189940e-0
6
Constraint violation....: 6.2995497707163395e-11 6.2995497707163395e-1
1
Complementarity.........: 2.8882173926694921e-09 2.8882173926694920e-0
6
Overall NLP error.......: 2.8882173926694921e-09 2.8882173926694920e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6513592e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 4.97e-04 9.88e-0
3h 1
2 8.3600930e+02 9.17e+02 5.24e+01 -1.0 8.33e+02 - 9.54e-05 1.08e-0
3h 1
3 2.6322504e+02 8.96e+02 5.25e+01 -1.0 9.17e+02 - 1.07e-03 2.19e-0
2h 1
4 1.2573574e+04 6.02e-02 8.02e+01 -1.0 8.97e+02 - 5.13e-02 1.00e+0
0h 1
5 4.2599275e+03 5.61e-02 5.27e+01 -1.0 7.19e+01 - 3.32e-01 6.13e-0
2f 1
6 2.6731519e+03 3.02e-02 2.71e+01 -1.0 3.87e+01 - 4.79e-01 4.34e-0
1f 1
75 1.552169e+04 1.632511e+04 5.883154e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6794703e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.80e-0
3f 1
2 7.6502063e+02 1.57e+04 5.25e+01 -1.0 1.45e+04 - 3.26e-05 1.07e-0
4h 1
3 7.6168233e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 1.10e-05 2.64e-0
4h 1
4 7.5116187e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 2.72e-04 8.55e-0
4h 1
5 5.3138804e+02 1.54e+04 5.27e+01 -1.0 1.57e+04 - 1.17e-03 1.98e-0
2f 1
6 2.6389950e+04 6.13e-02 8.48e+01 -1.0 1.54e+04 - 3.01e-02 1.00e+0
0h 1
7 1.8252117e+04 5.89e-02 6.57e+01 -1.0 7.59e+01 - 2.31e-01 4.37e-0
2f 1
8 1.6690551e+04 4.52e-02 3.23e+01 -1.0 2.87e+01 - 5.04e-01 4.34e-0
1f 1
9 1.6982737e+04 3.09e-02 1.27e+01 -1.0 1.60e+01 - 4.71e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6781686e+04 5.32e-03 1.83e-01 -1.0 3.80e+00 - 9.89e-01 1.00e+0
0h 1
11 1.6497575e+04 1.04e-03 9.23e-01 -1.7 4.59e+00 - 4.73e-01 8.80e-0
1f 1
12 1.6486007e+04 2.13e-04 6.43e-01 -1.7 7.20e+00 - 5.74e-01 1.00e+0
0f 1
13 1.6479965e+04 9.76e-05 1.30e-01 -1.7 1.11e+01 - 7.63e-01 1.00e+0
0h 1
14 1.6371042e+04 9.46e-04 6.62e-02 -2.5 1.25e+01 - 9.10e-01 1.00e+0
0f 1
15 1.6344565e+04 1.42e-03 1.48e-02 -2.5 4.30e+00 - 1.00e+00 1.00e+0
0h 1
16 1.6328187e+04 2.48e-04 1.02e-01 -3.8 5.64e+00 - 1.00e+00 8.37e-0
1h 1
17 1.6326334e+04 6.53e-07 1.23e-04 -3.8 8.36e-01 - 1.00e+00 1.00e+0
0h 1
18 1.6325118e+04 4.00e-07 1.10e-04 -5.7 2.97e-01 - 1.00e+00 9.98e-0
1h 1
19 1.6325120e+04 3.82e-11 3.01e-09 -5.7 1.93e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325105e+04 6.26e-11 1.61e-06 -8.6 3.68e-03 - 1.00e+00 9.97e-0
1h 1
21 1.6325105e+04 6.11e-16 3.35e-06 -8.6 9.11e-04 - 9.93e-01 1.00e+0
0f 1
22 1.6325105e+04 1.42e-14 2.51e-14 -8.6 4.67e-06 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.6325105275849769e+01 1.6325105275849768e+0
4
Dual infeasibility......: 2.5059056392440215e-14 2.5059056392440215e-1
1
Constraint violation....: 1.4210854715202004e-14 1.4210854715202004e-1
4
Complementarity.........: 2.6710192731537225e-09 2.6710192731537224e-0
6
Overall NLP error.......: 2.6710192731537225e-09 2.6710192731537224e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.1741930e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 3.14e-04 9.80e-0
3h 1
2 8.1440661e+02 1.50e+04 5.24e+01 -1.0 1.29e+04 - 2.43e-05 1.15e-0
4h 1
3 8.1252326e+02 1.50e+04 5.24e+01 -1.0 1.49e+04 - 1.91e-05 1.41e-0
4h 1
4 8.1163762e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 1.58e-04 6.76e-0
5h 1
5 5.3895727e+02 1.47e+04 5.26e+01 -1.0 1.50e+04 - 2.29e-04 2.11e-0
2f 1
6 2.6550813e+04 5.46e-02 8.26e+01 -1.0 1.47e+04 - 3.65e-02 1.00e+0
0h 1
7 1.7901423e+04 5.22e-02 5.91e+01 -1.0 8.21e+01 - 2.84e-01 4.82e-0
2f 1
8 1.5967240e+04 3.90e-02 3.15e+01 -1.0 3.78e+01 - 4.71e-01 4.97e-0
1f 1
9 1.6308880e+04 2.32e-02 1.47e+01 -1.0 2.01e+01 - 4.04e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6039093e+04 6.20e-03 3.21e-01 -1.0 5.40e+00 - 9.83e-01 1.00e+0
0h 1
11 1.5742825e+04 1.38e-03 3.61e-01 -1.7 5.10e+00 - 1.00e+00 8.40e-0
1f 1
12 1.5772556e+04 8.68e-04 1.00e-01 -1.7 8.08e+01 - 6.44e-01 1.00e+0
0f 1
13 1.5593743e+04 1.16e-03 6.23e-02 -2.5 7.82e+01 - 9.10e-01 1.00e+0
0f 1
14 1.5576565e+04 1.24e-03 1.58e-02 -2.5 1.09e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5561648e+04 2.22e-04 1.06e-01 -3.8 3.47e+00 - 1.00e+00 8.34e-0
1h 1
16 1.5560276e+04 9.41e-07 1.39e-04 -3.8 2.11e-01 - 1.00e+00 1.00e+0
0h 1
17 1.5559213e+04 3.95e-07 1.48e-04 -5.7 1.49e-01 - 1.00e+00 9.97e-0
1h 1
18 1.5559215e+04 3.88e-11 3.00e-09 -5.7 4.60e-02 - 1.00e+00 1.00e+0
0f 1
19 1.5559202e+04 6.30e-11 2.14e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.5559202156556424e+01 1.5559202156556423e+0
4
Dual infeasibility......: 2.1395187876198757e-09 2.1395187876198757e-0
6
Constraint violation....: 6.2995220151407239e-11 6.2995220151407239e-1
1
Complementarity.........: 2.8882168587827986e-09 2.8882168587827987e-0
6
Overall NLP error.......: 2.8882168587827986e-09 2.8882168587827987e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9473465e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 7.47e-04 9.81e-0
3h 1
2 8.9150017e+02 1.39e+04 5.24e+01 -1.0 1.01e+04 - 1.58e-05 1.36e-0
4h 1
3 8.8458917e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 4.12e-05 5.08e-0
4h 1
4 5.8015705e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 5.43e-04 2.28e-0
2h 1
5 2.6099450e+04 6.34e-02 8.15e+01 -1.0 1.36e+04 - 2.47e-02 1.00e+0
0h 1
6 1.7792005e+04 6.08e-02 6.59e+01 -1.0 5.35e+01 - 1.94e-01 3.77e-0
2f 1
7 1.6380245e+04 2.35e-02 3.28e+01 -1.0 2.20e+01 - 5.10e-01 5.69e-0
1f 1
8 1.5754260e+04 1.11e-02 1.87e+00 -1.0 8.74e+00 - 9.35e-01 8.18e-0
1f 1
9 1.6101354e+04 3.00e-04 8.84e-02 -1.0 3.33e+00 - 9.93e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5438082e+04 2.10e-03 9.75e-02 -2.5 5.26e+00 - 8.61e-01 8.80e-0
1f 1
11 1.5278369e+04 2.21e-03 3.12e-01 -2.5 3.59e+00 - 1.00e+00 7.93e-0
1f 1
12 1.5256475e+04 1.20e-04 4.09e-03 -2.5 1.10e+00 - 1.00e+00 1.00e+0
0h 1
13 1.5228555e+04 1.93e-05 4.04e-02 -3.8 1.10e+01 - 1.00e+00 8.89e-0
1h 1
14 1.5226414e+04 5.40e-08 5.87e-04 -3.8 1.09e+00 - 1.00e+00 1.00e+0
0f 1
15 1.5224663e+04 4.30e-08 1.15e-04 -5.7 5.94e-01 - 1.00e+00 9.96e-0
1f 1
16 1.5224661e+04 1.90e-12 1.64e-08 -5.7 1.78e-03 - 1.00e+00 1.00e+0
0f 1
17 1.5224641e+04 2.57e-12 2.85e-06 -8.6 7.37e-03 - 1.00e+00 9.99e-0
1f 1
18 1.5224641e+04 4.50e-16 4.48e-14 -8.6 3.76e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5224641199526282e+01 1.5224641199526281e+0
4
Dual infeasibility......: 4.4827152475141177e-14 4.4827152475141177e-1
1
Constraint violation....: 4.5029452028208842e-16 4.5029452028208842e-1
6
Complementarity.........: 2.5339724675256101e-09 2.5339724675256102e-0
6
Overall NLP error.......: 2.5339724675256101e-09 2.5339724675256102e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8072093e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.97e-04 9.80e-0
3h 1
2 8.7779318e+02 1.27e+04 5.24e+01 -1.0 1.12e+04 - 2.87e-05 1.11e-0
4h 1
3 8.7458384e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 1.55e-05 2.13e-0
4h 1
4 8.7248952e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 2.27e-04 1.41e-0
4h 1
5 5.3969735e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 3.82e-04 2.27e-0
2f 1
6 2.4685416e+04 6.15e-02 7.93e+01 -1.0 1.24e+04 - 5.62e-02 1.00e+0
0h 1
7 1.6182676e+04 5.71e-02 5.27e+01 -1.0 6.44e+01 - 3.23e-01 6.53e-0
2f 1
8 1.4824088e+04 3.11e-02 2.58e+01 -1.0 3.22e+01 - 5.00e-01 4.21e-0
1f 1
9 1.4037018e+04 1.19e-02 2.05e+00 -1.0 1.10e+01 - 9.20e-01 9.15e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4465737e+04 3.59e-04 1.59e-01 -1.0 4.90e+00 - 9.48e-01 1.00e+0
0f 1
11 1.3766879e+04 1.19e-03 6.70e-01 -1.7 1.62e+01 - 6.30e-01 1.00e+0
0f 1
12 1.3827662e+04 3.71e-05 2.11e-02 -1.7 5.11e+00 - 1.00e+00 1.00e+0
0h 1
13 1.3715691e+04 4.24e-05 2.47e-01 -2.5 2.69e+01 - 1.00e+00 8.32e-0
1f 1
14 1.3713441e+04 8.68e-05 3.22e-03 -2.5 4.90e+00 - 1.00e+00 1.00e+0
0f 1
15 1.3696772e+04 2.67e-04 8.09e-02 -3.8 5.03e+00 - 7.76e-01 9.87e-0
1h 1
16 1.3694049e+04 1.59e-03 1.89e-03 -3.8 1.54e-01 - 9.78e-01 1.00e+0
0h 1
17 1.3694080e+04 7.63e-05 6.45e-05 -3.8 1.20e-02 - 1.00e+00 1.00e+0
0h 1
18 1.3692874e+04 1.31e-04 1.11e-03 -5.7 1.51e-01 - 9.18e-01 1.00e+0
0h 1
19 1.3692834e+04 3.25e-05 6.66e-06 -5.7 8.40e-03 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.3692839e+04 1.82e-07 3.37e-06 -5.7 6.13e-04 - 1.00e+00 1.00e+0
0h 1
21 1.3692826e+04 2.64e-08 3.27e-05 -8.6 1.84e-03 - 1.00e+00 9.57e-0
1h 1
22 1.3692826e+04 4.37e-12 5.15e-11 -8.6 7.84e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.3692825540208553e+01 1.3692825540208552e+0
4
Dual infeasibility......: 5.1528264771426993e-11 5.1528264771426993e-0
8
Constraint violation....: 4.3736125832083417e-12 4.3736125832083417e-1
2
Complementarity.........: 2.5095115809938227e-09 2.5095115809938228e-0
6
Overall NLP error.......: 2.5095115809938227e-09 2.5095115809938228e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9481942e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 7.48e-04 9.80e-0
3h 1
2 8.9197823e+02 1.11e+04 5.24e+01 -1.0 1.04e+04 - 4.18e-05 1.06e-0
4h 1
3 8.3527080e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 9.63e-06 3.46e-0
3h 1
4 5.3623936e+02 1.08e+04 5.23e+01 -1.0 1.11e+04 - 3.85e-03 2.15e-0
2h 1
5 2.1933100e+04 6.71e-02 7.79e+01 -1.0 1.08e+04 - 8.01e-02 1.00e+0
0h 1
6 1.4673675e+04 6.05e-02 4.23e+01 -1.0 4.53e+01 - 4.37e-01 8.94e-0
2f 1
7 1.3327687e+04 2.86e-02 1.56e+01 -1.0 2.13e+01 - 6.21e-01 5.45e-0
1f 1
8 1.3017486e+04 4.21e-03 8.87e-01 -1.0 6.85e+00 - 9.49e-01 7.63e-0
1f 1
9 1.3264412e+04 1.26e-04 5.70e-02 -1.0 6.42e+00 - 9.98e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2672685e+04 2.20e-03 8.23e-02 -2.5 3.95e+00 - 8.61e-01 8.46e-0
1f 1
11 1.2504133e+04 2.15e-03 3.46e-01 -2.5 8.59e-01 - 1.00e+00 7.80e-0
1f 1
12 1.2479351e+04 1.52e-04 4.64e-03 -2.5 1.73e-01 - 1.00e+00 1.00e+0
0h 1
13 1.2456716e+04 2.22e-05 3.94e-02 -3.8 5.36e+00 - 1.00e+00 8.88e-0
1h 1
14 1.2455033e+04 5.68e-08 6.02e-04 -3.8 6.00e-01 - 1.00e+00 1.00e+0
0f 1
15 1.2453577e+04 4.28e-08 3.77e-05 -5.7 2.97e-01 - 1.00e+00 9.98e-0
1f 1
16 1.2453579e+04 1.88e-12 1.18e-08 -5.7 4.59e-04 - 1.00e+00 1.00e+0
0f 1
17 1.2453562e+04 2.57e-12 3.30e-06 -8.6 3.68e-03 - 1.00e+00 9.99e-0
1f 1
18 1.2453562e+04 1.65e-15 4.86e-14 -8.6 1.08e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.2453562314830299e+01 1.2453562314830298e+0
4
Dual infeasibility......: 4.8559591776866384e-14 4.8559591776866384e-1
1
Constraint violation....: 1.6506584536643577e-15 1.6506584536643577e-1
5
Complementarity.........: 2.7139520055992153e-09 2.7139520055992153e-0
6
Overall NLP error.......: 2.7139520055992153e-09 2.7139520055992153e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3005293e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 2.02e-03 9.81e-0
3h 1
2 9.2651210e+02 9.19e+03 5.23e+01 -1.0 6.50e+03 - 1.50e-05 1.40e-0
4h 1
3 4.8735725e+02 8.97e+03 5.24e+01 -1.0 9.19e+03 - 4.50e-05 2.34e-0
2f 1
4 2.1862187e+04 7.01e-02 8.02e+01 -1.0 8.97e+03 - 3.23e-02 1.00e+0
0h 1
5 1.3691797e+04 6.67e-02 6.19e+01 -1.0 1.57e+01 - 2.28e-01 4.50e-0
2f 1
6 1.2506350e+04 1.60e-02 2.67e+01 -1.0 7.64e+00 - 6.04e-01 8.60e-0
1f 1
7 1.2596694e+04 5.65e-03 2.44e-01 -1.0 2.19e+00 - 9.91e-01 1.00e+0
0f 1
8 1.2196507e+04 1.61e-03 1.40e-01 -1.7 5.04e+00 - 1.00e+00 9.30e-0
1f 1
9 1.2024810e+04 1.68e-03 5.13e-01 -2.5 3.38e+00 - 1.00e+00 7.47e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1991288e+04 2.90e-04 1.15e-01 -2.5 8.50e-01 - 1.00e+00 8.88e-0
1h 1
11 1.1993022e+04 8.46e-06 2.09e-03 -2.5 9.55e-02 - 1.00e+00 1.00e+0
0f 1
12 1.1965653e+04 8.02e-06 3.85e-03 -3.8 8.04e+00 - 1.00e+00 9.81e-0
1f 1
13 1.1965506e+04 1.39e-08 6.12e-06 -3.8 1.52e-01 - 1.00e+00 1.00e+0
0f 1
14 1.1964016e+04 1.73e-08 3.04e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0f 1
15 1.1963999e+04 1.28e-12 4.22e-10 -8.6 5.52e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.1963999154507619e+01 1.1963999154507619e+0
4
Dual infeasibility......: 4.2180045896386727e-10 4.2180045896386727e-0
7
Constraint violation....: 1.2798928583634961e-12 1.2798928583634961e-1
2
Complementarity.........: 3.3042129586449819e-09 3.3042129586449820e-0
6
Overall NLP error.......: 3.3042129586449819e-09 3.3042129586449820e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3709613e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 3.06e-03 9.81e-0
3h 1
2 9.3353198e+02 6.71e+03 5.23e+01 -1.0 5.10e+03 - 1.89e-05 1.30e-0
4h 1
3 4.2613385e+02 6.55e+03 5.24e+01 -1.0 6.71e+03 - 3.56e-05 2.29e-0
2f 1
4 1.9281092e+04 7.30e-02 8.02e+01 -1.0 6.55e+03 - 3.74e-02 1.00e+0
0h 1
5 1.1339331e+04 6.91e-02 5.90e+01 -1.0 8.02e+00 - 2.64e-01 5.00e-0
2f 1
6 1.0190236e+04 2.14e-02 2.42e+01 -1.0 5.08e+00 - 6.39e-01 1.00e+0
0f 1
7 1.0517954e+04 2.95e-03 2.01e-01 -1.0 2.03e+00 - 9.91e-01 1.00e+0
0f 1
8 1.0004054e+04 1.59e-03 6.62e-02 -1.7 5.15e+00 - 1.00e+00 9.87e-0
1f 1
9 9.8321708e+03 1.66e-03 3.42e-01 -2.5 1.25e+00 - 1.00e+00 8.01e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.8071756e+03 3.62e-05 7.24e-03 -2.5 2.80e-01 - 1.00e+00 1.00e+0
0h 1
11 9.7854015e+03 2.15e-06 7.23e-04 -3.8 5.36e+00 - 1.00e+00 1.00e+0
0h 1
12 9.7842083e+03 1.50e-08 3.75e-06 -5.7 2.95e-01 - 1.00e+00 1.00e+0
0h 1
13 9.7841926e+03 1.71e-12 4.05e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 13
(scaled) (unscaled)
Objective...............: 9.7841925920775168e+00 9.7841925920775175e+0
3
Dual infeasibility......: 4.0517096225096513e-10 4.0517096225096513e-0
7
Constraint violation....: 1.7060935997292859e-12 1.7060935997292859e-1
2
Complementarity.........: 3.3560896803585592e-09 3.3560896803585590e-0
6
Overall NLP error.......: 3.3560896803585592e-09 3.3560896803585590e-0
6
Number of objective function evaluations = 14
Number of objective gradient evaluations = 14
Number of equality constraint evaluations = 14
Number of inequality constraint evaluations = 14
Number of equality constraint Jacobian evaluations = 14
Number of inequality constraint Jacobian evaluations = 14
Number of Lagrangian Hessian evaluations = 13
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3000909e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 2.02e-03 9.81e-0
3h 1
2 9.2540939e+02 4.77e+03 5.23e+01 -1.0 2.66e+03 - 1.91e-05 1.78e-0
4h 1
3 3.8379504e+02 4.66e+03 5.24e+01 -1.0 4.77e+03 - 8.68e-05 2.34e-0
2f 1
4 1.7424477e+04 7.01e-02 7.87e+01 -1.0 4.66e+03 - 5.08e-02 1.00e+0
0h 1
5 9.2441130e+03 6.55e-02 5.13e+01 -1.0 1.16e+01 - 3.39e-01 6.13e-0
2f 1
6 7.9204820e+03 2.27e-02 2.21e+01 -1.0 7.02e+00 - 6.27e-01 9.88e-0
1f 1
7 8.2927286e+03 2.17e-03 1.89e-01 -1.0 2.55e+00 - 9.91e-01 1.00e+0
0f 1
8 7.7707479e+03 1.76e-03 6.99e-02 -1.7 6.35e+00 - 1.00e+00 9.92e-0
1f 1
9 7.5980728e+03 1.95e-03 3.69e-01 -2.5 1.67e+00 - 1.00e+00 7.91e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.5727496e+03 1.82e-04 4.79e-02 -2.5 3.44e-01 - 1.00e+00 9.36e-0
1h 1
11 7.5754877e+03 7.05e-06 1.34e-03 -2.5 2.20e-02 - 1.00e+00 1.00e+0
0f 1
12 7.5482488e+03 7.66e-06 4.23e-03 -3.8 8.04e+00 - 1.00e+00 9.79e-0
1f 1
13 7.5480543e+03 1.37e-08 6.27e-06 -3.8 1.66e-01 - 1.00e+00 1.00e+0
0f 1
14 7.5465649e+03 1.73e-08 3.04e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0f 1
15 7.5465477e+03 1.28e-12 4.22e-10 -8.6 5.52e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 7.5465477395634961e+00 7.5465477395634962e+0
3
Dual infeasibility......: 4.2179949817270113e-10 4.2179949817270113e-0
7
Constraint violation....: 1.2798512250000726e-12 1.2798512250000726e-1
2
Complementarity.........: 2.8554915987603802e-09 2.8554915987603800e-0
6
Overall NLP error.......: 2.8554915987603802e-09 2.8554915987603800e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6653022e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 4.97e-04 9.81e-0
3f 1
2 8.6323248e+02 3.24e+03 5.24e+01 -1.0 2.66e+03 - 5.18e-05 1.21e-0
4h 1
3 5.3831770e+02 3.20e+03 5.25e+01 -1.0 3.24e+03 - 3.12e-05 1.32e-0
2f 1
4 3.9903867e+02 3.13e+03 5.15e+01 -1.0 3.20e+03 - 2.00e-02 2.32e-0
2f 1
5 9.8503190e+03 7.36e-02 7.80e+01 -1.0 3.13e+03 - 1.07e-01 1.00e+0
0h 1
6 5.7440227e+03 6.32e-02 2.21e+01 -1.0 4.61e+01 - 6.97e-01 1.31e-0
1f 1
7 4.3233476e+03 3.42e-02 1.97e+00 -1.0 2.67e+01 - 8.81e-01 6.15e-0
1f 1
8 4.6962638e+03 3.54e-03 1.25e+00 -1.0 4.17e+00 - 7.71e-01 1.00e+0
0f 1
9 4.6083981e+03 2.71e-04 6.46e-01 -1.0 8.71e+00 - 3.51e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2038192e+03 2.93e-04 4.14e-01 -1.7 4.79e+00 - 9.41e-01 7.87e-0
1f 1
11 4.2102129e+03 3.95e-05 3.20e-01 -1.7 1.50e+01 - 7.91e-01 1.00e+0
0f 1
12 4.2120436e+03 5.69e-06 6.29e-04 -1.7 1.08e+01 - 1.00e+00 1.00e+0
0h 1
13 4.1101980e+03 6.16e-05 6.70e-02 -3.8 3.82e+01 - 9.04e-01 8.52e-0
1f 1
14 4.0872429e+03 6.45e-03 7.31e-02 -3.8 5.48e+00 - 5.78e-01 9.88e-0
1h 1
15 4.0845759e+03 2.79e-03 2.15e-03 -3.8 6.13e-02 - 9.70e-01 8.91e-0
1h 1
16 4.0849000e+03 8.72e-05 6.01e-04 -3.8 1.81e-02 - 1.00e+00 1.00e+0
0f 1
17 4.0833250e+03 1.48e-04 8.68e-04 -5.7 2.97e-01 - 9.38e-01 1.00e+0
0h 1
18 4.0833315e+03 4.11e-05 5.43e-03 -5.7 1.11e-03 - 1.00e+00 7.22e-0
1h 1
19 4.0833413e+03 1.16e-08 1.62e-06 -5.7 1.06e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 4.0833247e+03 9.31e-09 2.06e-05 -8.6 3.68e-03 - 1.00e+00 9.83e-0
1h 1
21 4.0833244e+03 1.51e-12 7.23e-11 -8.6 6.33e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 4.0833243979216114e+00 4.0833243979216113e+0
3
Dual infeasibility......: 7.2325205130117102e-11 7.2325205130117108e-0
8
Constraint violation....: 1.5059065106015623e-12 1.5059065106015623e-1
2
Complementarity.........: 2.6932378572680839e-09 2.6932378572680837e-0
6
Overall NLP error.......: 2.6932378572680839e-09 2.6932378572680837e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8038781e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.82e-0
3h 1
2 8.7404419e+02 2.00e+03 5.24e+01 -1.0 1.17e+03 - 4.28e-05 2.39e-0
4h 1
3 2.9382745e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 1.65e-04 2.27e-0
2f 1
4 1.4249786e+04 6.10e-02 7.92e+01 -1.0 1.95e+03 - 5.51e-02 1.00e+0
0h 1
5 5.5512989e+03 5.67e-02 5.34e+01 -1.0 6.55e+01 - 3.14e-01 6.40e-0
2f 1
6 4.1927553e+03 3.11e-02 2.64e+01 -1.0 3.24e+01 - 4.94e-01 4.18e-0
1f 1
7 3.3769719e+03 1.34e-02 2.16e+00 -1.0 1.11e+01 - 9.19e-01 9.25e-0
1f 1
8 3.8285991e+03 4.08e-04 1.03e-01 -1.0 5.01e+00 - 9.96e-01 1.00e+0
0f 1
9 3.1657088e+03 1.16e-03 1.15e+00 -1.7 5.39e+01 - 3.73e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.2150963e+03 1.01e-05 1.36e-02 -1.7 1.84e+01 - 1.00e+00 1.00e+0
0h 1
11 3.0881662e+03 3.01e-05 3.90e-01 -2.5 6.48e+01 - 1.00e+00 7.91e-0
1f 1
12 3.0663463e+03 1.05e-04 4.78e-03 -2.5 1.31e+01 - 1.00e+00 1.00e+0
0f 1
13 3.0436287e+03 2.77e-04 8.68e-02 -3.8 1.07e+01 - 7.71e-01 1.00e+0
0h 1
14 3.0408839e+03 1.61e-03 2.08e-03 -3.8 3.64e-02 - 9.71e-01 1.00e+0
0h 1
15 3.0409241e+03 7.54e-05 6.60e-05 -3.8 1.18e-02 - 1.00e+00 1.00e+0
0h 1
16 3.0392738e+03 1.31e-04 1.11e-03 -5.7 5.94e-01 - 9.18e-01 1.00e+0
0h 1
17 3.0392322e+03 3.27e-05 6.74e-06 -5.7 8.43e-03 - 1.00e+00 1.00e+0
0h 1
18 3.0392377e+03 1.93e-07 3.46e-06 -5.7 6.32e-04 - 1.00e+00 1.00e+0
0h 1
19 3.0392192e+03 2.64e-08 3.36e-05 -8.6 7.37e-03 - 1.00e+00 9.57e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 3.0392184e+03 4.50e-12 5.22e-11 -8.6 3.18e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 3.0392184001789433e+00 3.0392184001789433e+0
3
Dual infeasibility......: 5.2170502150523172e-11 5.2170502150523172e-0
8
Constraint violation....: 4.5028425432747099e-12 4.5028425432747099e-1
2
Complementarity.........: 3.3721293796965667e-09 3.3721293796965667e-0
6
Overall NLP error.......: 3.3721293796965667e-09 3.3721293796965667e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0774891e+02 9.17e+02 5.23e+01 -1.0 9.20e+02 - 1.00e-03 9.88e-0
3h 1
2 8.4540605e+02 9.15e+02 5.23e+01 -1.0 8.79e+02 - 9.05e-05 2.34e-0
3h 1
3 2.8754281e+02 8.95e+02 5.24e+01 -1.0 9.15e+02 - 2.40e-03 2.22e-0
2h 1
4 1.2444230e+04 6.81e-02 7.68e+01 -1.0 8.95e+02 - 8.41e-02 1.00e+0
0h 1
5 4.8011316e+03 6.12e-02 3.59e+01 -1.0 2.80e+01 - 5.07e-01 9.21e-0
2f 1
6 3.2963791e+03 1.99e-02 1.39e+01 -1.0 1.52e+01 - 6.35e-01 7.55e-0
1f 1
7 3.4752862e+03 3.85e-03 1.40e-01 -1.0 2.22e+00 - 9.91e-01 1.00e+0
0f 1
8 3.0360767e+03 1.49e-03 1.32e-01 -1.7 1.06e+01 - 1.00e+00 1.00e+0
0f 1
9 2.8726148e+03 2.09e-03 3.80e-01 -2.5 8.63e+00 - 1.00e+00 7.98e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8512491e+03 1.42e-04 5.20e-03 -2.5 1.61e+00 - 1.00e+00 1.00e+0
0h 1
11 2.8231372e+03 3.90e-05 1.76e-01 -3.8 1.88e+01 - 1.00e+00 7.42e-0
1h 1
12 2.8145167e+03 1.54e-07 3.47e-04 -3.8 4.81e+00 - 1.00e+00 1.00e+0
0f 1
13 2.8124163e+03 2.74e-08 1.03e-03 -5.7 1.04e+00 - 1.00e+00 9.85e-0
1f 1
14 2.8123895e+03 1.97e-12 1.40e-08 -5.7 1.58e-02 - 1.00e+00 1.00e+0
0f 1
15 2.8123637e+03 2.63e-12 4.48e-09 -8.6 1.29e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 2.8123637153591998e+00 2.8123637153591999e+0
3
Dual infeasibility......: 4.4777068912086149e-09 4.4777068912086149e-0
6
Constraint violation....: 2.6309093792420413e-12 2.6309093792420413e-1
2
Complementarity.........: 3.6085007768088950e-09 3.6085007768088950e-0
6
Overall NLP error.......: 4.4777068912086149e-09 4.4777068912086149e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.03e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.45e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643326e+00 1.6104063281643325e+0
3
Dual infeasibility......: 2.4577488759278421e-12 2.4577488759278421e-0
9
Constraint violation....: 7.4511016092546002e-16 7.4511016092546002e-1
6
Complementarity.........: 2.5062163910047563e-09 2.5062163910047562e-0
6
Overall NLP error.......: 2.5062163910047563e-09 2.5062163910047562e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031320943025915e-09 2.1031320943025915e-0
6
Constraint violation....: 6.2994179317321652e-11 6.2994179317321652e-1
1
Complementarity.........: 2.8882108896920311e-09 2.8882108896920312e-0
6
Overall NLP error.......: 2.8882108896920311e-09 2.8882108896920312e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254210124e-01 6.4890146254210117e+0
2
Dual infeasibility......: 4.9126604805733771e-09 4.9126604805733771e-0
6
Constraint violation....: 6.2123813870940126e-09 6.2123813870940126e-0
9
Complementarity.........: 4.3646095252459305e-09 4.3646095252459303e-0
6
Overall NLP error.......: 6.2123813870940126e-09 4.9126604805733771e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.03e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.45e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643326e+00 1.6104063281643325e+0
3
Dual infeasibility......: 2.4577488759278421e-12 2.4577488759278421e-0
9
Constraint violation....: 7.4511016092546002e-16 7.4511016092546002e-1
6
Complementarity.........: 2.5062163910047563e-09 2.5062163910047562e-0
6
Overall NLP error.......: 2.5062163910047563e-09 2.5062163910047562e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 40
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 20
inequality constraints with only lower bounds: 11
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2226504e+02 9.17e+02 5.24e+01 -1.0 9.19e+02 - 3.31e-04 9.89e-0
3h 1
2 7.8955201e+02 9.16e+02 5.24e+01 -1.0 8.42e+02 - 1.06e-04 1.20e-0
3h 1
3 2.4364669e+02 8.97e+02 5.26e+01 -1.0 9.17e+02 - 1.20e-03 2.08e-0
2h 1
4 1.2112571e+04 5.57e-02 8.24e+01 -1.0 8.97e+02 - 3.94e-02 1.00e+0
0h 1
5 3.8612358e+03 5.30e-02 5.36e+01 -1.0 7.85e+01 - 3.47e-01 5.12e-0
2f 1
6 1.9056484e+03 3.70e-02 2.84e+01 -1.0 3.94e+01 - 4.74e-01 5.01e-0
1f 1
7 2.5879741e+03 2.01e-02 1.46e+01 -1.0 2.03e+01 - 4.05e-01 2.50e-0
1f 3
8 1.9856623e+03 6.90e-03 3.24e-01 -1.0 7.36e+00 - 9.82e-01 1.00e+0
0f 1
9 1.6901690e+03 1.30e-03 2.84e-01 -1.7 5.35e+00 - 1.00e+00 8.67e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7945879e+03 8.98e-04 1.29e-02 -1.7 1.58e+02 - 1.00e+00 1.00e+0
0f 1
11 1.5337574e+03 1.41e-03 9.58e-02 -3.8 1.64e+02 - 7.92e-01 9.29e-0
1f 1
12 1.5038866e+03 1.60e-03 7.99e-02 -3.8 9.59e+00 - 8.40e-01 7.53e-0
1h 1
13 1.5022919e+03 3.37e-06 8.53e-04 -3.8 2.32e+00 - 1.00e+00 1.00e+0
0h 1
14 1.5003388e+03 2.76e-07 6.96e-04 -5.7 1.19e+00 - 1.00e+00 9.87e-0
1h 1
15 1.5003191e+03 3.65e-11 6.72e-09 -5.7 2.60e-01 - 1.00e+00 1.00e+0
0f 1
16 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.47e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.5002932851874127e+00 1.5002932851874127e+0
3
Dual infeasibility......: 2.1734494883516476e-09 2.1734494883516476e-0
6
Constraint violation....: 6.2998523064905498e-11 6.2998523064905498e-1
1
Complementarity.........: 2.8881011450431023e-09 2.8881011450431023e-0
6
Overall NLP error.......: 2.8881011450431023e-09 2.8881011450431023e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6492412e+02 9.17e+02 5.24e+01 -1.0 9.19e+02 - 4.97e-04 9.89e-0
3h 1
2 8.2552091e+02 9.16e+02 5.24e+01 -1.0 8.55e+02 - 1.04e-04 1.46e-0
3h 1
3 2.6387997e+02 8.96e+02 5.25e+01 -1.0 9.16e+02 - 1.47e-03 2.17e-0
2h 1
4 1.2384702e+04 6.06e-02 8.03e+01 -1.0 8.96e+02 - 5.22e-02 1.00e+0
0h 1
5 4.2399598e+03 5.65e-02 5.20e+01 -1.0 7.08e+01 - 3.41e-01 6.24e-0
2f 1
6 2.6549968e+03 3.03e-02 2.65e+01 -1.0 3.86e+01 - 4.84e-01 4.36e-0
1f 1
7 2.1303652e+03 1.40e-02 2.43e+00 -1.0 1.08e+01 - 9.19e-01 1.00e+0
0f 1
76 1.888337e+04 1.632511e+04 5.940004e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6794703e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.80e-0
3f 1
2 7.6502061e+02 1.57e+04 5.25e+01 -1.0 1.45e+04 - 3.26e-05 1.07e-0
4h 1
3 7.5970888e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 1.09e-05 4.21e-0
4h 1
4 7.4005491e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 4.28e-04 1.62e-0
3h 1
5 5.4617009e+02 1.54e+04 5.27e+01 -1.0 1.57e+04 - 2.19e-03 1.98e-0
2f 1
6 2.5834566e+04 6.20e-02 8.49e+01 -1.0 1.54e+04 - 3.11e-02 1.00e+0
0h 1
7 1.8221451e+04 5.94e-02 6.23e+01 -1.0 7.09e+01 - 2.71e-01 4.53e-0
2f 1
8 1.6686228e+04 4.57e-02 3.01e+01 -1.0 2.89e+01 - 5.11e-01 4.31e-0
1f 1
9 1.6972626e+04 3.13e-02 1.13e+01 -1.0 1.57e+01 - 4.78e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6784040e+04 5.33e-03 2.18e-01 -1.0 3.92e+00 - 9.86e-01 1.00e+0
0h 1
11 1.6497392e+04 1.04e-03 1.30e+00 -1.7 4.60e+00 - 3.10e-01 8.78e-0
1f 1
12 1.6487873e+04 1.59e-04 7.30e-01 -1.7 5.17e+00 - 6.20e-01 1.00e+0
0f 1
13 1.6477101e+04 1.11e-04 1.82e-01 -1.7 1.00e+01 - 7.05e-01 1.00e+0
0h 1
14 1.6373078e+04 9.03e-04 7.37e-02 -2.5 8.19e+00 - 9.07e-01 1.00e+0
0f 1
15 1.6344498e+04 1.56e-03 1.62e-02 -2.5 4.85e+00 - 1.00e+00 1.00e+0
0h 1
16 1.6328219e+04 2.78e-04 1.09e-01 -3.8 5.87e+00 - 1.00e+00 8.31e-0
1h 1
17 1.6326334e+04 6.15e-07 1.29e-04 -3.8 8.51e-01 - 1.00e+00 1.00e+0
0h 1
18 1.6325118e+04 4.01e-07 1.09e-04 -5.7 2.97e-01 - 1.00e+00 9.98e-0
1h 1
19 1.6325120e+04 3.83e-11 3.01e-09 -5.7 3.84e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325105e+04 6.26e-11 1.59e-06 -8.6 3.68e-03 - 1.00e+00 9.97e-0
1h 1
21 1.6325105e+04 1.07e-14 1.82e-06 -8.6 1.81e-03 - 9.96e-01 1.00e+0
0f 1
22 1.6325105e+04 7.11e-15 2.51e-14 -8.6 9.30e-06 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.6325105275847008e+01 1.6325105275847009e+0
4
Dual infeasibility......: 2.5059056392440215e-14 2.5059056392440215e-1
1
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.6681869278858044e-09 2.6681869278858044e-0
6
Overall NLP error.......: 2.6681869278858044e-09 2.6681869278858044e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.1741930e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 3.14e-04 9.80e-0
3h 1
2 8.1440649e+02 1.50e+04 5.24e+01 -1.0 1.29e+04 - 2.43e-05 1.15e-0
4h 1
3 8.1187038e+02 1.50e+04 5.24e+01 -1.0 1.49e+04 - 1.91e-05 1.91e-0
4h 1
4 8.1076456e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 2.08e-04 8.47e-0
5h 1
5 5.4005722e+02 1.47e+04 5.26e+01 -1.0 1.50e+04 - 2.99e-04 2.11e-0
2f 1
6 2.6487858e+04 5.47e-02 8.27e+01 -1.0 1.47e+04 - 3.67e-02 1.00e+0
0h 1
7 1.7896309e+04 5.23e-02 5.87e+01 -1.0 8.15e+01 - 2.89e-01 4.84e-0
2f 1
8 1.5966599e+04 3.90e-02 3.12e+01 -1.0 3.78e+01 - 4.71e-01 4.97e-0
1f 1
9 1.6307368e+04 2.33e-02 1.45e+01 -1.0 2.00e+01 - 4.05e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6039323e+04 6.20e-03 3.15e-01 -1.0 5.37e+00 - 9.84e-01 1.00e+0
0h 1
11 1.5742882e+04 1.38e-03 3.60e-01 -1.7 5.10e+00 - 1.00e+00 8.40e-0
1f 1
12 1.5782502e+04 8.64e-04 1.21e-01 -1.7 9.07e+01 - 5.70e-01 1.00e+0
0f 1
13 1.5592796e+04 1.16e-03 6.57e-02 -2.5 8.91e+01 - 9.08e-01 1.00e+0
0f 1
14 1.5576554e+04 1.25e-03 1.61e-02 -2.5 1.10e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5561660e+04 2.25e-04 1.07e-01 -3.8 3.45e+00 - 1.00e+00 8.33e-0
1h 1
16 1.5560275e+04 1.06e-06 1.42e-04 -3.8 1.95e-01 - 1.00e+00 1.00e+0
0h 1
17 1.5559213e+04 3.94e-07 1.48e-04 -5.7 1.49e-01 - 1.00e+00 9.97e-0
1h 1
18 1.5559215e+04 3.88e-11 3.01e-09 -5.7 4.58e-02 - 1.00e+00 1.00e+0
0f 1
19 1.5559202e+04 6.30e-11 2.14e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.5559202156550809e+01 1.5559202156550808e+0
4
Dual infeasibility......: 2.1395180987648257e-09 2.1395180987648257e-0
6
Constraint violation....: 6.2995081373529160e-11 6.2995081373529160e-1
1
Complementarity.........: 2.8882167798829245e-09 2.8882167798829244e-0
6
Overall NLP error.......: 2.8882167798829245e-09 2.8882167798829244e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9474555e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 7.47e-04 9.80e-0
3h 1
2 8.9199469e+02 1.39e+04 5.24e+01 -1.0 1.37e+04 - 8.66e-05 1.01e-0
4h 1
3 8.8257747e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 3.21e-06 6.93e-0
4f 1
4 5.8123535e+02 1.36e+04 5.24e+01 -1.0 1.39e+04 - 7.46e-04 2.27e-0
2h 1
5 2.5990164e+04 6.37e-02 7.79e+01 -1.0 1.36e+04 - 6.91e-02 1.00e+0
0h 1
6 1.7595436e+04 5.83e-02 4.87e+01 -1.0 5.00e+01 - 3.57e-01 7.69e-0
2f 1
7 1.6291290e+04 2.68e-02 2.14e+01 -1.0 2.30e+01 - 5.53e-01 4.96e-0
1f 1
8 1.5789004e+04 7.20e-03 1.25e+00 -1.0 8.72e+00 - 9.36e-01 7.37e-0
1f 1
9 1.6041678e+04 3.33e-04 8.06e-02 -1.0 2.82e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5454884e+04 2.08e-03 9.08e-02 -2.5 4.31e+00 - 8.63e-01 8.28e-0
1f 1
11 1.5276310e+04 2.17e-03 3.60e-01 -2.5 1.07e+00 - 1.00e+00 7.75e-0
1f 1
12 1.5247274e+04 1.68e-04 5.12e-03 -2.5 2.17e-01 - 1.00e+00 1.00e+0
0h 1
13 1.5227509e+04 2.52e-05 4.54e-02 -3.8 2.68e+00 - 1.00e+00 8.77e-0
1h 1
14 1.5225960e+04 5.93e-08 6.08e-04 -3.8 3.29e-01 - 1.00e+00 1.00e+0
0f 1
15 1.5224656e+04 4.20e-08 2.67e-05 -5.7 1.49e-01 - 1.00e+00 9.99e-0
1f 1
16 1.5224658e+04 1.87e-12 1.04e-08 -5.7 1.67e-04 - 1.00e+00 1.00e+0
0f 1
17 1.5224643e+04 2.57e-12 2.86e-06 -8.6 1.84e-03 - 1.00e+00 9.99e-0
1f 1
18 1.5224643e+04 7.19e-15 4.46e-14 -8.6 9.62e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5224643439081522e+01 1.5224643439081521e+0
4
Dual infeasibility......: 4.4609693868719980e-14 4.4609693868719980e-1
1
Constraint violation....: 7.1895386027660807e-15 7.1895386027660807e-1
5
Complementarity.........: 2.5059120163194913e-09 2.5059120163194911e-0
6
Overall NLP error.......: 2.5059120163194913e-09 2.5059120163194911e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4548237e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.98e-04 9.80e-0
3h 1
2 8.4261832e+02 1.27e+04 5.24e+01 -1.0 1.20e+04 - 4.62e-05 1.04e-0
4h 1
3 8.0309467e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 7.81e-06 2.58e-0
3h 1
4 5.2937834e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 2.80e-03 2.08e-0
2h 1
5 2.3335798e+04 5.94e-02 8.14e+01 -1.0 1.24e+04 - 4.97e-02 1.00e+0
0h 1
6 1.5690537e+04 5.54e-02 4.84e+01 -1.0 7.33e+01 - 3.95e-01 6.13e-0
2f 1
7 1.3663628e+04 3.60e-02 2.49e+01 -1.0 4.16e+01 - 4.90e-01 5.24e-0
1f 1
8 1.4305428e+04 1.31e-02 2.79e+00 -1.0 1.59e+01 - 7.96e-01 5.00e-0
1f 2
9 1.3827023e+04 4.20e-03 1.76e-01 -1.0 7.73e+00 - 9.59e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3455833e+04 1.11e-03 3.89e-01 -1.7 5.64e+00 - 1.00e+00 8.15e-0
1f 1
11 1.3431557e+04 4.90e-04 2.48e-02 -1.7 3.49e+01 - 1.00e+00 1.00e+0
0f 1
12 1.3269592e+04 1.39e-03 1.20e-01 -3.8 3.98e+01 - 7.60e-01 9.23e-0
1f 1
13 1.3232163e+04 2.74e-03 2.16e-02 -3.8 3.01e+00 - 8.07e-01 8.28e-0
1h 1
14 1.3233886e+04 3.09e-04 1.34e-01 -3.8 5.17e-01 - 1.00e+00 9.07e-0
1h 1
15 1.3234267e+04 4.98e-07 2.20e-05 -3.8 2.38e-01 - 1.00e+00 1.00e+0
0f 1
16 1.3233079e+04 4.18e-07 2.33e-03 -5.7 2.97e-01 - 1.00e+00 9.77e-0
1h 1
17 1.3233066e+04 4.90e-11 2.26e-08 -5.7 5.81e-02 - 1.00e+00 1.00e+0
0f 1
18 1.3233051e+04 6.30e-11 4.40e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.3233050934682947e+01 1.3233050934682946e+0
4
Dual infeasibility......: 4.3985735337706477e-09 4.3985735337706477e-0
6
Constraint violation....: 6.2987115523327475e-11 6.2987115523327475e-1
1
Complementarity.........: 4.3669764709277765e-09 4.3669764709277766e-0
6
Overall NLP error.......: 4.3985735337706477e-09 4.3985735337706477e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2209886e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.46e-03 9.80e-0
3h 1
2 9.1921882e+02 1.11e+04 5.23e+01 -1.0 1.02e+04 - 3.31e-05 1.08e-0
4h 1
3 8.3589436e+02 1.11e+04 5.23e+01 -1.0 1.11e+04 - 1.16e-05 5.07e-0
3h 1
4 5.7069423e+02 1.08e+04 5.22e+01 -1.0 1.11e+04 - 5.77e-03 2.14e-0
2h 1
5 2.1581619e+04 7.49e-02 7.76e+01 -1.0 1.08e+04 - 8.36e-02 1.00e+0
0h 1
6 1.5200119e+04 6.72e-02 2.24e+01 -1.0 1.37e+01 - 6.83e-01 9.53e-0
2f 1
7 1.3929726e+04 1.90e-02 7.14e+00 -1.0 9.99e+00 - 7.16e-01 8.61e-0
1f 1
8 1.4054890e+04 1.02e-02 6.51e-01 -1.0 2.67e+00 - 9.92e-01 4.68e-0
1f 2
9 1.3767985e+04 1.12e-02 9.76e-01 -1.7 1.32e+01 - 2.69e-01 8.15e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3763327e+04 5.99e-04 6.04e-01 -1.7 1.17e+01 - 7.60e-01 1.00e+0
0f 1
11 1.3759660e+04 1.35e-04 2.52e-03 -1.7 1.26e+01 - 1.00e+00 1.00e+0
0h 1
12 1.3588831e+04 5.38e-04 2.30e-02 -3.8 3.54e+01 - 8.33e-01 8.33e-0
1f 1
13 1.3568589e+04 1.77e-04 2.19e-01 -3.8 5.87e+00 - 9.92e-01 7.07e-0
1h 1
14 1.3563200e+04 3.88e-07 4.33e-04 -3.8 1.72e+00 - 1.00e+00 1.00e+0
0h 1
15 1.3561861e+04 2.03e-08 4.17e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
16 1.3561846e+04 8.60e-13 5.39e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.3561846278596102e+01 1.3561846278596102e+0
4
Dual infeasibility......: 5.3912112727068858e-10 5.3912112727068858e-0
7
Constraint violation....: 8.6025631063080255e-13 8.6025631063080255e-1
3
Complementarity.........: 4.1981856140394646e-09 4.1981856140394645e-0
6
Overall NLP error.......: 4.1981856140394646e-09 4.1981856140394645e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8775333e+02 9.19e+03 5.24e+01 -1.0 9.28e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8469544e+02 9.19e+03 5.24e+01 -1.0 7.80e+03 - 2.91e-05 1.17e-0
4h 1
3 6.6462188e+02 9.08e+03 5.24e+01 -1.0 9.19e+03 - 2.18e-05 1.20e-0
2h 1
4 5.9228760e+02 8.88e+03 5.19e+01 -1.0 9.08e+03 - 1.38e-02 2.17e-0
2h 1
5 1.7105307e+04 7.36e-02 7.74e+01 -1.0 8.88e+03 - 1.04e-01 1.00e+0
0h 1
6 1.2211573e+04 6.40e-02 2.02e+01 -1.0 4.24e+01 - 7.12e-01 1.21e-0
1f 1
7 1.0749761e+04 2.49e-02 1.83e+00 -1.0 2.14e+01 - 9.33e-01 6.71e-0
1f 1
8 1.0985588e+04 3.01e-03 1.25e+00 -1.0 4.35e+00 - 4.23e-01 1.00e+0
0f 1
9 1.1155735e+04 5.09e-04 1.11e+00 -1.0 7.35e+00 - 5.25e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1145467e+04 1.22e-04 1.23e-01 -1.0 1.47e+01 - 6.67e-01 1.00e+0
0f 1
11 1.0527359e+04 1.85e-03 9.55e-02 -1.7 4.64e+00 - 9.56e-01 1.00e+0
0f 1
12 1.0370533e+04 1.17e-03 1.58e-01 -2.5 1.80e+01 - 8.90e-01 6.88e-0
1f 1
13 1.0363485e+04 1.89e-06 7.77e-03 -2.5 1.02e+01 - 1.00e+00 1.00e+0
0h 1
14 1.0339607e+04 3.86e-06 5.32e-02 -3.8 8.34e+00 - 9.47e-01 8.91e-0
1f 1
15 1.0336007e+04 5.34e-04 6.21e-04 -3.8 9.10e-01 - 1.00e+00 1.00e+0
0f 1
16 1.0334762e+04 5.22e-05 1.05e-02 -5.7 4.46e-01 - 8.31e-01 1.00e+0
0h 1
17 1.0334652e+04 3.24e-05 3.56e-05 -5.7 9.17e-03 - 1.00e+00 1.00e+0
0h 1
18 1.0334655e+04 5.81e-07 6.07e-06 -5.7 1.15e-03 - 1.00e+00 1.00e+0
0h 1
19 1.0334639e+04 4.05e-08 8.12e-05 -8.6 5.53e-03 - 1.00e+00 9.42e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.0334638e+04 7.76e-12 7.04e-11 -8.6 3.19e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.0334637968937528e+01 1.0334637968937528e+0
4
Dual infeasibility......: 7.0409482716658960e-11 7.0409482716658966e-0
8
Constraint violation....: 7.7575723622658188e-12 7.7575723622658188e-1
2
Complementarity.........: 3.2599587722861040e-09 3.2599587722861041e-0
6
Overall NLP error.......: 3.2599587722861040e-09 3.2599587722861041e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0889707e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0591739e+02 6.71e+03 5.23e+01 -1.0 5.95e+03 - 4.04e-05 1.12e-0
4h 1
3 7.6488246e+02 6.66e+03 5.24e+01 -1.0 6.70e+03 - 1.70e-05 6.81e-0
3h 1
4 4.6074221e+02 6.52e+03 5.21e+01 -1.0 6.66e+03 - 8.31e-03 2.09e-0
2h 1
5 1.6247930e+04 7.43e-02 7.77e+01 -1.0 6.52e+03 - 8.93e-02 1.00e+0
0h 1
6 1.0403223e+04 6.60e-02 2.72e+01 -1.0 2.46e+01 - 6.25e-01 1.03e-0
1f 1
7 8.8840633e+03 1.77e-02 6.66e+00 -1.0 1.48e+01 - 7.64e-01 8.19e-0
1f 1
8 9.0908604e+03 9.00e-03 6.84e-01 -1.0 4.18e+00 - 9.82e-01 4.95e-0
1f 2
9 8.8111150e+03 1.09e-02 1.02e+00 -1.7 7.33e+00 - 2.02e-01 8.24e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.8049163e+03 5.53e-04 7.70e-01 -1.7 7.43e+00 - 6.88e-01 1.00e+0
0f 1
11 8.7982314e+03 1.34e-04 1.17e-01 -1.7 1.24e+01 - 8.35e-01 1.00e+0
0h 1
12 8.6375018e+03 5.78e-04 2.41e-02 -2.5 1.77e+01 - 9.45e-01 9.53e-0
1f 1
13 8.6047512e+03 1.64e-04 7.15e-02 -3.8 9.26e+00 - 9.74e-01 8.47e-0
1h 1
14 8.6017636e+03 2.22e-07 1.33e-01 -3.8 1.50e+00 - 9.00e-01 1.00e+0
0h 1
15 8.6016821e+03 5.25e-09 3.52e-05 -3.8 3.69e-04 - 1.00e+00 1.00e+0
0h 1
16 8.6003683e+03 1.93e-08 3.87e-03 -5.7 2.97e-01 - 1.00e+00 9.68e-0
1f 1
17 8.6003325e+03 5.74e-12 2.62e-08 -5.7 9.59e-03 - 1.00e+00 1.00e+0
0f 1
18 8.6003159e+03 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 8.6003159295912521e+00 8.6003159295912519e+0
3
Dual infeasibility......: 4.4780415509856002e-09 4.4780415509856002e-0
6
Constraint violation....: 2.6337682035304510e-12 2.6337682035304510e-1
2
Complementarity.........: 3.6085480785336032e-09 3.6085480785336032e-0
6
Overall NLP error.......: 4.4780415509856002e-09 4.4780415509856002e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3000909e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 2.02e-03 9.81e-0
3h 1
2 9.2540939e+02 4.77e+03 5.23e+01 -1.0 2.66e+03 - 1.91e-05 1.78e-0
4h 1
3 3.8379504e+02 4.66e+03 5.24e+01 -1.0 4.77e+03 - 8.68e-05 2.34e-0
2f 1
4 1.7424477e+04 7.01e-02 7.87e+01 -1.0 4.66e+03 - 5.08e-02 1.00e+0
0h 1
5 9.2441130e+03 6.55e-02 5.13e+01 -1.0 1.16e+01 - 3.39e-01 6.13e-0
2f 1
6 7.9204820e+03 2.27e-02 2.21e+01 -1.0 7.02e+00 - 6.27e-01 9.88e-0
1f 1
7 8.2927286e+03 2.17e-03 1.89e-01 -1.0 2.55e+00 - 9.91e-01 1.00e+0
0f 1
8 7.7707485e+03 1.76e-03 6.99e-02 -1.7 6.35e+00 - 1.00e+00 9.92e-0
1f 1
9 7.5980729e+03 1.95e-03 3.69e-01 -2.5 1.67e+00 - 1.00e+00 7.91e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.5727496e+03 1.82e-04 4.79e-02 -2.5 3.44e-01 - 1.00e+00 9.36e-0
1h 1
11 7.5754877e+03 7.05e-06 1.34e-03 -2.5 2.20e-02 - 1.00e+00 1.00e+0
0f 1
12 7.5482488e+03 7.66e-06 4.23e-03 -3.8 8.04e+00 - 1.00e+00 9.79e-0
1f 1
13 7.5480543e+03 1.37e-08 6.27e-06 -3.8 1.66e-01 - 1.00e+00 1.00e+0
0f 1
14 7.5465649e+03 1.73e-08 3.04e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0f 1
15 7.5465477e+03 1.28e-12 4.22e-10 -8.6 5.52e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 7.5465477394707188e+00 7.5465477394707186e+0
3
Dual infeasibility......: 4.2179927612979028e-10 4.2179927612979028e-0
7
Constraint violation....: 1.2798512250000726e-12 1.2798512250000726e-1
2
Complementarity.........: 2.8269141057752123e-09 2.8269141057752124e-0
6
Overall NLP error.......: 2.8269141057752123e-09 2.8269141057752124e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6653022e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 4.97e-04 9.81e-0
3f 1
2 8.6323248e+02 3.24e+03 5.24e+01 -1.0 2.66e+03 - 5.18e-05 1.21e-0
4h 1
3 5.3831762e+02 3.20e+03 5.25e+01 -1.0 3.24e+03 - 3.12e-05 1.32e-0
2f 1
4 3.9903871e+02 3.13e+03 5.15e+01 -1.0 3.20e+03 - 2.00e-02 2.32e-0
2f 1
5 9.8503183e+03 7.36e-02 7.80e+01 -1.0 3.13e+03 - 1.07e-01 1.00e+0
0h 1
6 5.7440226e+03 6.32e-02 2.21e+01 -1.0 4.61e+01 - 6.97e-01 1.31e-0
1f 1
7 4.3233476e+03 3.42e-02 1.97e+00 -1.0 2.67e+01 - 8.81e-01 6.15e-0
1f 1
8 4.6962638e+03 3.54e-03 1.12e+00 -1.0 4.17e+00 - 7.95e-01 1.00e+0
0f 1
9 4.6100960e+03 2.68e-04 7.07e-01 -1.0 9.67e+00 - 3.29e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2038235e+03 2.95e-04 4.14e-01 -1.7 4.78e+00 - 9.46e-01 7.94e-0
1f 1
11 4.2114047e+03 3.91e-05 2.64e-01 -1.7 1.56e+01 - 8.22e-01 1.00e+0
0f 1
12 4.2127277e+03 5.83e-06 6.18e-04 -1.7 9.79e+00 - 1.00e+00 1.00e+0
0h 1
13 4.1102959e+03 6.15e-05 6.70e-02 -3.8 3.89e+01 - 9.04e-01 8.51e-0
1f 1
14 4.0872462e+03 6.45e-03 7.31e-02 -3.8 5.57e+00 - 5.78e-01 9.88e-0
1h 1
15 4.0845760e+03 2.79e-03 2.16e-03 -3.8 6.19e-02 - 9.69e-01 8.92e-0
1h 1
16 4.0848996e+03 8.70e-05 5.99e-04 -3.8 1.81e-02 - 1.00e+00 1.00e+0
0f 1
17 4.0833249e+03 1.47e-04 8.67e-04 -5.7 2.97e-01 - 9.38e-01 1.00e+0
0h 1
18 4.0833315e+03 4.10e-05 5.43e-03 -5.7 1.11e-03 - 1.00e+00 7.22e-0
1h 1
19 4.0833413e+03 1.16e-08 1.61e-06 -5.7 1.06e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 4.0833247e+03 9.31e-09 2.06e-05 -8.6 3.68e-03 - 1.00e+00 9.83e-0
1h 1
21 4.0833244e+03 1.51e-12 7.23e-11 -8.6 6.33e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 4.0833243979755629e+00 4.0833243979755630e+0
3
Dual infeasibility......: 7.2322065983989666e-11 7.2322065983989666e-0
8
Constraint violation....: 1.5054624213917123e-12 1.5054624213917123e-1
2
Complementarity.........: 2.6680237238761858e-09 2.6680237238761856e-0
6
Overall NLP error.......: 2.6680237238761858e-09 2.6680237238761856e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1569807e+02 2.00e+03 5.23e+01 -1.0 2.01e+03 - 1.20e-03 9.82e-0
3h 1
2 9.0740266e+02 2.00e+03 5.23e+01 -1.0 1.37e+03 - 3.64e-05 3.18e-0
4h 1
3 3.1327425e+02 1.95e+03 5.24e+01 -1.0 2.00e+03 - 2.44e-04 2.34e-0
2f 1
4 1.4531645e+04 6.68e-02 7.62e+01 -1.0 1.95e+03 - 8.10e-02 1.00e+0
0h 1
5 6.1127872e+03 6.03e-02 3.21e+01 -1.0 2.08e+01 - 5.49e-01 8.75e-0
2f 1
6 4.5843893e+03 1.61e-02 1.41e+01 -1.0 1.27e+01 - 6.22e-01 8.68e-0
1f 1
7 4.8958397e+03 1.56e-03 1.27e-01 -1.0 3.73e+00 - 9.91e-01 1.00e+0
0f 1
8 4.4227069e+03 1.89e-03 1.46e-01 -1.7 1.01e+01 - 9.92e-01 1.00e+0
0f 1
9 4.2368408e+03 1.99e-03 3.73e-01 -2.5 1.21e+00 - 1.00e+00 7.82e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2088591e+03 2.20e-04 2.58e-02 -2.5 2.53e-01 - 1.00e+00 9.75e-0
1h 1
11 4.1820138e+03 1.80e-06 2.82e-02 -3.8 1.07e+01 - 9.76e-01 1.00e+0
0h 1
12 4.1821479e+03 1.68e-09 5.40e-06 -3.8 1.28e-02 - 1.00e+00 1.00e+0
0h 1
13 4.1805130e+03 1.80e-08 1.81e-04 -5.7 5.94e-01 - 1.00e+00 9.96e-0
1f 1
14 4.1805094e+03 1.80e-12 2.29e-09 -5.7 2.39e-03 - 1.00e+00 1.00e+0
0f 1
15 4.1804892e+03 2.63e-12 1.52e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 4.1804891664240547e+00 4.1804891664240549e+0
3
Dual infeasibility......: 1.5189627822055682e-09 1.5189627822055682e-0
6
Constraint violation....: 2.6292093502355840e-12 2.6292093502355840e-1
2
Complementarity.........: 3.3096657822907709e-09 3.3096657822907708e-0
6
Overall NLP error.......: 3.3096657822907709e-09 3.3096657822907708e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 40
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 20
inequality constraints with only lower bounds: 11
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0758320e+02 9.17e+02 5.23e+01 -1.0 9.19e+02 - 1.00e-03 9.89e-0
3h 1
2 7.8974376e+02 9.13e+02 5.23e+01 -1.0 8.97e+02 - 9.96e-05 4.43e-0
3h 1
3 2.9288179e+02 8.94e+02 5.23e+01 -1.0 9.14e+02 - 4.64e-03 2.14e-0
2h 1
4 1.1585147e+04 7.06e-02 7.73e+01 -1.0 8.94e+02 - 8.61e-02 1.00e+0
0h 1
5 4.7263316e+03 6.32e-02 3.26e+01 -1.0 2.65e+01 - 5.53e-01 9.60e-0
2f 1
6 3.2140151e+03 2.01e-02 1.12e+01 -1.0 1.50e+01 - 6.75e-01 7.80e-0
1f 1
7 3.5011239e+03 2.61e-03 1.12e-01 -1.0 3.10e+00 - 9.91e-01 1.00e+0
0f 1
8 3.0504838e+03 1.56e-03 1.49e-01 -1.7 1.34e+01 - 1.00e+00 1.00e+0
0f 1
9 2.8779415e+03 2.07e-03 3.72e-01 -2.5 8.49e+00 - 1.00e+00 7.89e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8539026e+03 1.60e-04 5.36e-03 -2.5 1.66e+00 - 1.00e+00 1.00e+0
0h 1
11 2.8241057e+03 4.42e-05 1.83e-01 -3.8 2.15e+01 - 1.00e+00 7.38e-0
1h 1
12 2.8146655e+03 1.52e-07 3.54e-04 -3.8 5.59e+00 - 1.00e+00 1.00e+0
0f 1
13 2.8124202e+03 2.71e-08 1.02e-03 -5.7 1.19e+00 - 1.00e+00 9.85e-0
1f 1
14 2.8123914e+03 1.95e-12 1.38e-08 -5.7 1.79e-02 - 1.00e+00 1.00e+0
0f 1
15 2.8123637e+03 2.63e-12 4.48e-09 -8.6 1.47e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 2.8123637223954487e+00 2.8123637223954488e+0
3
Dual infeasibility......: 4.4777084263287769e-09 4.4777084263287769e-0
6
Constraint violation....: 2.6307428457883475e-12 2.6307428457883475e-1
2
Complementarity.........: 3.6085017309961973e-09 3.6085017309961971e-0
6
Overall NLP error.......: 4.4777084263287769e-09 4.4777084263287769e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254210157e-01 6.4890146254210151e+0
2
Dual infeasibility......: 4.9126604771043537e-09 4.9126604771043537e-0
6
Constraint violation....: 6.2123814981163150e-09 6.2123814981163150e-0
9
Complementarity.........: 4.3646095252510184e-09 4.3646095252510185e-0
6
Overall NLP error.......: 6.2123814981163150e-09 4.9126604771043537e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933498e-01 5.8277753147933493e+0
2
Dual infeasibility......: 2.1031318725701182e-09 2.1031318725701182e-0
6
Constraint violation....: 6.2994318095199731e-11 6.2994318095199731e-1
1
Complementarity.........: 2.8882108896903808e-09 2.8882108896903807e-0
6
Overall NLP error.......: 2.8882108896903808e-09 2.8882108896903807e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254210157e-01 6.4890146254210151e+0
2
Dual infeasibility......: 4.9126604771043537e-09 4.9126604771043537e-0
6
Constraint violation....: 6.2123814981163150e-09 6.2123814981163150e-0
9
Complementarity.........: 4.3646095252510184e-09 4.3646095252510185e-0
6
Overall NLP error.......: 6.2123814981163150e-09 4.9126604771043537e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.03e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 6.36e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643330e+00 1.6104063281643330e+0
3
Dual infeasibility......: 2.4577558148217460e-12 2.4577558148217460e-0
9
Constraint violation....: 6.3603172496151010e-15 6.3603172496151010e-1
5
Complementarity.........: 2.5062163910047555e-09 2.5062163910047553e-0
6
Overall NLP error.......: 2.5062163910047555e-09 2.5062163910047553e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 40
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 20
inequality constraints with only lower bounds: 11
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2226504e+02 9.17e+02 5.24e+01 -1.0 9.19e+02 - 3.31e-04 9.89e-0
3h 1
2 7.8955201e+02 9.16e+02 5.24e+01 -1.0 8.42e+02 - 1.06e-04 1.20e-0
3h 1
3 2.4364669e+02 8.97e+02 5.26e+01 -1.0 9.17e+02 - 1.20e-03 2.08e-0
2h 1
4 1.2112571e+04 5.57e-02 8.24e+01 -1.0 8.97e+02 - 3.94e-02 1.00e+0
0h 1
5 3.8612358e+03 5.30e-02 5.36e+01 -1.0 7.85e+01 - 3.47e-01 5.12e-0
2f 1
6 1.9056484e+03 3.70e-02 2.84e+01 -1.0 3.94e+01 - 4.74e-01 5.01e-0
1f 1
7 2.5879741e+03 2.01e-02 1.46e+01 -1.0 2.03e+01 - 4.05e-01 2.50e-0
1f 3
8 1.9856623e+03 6.90e-03 3.24e-01 -1.0 7.36e+00 - 9.82e-01 1.00e+0
0f 1
9 1.6901690e+03 1.30e-03 2.84e-01 -1.7 5.35e+00 - 1.00e+00 8.67e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7945879e+03 8.98e-04 1.29e-02 -1.7 1.58e+02 - 1.00e+00 1.00e+0
0f 1
11 1.5337574e+03 1.41e-03 9.58e-02 -3.8 1.64e+02 - 7.92e-01 9.29e-0
1f 1
12 1.5038866e+03 1.60e-03 7.99e-02 -3.8 9.59e+00 - 8.40e-01 7.53e-0
1h 1
13 1.5022919e+03 3.37e-06 8.53e-04 -3.8 2.32e+00 - 1.00e+00 1.00e+0
0h 1
14 1.5003388e+03 2.76e-07 6.96e-04 -5.7 1.19e+00 - 1.00e+00 9.87e-0
1h 1
15 1.5003191e+03 3.65e-11 6.72e-09 -5.7 2.60e-01 - 1.00e+00 1.00e+0
0f 1
16 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.47e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.5002932851874125e+00 1.5002932851874125e+0
3
Dual infeasibility......: 2.1734492662934901e-09 2.1734492662934901e-0
6
Constraint violation....: 6.2998439798178651e-11 6.2998439798178651e-1
1
Complementarity.........: 2.8881011450423951e-09 2.8881011450423950e-0
6
Overall NLP error.......: 2.8881011450423951e-09 2.8881011450423950e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
1 8.6492412e+02 9.17e+02 5.24e+01 -1.0 9.19e+02 - 4.97e-04 9.89e-0
3h 1
2 8.2552091e+02 9.16e+02 5.24e+01 -1.0 8.55e+02 - 1.04e-04 1.46e-0
3h 1
3 2.6387997e+02 8.96e+02 5.25e+01 -1.0 9.16e+02 - 1.47e-03 2.17e-0
2h 1
4 1.2384702e+04 6.06e-02 8.03e+01 -1.0 8.96e+02 - 5.22e-02 1.00e+0
0h 1
5 4.2399598e+03 5.65e-02 5.20e+01 -1.0 7.08e+01 - 3.41e-01 6.24e-0
2f 1
6 2.6549968e+03 3.03e-02 2.65e+01 -1.0 3.86e+01 - 4.84e-01 4.36e-0
1f 1
7 2.1303652e+03 1.40e-02 2.43e+00 -1.0 1.08e+01 - 9.19e-01 1.00e+0
0f 1
77 1.689841e+04 1.632511e+04 5.996167e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6794703e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.80e-0
3f 1
2 7.6502061e+02 1.57e+04 5.25e+01 -1.0 1.45e+04 - 3.26e-05 1.07e-0
4h 1
3 7.5970888e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 1.09e-05 4.21e-0
4h 1
4 7.4005491e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 4.28e-04 1.62e-0
3h 1
5 5.4617009e+02 1.54e+04 5.27e+01 -1.0 1.57e+04 - 2.19e-03 1.98e-0
2f 1
6 2.5834566e+04 6.20e-02 8.49e+01 -1.0 1.54e+04 - 3.11e-02 1.00e+0
0h 1
7 1.8221451e+04 5.94e-02 6.23e+01 -1.0 7.09e+01 - 2.71e-01 4.53e-0
2f 1
8 1.6686228e+04 4.57e-02 3.01e+01 -1.0 2.89e+01 - 5.11e-01 4.31e-0
1f 1
9 1.6972626e+04 3.13e-02 1.13e+01 -1.0 1.57e+01 - 4.78e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6784040e+04 5.33e-03 2.18e-01 -1.0 3.92e+00 - 9.86e-01 1.00e+0
0h 1
11 1.6497392e+04 1.04e-03 1.30e+00 -1.7 4.60e+00 - 3.10e-01 8.78e-0
1f 1
12 1.6487873e+04 1.59e-04 7.30e-01 -1.7 5.17e+00 - 6.20e-01 1.00e+0
0f 1
13 1.6477101e+04 1.11e-04 1.82e-01 -1.7 1.00e+01 - 7.05e-01 1.00e+0
0h 1
14 1.6373078e+04 9.03e-04 7.37e-02 -2.5 8.19e+00 - 9.07e-01 1.00e+0
0f 1
15 1.6344498e+04 1.56e-03 1.62e-02 -2.5 4.85e+00 - 1.00e+00 1.00e+0
0h 1
16 1.6328219e+04 2.78e-04 1.09e-01 -3.8 5.87e+00 - 1.00e+00 8.31e-0
1h 1
17 1.6326334e+04 6.15e-07 1.29e-04 -3.8 8.51e-01 - 1.00e+00 1.00e+0
0h 1
18 1.6325118e+04 4.01e-07 1.09e-04 -5.7 2.97e-01 - 1.00e+00 9.98e-0
1h 1
19 1.6325120e+04 3.83e-11 3.01e-09 -5.7 3.84e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325105e+04 6.26e-11 1.59e-06 -8.6 3.68e-03 - 1.00e+00 9.97e-0
1h 1
21 1.6325105e+04 7.11e-15 1.82e-06 -8.6 1.81e-03 - 9.96e-01 1.00e+0
0f 1
22 1.6325105e+04 3.55e-15 2.53e-14 -8.6 9.30e-06 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.6325105275847008e+01 1.6325105275847009e+0
4
Dual infeasibility......: 2.5313084961453569e-14 2.5313084961453569e-1
1
Constraint violation....: 3.5527136788005009e-15 3.5527136788005009e-1
5
Complementarity.........: 2.6681869278858044e-09 2.6681869278858044e-0
6
Overall NLP error.......: 2.6681869278858044e-09 2.6681869278858044e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.1741930e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 3.14e-04 9.80e-0
3h 1
2 8.1440649e+02 1.50e+04 5.24e+01 -1.0 1.29e+04 - 2.43e-05 1.15e-0
4h 1
3 8.1187037e+02 1.50e+04 5.24e+01 -1.0 1.49e+04 - 1.91e-05 1.91e-0
4h 1
4 8.1076455e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 2.08e-04 8.47e-0
5h 1
5 5.4005723e+02 1.47e+04 5.26e+01 -1.0 1.50e+04 - 2.99e-04 2.11e-0
2f 1
6 2.6487857e+04 5.47e-02 8.27e+01 -1.0 1.47e+04 - 3.67e-02 1.00e+0
0h 1
7 1.7896309e+04 5.23e-02 5.87e+01 -1.0 8.15e+01 - 2.89e-01 4.84e-0
2f 1
8 1.5966599e+04 3.90e-02 3.12e+01 -1.0 3.78e+01 - 4.71e-01 4.97e-0
1f 1
9 1.6307368e+04 2.33e-02 1.45e+01 -1.0 2.00e+01 - 4.05e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6039323e+04 6.20e-03 3.15e-01 -1.0 5.37e+00 - 9.84e-01 1.00e+0
0h 1
11 1.5742882e+04 1.38e-03 3.60e-01 -1.7 5.10e+00 - 1.00e+00 8.40e-0
1f 1
12 1.5782502e+04 8.64e-04 1.21e-01 -1.7 9.07e+01 - 5.70e-01 1.00e+0
0f 1
13 1.5592796e+04 1.16e-03 6.57e-02 -2.5 8.91e+01 - 9.08e-01 1.00e+0
0f 1
14 1.5576554e+04 1.25e-03 1.61e-02 -2.5 1.10e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5561660e+04 2.25e-04 1.07e-01 -3.8 3.45e+00 - 1.00e+00 8.33e-0
1h 1
16 1.5560275e+04 1.06e-06 1.42e-04 -3.8 1.95e-01 - 1.00e+00 1.00e+0
0h 1
17 1.5559213e+04 3.94e-07 1.48e-04 -5.7 1.49e-01 - 1.00e+00 9.97e-0
1h 1
18 1.5559215e+04 3.88e-11 3.01e-09 -5.7 4.58e-02 - 1.00e+00 1.00e+0
0f 1
19 1.5559202e+04 6.30e-11 2.14e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.5559202156550809e+01 1.5559202156550808e+0
4
Dual infeasibility......: 2.1395183206734818e-09 2.1395183206734818e-0
6
Constraint violation....: 6.2995123006892584e-11 6.2995123006892584e-1
1
Complementarity.........: 2.8882167798826887e-09 2.8882167798826885e-0
6
Overall NLP error.......: 2.8882167798826887e-09 2.8882167798826885e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9474555e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 7.47e-04 9.80e-0
3h 1
2 8.9199469e+02 1.39e+04 5.24e+01 -1.0 1.37e+04 - 8.66e-05 1.01e-0
4h 1
3 8.8257747e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 3.21e-06 6.93e-0
4f 1
4 5.8123535e+02 1.36e+04 5.24e+01 -1.0 1.39e+04 - 7.46e-04 2.27e-0
2h 1
5 2.5990164e+04 6.37e-02 7.79e+01 -1.0 1.36e+04 - 6.91e-02 1.00e+0
0h 1
6 1.7595436e+04 5.83e-02 4.87e+01 -1.0 5.00e+01 - 3.57e-01 7.69e-0
2f 1
7 1.6291290e+04 2.68e-02 2.14e+01 -1.0 2.30e+01 - 5.53e-01 4.96e-0
1f 1
8 1.5789004e+04 7.20e-03 1.25e+00 -1.0 8.72e+00 - 9.36e-01 7.37e-0
1f 1
9 1.6041678e+04 3.33e-04 8.06e-02 -1.0 2.82e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5454884e+04 2.08e-03 9.08e-02 -2.5 4.31e+00 - 8.63e-01 8.28e-0
1f 1
11 1.5276310e+04 2.17e-03 3.60e-01 -2.5 1.07e+00 - 1.00e+00 7.75e-0
1f 1
12 1.5247274e+04 1.68e-04 5.12e-03 -2.5 2.17e-01 - 1.00e+00 1.00e+0
0h 1
13 1.5227509e+04 2.52e-05 4.54e-02 -3.8 2.68e+00 - 1.00e+00 8.77e-0
1h 1
14 1.5225960e+04 5.93e-08 6.08e-04 -3.8 3.29e-01 - 1.00e+00 1.00e+0
0f 1
15 1.5224656e+04 4.20e-08 2.67e-05 -5.7 1.49e-01 - 1.00e+00 9.99e-0
1f 1
16 1.5224658e+04 1.87e-12 1.04e-08 -5.7 1.67e-04 - 1.00e+00 1.00e+0
0f 1
17 1.5224643e+04 2.57e-12 2.86e-06 -8.6 1.84e-03 - 1.00e+00 9.99e-0
1f 1
18 1.5224643e+04 2.50e-16 4.48e-14 -8.6 9.62e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5224643439186311e+01 1.5224643439186311e+0
4
Dual infeasibility......: 4.4793816275892122e-14 4.4793816275892122e-1
1
Constraint violation....: 2.4980018054066022e-16 2.4980018054066022e-1
6
Complementarity.........: 2.5059120163127853e-09 2.5059120163127851e-0
6
Overall NLP error.......: 2.5059120163127853e-09 2.5059120163127851e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8072093e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.97e-04 9.80e-0
3h 1
2 8.7779306e+02 1.27e+04 5.24e+01 -1.0 1.12e+04 - 2.87e-05 1.11e-0
4h 1
3 8.6122953e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 1.55e-05 1.10e-0
3h 1
4 5.4318241e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 1.11e-03 2.22e-0
2h 1
5 2.4454252e+04 6.20e-02 8.15e+01 -1.0 1.24e+04 - 3.10e-02 1.00e+0
0h 1
6 1.6299322e+04 5.91e-02 6.14e+01 -1.0 6.05e+01 - 2.46e-01 4.35e-0
2f 1
7 1.4711302e+04 2.50e-02 3.16e+01 -1.0 2.85e+01 - 4.92e-01 5.40e-0
1f 1
8 1.4357401e+04 1.22e-02 2.17e+00 -1.0 9.69e+00 - 9.28e-01 4.97e-0
1f 2
9 1.4163698e+04 3.04e-03 1.20e-01 -1.0 4.79e+00 - 9.68e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3741875e+04 1.37e-03 3.73e-01 -2.5 2.59e+00 - 9.08e-01 7.62e-0
1f 1
11 1.3720016e+04 9.76e-06 9.00e-03 -2.5 1.69e+00 - 1.00e+00 1.00e+0
0h 1
12 1.3697666e+04 2.79e-04 8.33e-02 -3.8 5.72e+00 - 7.68e-01 9.71e-0
1f 1
13 1.3694169e+04 2.13e-03 2.86e-03 -3.8 1.86e-01 - 8.99e-01 1.00e+0
0h 1
14 1.3694246e+04 1.11e-04 1.07e-04 -3.8 1.51e-02 - 1.00e+00 1.00e+0
0h 1
15 1.3692880e+04 1.43e-04 1.18e-03 -5.7 3.00e-01 - 9.15e-01 1.00e+0
0h 1
16 1.3692836e+04 3.73e-05 8.20e-06 -5.7 9.00e-03 - 1.00e+00 1.00e+0
0h 1
17 1.3692841e+04 4.86e-07 5.11e-06 -5.7 1.01e-03 - 1.00e+00 1.00e+0
0h 1
18 1.3692826e+04 3.84e-08 5.24e-05 -8.6 3.69e-03 - 1.00e+00 9.47e-0
1h 1
19 1.3692826e+04 7.12e-12 6.95e-11 -8.6 1.97e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.3692825541074269e+01 1.3692825541074269e+0
4
Dual infeasibility......: 6.9471090119110146e-11 6.9471090119110153e-0
8
Constraint violation....: 7.1239680821122420e-12 7.1239680821122420e-1
2
Complementarity.........: 3.3101857100788897e-09 3.3101857100788898e-0
6
Overall NLP error.......: 3.3101857100788897e-09 3.3101857100788898e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6662389e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 4.97e-04 9.80e-0
3h 1
2 8.6375901e+02 1.11e+04 5.24e+01 -1.0 1.04e+04 - 4.51e-05 1.05e-0
4h 1
3 8.1247866e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 9.09e-06 3.08e-0
3h 1
4 5.1271377e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 3.39e-03 2.10e-0
2h 1
5 2.1781269e+04 6.25e-02 8.04e+01 -1.0 1.09e+04 - 5.65e-02 1.00e+0
0h 1
6 1.4355473e+04 5.79e-02 4.85e+01 -1.0 6.64e+01 - 3.84e-01 6.77e-0
2f 1
7 1.2780687e+04 3.04e-02 2.34e+01 -1.0 3.79e+01 - 5.09e-01 4.42e-0
1f 1
8 1.2333284e+04 1.27e-02 2.11e+00 -1.0 1.05e+01 - 9.22e-01 1.00e+0
0f 1
9 1.2590751e+04 3.91e-04 7.29e-02 -1.0 4.30e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2099307e+04 5.08e-04 6.40e-01 -2.5 7.12e+00 - 8.93e-01 6.41e-0
1f 1
11 1.2017941e+04 2.37e-04 3.82e-01 -2.5 2.45e+00 - 8.88e-01 1.00e+0
0h 1
12 1.1994709e+04 6.02e-03 2.19e-01 -2.5 1.69e+00 - 1.00e+00 6.03e-0
1h 1
13 1.1985170e+04 7.03e-04 5.56e-03 -2.5 4.75e-01 - 1.00e+00 1.00e+0
0f 1
14 1.1966692e+04 1.15e-03 2.92e-02 -3.8 5.36e+00 - 8.09e-01 1.00e+0
0h 1
15 1.1963688e+04 2.25e-03 1.06e-03 -3.8 4.73e-02 - 1.00e+00 1.00e+0
0h 1
16 1.1964070e+04 4.49e-05 1.48e-04 -3.8 1.50e-02 - 1.00e+00 1.00e+0
0h 1
17 1.1962598e+04 1.05e-04 4.27e-04 -5.7 2.97e-01 - 9.51e-01 9.82e-0
1h 1
18 1.1962590e+04 2.18e-05 3.56e-03 -5.7 5.37e-03 - 1.00e+00 7.94e-0
1h 1
19 1.1962593e+04 8.54e-09 1.12e-06 -5.7 1.11e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.1962577e+04 8.97e-09 1.93e-05 -8.6 3.68e-03 - 1.00e+00 9.83e-0
1h 1
21 1.1962577e+04 1.38e-12 6.48e-11 -8.6 6.13e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.1962576510606720e+01 1.1962576510606719e+0
4
Dual infeasibility......: 6.4763639571055747e-11 6.4763639571055740e-0
8
Constraint violation....: 1.3765655282327316e-12 1.3765655282327316e-1
2
Complementarity.........: 2.6001639808711256e-09 2.6001639808711254e-0
6
Overall NLP error.......: 2.6001639808711256e-09 2.6001639808711254e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3004760e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 2.02e-03 9.81e-0
3h 1
2 9.2458171e+02 9.19e+03 5.23e+01 -1.0 5.43e+03 - 9.22e-06 2.42e-0
4h 1
3 4.8777176e+02 8.97e+03 5.24e+01 -1.0 9.19e+03 - 1.48e-04 2.34e-0
2h 1
4 2.1819681e+04 7.02e-02 7.81e+01 -1.0 8.97e+03 - 5.74e-02 1.00e+0
0h 1
5 1.3648766e+04 6.51e-02 4.65e+01 -1.0 1.06e+01 - 3.92e-01 6.72e-0
2f 1
6 1.2329076e+04 2.50e-02 1.99e+01 -1.0 6.90e+00 - 6.37e-01 1.00e+0
0f 1
7 1.2710449e+04 1.46e-03 1.71e-01 -1.0 2.42e+00 - 9.91e-01 1.00e+0
0f 1
8 1.2188881e+04 1.73e-03 6.89e-02 -1.7 7.62e+00 - 1.00e+00 1.00e+0
0f 1
9 1.2015266e+04 1.99e-03 3.42e-01 -2.5 3.08e+00 - 1.00e+00 7.99e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1992853e+04 1.62e-04 4.13e-02 -2.5 6.16e-01 - 1.00e+00 9.45e-0
1h 1
11 1.1995752e+04 6.80e-06 1.22e-03 -2.5 3.37e-02 - 1.00e+00 1.00e+0
0f 1
12 1.1965916e+04 7.60e-06 4.28e-03 -3.8 1.07e+01 - 1.00e+00 9.79e-0
1f 1
13 1.1965656e+04 1.37e-08 6.29e-06 -3.8 2.27e-01 - 1.00e+00 1.00e+0
0f 1
14 1.1964018e+04 1.73e-08 3.04e-06 -5.7 5.94e-01 - 1.00e+00 1.00e+0
0f 1
15 1.1963999e+04 1.28e-12 4.22e-10 -8.6 7.36e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.1963999150779765e+01 1.1963999150779764e+0
4
Dual infeasibility......: 4.2179904452811261e-10 4.2179904452811261e-0
7
Constraint violation....: 1.2797679582732258e-12 1.2797679582732258e-1
2
Complementarity.........: 3.6148179949776777e-09 3.6148179949776776e-0
6
Overall NLP error.......: 3.6148179949776777e-09 3.6148179949776776e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0888295e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0557265e+02 6.71e+03 5.23e+01 -1.0 5.21e+03 - 2.69e-05 1.27e-0
4h 1
3 4.1986899e+02 6.55e+03 5.24e+01 -1.0 6.70e+03 - 3.43e-05 2.35e-0
2f 1
4 1.9285646e+04 6.51e-02 8.06e+01 -1.0 6.55e+03 - 2.96e-02 1.00e+0
0h 1
5 1.0827936e+04 6.21e-02 6.35e+01 -1.0 3.91e+01 - 2.12e-01 4.20e-0
2f 1
6 9.5566169e+03 2.07e-02 3.00e+01 -1.0 1.63e+01 - 5.39e-01 6.15e-0
1f 1
7 9.1167531e+03 6.69e-03 9.63e-01 -1.0 5.59e+00 - 9.55e-01 7.70e-0
1f 1
8 9.3796749e+03 2.25e-04 7.31e-02 -1.0 4.69e+00 - 9.81e-01 1.00e+0
0f 1
9 8.8173207e+03 2.07e-03 8.46e-02 -2.5 3.16e+00 - 8.56e-01 8.39e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.6549910e+03 2.15e-03 4.34e-01 -2.5 1.84e+00 - 1.00e+00 7.56e-0
1f 1
11 8.6280964e+03 1.35e-04 4.75e-03 -2.5 7.69e-01 - 1.00e+00 1.00e+0
0h 1
12 8.6073604e+03 3.60e-05 1.51e-01 -3.8 8.04e+00 - 1.00e+00 7.57e-0
1h 1
13 8.6018718e+03 1.30e-07 3.46e-04 -3.8 1.95e+00 - 1.00e+00 1.00e+0
0f 1
14 8.6003514e+03 2.83e-08 9.59e-04 -5.7 4.46e-01 - 1.00e+00 9.85e-0
1h 1
15 8.6003344e+03 1.87e-12 1.36e-08 -5.7 6.56e-03 - 1.00e+00 1.00e+0
0f 1
16 8.6003159e+03 2.63e-12 4.48e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 8.6003159354283731e+00 8.6003159354283725e+0
3
Dual infeasibility......: 4.4776944169683768e-09 4.4776944169683768e-0
6
Constraint violation....: 2.6308885625603295e-12 2.6308885625603295e-1
2
Complementarity.........: 3.6084986224123760e-09 3.6084986224123760e-0
6
Overall NLP error.......: 4.4776944169683768e-09 4.4776944169683768e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3002852e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 2.02e-03 9.81e-0
3h 1
2 9.2665255e+02 4.77e+03 5.23e+01 -1.0 3.78e+03 - 3.07e-05 1.25e-0
4h 1
3 4.3498451e+02 4.67e+03 5.24e+01 -1.0 4.77e+03 - 3.22e-05 2.12e-0
2f 1
4 1.2082183e+04 8.33e-02 7.86e+01 -1.0 4.67e+03 - 3.26e-02 1.00e+0
0h 1
5 9.1245079e+03 7.96e-02 2.66e+01 -1.0 1.08e+01 - 6.13e-01 4.30e-0
2f 1
6 7.9979519e+03 1.30e-02 1.10e+01 -1.0 9.06e+00 - 6.51e-01 8.24e-0
1f 1
7 8.1341046e+03 8.57e-03 1.54e-01 -1.0 2.78e+00 - 9.87e-01 9.38e-0
1f 1
8 7.7574340e+03 2.58e-03 1.36e+00 -1.7 6.67e+00 - 3.03e-01 1.00e+0
0f 1
9 7.7240557e+03 2.22e-04 5.96e-01 -1.7 7.40e+00 - 7.15e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.7358109e+03 1.13e-04 1.37e-01 -1.7 1.28e+01 - 8.49e-01 1.00e+0
0f 1
11 7.5789106e+03 4.04e-04 1.67e-02 -2.5 1.92e+01 - 9.67e-01 9.42e-0
1f 1
12 7.5536280e+03 1.07e-04 1.59e-01 -3.8 9.19e+00 - 9.96e-01 7.69e-0
1h 1
13 7.5478980e+03 2.25e-07 1.38e-04 -3.8 2.16e+00 - 1.00e+00 1.00e+0
0f 1
14 7.5465631e+03 1.79e-08 2.98e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
15 7.5465477e+03 1.30e-12 4.24e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 7.5465477384208910e+00 7.5465477384208907e+0
3
Dual infeasibility......: 4.2357255276267696e-10 4.2357255276267696e-0
7
Constraint violation....: 1.2975037710916126e-12 1.2975037710916126e-1
2
Complementarity.........: 3.7554744185848304e-09 3.7554744185848301e-0
6
Overall NLP error.......: 3.7554744185848304e-09 3.7554744185848301e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2294726e+02 3.24e+03 5.23e+01 -1.0 3.27e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1945201e+02 3.24e+03 5.23e+01 -1.0 2.47e+03 - 3.93e-05 1.30e-0
4h 1
3 3.4573144e+02 3.17e+03 5.24e+01 -1.0 3.24e+03 - 4.04e-05 2.36e-0
2f 1
4 1.5906615e+04 6.81e-02 7.93e+01 -1.0 3.17e+03 - 4.21e-02 1.00e+0
0h 1
5 7.5933645e+03 6.41e-02 5.66e+01 -1.0 2.00e+01 - 2.81e-01 5.33e-0
2f 1
6 6.3092956e+03 1.54e-02 2.51e+01 -1.0 1.01e+01 - 5.90e-01 8.06e-0
1f 1
7 6.3346293e+03 6.22e-03 2.30e-01 -1.0 1.94e+00 - 9.91e-01 1.00e+0
0f 1
8 5.9359407e+03 1.57e-03 8.95e-02 -1.7 4.62e+00 - 1.00e+00 9.66e-0
1f 1
9 5.7772838e+03 1.82e-03 5.17e-01 -2.5 1.14e+00 - 1.00e+00 7.50e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.7447658e+03 3.25e-04 1.02e-01 -2.5 2.94e-01 - 1.00e+00 8.96e-0
1h 1
11 5.7477659e+03 1.16e-05 4.01e-03 -2.5 2.85e-02 - 1.00e+00 1.00e+0
0f 1
12 5.7228582e+03 1.05e-05 8.02e-03 -3.8 5.36e+00 - 1.00e+00 9.61e-0
1f 1
13 5.7223580e+03 1.57e-08 1.36e-05 -3.8 2.04e-01 - 1.00e+00 1.00e+0
0f 1
14 5.7210148e+03 1.79e-08 5.06e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0f 1
15 5.7210000e+03 6.40e-13 4.11e-10 -8.6 3.67e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.7210000426662431e+00 5.7210000426662427e+0
3
Dual infeasibility......: 4.1141761214969860e-10 4.1141761214969860e-0
7
Constraint violation....: 6.4021010715009652e-13 6.4021010715009652e-1
3
Complementarity.........: 2.5985704258953488e-09 2.5985704258953487e-0
6
Overall NLP error.......: 2.5985704258953488e-09 2.5985704258953487e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4507754e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 3.98e-04 9.82e-0
3h 1
2 8.3905718e+02 2.00e+03 5.24e+01 -1.0 1.11e+03 - 4.51e-05 2.23e-0
4h 1
3 2.7524753e+02 1.95e+03 5.26e+01 -1.0 2.00e+03 - 1.49e-04 2.18e-0
2f 1
4 1.3935346e+04 5.68e-02 8.10e+01 -1.0 1.95e+03 - 4.47e-02 1.00e+0
0h 1
5 5.1622871e+03 5.33e-02 5.36e+01 -1.0 8.19e+01 - 3.31e-01 5.50e-0
2f 1
6 3.0125711e+03 3.35e-02 2.96e+01 -1.0 4.24e+01 - 4.60e-01 5.40e-0
1f 1
7 4.0558493e+03 1.30e-02 1.19e+01 -1.0 2.42e+01 - 5.72e-01 5.00e-0
1f 2
8 3.1610499e+03 5.79e-03 5.49e-01 -1.0 1.08e+01 - 9.57e-01 1.00e+0
0f 1
9 2.8018544e+03 1.34e-03 3.59e-01 -1.7 6.29e+00 - 1.00e+00 8.29e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8142575e+03 6.86e-04 1.73e-02 -1.7 7.79e+01 - 1.00e+00 1.00e+0
0f 1
11 2.6183447e+03 1.37e-03 1.15e-01 -3.8 8.08e+01 - 7.68e-01 9.22e-0
1f 1
12 2.5796322e+03 2.68e-03 2.12e-02 -3.8 5.62e+00 - 8.10e-01 8.19e-0
1h 1
13 2.5805160e+03 4.81e-04 2.05e-01 -3.8 1.01e+00 - 1.00e+00 8.55e-0
1h 1
14 2.5809608e+03 5.91e-07 4.78e-05 -3.8 1.45e-01 - 1.00e+00 1.00e+0
0f 1
15 2.5794821e+03 4.23e-07 2.33e-03 -5.7 5.94e-01 - 1.00e+00 9.77e-0
1h 1
16 2.5794622e+03 4.86e-11 2.27e-08 -5.7 1.36e-02 - 1.00e+00 1.00e+0
0f 1
17 2.5794438e+03 6.30e-11 4.40e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 2.5794437960424741e+00 2.5794437960424739e+0
3
Dual infeasibility......: 4.3999644668843370e-09 4.3999644668843370e-0
6
Constraint violation....: 6.2987642879264172e-11 6.2987642879264172e-1
1
Complementarity.........: 3.3856531397995705e-09 3.3856531397995703e-0
6
Overall NLP error.......: 4.3999644668843370e-09 4.3999644668843370e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 40
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 20
inequality constraints with only lower bounds: 11
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2158775e+02 9.17e+02 5.24e+01 -1.0 9.19e+02 - 3.29e-04 9.89e-0
3h 1
2 7.8893164e+02 9.16e+02 5.24e+01 -1.0 8.41e+02 - 1.06e-04 1.19e-0
3h 1
3 2.4334660e+02 8.97e+02 5.26e+01 -1.0 9.17e+02 - 1.20e-03 2.08e-0
2h 1
4 1.2107800e+04 5.56e-02 8.25e+01 -1.0 8.97e+02 - 3.92e-02 1.00e+0
0h 1
5 3.8559836e+03 5.30e-02 5.38e+01 -1.0 7.85e+01 - 3.44e-01 5.11e-0
2f 1
6 1.9054439e+03 3.72e-02 2.85e+01 -1.0 3.93e+01 - 4.74e-01 5.00e-0
1f 1
7 2.5866919e+03 2.02e-02 1.46e+01 -1.0 2.02e+01 - 4.06e-01 2.50e-0
1f 3
8 1.9835362e+03 6.92e-03 3.16e-01 -1.0 7.40e+00 - 9.82e-01 1.00e+0
0f 1
9 1.6893880e+03 1.29e-03 2.80e-01 -1.7 5.30e+00 - 1.00e+00 8.69e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7944840e+03 8.94e-04 1.27e-02 -1.7 1.58e+02 - 1.00e+00 1.00e+0
0f 1
11 1.5337672e+03 1.41e-03 9.55e-02 -3.8 1.64e+02 - 7.92e-01 9.29e-0
1f 1
12 1.5038848e+03 1.59e-03 7.89e-02 -3.8 9.57e+00 - 8.40e-01 7.54e-0
1h 1
13 1.5022927e+03 3.34e-06 8.47e-04 -3.8 2.31e+00 - 1.00e+00 1.00e+0
0h 1
14 1.5003387e+03 2.78e-07 6.93e-04 -5.7 1.19e+00 - 1.00e+00 9.87e-0
1h 1
15 1.5003191e+03 3.67e-11 6.70e-09 -5.7 2.65e-01 - 1.00e+00 1.00e+0
0f 1
16 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.47e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.5002932851902140e+00 1.5002932851902140e+0
3
Dual infeasibility......: 2.1692346944282617e-09 2.1692346944282617e-0
6
Constraint violation....: 6.2998675720571384e-11 6.2998675720571384e-1
1
Complementarity.........: 2.8881015198893345e-09 2.8881015198893347e-0
6
Overall NLP error.......: 2.8881015198893345e-09 2.8881015198893347e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.80e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.4973022e+02 7.53e+01 9.06e+01 -1.0 2.60e+01 - 3.82e-04 3.51e-0
2f 1
2 1.1815634e+04 5.63e-02 8.12e+01 -1.0 2.88e+01 - 4.62e-02 1.00e+0
0h 1
3 3.1560038e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.63e-0
2f 1
4 1.0148261e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8311849e+03 7.32e-03 1.59e+01 -1.0 1.90e+01 - 6.01e-01 1.00e+0
0h 1
6 1.1121606e+03 5.45e-03 4.06e-01 -1.0 1.74e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8122725e+02 9.75e-04 2.01e-01 -1.7 5.70e+00 - 1.00e+00 8.93e-0
1h 1
8 7.2711707e+02 8.62e-04 1.29e-02 -1.7 3.47e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0943827e+02 1.50e-03 1.12e-01 -3.8 4.46e+00 - 7.72e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8221547e+02 2.13e-03 7.61e-02 -3.8 2.08e+00 - 8.09e-01 7.38e-0
1h 1
11 5.8339390e+02 6.77e-05 3.43e-02 -3.8 3.03e-02 - 1.00e+00 9.68e-0
1h 1
12 5.8368703e+02 2.73e-07 1.03e-05 -3.8 4.16e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278914e+02 4.12e-07 5.09e-04 -5.7 3.46e-02 - 1.00e+00 9.92e-0
1h 1
14 5.8278859e+02 4.34e-11 3.43e-09 -5.7 2.58e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.61e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753114346764e-01 5.8277753114346763e+0
2
Dual infeasibility......: 2.6085768661538335e-09 2.6085768661538335e-0
6
Constraint violation....: 6.3001923122918413e-11 6.3001923122918413e-1
1
Complementarity.........: 2.8882619128249067e-09 2.8882619128249066e-0
6
Overall NLP error.......: 2.8882619128249067e-09 2.8882619128249066e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1562352e+02 1.10e+02 1.13e+02 -1.0 3.77e+01 - 2.63e-04 3.01e-0
2f 1
2 1.1395489e+04 5.38e-02 8.36e+01 -1.0 4.54e+01 - 3.09e-02 1.00e+0
0h 1
3 2.7818957e+03 5.17e-02 6.49e+01 -1.0 8.43e+01 - 2.26e-01 4.31e-0
2f 1
4 9.8126838e+02 4.25e-02 3.38e+01 -1.0 3.40e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5880439e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.22e-01 1.00e+0
0h 1
6 9.4485226e+02 1.01e-02 8.69e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6262803e+02 4.58e-04 6.61e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536147e+02 1.94e-03 1.93e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379473e+02 3.25e-03 6.08e-02 -2.5 2.05e+00 - 1.00e+00 9.48e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140267e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388114e+02 1.57e-04 1.68e-02 -3.8 7.57e-01 - 9.93e-01 9.42e-0
1h 1
12 5.8370190e+02 7.28e-07 6.65e-05 -3.8 8.51e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278678e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.07e-09 -5.7 3.35e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148962974e-01 5.8277753148962972e+0
2
Dual infeasibility......: 2.0876385487310206e-09 2.0876385487310206e-0
6
Constraint violation....: 6.2994345850775346e-11 6.2994345850775346e-1
1
Complementarity.........: 2.8882094055675713e-09 2.8882094055675712e-0
6
Overall NLP error.......: 2.8882094055675713e-09 2.8882094055675712e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.80e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.4973022e+02 7.53e+01 9.06e+01 -1.0 2.60e+01 - 3.82e-04 3.51e-0
2f 1
2 1.1815634e+04 5.63e-02 8.12e+01 -1.0 2.88e+01 - 4.62e-02 1.00e+0
0h 1
3 3.1560038e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.63e-0
2f 1
4 1.0148261e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8311849e+03 7.32e-03 1.59e+01 -1.0 1.90e+01 - 6.01e-01 1.00e+0
0h 1
6 1.1121606e+03 5.45e-03 4.06e-01 -1.0 1.74e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8122725e+02 9.75e-04 2.01e-01 -1.7 5.70e+00 - 1.00e+00 8.93e-0
1h 1
8 7.2711707e+02 8.62e-04 1.29e-02 -1.7 3.47e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0943827e+02 1.50e-03 1.12e-01 -3.8 4.46e+00 - 7.72e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8221547e+02 2.13e-03 7.61e-02 -3.8 2.08e+00 - 8.09e-01 7.38e-0
1h 1
11 5.8339390e+02 6.77e-05 3.43e-02 -3.8 3.03e-02 - 1.00e+00 9.68e-0
1h 1
12 5.8368703e+02 2.73e-07 1.03e-05 -3.8 4.16e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278914e+02 4.12e-07 5.09e-04 -5.7 3.46e-02 - 1.00e+00 9.92e-0
1h 1
14 5.8278859e+02 4.34e-11 3.43e-09 -5.7 2.58e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.61e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753114346764e-01 5.8277753114346763e+0
2
Dual infeasibility......: 2.6085768661538335e-09 2.6085768661538335e-0
6
Constraint violation....: 6.3001923122918413e-11 6.3001923122918413e-1
1
Complementarity.........: 2.8882619128249067e-09 2.8882619128249066e-0
6
Overall NLP error.......: 2.8882619128249067e-09 2.8882619128249066e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.30e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9752295e+02 4.12e+01 5.97e+01 -1.0 1.43e+01 - 6.95e-04 4.22e-0
2f 1
2 1.2223625e+04 6.06e-02 7.87e+01 -1.0 1.80e+01 - 7.03e-02 1.00e+0
0h 1
3 3.6164925e+03 5.54e-02 5.16e+01 -1.0 5.49e+01 - 3.32e-01 7.83e-0
2f 1
4 2.3466693e+03 2.94e-02 2.29e+01 -1.0 2.73e+01 - 5.43e-01 4.44e-0
1f 1
5 1.7433411e+03 8.60e-03 1.20e+00 -1.0 1.00e+01 - 9.27e-01 7.72e-0
1f 1
6 2.0196339e+03 3.35e-04 8.12e-02 -1.0 3.41e+00 - 1.00e+00 1.00e+0
0h 1
7 1.3876197e+03 2.09e-03 7.98e-02 -2.5 4.93e+00 - 8.66e-01 8.53e-0
1f 1
8 1.2082550e+03 2.16e-03 1.82e-01 -2.5 1.03e+00 - 1.00e+00 8.44e-0
1f 1
9 1.1989690e+03 4.30e-05 5.35e-03 -2.5 1.18e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1919732e+03 2.30e-05 1.71e+00 -3.8 9.19e-02 - 1.00e+00 4.91e-0
1h 1
11 1.1892254e+03 1.18e-06 8.14e-02 -3.8 7.37e-02 - 9.39e-01 1.00e+0
0f 1
12 1.1887737e+03 2.74e-05 1.66e-01 -3.8 2.31e-02 - 1.00e+00 4.53e-0
1h 2
13 1.1885637e+03 3.41e-06 1.13e-04 -3.8 1.10e-02 - 1.00e+00 1.00e+0
0h 1
14 1.1878349e+03 7.99e-06 5.32e-02 -5.7 1.33e-02 - 7.07e-01 9.87e-0
1h 1
15 1.1876626e+03 1.88e-05 2.11e-04 -5.7 6.60e-03 - 9.83e-01 1.00e+0
0f 1
16 1.1876664e+03 1.37e-08 1.76e-06 -5.7 1.71e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1876544e+03 1.43e-08 4.60e-05 -8.6 1.74e-04 - 9.92e-01 9.58e-0
1h 1
18 1.1876540e+03 4.24e-12 5.54e-11 -8.6 7.26e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1876539891189137e+00 1.1876539891189136e+0
3
Dual infeasibility......: 5.5364755757192746e-11 5.5364755757192746e-0
8
Constraint violation....: 4.2422731993951857e-12 4.2422731993951857e-1
2
Complementarity.........: 2.5123757556810147e-09 2.5123757556810146e-0
6
Overall NLP error.......: 2.5123757556810147e-09 2.5123757556810146e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 42
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 21
inequality constraints with only lower bounds: 12
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2132963e+02 9.17e+02 5.24e+01 -1.0 9.18e+02 - 3.29e-04 9.90e-0
3h 1
2 7.8835515e+02 9.16e+02 5.24e+01 -1.0 8.42e+02 - 1.18e-04 1.21e-0
3h 1
3 2.4341104e+02 8.97e+02 5.26e+01 -1.0 9.16e+02 - 1.20e-03 2.08e-0
2h 1
4 1.2102171e+04 5.56e-02 8.38e+01 -1.0 8.97e+02 - 2.34e-02 1.00e+0
0h 1
5 3.9421332e+03 5.37e-02 6.82e+01 -1.0 8.10e+01 - 1.91e-01 3.71e-0
2f 1
6 1.9784818e+03 4.38e-02 3.63e+01 -1.0 3.40e+01 - 4.73e-01 5.43e-0
1f 1
7 2.6471704e+03 1.88e-02 2.09e+01 -1.0 1.92e+01 - 3.75e-01 2.50e-0
1f 3
8 1.9456120e+03 7.68e-03 3.85e-01 -1.0 1.00e+01 - 9.84e-01 1.00e+0
0f 1
9 1.6815564e+03 1.32e-03 2.75e-01 -1.7 4.75e+00 - 1.00e+00 8.77e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8156328e+03 9.63e-04 1.68e-02 -1.7 1.80e+02 - 9.56e-01 1.00e+0
0f 1
11 1.5358166e+03 1.39e-03 9.50e-02 -3.8 1.85e+02 - 7.95e-01 9.27e-0
1f 1
12 1.5044156e+03 1.57e-03 7.73e-02 -3.8 1.13e+01 - 8.38e-01 7.53e-0
1h 1
13 1.5022800e+03 4.01e-06 8.65e-04 -3.8 2.72e+00 - 1.00e+00 1.00e+0
0h 1
14 1.5003385e+03 2.64e-07 7.41e-04 -5.7 1.19e+00 - 1.00e+00 9.87e-0
1h 1
15 1.5003191e+03 3.66e-11 6.83e-09 -5.7 2.81e-01 - 1.00e+00 1.00e+0
0f 1
16 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.47e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.5002932850133408e+00 1.5002932850133407e+0
3
Dual infeasibility......: 2.1692304269547243e-09 2.1692304269547243e-0
6
Constraint violation....: 6.2999300221022736e-11 6.2999300221022736e-1
1
Complementarity.........: 2.8880982258061332e-09 2.8880982258061333e-0
6
Overall NLP error.......: 2.8880982258061332e-09 2.8880982258061333e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6403472e+02 9.17e+02 5.24e+01 -1.0 9.18e+02 - 4.93e-04 9.90e-0
3h 1
2 8.2515625e+02 9.16e+02 5.24e+01 -1.0 8.54e+02 - 1.16e-04 1.44e-0
3h 1
3 2.6355400e+02 8.96e+02 5.25e+01 -1.0 9.16e+02 - 1.43e-03 2.17e-0
2h 1
4 1.2391032e+04 6.05e-02 8.26e+01 -1.0 8.96e+02 - 2.46e-02 1.00e+0
0h 1
5 4.3874419e+03 5.80e-02 6.56e+01 -1.0 6.93e+01 - 2.08e-01 3.81e-0
2f 1
6 2.4217493e+03 3.44e-02 3.52e+01 -1.0 3.15e+01 - 4.79e-01 6.14e-0
1f 1
7 2.2774738e+03 6.70e-03 2.30e+00 -1.0 7.53e+00 - 9.40e-01 1.00e+0
0f 1
78 1.604671e+04 1.632511e+04 6.055123e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6793774e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.80e-0
3h 1
2 7.6493627e+02 1.57e+04 5.25e+01 -1.0 1.38e+04 - 2.51e-05 1.13e-0
4h 1
3 7.6112402e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 1.74e-05 3.02e-0
4h 1
4 7.5587381e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 3.17e-04 4.28e-0
4h 1
5 5.2695508e+02 1.54e+04 5.27e+01 -1.0 1.57e+04 - 8.02e-04 2.00e-0
2f 1
6 2.6550634e+04 6.11e-02 8.48e+01 -1.0 1.54e+04 - 2.98e-02 1.00e+0
0h 1
7 1.8261036e+04 5.87e-02 6.65e+01 -1.0 7.74e+01 - 2.22e-01 4.33e-0
2f 1
8 1.6691285e+04 4.51e-02 3.28e+01 -1.0 2.87e+01 - 5.02e-01 4.35e-0
1f 1
9 1.6985127e+04 3.08e-02 1.30e+01 -1.0 1.61e+01 - 4.69e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6781079e+04 5.31e-03 2.03e-01 -1.0 3.77e+00 - 9.89e-01 1.00e+0
0h 1
11 1.6496714e+04 1.04e-03 6.58e-01 -1.7 4.59e+00 - 5.96e-01 8.80e-0
1f 1
12 1.6482379e+04 2.69e-04 6.27e-01 -1.7 8.03e+00 - 4.89e-01 1.00e+0
0f 1
13 1.6479992e+04 7.83e-05 1.46e-01 -1.7 1.16e+01 - 7.31e-01 1.00e+0
0h 1
14 1.6371603e+04 9.18e-04 6.73e-02 -2.5 1.25e+01 - 9.11e-01 1.00e+0
0f 1
15 1.6344741e+04 1.40e-03 1.48e-02 -2.5 4.78e+00 - 1.00e+00 1.00e+0
0h 1
16 1.6328038e+04 2.46e-04 1.01e-01 -3.8 5.97e+00 - 1.00e+00 8.38e-0
1h 1
17 1.6326333e+04 6.83e-07 1.22e-04 -3.8 6.86e-01 - 1.00e+00 1.00e+0
0h 1
18 1.6325118e+04 4.00e-07 1.10e-04 -5.7 2.97e-01 - 1.00e+00 9.98e-0
1h 1
19 1.6325120e+04 3.82e-11 3.01e-09 -5.7 1.36e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325105e+04 6.27e-11 1.55e-06 -8.6 3.69e-03 - 1.00e+00 9.97e-0
1h 1
21 1.6325105e+04 3.55e-15 2.51e-14 -8.6 6.41e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.6325105277908417e+01 1.6325105277908417e+0
4
Dual infeasibility......: 2.5091040356528538e-14 2.5091040356528538e-1
1
Constraint violation....: 3.5527136788005009e-15 3.5527136788005009e-1
5
Complementarity.........: 4.9323462296193825e-09 4.9323462296193827e-0
6
Overall NLP error.......: 4.9323462296193825e-09 4.9323462296193827e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6807293e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.29e-04 9.80e-0
3h 1
2 7.6505068e+02 1.50e+04 5.25e+01 -1.0 1.30e+04 - 2.53e-05 1.14e-0
4h 1
3 7.6250316e+02 1.50e+04 5.25e+01 -1.0 1.49e+04 - 1.84e-05 1.90e-0
4h 1
4 7.6140441e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 2.07e-04 8.36e-0
5h 1
5 5.0443638e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 2.96e-04 2.00e-0
2f 1
6 2.6108938e+04 6.07e-02 8.48e+01 -1.0 1.47e+04 - 2.94e-02 1.00e+0
0h 1
7 1.7512835e+04 5.83e-02 6.79e+01 -1.0 8.04e+01 - 2.05e-01 4.25e-0
2f 1
8 1.5926091e+04 4.48e-02 3.37e+01 -1.0 2.87e+01 - 4.99e-01 4.37e-0
1f 1
9 1.6223158e+04 3.05e-02 1.37e+01 -1.0 1.62e+01 - 4.66e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6014244e+04 5.30e-03 2.48e-01 -1.0 3.73e+00 - 9.86e-01 1.00e+0
0h 1
11 1.5728923e+04 1.03e-03 2.43e-01 -1.7 4.60e+00 - 1.00e+00 8.81e-0
1f 1
12 1.5762048e+04 7.59e-04 5.73e-02 -1.7 7.25e+01 - 7.77e-01 1.00e+0
0f 1
13 1.5593833e+04 1.08e-03 4.64e-02 -2.5 7.11e+01 - 9.26e-01 1.00e+0
0f 1
14 1.5576646e+04 1.09e-03 1.31e-02 -2.5 1.10e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5561425e+04 1.85e-04 8.92e-02 -3.8 3.47e+00 - 1.00e+00 8.50e-0
1h 1
16 1.5560278e+04 7.86e-07 1.13e-04 -3.8 1.38e-01 - 1.00e+00 1.00e+0
0h 1
17 1.5559212e+04 3.97e-07 1.14e-04 -5.7 1.50e-01 - 1.00e+00 9.97e-0
1h 1
18 1.5559215e+04 3.84e-11 3.03e-09 -5.7 8.59e-03 - 1.00e+00 1.00e+0
0f 1
19 1.5559202e+04 6.30e-11 2.07e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.5559202156597280e+01 1.5559202156597279e+0
4
Dual infeasibility......: 2.0695848238303237e-09 2.0695848238303237e-0
6
Constraint violation....: 6.2993776861475226e-11 6.2993776861475226e-1
1
Complementarity.........: 2.8882111486918187e-09 2.8882111486918187e-0
6
Overall NLP error.......: 2.8882111486918187e-09 2.8882111486918187e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.3158868e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.51e-04 9.80e-0
3f 1
2 8.2877355e+02 1.39e+04 5.24e+01 -1.0 1.37e+04 - 9.37e-05 1.01e-0
4h 1
3 8.1974101e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 3.08e-06 6.36e-0
4f 1
4 5.2931379e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 6.83e-04 2.12e-0
2h 1
5 2.5415999e+04 5.59e-02 8.20e+01 -1.0 1.36e+04 - 4.07e-02 1.00e+0
0h 1
6 1.6922501e+04 5.29e-02 5.31e+01 -1.0 8.03e+01 - 3.47e-01 5.19e-0
2f 1
7 1.4891950e+04 3.52e-02 2.87e+01 -1.0 4.08e+01 - 4.66e-01 5.14e-0
1f 1
8 1.5243437e+04 2.22e-02 1.33e+01 -1.0 2.13e+01 - 3.96e-01 1.25e-0
1f 4
9 1.5009733e+04 5.61e-03 5.30e-01 -1.0 4.03e+00 - 9.70e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4688234e+04 1.48e-03 4.82e-01 -1.7 6.29e+00 - 1.00e+00 8.02e-0
1f 1
11 1.4633022e+04 1.00e-03 1.73e-02 -1.7 1.85e+01 - 1.00e+00 1.00e+0
0f 1
12 1.4504765e+04 1.48e-03 9.54e-02 -3.8 1.99e+01 - 7.84e-01 9.19e-0
1f 1
13 1.4480539e+04 1.74e-03 1.03e-01 -3.8 1.76e+00 - 8.40e-01 7.38e-0
1h 1
14 1.4480986e+04 3.76e-06 9.66e-04 -3.8 4.13e-01 - 1.00e+00 1.00e+0
0h 1
15 1.4480072e+04 2.43e-07 7.46e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 1.4480065e+04 3.35e-11 7.14e-09 -5.7 1.66e-01 - 1.00e+00 1.00e+0
0f 1
17 1.4480052e+04 6.30e-11 2.24e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.4480051785455681e+01 1.4480051785455680e+0
4
Dual infeasibility......: 2.2424204092281819e-09 2.2424204092281819e-0
6
Constraint violation....: 6.3001298622467061e-11 6.3001298622467061e-1
1
Complementarity.........: 2.8880942093958071e-09 2.8880942093958071e-0
6
Overall NLP error.......: 2.8880942093958071e-09 2.8880942093958071e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.3793324e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.71e-04 9.80e-0
3h 1
2 8.3506259e+02 1.27e+04 5.24e+01 -1.0 1.20e+04 - 4.65e-05 1.04e-0
4h 1
3 7.9584057e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 7.77e-06 2.55e-0
3h 1
4 5.2387156e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 2.76e-03 2.06e-0
2h 1
5 2.3276068e+04 5.85e-02 8.18e+01 -1.0 1.24e+04 - 4.65e-02 1.00e+0
0h 1
6 1.5633422e+04 5.48e-02 4.82e+01 -1.0 7.34e+01 - 4.02e-01 5.85e-0
2f 1
7 1.3648891e+04 3.60e-02 2.48e+01 -1.0 4.11e+01 - 4.88e-01 5.13e-0
1f 1
8 1.4004336e+04 1.95e-02 4.54e+00 -1.0 1.25e+01 - 6.72e-01 2.50e-0
1f 3
9 1.3789630e+04 4.90e-03 3.01e-01 -1.0 5.28e+00 - 9.60e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3451139e+04 1.32e-03 4.89e-01 -1.7 6.09e+00 - 1.00e+00 7.95e-0
1f 1
11 1.3414440e+04 7.18e-04 2.45e-02 -1.7 3.67e+01 - 1.00e+00 1.00e+0
0f 1
12 1.3260602e+04 1.53e-03 1.08e-01 -3.8 3.98e+01 - 7.69e-01 9.22e-0
1f 1
13 1.3233607e+04 1.99e-03 1.04e-01 -3.8 3.08e+00 - 8.26e-01 7.31e-0
1h 1
14 1.3234109e+04 2.71e-06 1.14e-03 -3.8 8.28e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3233076e+04 2.36e-07 8.47e-04 -5.7 2.97e-01 - 1.00e+00 9.85e-0
1h 1
16 1.3233066e+04 3.01e-11 7.44e-09 -5.7 2.70e-02 - 1.00e+00 1.00e+0
0f 1
17 1.3233051e+04 6.30e-11 2.40e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.3233050936639977e+01 1.3233050936639976e+0
4
Dual infeasibility......: 2.3951051522572424e-09 2.3951051522572424e-0
6
Constraint violation....: 6.3004795824994630e-11 6.3004795824994630e-1
1
Complementarity.........: 3.0979812634604256e-09 3.0979812634604256e-0
6
Overall NLP error.......: 3.0979812634604256e-09 3.0979812634604256e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9038317e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 6.93e-04 9.80e-0
3h 1
2 8.8740946e+02 1.11e+04 5.24e+01 -1.0 9.68e+03 - 2.80e-05 1.14e-0
4h 1
3 7.2623959e+02 1.10e+04 5.24e+01 -1.0 1.11e+04 - 1.82e-05 9.82e-0
3h 1
4 6.1523738e+02 1.08e+04 5.20e+01 -1.0 1.10e+04 - 1.10e-02 2.09e-0
2h 1
5 1.9688599e+04 7.24e-02 7.76e+01 -1.0 1.08e+04 - 9.87e-02 1.00e+0
0h 1
6 1.4293221e+04 6.35e-02 2.07e+01 -1.0 4.26e+01 - 7.03e-01 1.14e-0
1f 1
7 1.2770192e+04 2.29e-02 1.96e+00 -1.0 2.13e+01 - 9.30e-01 6.78e-0
1f 1
8 1.3007622e+04 3.09e-03 1.05e+00 -1.0 4.02e+00 - 5.19e-01 1.00e+0
0f 1
9 1.3186063e+04 5.92e-04 9.38e-01 -1.0 8.13e+00 - 5.98e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2531750e+04 1.79e-03 2.26e-01 -1.7 3.23e+00 - 8.73e-01 1.00e+0
0f 1
11 1.2498722e+04 6.29e-04 8.02e-02 -1.7 1.58e+01 - 9.07e-01 1.00e+0
0h 1
12 1.2328342e+04 5.37e-04 1.59e-02 -2.5 1.96e+01 - 9.69e-01 9.61e-0
1f 1
13 1.2321762e+04 3.39e-04 3.75e+00 -3.8 1.20e+01 - 1.00e+00 3.69e-0
1h 1
14 1.2309731e+04 1.67e-05 9.18e-03 -3.8 7.65e+00 - 1.00e+00 1.00e+0
0f 1
15 1.2309537e+04 1.47e-05 7.94e-05 -3.8 5.02e-03 - 1.00e+00 1.00e+0
0h 1
16 1.2308340e+04 1.25e-05 4.57e-02 -5.7 4.46e-01 - 6.93e-01 9.92e-0
1h 1
17 1.2308177e+04 1.98e-05 1.80e-04 -5.7 6.96e-03 - 9.84e-01 1.00e+0
0f 1
18 1.2308178e+04 7.77e-08 3.76e-06 -5.7 4.31e-04 - 1.00e+00 1.00e+0
0h 1
19 1.2308162e+04 1.08e-08 9.27e-05 -8.6 5.53e-03 - 9.95e-01 9.44e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.2308161e+04 7.91e-12 8.83e-11 -8.6 3.11e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.2308160915786084e+01 1.2308160915786084e+0
4
Dual infeasibility......: 8.8337068620718622e-11 8.8337068620718622e-0
8
Constraint violation....: 7.9103390504542404e-12 7.9103390504542404e-1
2
Complementarity.........: 3.5261804969164622e-09 3.5261804969164623e-0
6
Overall NLP error.......: 3.5261804969164622e-09 3.5261804969164623e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8775333e+02 9.19e+03 5.24e+01 -1.0 9.28e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8469544e+02 9.19e+03 5.24e+01 -1.0 7.80e+03 - 2.91e-05 1.17e-0
4h 1
3 6.6462174e+02 9.08e+03 5.24e+01 -1.0 9.19e+03 - 2.18e-05 1.20e-0
2h 1
4 5.9228775e+02 8.88e+03 5.19e+01 -1.0 9.08e+03 - 1.38e-02 2.17e-0
2h 1
5 1.7105306e+04 7.36e-02 7.74e+01 -1.0 8.88e+03 - 1.04e-01 1.00e+0
0h 1
6 1.2211573e+04 6.40e-02 2.02e+01 -1.0 4.24e+01 - 7.12e-01 1.21e-0
1f 1
7 1.0749761e+04 2.49e-02 1.83e+00 -1.0 2.14e+01 - 9.33e-01 6.71e-0
1f 1
8 1.0985588e+04 3.01e-03 9.71e-01 -1.0 4.35e+00 - 5.51e-01 1.00e+0
0f 1
9 1.0463513e+04 1.27e-03 3.17e-01 -1.7 3.97e+00 - 8.00e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.0471115e+04 5.90e-04 2.45e-01 -1.7 7.57e+00 - 7.79e-01 1.00e+0
0f 1
11 1.0486291e+04 1.48e-05 8.66e-02 -1.7 1.96e+01 - 5.62e-01 1.00e+0
0h 1
12 1.0377158e+04 1.64e-04 3.87e-01 -2.5 1.58e+01 - 1.00e+00 6.74e-0
1f 1
13 1.0360662e+04 6.38e-06 9.55e-03 -2.5 1.45e+01 - 1.00e+00 1.00e+0
0f 1
14 1.0339519e+04 9.23e-06 4.02e-02 -3.8 8.04e+00 - 8.63e-01 9.09e-0
1f 1
15 1.0336042e+04 5.08e-04 1.00e-03 -3.8 7.26e-01 - 1.00e+00 1.00e+0
0f 1
16 1.0334757e+04 5.43e-05 1.03e-02 -5.7 4.46e-01 - 8.32e-01 1.00e+0
0h 1
17 1.0334651e+04 3.18e-05 3.49e-05 -5.7 9.04e-03 - 1.00e+00 1.00e+0
0h 1
18 1.0334655e+04 4.87e-07 6.12e-06 -5.7 1.05e-03 - 1.00e+00 1.00e+0
0h 1
19 1.0334639e+04 3.29e-08 7.73e-05 -8.6 5.53e-03 - 1.00e+00 9.44e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.0334638e+04 7.33e-12 6.35e-11 -8.6 3.08e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.0334637967830096e+01 1.0334637967830096e+0
4
Dual infeasibility......: 6.3470142636891105e-11 6.3470142636891098e-0
8
Constraint violation....: 7.3260286725940205e-12 7.3260286725940205e-1
2
Complementarity.........: 2.9420668027218959e-09 2.9420668027218959e-0
6
Overall NLP error.......: 2.9420668027218959e-09 2.9420668027218959e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3708621e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 3.06e-03 9.81e-0
3h 1
2 9.2685228e+02 6.70e+03 5.23e+01 -1.0 5.16e+03 - 7.80e-06 4.30e-0
4h 1
3 4.2744385e+02 6.55e+03 5.24e+01 -1.0 6.70e+03 - 3.41e-04 2.27e-0
2h 1
4 1.9152600e+04 7.34e-02 7.71e+01 -1.0 6.55e+03 - 7.60e-02 1.00e+0
0h 1
5 1.1266474e+04 6.67e-02 2.37e+01 -1.0 4.40e+00 - 6.64e-01 8.47e-0
2f 1
6 1.0233662e+04 3.07e-02 9.29e+00 -1.0 4.78e+00 - 7.00e-01 1.00e+0
0f 1
7 1.0417809e+04 1.44e-02 2.61e-01 -1.0 1.29e+00 - 9.92e-01 9.96e-0
1f 1
8 1.0005559e+04 3.73e-03 3.38e-01 -1.7 1.54e+01 - 8.48e-01 1.00e+0
0f 1
9 9.9704668e+03 6.37e-04 3.73e-01 -1.7 3.05e+01 - 7.01e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.9962200e+03 2.01e-05 6.96e-04 -1.7 1.16e+01 - 1.00e+00 1.00e+0
0h 1
11 9.8128155e+03 2.98e-04 2.43e-02 -3.8 5.83e+01 - 8.67e-01 8.41e-0
1f 1
12 9.7884187e+03 4.54e-05 6.01e-02 -3.8 9.14e+00 - 1.00e+00 8.75e-0
1h 1
13 9.7856969e+03 5.27e-08 2.93e-05 -3.8 1.14e+00 - 1.00e+00 1.00e+0
0f 1
14 9.7842101e+03 1.69e-08 2.51e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0f 1
15 9.7841926e+03 1.73e-12 4.25e-10 -8.6 5.52e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 9.7841925893847534e+00 9.7841925893847529e+0
3
Dual infeasibility......: 4.2532803814147424e-10 4.2532803814147424e-0
7
Constraint violation....: 1.7262441476262325e-12 1.7262441476262325e-1
2
Complementarity.........: 2.7079832728718771e-09 2.7079832728718769e-0
6
Overall NLP error.......: 2.7079832728718771e-09 2.7079832728718769e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3000909e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 2.02e-03 9.81e-0
3h 1
2 9.2540939e+02 4.77e+03 5.23e+01 -1.0 2.66e+03 - 1.91e-05 1.78e-0
4h 1
3 3.8379504e+02 4.66e+03 5.24e+01 -1.0 4.77e+03 - 8.68e-05 2.34e-0
2f 1
4 1.7424477e+04 7.01e-02 7.87e+01 -1.0 4.66e+03 - 5.08e-02 1.00e+0
0h 1
5 9.2441130e+03 6.55e-02 5.13e+01 -1.0 1.16e+01 - 3.39e-01 6.13e-0
2f 1
6 7.9204820e+03 2.27e-02 2.21e+01 -1.0 7.02e+00 - 6.27e-01 9.88e-0
1f 1
7 8.2927286e+03 2.17e-03 1.90e-01 -1.0 2.55e+00 - 9.91e-01 1.00e+0
0f 1
8 7.7707444e+03 1.76e-03 6.99e-02 -1.7 6.35e+00 - 1.00e+00 9.92e-0
1f 1
9 7.5980722e+03 1.95e-03 3.69e-01 -2.5 1.67e+00 - 1.00e+00 7.91e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.5727496e+03 1.82e-04 4.79e-02 -2.5 3.44e-01 - 1.00e+00 9.36e-0
1h 1
11 7.5754877e+03 7.05e-06 1.34e-03 -2.5 2.21e-02 - 1.00e+00 1.00e+0
0f 1
12 7.5482488e+03 7.66e-06 4.23e-03 -3.8 8.04e+00 - 1.00e+00 9.79e-0
1f 1
13 7.5480543e+03 1.37e-08 6.27e-06 -3.8 1.66e-01 - 1.00e+00 1.00e+0
0f 1
14 7.5465649e+03 1.73e-08 3.04e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0f 1
15 7.5465477e+03 1.28e-12 4.22e-10 -8.6 5.52e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 7.5465477393977176e+00 7.5465477393977171e+0
3
Dual infeasibility......: 4.2179927613317841e-10 4.2179927613317841e-0
7
Constraint violation....: 1.2799900028781508e-12 1.2799900028781508e-1
2
Complementarity.........: 3.0423275755092796e-09 3.0423275755092797e-0
6
Overall NLP error.......: 3.0423275755092796e-09 3.0423275755092797e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9478285e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3f 1
2 8.9187540e+02 3.24e+03 5.24e+01 -1.0 3.02e+03 - 9.14e-05 1.06e-0
4h 1
3 8.1655200e+02 3.23e+03 5.24e+01 -1.0 3.24e+03 - 1.38e-05 3.11e-0
3f 1
4 3.3910587e+02 3.16e+03 5.23e+01 -1.0 3.23e+03 - 4.64e-03 2.16e-0
2h 1
5 1.3760479e+04 6.81e-02 7.78e+01 -1.0 3.16e+03 - 8.37e-02 1.00e+0
0h 1
6 6.7546785e+03 6.11e-02 3.98e+01 -1.0 4.44e+01 - 4.66e-01 9.34e-0
2f 1
7 5.3864148e+03 2.95e-02 1.35e+01 -1.0 2.09e+01 - 6.49e-01 5.65e-0
1f 1
8 5.1381255e+03 3.48e-03 7.14e-01 -1.0 6.07e+00 - 9.54e-01 7.93e-0
1h 1
9 4.8058915e+03 9.07e-03 2.89e-01 -1.7 1.90e+00 - 1.00e+00 8.12e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.7469494e+03 1.26e-03 1.39e-01 -1.7 1.88e+01 - 1.00e+00 9.70e-0
1f 1
11 4.6212428e+03 4.91e-04 1.73e-01 -2.5 1.68e+01 - 9.48e-01 8.28e-0
1h 1
12 4.5986044e+03 6.65e-05 4.46e-03 -2.5 2.80e+00 - 1.00e+00 1.00e+0
0f 1
13 4.5763010e+03 1.58e-05 2.73e-02 -3.8 2.68e+00 - 1.00e+00 9.25e-0
1h 1
14 4.5756329e+03 4.87e-08 5.45e-04 -3.8 1.99e-01 - 1.00e+00 1.00e+0
0f 1
15 4.5743308e+03 4.26e-08 4.12e-04 -5.7 1.49e-01 - 1.00e+00 9.91e-0
1f 1
16 4.5743250e+03 1.95e-12 3.00e-08 -5.7 1.33e-03 - 1.00e+00 1.00e+0
0f 1
17 4.5743102e+03 2.58e-12 3.28e-06 -8.6 1.84e-03 - 1.00e+00 9.99e-0
1f 1
18 4.5743102e+03 1.64e-15 4.87e-14 -8.6 1.07e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 4.5743102056864711e+00 4.5743102056864709e+0
3
Dual infeasibility......: 4.8740230484764618e-14 4.8740230484764618e-1
1
Constraint violation....: 1.6357794067384396e-15 1.6357794067384396e-1
5
Complementarity.........: 2.5059125764795938e-09 2.5059125764795938e-0
6
Overall NLP error.......: 2.5059125764795938e-09 2.5059125764795938e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8030290e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.83e-0
3h 1
2 8.7173266e+02 2.00e+03 5.24e+01 -1.0 1.39e+03 - 4.31e-05 3.26e-0
4h 1
3 8.2189944e+02 1.99e+03 5.24e+01 -1.0 2.00e+03 - 2.57e-04 1.95e-0
3h 1
4 2.9849032e+02 1.95e+03 5.24e+01 -1.0 1.99e+03 - 2.20e-03 2.18e-0
2f 1
5 1.3201943e+04 6.34e-02 7.94e+01 -1.0 1.95e+03 - 6.11e-02 1.00e+0
0h 1
6 5.4373917e+03 5.85e-02 4.94e+01 -1.0 6.04e+01 - 3.63e-01 7.11e-0
2f 1
7 4.0797057e+03 3.10e-02 2.28e+01 -1.0 3.12e+01 - 5.26e-01 4.32e-0
1f 1
8 3.4078519e+03 8.69e-03 1.63e+00 -1.0 1.07e+01 - 9.22e-01 8.78e-0
1f 1
9 3.7665705e+03 2.23e-04 1.50e-01 -1.0 4.47e+00 - 9.37e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.1160676e+03 1.22e-03 8.62e-01 -1.7 1.77e+01 - 5.13e-01 9.84e-0
1f 1
11 3.1950018e+03 4.75e-05 8.47e-01 -1.7 1.44e+01 - 7.86e-01 1.00e+0
0f 1
12 3.1938033e+03 8.30e-05 9.38e-03 -1.7 3.45e+01 - 1.00e+00 1.00e+0
0f 1
13 3.0932484e+03 3.43e-05 6.27e-01 -2.5 5.71e+01 - 1.00e+00 7.35e-0
1f 1
14 3.0679386e+03 1.16e-04 6.29e-03 -2.5 1.49e+01 - 1.00e+00 1.00e+0
0f 1
15 3.0431073e+03 2.74e-04 8.90e-02 -3.8 1.29e+01 - 7.68e-01 1.00e+0
0h 1
16 3.0409284e+03 1.66e-03 2.70e-02 -3.8 6.32e-01 - 5.98e-02 1.00e+0
0f 1
17 3.0409971e+03 3.04e-05 1.25e-05 -3.8 4.00e-02 - 1.00e+00 1.00e+0
0h 1
18 3.0392743e+03 1.66e-04 1.33e-03 -5.7 6.06e-01 - 9.08e-01 1.00e+0
0h 1
19 3.0392336e+03 4.34e-05 1.13e-05 -5.7 9.70e-03 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 3.0392367e+03 1.06e-06 6.84e-06 -5.7 1.50e-03 - 1.00e+00 1.00e+0
0h 1
21 3.0392194e+03 7.85e-08 7.17e-05 -8.6 7.37e-03 - 1.00e+00 9.42e-0
1h 1
22 3.0392184e+03 8.09e-12 9.37e-11 -8.6 4.28e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 3.0392184024303348e+00 3.0392184024303347e+0
3
Dual infeasibility......: 9.3675649390274303e-11 9.3675649390274303e-0
8
Constraint violation....: 8.0913054034681409e-12 8.0913054034681409e-1
2
Complementarity.........: 2.9307336636149534e-09 2.9307336636149535e-0
6
Overall NLP error.......: 2.9307336636149534e-09 2.9307336636149535e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 42
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 21
inequality constraints with only lower bounds: 12
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0741783e+02 9.17e+02 5.23e+01 -1.0 9.18e+02 - 1.00e-03 9.90e-0
3h 1
2 8.1159359e+02 9.14e+02 5.23e+01 -1.0 8.92e+02 - 1.11e-04 3.61e-0
3h 1
3 2.9062191e+02 8.94e+02 5.23e+01 -1.0 9.14e+02 - 3.57e-03 2.17e-0
2h 1
4 1.1971043e+04 6.94e-02 8.20e+01 -1.0 8.94e+02 - 2.68e-02 1.00e+0
0h 1
5 4.9337522e+03 6.63e-02 6.12e+01 -1.0 3.52e+01 - 2.55e-01 4.17e-0
2f 1
6 3.6923930e+03 2.05e-02 2.72e+01 -1.0 1.60e+01 - 5.63e-01 6.34e-0
1f 1
7 3.3234164e+03 5.64e-03 8.29e-01 -1.0 4.57e+00 - 9.62e-01 8.24e-0
1f 1
8 3.6020237e+03 1.54e-04 5.25e-02 -1.0 6.68e+00 - 9.92e-01 1.00e+0
0f 1
9 3.0296578e+03 2.22e-03 9.53e-02 -2.5 1.28e+01 - 8.54e-01 8.64e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8765371e+03 2.16e-03 3.93e-01 -2.5 4.56e+00 - 1.00e+00 7.69e-0
1f 1
11 2.8549494e+03 1.13e-04 4.65e-03 -2.5 1.42e+00 - 1.00e+00 1.00e+0
0h 1
12 2.8229276e+03 3.01e-05 1.39e-01 -3.8 2.22e+01 - 1.00e+00 7.66e-0
1f 1
13 2.8146658e+03 1.18e-07 3.30e-04 -3.8 4.85e+00 - 1.00e+00 1.00e+0
0f 1
14 2.8124191e+03 2.87e-08 1.02e-03 -5.7 1.18e+00 - 1.00e+00 9.85e-0
1f 1
15 2.8123914e+03 1.97e-12 1.42e-08 -5.7 1.67e-02 - 1.00e+00 1.00e+0
0f 1
16 2.8123637e+03 2.63e-12 4.48e-09 -8.6 1.47e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 2.8123637176850225e+00 2.8123637176850225e+0
3
Dual infeasibility......: 4.4776957912924627e-09 4.4776957912924627e-0
6
Constraint violation....: 2.6308538680908100e-12 2.6308538680908100e-1
2
Complementarity.........: 3.6084969290117775e-09 3.6084969290117776e-0
6
Overall NLP error.......: 4.4776957912924627e-09 4.4776957912924627e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318725023556e-09 2.1031318725023556e-0
6
Constraint violation....: 6.2994248706260692e-11 6.2994248706260692e-1
1
Complementarity.........: 2.8882108896910881e-09 2.8882108896910880e-0
6
Overall NLP error.......: 2.8882108896910881e-09 2.8882108896910880e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318725023556e-09 2.1031318725023556e-0
6
Constraint violation....: 6.2994248706260692e-11 6.2994248706260692e-1
1
Complementarity.........: 2.8882108896910881e-09 2.8882108896910880e-0
6
Overall NLP error.......: 2.8882108896910881e-09 2.8882108896910880e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254210124e-01 6.4890146254210117e+0
2
Dual infeasibility......: 4.9126604736313069e-09 4.9126604736313069e-0
6
Constraint violation....: 6.2123811650494076e-09 6.2123811650494076e-0
9
Complementarity.........: 4.3646095252498074e-09 4.3646095252498072e-0
6
Overall NLP error.......: 6.2123811650494076e-09 4.9126604736313069e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.03e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 6.36e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643326e+00 1.6104063281643325e+0
3
Dual infeasibility......: 2.4576864258860156e-12 2.4576864258860156e-0
9
Constraint violation....: 6.3603173025546602e-15 6.3603173025546602e-1
5
Complementarity.........: 2.5062163910047555e-09 2.5062163910047553e-0
6
Overall NLP error.......: 2.5062163910047555e-09 2.5062163910047553e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 42
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 21
inequality constraints with only lower bounds: 12
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2200714e+02 9.17e+02 5.24e+01 -1.0 9.18e+02 - 3.31e-04 9.90e-0
3h 1
2 7.8010851e+02 9.16e+02 5.24e+01 -1.0 8.58e+02 - 1.15e-04 1.53e-0
3h 1
3 2.4431317e+02 8.97e+02 5.26e+01 -1.0 9.16e+02 - 1.55e-03 2.07e-0
2h 1
4 1.1939245e+04 5.60e-02 8.25e+01 -1.0 8.97e+02 - 3.99e-02 1.00e+0
0h 1
5 3.8457183e+03 5.32e-02 5.18e+01 -1.0 7.71e+01 - 3.68e-01 5.19e-0
2f 1
6 1.9024420e+03 3.68e-02 2.73e+01 -1.0 3.95e+01 - 4.77e-01 4.99e-0
1f 1
7 2.5789659e+03 2.03e-02 1.38e+01 -1.0 2.01e+01 - 4.09e-01 2.50e-0
1f 3
8 1.9890222e+03 6.85e-03 3.05e-01 -1.0 7.20e+00 - 9.82e-01 1.00e+0
0f 1
9 1.6909203e+03 1.30e-03 2.86e-01 -1.7 5.37e+00 - 1.00e+00 8.66e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8151128e+03 8.81e-04 1.23e-02 -1.7 1.78e+02 - 1.00e+00 1.00e+0
0f 1
11 1.5352317e+03 1.41e-03 9.62e-02 -3.8 1.84e+02 - 7.91e-01 9.29e-0
1f 1
12 1.5043468e+03 1.61e-03 7.96e-02 -3.8 1.09e+01 - 8.40e-01 7.53e-0
1h 1
13 1.5024425e+03 3.35e-06 8.53e-04 -3.8 2.64e+00 - 1.00e+00 1.00e+0
0h 1
14 1.5003425e+03 2.76e-07 6.93e-04 -5.7 1.34e+00 - 1.00e+00 9.87e-0
1h 1
15 1.5003209e+03 3.64e-11 6.71e-09 -5.7 2.53e-01 - 1.00e+00 1.00e+0
0f 1
16 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.66e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.5002932876902273e+00 1.5002932876902273e+0
3
Dual infeasibility......: 2.1734496287770048e-09 2.1734496287770048e-0
6
Constraint violation....: 6.2999133687569042e-11 6.2999133687569042e-1
1
Complementarity.........: 2.8881013049459147e-09 2.8881013049459147e-0
6
Overall NLP error.......: 2.8881013049459147e-09 2.8881013049459147e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
1 8.6471232e+02 9.17e+02 5.24e+01 -1.0 9.18e+02 - 4.97e-04 9.90e-0
3h 1
2 8.1209417e+02 9.16e+02 5.24e+01 -1.0 8.71e+02 - 1.14e-04 1.95e-0
3h 1
3 2.6481235e+02 8.96e+02 5.25e+01 -1.0 9.16e+02 - 1.98e-03 2.15e-0
2h 1
4 1.2150276e+04 6.12e-02 8.03e+01 -1.0 8.96e+02 - 5.34e-02 1.00e+0
0h 1
5 4.2145491e+03 5.69e-02 5.11e+01 -1.0 6.95e+01 - 3.52e-01 6.39e-0
2f 1
6 2.6321385e+03 3.03e-02 2.57e+01 -1.0 3.84e+01 - 4.90e-01 4.37e-0
1f 1
7 2.1293462e+03 1.36e-02 2.34e+00 -1.0 1.08e+01 - 9.20e-01 1.00e+0
0f 1
79 1.536760e+04 1.632511e+04 6.112387e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6794703e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.80e-0
3f 1
2 7.6502061e+02 1.57e+04 5.25e+01 -1.0 1.45e+04 - 3.26e-05 1.07e-0
4h 1
3 7.5970888e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 1.09e-05 4.21e-0
4h 1
4 7.4005491e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 4.28e-04 1.62e-0
3h 1
5 5.4617010e+02 1.54e+04 5.27e+01 -1.0 1.57e+04 - 2.19e-03 1.98e-0
2f 1
6 2.5834566e+04 6.20e-02 8.49e+01 -1.0 1.54e+04 - 3.11e-02 1.00e+0
0h 1
7 1.8221451e+04 5.94e-02 6.23e+01 -1.0 7.09e+01 - 2.71e-01 4.53e-0
2f 1
8 1.6686228e+04 4.57e-02 3.01e+01 -1.0 2.89e+01 - 5.11e-01 4.31e-0
1f 1
9 1.6972626e+04 3.13e-02 1.13e+01 -1.0 1.57e+01 - 4.78e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6784040e+04 5.33e-03 2.18e-01 -1.0 3.92e+00 - 9.86e-01 1.00e+0
0h 1
11 1.6497392e+04 1.04e-03 1.30e+00 -1.7 4.60e+00 - 3.10e-01 8.78e-0
1f 1
12 1.6487873e+04 1.59e-04 7.30e-01 -1.7 5.17e+00 - 6.20e-01 1.00e+0
0f 1
13 1.6477101e+04 1.11e-04 1.82e-01 -1.7 1.00e+01 - 7.05e-01 1.00e+0
0h 1
14 1.6373078e+04 9.03e-04 7.37e-02 -2.5 8.19e+00 - 9.07e-01 1.00e+0
0f 1
15 1.6344498e+04 1.56e-03 1.62e-02 -2.5 4.85e+00 - 1.00e+00 1.00e+0
0h 1
16 1.6328219e+04 2.78e-04 1.09e-01 -3.8 5.87e+00 - 1.00e+00 8.31e-0
1h 1
17 1.6326334e+04 6.15e-07 1.29e-04 -3.8 8.51e-01 - 1.00e+00 1.00e+0
0h 1
18 1.6325118e+04 4.01e-07 1.09e-04 -5.7 2.97e-01 - 1.00e+00 9.98e-0
1h 1
19 1.6325120e+04 3.83e-11 3.01e-09 -5.7 3.84e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325105e+04 6.26e-11 1.59e-06 -8.6 3.68e-03 - 1.00e+00 9.97e-0
1h 1
21 1.6325105e+04 1.07e-14 1.82e-06 -8.6 1.81e-03 - 9.96e-01 1.00e+0
0f 1
22 1.6325105e+04 3.55e-15 2.58e-14 -8.6 9.30e-06 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.6325105275847008e+01 1.6325105275847009e+0
4
Dual infeasibility......: 2.5757174171303632e-14 2.5757174171303632e-1
1
Constraint violation....: 3.5527136788005009e-15 3.5527136788005009e-1
5
Complementarity.........: 2.6681869278857919e-09 2.6681869278857917e-0
6
Overall NLP error.......: 2.6681869278857919e-09 2.6681869278857917e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6676200e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 4.98e-04 9.81e-0
3h 1
2 8.6364419e+02 1.50e+04 5.24e+01 -1.0 1.17e+04 - 1.81e-05 1.27e-0
4h 1
3 8.6199176e+02 1.50e+04 5.24e+01 -1.0 1.49e+04 - 3.20e-05 1.28e-0
4h 1
4 8.6127645e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 1.58e-04 5.62e-0
5h 1
5 5.7952634e+02 1.46e+04 5.25e+01 -1.0 1.50e+04 - 2.17e-04 2.24e-0
2f 1
6 2.6988572e+04 5.94e-02 8.01e+01 -1.0 1.46e+04 - 4.98e-02 1.00e+0
0h 1
7 1.8356611e+04 5.55e-02 5.39e+01 -1.0 7.39e+01 - 3.17e-01 5.95e-0
2f 1
8 1.6770022e+04 3.02e-02 2.82e+01 -1.0 3.89e+01 - 4.71e-01 4.31e-0
1f 1
9 1.6481398e+04 1.45e-02 2.59e+00 -1.0 1.10e+01 - 9.18e-01 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6311615e+04 7.19e-03 1.79e+00 -1.0 8.20e+00 - 9.67e-01 4.95e-0
1f 2
11 1.6376540e+04 5.75e-04 8.82e-02 -1.0 6.03e+01 - 7.77e-01 1.00e+0
0f 1
12 1.5980988e+04 4.50e-04 9.54e-01 -2.5 3.07e+01 - 9.18e-01 5.91e-0
1f 1
13 1.5862570e+04 2.25e-04 2.04e-01 -2.5 3.72e+01 - 9.28e-01 1.00e+0
0f 1
14 1.5835974e+04 3.04e-03 1.79e-02 -2.5 2.03e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5822748e+04 9.06e-04 2.17e-02 -3.8 3.55e+00 - 8.06e-01 9.26e-0
1h 1
16 1.5819182e+04 2.31e-03 7.66e-04 -3.8 1.56e-01 - 1.00e+00 1.00e+0
0h 1
17 1.5819388e+04 5.52e-05 1.40e-04 -3.8 1.28e-02 - 1.00e+00 1.00e+0
0h 1
18 1.5818089e+04 1.00e-04 3.33e-04 -5.7 1.51e-01 - 9.50e-01 9.75e-0
1h 1
19 1.5818075e+04 2.28e-05 3.74e-03 -5.7 2.68e-03 - 1.00e+00 7.74e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5818079e+04 9.04e-09 1.28e-06 -5.7 6.05e-04 - 1.00e+00 1.00e+0
0f 1
21 1.5818064e+04 9.12e-09 1.91e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
22 1.5818064e+04 1.36e-12 6.48e-11 -8.6 3.05e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.5818063699438410e+01 1.5818063699438409e+0
4
Dual infeasibility......: 6.4833494801834026e-11 6.4833494801834026e-0
8
Constraint violation....: 1.3568035583944038e-12 1.3568035583944038e-1
2
Complementarity.........: 2.5092844403780321e-09 2.5092844403780318e-0
6
Overall NLP error.......: 2.5092844403780321e-09 2.5092844403780318e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0892329e+02 1.39e+04 5.23e+01 -1.0 1.40e+04 - 1.00e-03 9.80e-0
3h 1
2 9.0612194e+02 1.39e+04 5.23e+01 -1.0 1.31e+04 - 3.81e-05 1.05e-0
4h 1
3 9.0347514e+02 1.39e+04 5.23e+01 -1.0 1.38e+04 - 8.23e-06 1.95e-0
4h 1
4 9.0021806e+02 1.39e+04 5.23e+01 -1.0 1.39e+04 - 2.01e-04 2.42e-0
4h 1
5 5.9206855e+02 1.36e+04 5.24e+01 -1.0 1.39e+04 - 4.63e-04 2.33e-0
2f 1
6 2.6179779e+04 6.59e-02 7.64e+01 -1.0 1.36e+04 - 8.28e-02 1.00e+0
0h 1
7 1.7840443e+04 5.94e-02 3.85e+01 -1.0 2.94e+01 - 4.70e-01 8.93e-0
2f 1
8 1.6345384e+04 1.91e-02 1.60e+01 -1.0 1.54e+01 - 6.09e-01 7.35e-0
1f 1
9 1.6385140e+04 5.81e-03 1.32e+00 -1.0 2.12e+00 - 9.89e-01 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6549394e+04 3.47e-04 7.35e-02 -1.0 1.55e+01 - 1.00e+00 1.00e+0
0f 1
11 1.6201165e+04 9.13e-04 7.42e-01 -2.5 3.04e+01 - 8.56e-01 5.16e-0
1f 1
12 1.5852147e+04 2.58e-03 2.73e-01 -2.5 3.57e+00 - 1.00e+00 8.17e-0
1f 1
13 1.5813443e+04 2.59e-04 1.26e-02 -2.5 3.00e-01 - 1.00e+00 1.00e+0
0h 1
14 1.5797740e+04 6.25e-05 3.01e-01 -3.8 2.79e+00 - 1.00e+00 7.60e-0
1h 1
15 1.5793332e+04 1.77e-07 1.52e-04 -3.8 6.18e-01 - 1.00e+00 1.00e+0
0f 1
16 1.5792167e+04 1.86e-08 3.75e-03 -5.7 1.49e-01 - 1.00e+00 9.68e-0
1h 1
17 1.5792137e+04 5.55e-12 2.56e-08 -5.7 4.54e-03 - 1.00e+00 1.00e+0
0f 1
18 1.5792122e+04 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5792122217985439e+01 1.5792122217985438e+0
4
Dual infeasibility......: 4.4780140357640537e-09 4.4780140357640537e-0
6
Constraint violation....: 2.6339277980902409e-12 2.6339277980902409e-1
2
Complementarity.........: 3.6085429798070346e-09 3.6085429798070344e-0
6
Overall NLP error.......: 4.4780140357640537e-09 4.4780140357640537e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4547453e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.98e-04 9.80e-0
3h 1
2 8.4252038e+02 1.27e+04 5.24e+01 -1.0 1.14e+04 - 3.11e-05 1.10e-0
4h 1
3 8.3798406e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 1.44e-05 2.95e-0
4h 1
4 8.2005794e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 3.06e-04 1.18e-0
3h 1
5 5.2137032e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 1.57e-03 2.13e-0
2f 1
6 2.3744666e+04 5.85e-02 8.13e+01 -1.0 1.24e+04 - 4.79e-02 1.00e+0
0h 1
7 1.5732213e+04 5.47e-02 5.03e+01 -1.0 7.60e+01 - 3.72e-01 5.90e-0
2f 1
8 1.3664882e+04 3.53e-02 2.66e+01 -1.0 4.19e+01 - 4.78e-01 5.29e-0
1f 1
9 1.4412144e+04 1.30e-02 5.30e+00 -1.0 1.82e+01 - 7.24e-01 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3830859e+04 4.58e-03 2.99e-01 -1.0 8.48e+00 - 9.56e-01 1.00e+0
0f 1
11 1.3454718e+04 1.18e-03 1.51e-01 -1.7 5.90e+00 - 8.88e-01 8.18e-0
1f 1
12 1.3316849e+04 1.01e-03 3.60e-01 -2.5 5.59e+00 - 7.85e-01 1.00e+0
0f 1
13 1.3247216e+04 1.06e-02 5.19e-02 -2.5 3.87e+00 - 1.00e+00 9.98e-0
1h 1
14 1.3259721e+04 4.03e-04 6.53e-03 -2.5 5.36e-01 - 1.00e+00 1.00e+0
0f 1
15 1.3235533e+04 2.17e-04 4.46e-02 -3.8 5.58e+00 - 9.86e-01 8.82e-0
1h 1
16 1.3234271e+04 1.87e-06 1.34e-04 -3.8 5.52e-01 - 1.00e+00 1.00e+0
0h 1
17 1.3233077e+04 3.21e-07 2.12e-03 -5.7 2.97e-01 - 1.00e+00 9.78e-0
1h 1
18 1.3233066e+04 3.72e-11 2.14e-08 -5.7 6.29e-03 - 1.00e+00 1.00e+0
0f 1
19 1.3233051e+04 6.30e-11 4.40e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.3233050935296813e+01 1.3233050935296813e+0
4
Dual infeasibility......: 4.3996438044356488e-09 4.3996438044356488e-0
6
Constraint violation....: 6.3009292228244362e-11 6.3009292228244362e-1
1
Complementarity.........: 3.3077661935679967e-09 3.3077661935679966e-0
6
Overall NLP error.......: 4.3996438044356488e-09 4.3996438044356488e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6592759e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 4.93e-04 9.80e-0
3h 1
2 8.6294454e+02 1.11e+04 5.24e+01 -1.0 9.80e+03 - 3.04e-05 1.12e-0
4h 1
3 7.2301231e+02 1.10e+04 5.24e+01 -1.0 1.11e+04 - 1.69e-05 8.39e-0
3h 1
4 5.7728976e+02 1.08e+04 5.22e+01 -1.0 1.10e+04 - 9.31e-03 2.05e-0
2h 1
5 1.9796248e+04 6.71e-02 8.00e+01 -1.0 1.08e+04 - 7.41e-02 1.00e+0
0h 1
6 1.4059658e+04 6.07e-02 2.68e+01 -1.0 5.78e+01 - 6.40e-01 8.90e-0
2f 1
7 1.2487453e+04 3.08e-02 3.74e+00 -1.0 3.50e+01 - 8.10e-01 4.95e-0
1f 1
8 1.2329424e+04 8.57e-03 4.54e-01 -1.0 9.03e+00 - 9.42e-01 1.00e+0
0f 1
9 1.2074403e+04 2.22e-03 2.32e-01 -1.7 3.97e+00 - 7.02e-01 7.42e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2070500e+04 1.98e-04 1.11e+00 -1.7 1.04e+01 - 3.98e-01 1.00e+0
0f 1
11 1.2070675e+04 4.46e-05 1.20e-01 -1.7 1.25e+01 - 8.74e-01 1.00e+0
0f 1
12 1.1988162e+04 6.70e-05 2.57e-02 -2.5 1.39e+01 - 1.00e+00 9.76e-0
1f 1
13 1.1959153e+04 3.23e-03 8.48e-02 -3.8 1.30e+01 - 6.27e-01 9.83e-0
1h 1
14 1.1953995e+04 6.11e-03 1.52e-02 -3.8 2.20e-01 - 8.23e-01 1.00e+0
0h 1
15 1.1954439e+04 6.68e-05 5.30e-04 -3.8 1.35e-02 - 1.00e+00 1.00e+0
0h 1
16 1.1952804e+04 1.25e-04 7.88e-04 -5.7 4.46e-01 - 9.39e-01 9.91e-0
1h 1
17 1.1952798e+04 3.84e-05 5.75e-03 -5.7 3.85e-03 - 1.00e+00 6.96e-0
1h 1
18 1.1952807e+04 1.42e-08 1.72e-06 -5.7 1.17e-03 - 1.00e+00 1.00e+0
0f 1
19 1.1952789e+04 9.43e-09 2.56e-05 -8.6 5.53e-03 - 1.00e+00 9.81e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.1952789e+04 1.82e-12 9.79e-11 -8.6 1.03e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.1952788692080464e+01 1.1952788692080463e+0
4
Dual infeasibility......: 9.7909992446946542e-11 9.7909992446946548e-0
8
Constraint violation....: 1.8235413179468196e-12 1.8235413179468196e-1
2
Complementarity.........: 3.2578582315912200e-09 3.2578582315912201e-0
6
Overall NLP error.......: 3.2578582315912200e-09 3.2578582315912201e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0889550e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0544003e+02 9.19e+03 5.23e+01 -1.0 6.53e+03 - 1.88e-05 1.39e-0
4h 1
3 4.7820593e+02 8.97e+03 5.24e+01 -1.0 9.19e+03 - 4.54e-05 2.34e-0
2f 1
4 2.1767436e+04 6.51e-02 8.07e+01 -1.0 8.97e+03 - 2.85e-02 1.00e+0
0h 1
5 1.3313724e+04 6.22e-02 6.41e+01 -1.0 3.95e+01 - 2.06e-01 4.10e-0
2f 1
6 1.2046235e+04 2.08e-02 3.03e+01 -1.0 1.63e+01 - 5.38e-01 6.14e-0
1f 1
7 1.1599697e+04 6.95e-03 9.87e-01 -1.0 5.66e+00 - 9.55e-01 7.67e-0
1f 1
8 1.1862526e+04 2.40e-04 7.35e-02 -1.0 4.91e+00 - 9.99e-01 1.00e+0
0f 1
9 1.1304312e+04 2.07e-03 8.43e-02 -2.5 5.83e+00 - 8.56e-01 8.40e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1141018e+04 2.16e-03 4.29e-01 -2.5 1.18e+00 - 1.00e+00 7.59e-0
1f 1
11 1.1113964e+04 1.30e-04 4.69e-03 -2.5 2.92e-01 - 1.00e+00 1.00e+0
0h 1
12 1.1091125e+04 3.48e-05 1.49e-01 -3.8 1.07e+01 - 1.00e+00 7.59e-0
1h 1
13 1.1085027e+04 1.28e-07 3.42e-04 -3.8 2.58e+00 - 1.00e+00 1.00e+0
0f 1
14 1.1083360e+04 2.84e-08 9.74e-04 -5.7 5.94e-01 - 1.00e+00 9.85e-0
1f 1
15 1.1083341e+04 1.89e-12 1.38e-08 -5.7 8.84e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1083321e+04 2.63e-12 4.48e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.1083320755770202e+01 1.1083320755770203e+0
4
Dual infeasibility......: 4.4776951890749071e-09 4.4776951890749071e-0
6
Constraint violation....: 2.6309093792420413e-12 2.6309093792420413e-1
2
Complementarity.........: 3.8941199728098786e-09 3.8941199728098784e-0
6
Overall NLP error.......: 4.4776951890749071e-09 4.4776951890749071e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0889707e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0591739e+02 6.71e+03 5.23e+01 -1.0 5.95e+03 - 4.04e-05 1.12e-0
4h 1
3 7.6488246e+02 6.66e+03 5.24e+01 -1.0 6.70e+03 - 1.70e-05 6.81e-0
3h 1
4 4.6074222e+02 6.52e+03 5.21e+01 -1.0 6.66e+03 - 8.31e-03 2.09e-0
2h 1
5 1.6247930e+04 7.43e-02 7.77e+01 -1.0 6.52e+03 - 8.93e-02 1.00e+0
0h 1
6 1.0403223e+04 6.60e-02 2.72e+01 -1.0 2.46e+01 - 6.25e-01 1.03e-0
1f 1
7 8.8840633e+03 1.77e-02 6.66e+00 -1.0 1.48e+01 - 7.64e-01 8.19e-0
1f 1
8 9.0908604e+03 9.00e-03 6.84e-01 -1.0 4.18e+00 - 9.82e-01 4.95e-0
1f 2
9 8.8111319e+03 1.09e-02 1.02e+00 -1.7 7.35e+00 - 2.02e-01 8.24e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.8049522e+03 5.53e-04 7.70e-01 -1.7 7.44e+00 - 6.89e-01 1.00e+0
0f 1
11 8.7982685e+03 1.34e-04 1.17e-01 -1.7 1.24e+01 - 8.35e-01 1.00e+0
0h 1
12 8.6374725e+03 5.78e-04 2.41e-02 -2.5 1.78e+01 - 9.45e-01 9.53e-0
1f 1
13 8.6047489e+03 1.64e-04 7.15e-02 -3.8 9.24e+00 - 9.74e-01 8.47e-0
1h 1
14 8.6017636e+03 2.22e-07 1.33e-01 -3.8 1.50e+00 - 9.00e-01 1.00e+0
0h 1
15 8.6016821e+03 5.25e-09 3.52e-05 -3.8 3.64e-04 - 1.00e+00 1.00e+0
0h 1
16 8.6003683e+03 1.93e-08 3.87e-03 -5.7 2.97e-01 - 1.00e+00 9.68e-0
1f 1
17 8.6003325e+03 5.74e-12 2.62e-08 -5.7 9.59e-03 - 1.00e+00 1.00e+0
0f 1
18 8.6003159e+03 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 8.6003159339769830e+00 8.6003159339769827e+0
3
Dual infeasibility......: 4.4780413518223198e-09 4.4780413518223198e-0
6
Constraint violation....: 2.6337820813182589e-12 2.6337820813182589e-1
2
Complementarity.........: 3.6085480538506640e-09 3.6085480538506637e-0
6
Overall NLP error.......: 4.4780413518223198e-09 4.4780413518223198e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0885267e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0522538e+02 4.77e+03 5.23e+01 -1.0 3.40e+03 - 2.93e-05 1.39e-0
4h 1
3 3.7446895e+02 4.66e+03 5.24e+01 -1.0 4.77e+03 - 4.82e-05 2.34e-0
2f 1
4 1.7343624e+04 6.51e-02 8.03e+01 -1.0 4.66e+03 - 3.33e-02 1.00e+0
0h 1
5 8.8835455e+03 6.19e-02 6.15e+01 -1.0 3.76e+01 - 2.33e-01 4.52e-0
2f 1
6 7.5996542e+03 2.03e-02 2.88e+01 -1.0 1.63e+01 - 5.42e-01 6.20e-0
1f 1
7 7.1823993e+03 5.79e-03 8.85e-01 -1.0 5.30e+00 - 9.57e-01 7.82e-0
1f 1
8 7.4476292e+03 1.69e-04 6.59e-02 -1.0 5.07e+00 - 1.00e+00 1.00e+0
0f 1
9 6.8807542e+03 2.12e-03 8.08e-02 -2.5 3.15e+00 - 8.55e-01 8.48e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.7194703e+03 2.16e-03 4.17e-01 -2.5 9.54e-01 - 1.00e+00 7.62e-0
1f 1
11 6.6937548e+03 1.24e-04 4.69e-03 -2.5 2.10e-01 - 1.00e+00 1.00e+0
0h 1
12 6.6728222e+03 3.31e-05 1.45e-01 -3.8 8.04e+00 - 1.00e+00 7.62e-0
1h 1
13 6.6674261e+03 1.25e-07 3.38e-04 -3.8 1.91e+00 - 1.00e+00 1.00e+0
0f 1
14 6.6659052e+03 2.85e-08 9.91e-04 -5.7 4.46e-01 - 1.00e+00 9.85e-0
1h 1
15 6.6658878e+03 1.92e-12 1.39e-08 -5.7 6.69e-03 - 1.00e+00 1.00e+0
0f 1
16 6.6658693e+03 2.63e-12 4.48e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.6658693441383203e+00 6.6658693441383202e+0
3
Dual infeasibility......: 4.4776953946985078e-09 4.4776953946985078e-0
6
Constraint violation....: 2.6309371348176569e-12 2.6309371348176569e-1
2
Complementarity.........: 3.6084978105361330e-09 3.6084978105361330e-0
6
Overall NLP error.......: 4.4776953946985078e-09 4.4776953946985078e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9478285e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3f 1
2 8.9187540e+02 3.24e+03 5.24e+01 -1.0 3.02e+03 - 9.14e-05 1.06e-0
4h 1
3 8.1655200e+02 3.23e+03 5.24e+01 -1.0 3.24e+03 - 1.38e-05 3.11e-0
3f 1
4 3.3910587e+02 3.16e+03 5.23e+01 -1.0 3.23e+03 - 4.64e-03 2.16e-0
2h 1
5 1.3760479e+04 6.81e-02 7.78e+01 -1.0 3.16e+03 - 8.37e-02 1.00e+0
0h 1
6 6.7546785e+03 6.11e-02 3.98e+01 -1.0 4.44e+01 - 4.66e-01 9.34e-0
2f 1
7 5.3864148e+03 2.95e-02 1.35e+01 -1.0 2.09e+01 - 6.49e-01 5.65e-0
1f 1
8 5.1381255e+03 3.48e-03 7.14e-01 -1.0 6.07e+00 - 9.54e-01 7.93e-0
1h 1
9 4.8058915e+03 9.07e-03 2.89e-01 -1.7 1.90e+00 - 1.00e+00 8.12e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.7469494e+03 1.26e-03 1.39e-01 -1.7 1.88e+01 - 1.00e+00 9.70e-0
1f 1
11 4.6212428e+03 4.91e-04 1.73e-01 -2.5 1.68e+01 - 9.48e-01 8.28e-0
1h 1
12 4.5986044e+03 6.65e-05 4.46e-03 -2.5 2.80e+00 - 1.00e+00 1.00e+0
0f 1
13 4.5763010e+03 1.58e-05 2.73e-02 -3.8 2.68e+00 - 1.00e+00 9.25e-0
1h 1
14 4.5756329e+03 4.87e-08 5.45e-04 -3.8 1.99e-01 - 1.00e+00 1.00e+0
0f 1
15 4.5743308e+03 4.26e-08 4.12e-04 -5.7 1.49e-01 - 1.00e+00 9.91e-0
1f 1
16 4.5743250e+03 1.95e-12 3.00e-08 -5.7 1.33e-03 - 1.00e+00 1.00e+0
0f 1
17 4.5743102e+03 2.58e-12 3.28e-06 -8.6 1.84e-03 - 1.00e+00 9.99e-0
1f 1
18 4.5743102e+03 5.47e-15 4.85e-14 -8.6 1.07e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 4.5743102062652801e+00 4.5743102062652797e+0
3
Dual infeasibility......: 4.8507504510651759e-14 4.8507504510651759e-1
1
Constraint violation....: 5.4693772510440206e-15 5.4693772510440206e-1
5
Complementarity.........: 2.5059125765115420e-09 2.5059125765115417e-0
6
Overall NLP error.......: 2.5059125765115420e-09 2.5059125765115417e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8038781e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.82e-0
3h 1
2 8.7404419e+02 2.00e+03 5.24e+01 -1.0 1.17e+03 - 4.28e-05 2.39e-0
4h 1
3 2.9382745e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 1.65e-04 2.27e-0
2f 1
4 1.4249786e+04 6.10e-02 7.92e+01 -1.0 1.95e+03 - 5.51e-02 1.00e+0
0h 1
5 5.5512989e+03 5.67e-02 5.34e+01 -1.0 6.55e+01 - 3.14e-01 6.40e-0
2f 1
6 4.1927553e+03 3.11e-02 2.64e+01 -1.0 3.24e+01 - 4.94e-01 4.18e-0
1f 1
7 3.3769719e+03 1.34e-02 2.16e+00 -1.0 1.11e+01 - 9.19e-01 9.25e-0
1f 1
8 3.8285991e+03 4.08e-04 1.04e-01 -1.0 5.01e+00 - 9.97e-01 1.00e+0
0f 1
9 3.1676792e+03 1.16e-03 4.48e-01 -1.7 5.58e+01 - 7.55e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.2170643e+03 1.24e-05 1.39e-02 -1.7 1.97e+01 - 1.00e+00 1.00e+0
0h 1
11 3.0892543e+03 2.82e-05 4.06e-01 -2.5 6.80e+01 - 1.00e+00 7.86e-0
1f 1
12 3.0663455e+03 1.01e-04 4.65e-03 -2.5 1.41e+01 - 1.00e+00 1.00e+0
0f 1
13 3.0436263e+03 2.77e-04 8.67e-02 -3.8 1.07e+01 - 7.72e-01 1.00e+0
0h 1
14 3.0408827e+03 1.61e-03 2.07e-03 -3.8 3.62e-02 - 9.74e-01 1.00e+0
0f 1
15 3.0409239e+03 7.43e-05 6.50e-05 -3.8 1.17e-02 - 1.00e+00 1.00e+0
0h 1
16 3.0392737e+03 1.31e-04 1.11e-03 -5.7 5.94e-01 - 9.18e-01 1.00e+0
0h 1
17 3.0392321e+03 3.26e-05 6.70e-06 -5.7 8.42e-03 - 1.00e+00 1.00e+0
0h 1
18 3.0392378e+03 1.88e-07 3.42e-06 -5.7 6.23e-04 - 1.00e+00 1.00e+0
0h 1
19 3.0392192e+03 2.64e-08 3.32e-05 -8.6 7.37e-03 - 1.00e+00 9.57e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 3.0392184e+03 4.44e-12 5.19e-11 -8.6 3.16e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 3.0392184025574087e+00 3.0392184025574088e+0
3
Dual infeasibility......: 5.1870786233353414e-11 5.1870786233353414e-0
8
Constraint violation....: 4.4424464107351014e-12 4.4424464107351014e-1
2
Complementarity.........: 2.8317903064833427e-09 2.8317903064833428e-0
6
Overall NLP error.......: 2.8317903064833427e-09 2.8317903064833428e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 42
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 21
inequality constraints with only lower bounds: 12
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6471232e+02 9.17e+02 5.24e+01 -1.0 9.18e+02 - 4.97e-04 9.90e-0
3h 1
2 8.1209417e+02 9.16e+02 5.24e+01 -1.0 8.71e+02 - 1.14e-04 1.95e-0
3h 1
3 2.6481235e+02 8.96e+02 5.25e+01 -1.0 9.16e+02 - 1.98e-03 2.15e-0
2h 1
4 1.2150276e+04 6.12e-02 8.03e+01 -1.0 8.96e+02 - 5.34e-02 1.00e+0
0h 1
5 4.2145491e+03 5.69e-02 5.11e+01 -1.0 6.95e+01 - 3.52e-01 6.39e-0
2f 1
6 2.6321385e+03 3.03e-02 2.57e+01 -1.0 3.84e+01 - 4.90e-01 4.37e-0
1f 1
7 2.1293462e+03 1.36e-02 2.34e+00 -1.0 1.08e+01 - 9.20e-01 1.00e+0
0f 1
8 2.4240533e+03 3.92e-04 7.49e-02 -1.0 4.26e+00 - 9.94e-01 1.00e+0
0f 1
9 1.8941955e+03 5.62e-04 5.19e-01 -2.5 8.57e+00 - 8.89e-01 6.79e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8282361e+03 2.38e-04 3.69e-01 -2.5 1.34e+01 - 8.87e-01 1.00e+0
0h 1
11 1.8103173e+03 6.36e-03 2.66e-01 -2.5 2.21e+00 - 1.00e+00 5.11e-0
1h 1
12 1.7995129e+03 9.18e-04 7.56e-03 -2.5 1.12e+00 - 1.00e+00 1.00e+0
0f 1
13 1.7621296e+03 1.12e-03 2.80e-02 -3.8 2.42e+01 - 8.17e-01 1.00e+0
0h 1
14 1.7593274e+03 2.05e-03 1.05e-03 -3.8 6.04e-02 - 1.00e+00 1.00e+0
0h 1
15 1.7597258e+03 5.01e-05 1.63e-04 -3.8 1.57e-02 - 1.00e+00 1.00e+0
0h 1
16 1.7572207e+03 1.07e-04 4.60e-04 -5.7 1.34e+00 - 9.51e-01 9.84e-0
1h 1
17 1.7572020e+03 2.15e-05 3.48e-03 -5.7 2.09e-02 - 1.00e+00 8.00e-0
1h 1
18 1.7572026e+03 8.47e-09 1.07e-06 -5.7 4.18e-03 - 1.00e+00 1.00e+0
0f 1
19 1.7571734e+03 8.95e-09 1.93e-05 -8.6 1.66e-02 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7571729e+03 1.38e-12 6.47e-11 -8.6 2.76e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.7571729310214406e+00 1.7571729310214405e+0
3
Dual infeasibility......: 6.4677037256039120e-11 6.4677037256039127e-0
8
Constraint violation....: 1.3791190411893695e-12 1.3791190411893695e-1
2
Complementarity.........: 2.5091873095680214e-09 2.5091873095680212e-0
6
Overall NLP error.......: 2.5091873095680214e-09 2.5091873095680212e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101521e-01 6.4890146112101525e+0
2
Dual infeasibility......: 4.9126605618489413e-09 4.9126605618489413e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984918224e-09 4.3646094984918221e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605618489413e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318724481455e-09 2.1031318724481455e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896894379e-09 2.8882108896894380e-0
6
Overall NLP error.......: 2.8882108896894379e-09 2.8882108896894380e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101521e-01 6.4890146112101525e+0
2
Dual infeasibility......: 4.9126605618489413e-09 4.9126605618489413e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984918224e-09 4.3646094984918221e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605618489413e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.04e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.57e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235660171e+00 1.6104063235660171e+0
3
Dual infeasibility......: 2.4574009793760635e-12 2.4574009793760635e-0
9
Constraint violation....: 7.5703172614159067e-16 7.5703172614159067e-1
6
Complementarity.........: 2.5062163919681798e-09 2.5062163919681799e-0
6
Overall NLP error.......: 2.5062163919681798e-09 2.5062163919681799e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 44
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 22
inequality constraints with only lower bounds: 13
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2174925e+02 9.17e+02 5.24e+01 -1.0 9.17e+02 - 3.31e-04 9.91e-0
3h 1
2 7.6886174e+02 9.16e+02 5.24e+01 -1.0 8.71e+02 - 1.25e-04 1.94e-0
3h 1
3 2.4516007e+02 8.97e+02 5.26e+01 -1.0 9.16e+02 - 1.97e-03 2.06e-0
2h 1
4 1.1738953e+04 5.64e-02 8.25e+01 -1.0 8.97e+02 - 4.05e-02 1.00e+0
0h 1
5 3.8274434e+03 5.35e-02 4.96e+01 -1.0 7.56e+01 - 3.95e-01 5.28e-0
2f 1
6 1.8982125e+03 3.64e-02 2.58e+01 -1.0 3.96e+01 - 4.81e-01 4.97e-0
1f 1
7 2.5676289e+03 2.04e-02 1.28e+01 -1.0 1.98e+01 - 4.13e-01 2.50e-0
1f 3
8 1.9933474e+03 6.77e-03 2.81e-01 -1.0 6.99e+00 - 9.82e-01 1.00e+0
0f 1
9 1.6919043e+03 1.30e-03 2.88e-01 -1.7 5.57e+00 - 1.00e+00 8.64e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8356545e+03 8.61e-04 1.16e-02 -1.7 1.98e+02 - 1.00e+00 1.00e+0
0f 1
11 1.5574744e+03 1.19e-03 4.85e-02 -2.5 1.77e+02 - 9.19e-01 1.00e+0
0f 1
12 1.5425213e+03 1.27e-03 1.51e-02 -2.5 1.72e+00 - 1.00e+00 1.00e+0
0h 1
13 1.5081902e+03 2.24e-04 1.05e-01 -3.8 2.69e+01 - 1.00e+00 8.34e-0
1h 1
14 1.5027236e+03 4.34e-07 1.36e-04 -3.8 4.40e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5003258e+03 4.02e-07 1.62e-04 -5.7 1.49e+00 - 1.00e+00 9.97e-0
1h 1
16 1.5003228e+03 3.89e-11 2.94e-09 -5.7 4.01e-02 - 1.00e+00 1.00e+0
0f 1
17 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.84e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5002932899994825e+00 1.5002932899994826e+0
3
Dual infeasibility......: 2.1737246971942299e-09 2.1737246971942299e-0
6
Constraint violation....: 6.2995830774070782e-11 6.2995830774070782e-1
1
Complementarity.........: 2.8882202108165283e-09 2.8882202108165283e-0
6
Overall NLP error.......: 2.8882202108165283e-09 2.8882202108165283e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6450052e+02 9.17e+02 5.24e+01 -1.0 9.17e+02 - 4.97e-04 9.91e-0
3h 1
2 7.9486495e+02 9.15e+02 5.24e+01 -1.0 8.82e+02 - 1.23e-04 2.58e-0
3h 1
3 2.6615599e+02 8.96e+02 5.25e+01 -1.0 9.15e+02 - 2.64e-03 2.12e-0
2h 1
4 1.1860811e+04 6.18e-02 8.04e+01 -1.0 8.96e+02 - 5.50e-02 1.00e+0
0h 1
5 4.1820989e+03 5.74e-02 4.98e+01 -1.0 6.79e+01 - 3.67e-01 6.58e-0
2f 1
6 2.6033332e+03 3.04e-02 2.46e+01 -1.0 3.82e+01 - 4.99e-01 4.40e-0
1f 1
80 1.427822e+04 1.632511e+04 6.167763e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2433284e+02 1.57e+04 5.24e+01 -1.0 1.59e+04 - 3.31e-04 9.80e-0
3h 1
2 8.2134525e+02 1.57e+04 5.24e+01 -1.0 1.37e+04 - 2.39e-05 1.14e-0
4h 1
3 8.1756484e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 1.83e-05 3.03e-0
4h 1
4 8.1227230e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 3.20e-04 4.35e-0
4h 1
5 5.6763895e+02 1.54e+04 5.26e+01 -1.0 1.57e+04 - 8.12e-04 2.11e-0
2f 1
6 2.6997278e+04 5.56e-02 8.24e+01 -1.0 1.54e+04 - 3.92e-02 1.00e+0
0h 1
7 1.8691316e+04 5.29e-02 5.41e+01 -1.0 7.89e+01 - 3.40e-01 5.09e-0
2f 1
8 1.6731432e+04 3.71e-02 2.87e+01 -1.0 3.94e+01 - 4.73e-01 5.02e-0
1f 1
9 1.7073595e+04 2.29e-02 1.30e+01 -1.0 2.03e+01 - 4.04e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6824705e+04 6.00e-03 3.71e-01 -1.0 4.81e+00 - 9.79e-01 1.00e+0
0h 1
11 1.6518206e+04 1.42e-03 3.33e-01 -1.7 5.52e+00 - 9.70e-01 8.25e-0
1f 1
12 1.6492143e+04 8.11e-04 3.31e-01 -1.7 3.09e+01 - 1.24e-01 1.00e+0
0f 1
13 1.6505042e+04 1.26e-05 1.31e-03 -1.7 1.31e+01 - 1.00e+00 1.00e+0
0h 1
14 1.6361539e+04 1.00e-03 2.76e-02 -3.8 5.53e+01 - 7.93e-01 8.30e-0
1f 1
15 1.6326668e+04 1.72e-03 6.16e-01 -3.8 2.20e+00 - 5.28e-02 7.99e-0
1h 1
16 1.6326051e+04 2.15e-04 1.08e-01 -3.8 2.85e-02 - 1.00e+00 8.74e-0
1h 1
17 1.6326315e+04 2.28e-07 2.82e-05 -3.8 1.01e-01 - 1.00e+00 1.00e+0
0f 1
18 1.6325120e+04 4.09e-07 2.39e-04 -5.7 2.99e-01 - 1.00e+00 9.95e-0
1h 1
19 1.6325120e+04 4.21e-11 3.35e-09 -5.7 4.23e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325105e+04 6.27e-11 1.64e-06 -8.6 3.69e-03 - 1.00e+00 9.97e-0
1h 1
21 1.6325105e+04 1.42e-14 2.51e-14 -8.6 7.03e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.6325105277940086e+01 1.6325105277940085e+0
4
Dual infeasibility......: 2.5091040356528538e-14 2.5091040356528538e-1
1
Constraint violation....: 1.4210854715202004e-14 1.4210854715202004e-1
4
Complementarity.........: 4.9694456753675287e-09 4.9694456753675284e-0
6
Overall NLP error.......: 4.9694456753675287e-09 4.9694456753675284e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9225677e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.64e-04 9.80e-0
3f 1
2 7.8942245e+02 1.50e+04 5.25e+01 -1.0 1.48e+04 - 9.52e-05 1.00e-0
4h 1
3 7.8170958e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 2.83e-06 5.80e-0
4f 1
4 5.2281575e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 6.18e-04 2.03e-0
2h 1
5 2.6203229e+04 5.40e-02 8.38e+01 -1.0 1.47e+04 - 3.24e-02 1.00e+0
0h 1
6 1.7690204e+04 5.18e-02 6.38e+01 -1.0 8.06e+01 - 2.42e-01 4.50e-0
2f 1
7 1.5948437e+04 4.29e-02 3.26e+01 -1.0 3.30e+01 - 4.86e-01 4.64e-0
1f 1
8 1.6265612e+04 2.68e-02 1.43e+01 -1.0 1.79e+01 - 4.33e-01 1.25e-0
1f 4
9 1.6015509e+04 6.01e-03 1.46e-01 -1.0 4.94e+00 - 9.92e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5733624e+04 1.19e-03 2.76e-01 -1.7 4.61e+00 - 1.00e+00 8.68e-0
1f 1
11 1.5708922e+04 7.68e-04 1.10e-02 -1.7 1.57e+01 - 1.00e+00 1.00e+0
0f 1
12 1.5584125e+04 1.33e-03 8.93e-02 -3.8 1.99e+01 - 7.99e-01 9.32e-0
1f 1
13 1.5559913e+04 1.47e-03 6.38e-02 -3.8 1.70e+00 - 8.49e-01 7.73e-0
1h 1
14 1.5560166e+04 2.69e-06 7.40e-04 -3.8 3.04e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5559221e+04 3.16e-07 6.09e-04 -5.7 1.49e-01 - 1.00e+00 9.88e-0
1h 1
16 1.5559215e+04 3.95e-11 6.17e-09 -5.7 1.23e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5559202e+04 6.30e-11 2.09e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5559202159225093e+01 1.5559202159225093e+0
4
Dual infeasibility......: 2.0878340099090863e-09 2.0878340099090863e-0
6
Constraint violation....: 6.2996094452039131e-11 6.2996094452039131e-1
1
Complementarity.........: 2.8881089270220396e-09 2.8881089270220396e-0
6
Overall NLP error.......: 2.8881089270220396e-09 2.8881089270220396e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9900787e+02 1.39e+04 5.25e+01 -1.0 1.40e+04 - 2.76e-04 9.80e-0
3f 1
2 7.9612646e+02 1.39e+04 5.25e+01 -1.0 1.33e+04 - 4.77e-05 1.04e-0
4h 1
3 7.6422526e+02 1.39e+04 5.25e+01 -1.0 1.39e+04 - 6.93e-06 2.22e-0
3h 1
4 5.2263635e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 2.38e-03 2.00e-0
2h 1
5 2.4340557e+04 5.54e-02 8.37e+01 -1.0 1.36e+04 - 3.52e-02 1.00e+0
0h 1
6 1.6601947e+04 5.29e-02 5.67e+01 -1.0 7.37e+01 - 3.24e-01 4.85e-0
2f 1
7 1.4864980e+04 4.22e-02 2.85e+01 -1.0 3.45e+01 - 4.95e-01 4.65e-0
1f 1
8 1.5177125e+04 2.66e-02 1.18e+01 -1.0 1.77e+01 - 4.38e-01 1.25e-0
1f 4
9 1.4944475e+04 6.09e-03 1.34e-01 -1.0 4.83e+00 - 9.92e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4659357e+04 1.23e-03 2.93e-01 -1.7 7.12e+00 - 1.00e+00 8.62e-0
1f 1
11 1.4650423e+04 7.35e-04 1.23e-02 -1.7 3.34e+01 - 1.00e+00 1.00e+0
0f 1
12 1.4506430e+04 1.34e-03 9.11e-02 -3.8 3.98e+01 - 7.96e-01 9.32e-0
1f 1
13 1.4481188e+04 1.49e-03 6.43e-02 -3.8 2.69e+00 - 8.47e-01 7.71e-0
1h 1
14 1.4481165e+04 2.72e-06 7.50e-04 -3.8 6.15e-01 - 1.00e+00 1.00e+0
0h 1
15 1.4480074e+04 3.13e-07 6.11e-04 -5.7 2.97e-01 - 1.00e+00 9.88e-0
1h 1
16 1.4480067e+04 3.91e-11 6.21e-09 -5.7 9.63e-02 - 1.00e+00 1.00e+0
0f 1
17 1.4480052e+04 6.30e-11 2.10e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.4480051787995379e+01 1.4480051787995379e+0
4
Dual infeasibility......: 2.0963374803944177e-09 2.0963374803944177e-0
6
Constraint violation....: 6.2995872407434206e-11 6.2995872407434206e-1
1
Complementarity.........: 2.8881085298498102e-09 2.8881085298498102e-0
6
Overall NLP error.......: 2.8881085298498102e-09 2.8881085298498102e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9353188e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 7.31e-04 9.80e-0
3h 1
2 8.9060710e+02 1.27e+04 5.24e+01 -1.0 1.12e+04 - 2.71e-05 1.12e-0
4h 1
3 8.6940955e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 1.63e-05 1.43e-0
3h 1
4 5.5567527e+02 1.24e+04 5.24e+01 -1.0 1.26e+04 - 1.43e-03 2.23e-0
2h 1
5 2.4442256e+04 6.42e-02 8.09e+01 -1.0 1.24e+04 - 3.56e-02 1.00e+0
0h 1
6 1.6457511e+04 6.09e-02 5.78e+01 -1.0 4.94e+01 - 2.82e-01 4.78e-0
2f 1
7 1.5059407e+04 2.47e-02 2.80e+01 -1.0 2.34e+01 - 5.19e-01 5.48e-0
1f 1
8 1.4477231e+04 8.98e-03 1.45e+00 -1.0 8.72e+00 - 9.35e-01 7.81e-0
1f 1
9 1.4786875e+04 2.51e-04 1.04e-01 -1.0 3.11e+00 - 9.54e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4149451e+04 2.10e-03 7.78e-02 -2.5 4.68e+00 - 8.62e-01 8.57e-0
1f 1
11 1.3981704e+04 2.17e-03 3.12e-01 -2.5 1.17e+00 - 1.00e+00 7.88e-0
1f 1
12 1.3956687e+04 1.55e-04 4.61e-03 -2.5 7.04e-01 - 1.00e+00 1.00e+0
0h 1
13 1.3934682e+04 3.27e-05 8.28e-02 -3.8 6.44e+00 - 1.00e+00 8.17e-0
1h 1
14 1.3931762e+04 9.78e-08 5.81e-04 -3.8 7.25e-01 - 1.00e+00 1.00e+0
0f 1
15 1.3930362e+04 3.70e-08 3.97e-04 -5.7 2.87e-01 - 1.00e+00 9.91e-0
1f 1
16 1.3930359e+04 1.90e-12 1.62e-08 -5.7 4.20e-04 - 1.00e+00 1.00e+0
0f 1
17 1.3930342e+04 2.56e-12 9.33e-09 -8.6 3.69e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.3930342236402934e+01 1.3930342236402934e+0
4
Dual infeasibility......: 9.3266527889495386e-09 9.3266527889495386e-0
6
Constraint violation....: 2.5570170980593332e-12 2.5570170980593332e-1
2
Complementarity.........: 4.6788838027640698e-09 4.6788838027640700e-0
6
Overall NLP error.......: 9.3266527889495386e-09 9.3266527889495386e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2301164e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.51e-03 9.80e-0
3h 1
2 9.1989531e+02 1.11e+04 5.23e+01 -1.0 9.02e+03 - 1.92e-05 1.22e-0
4h 1
3 5.4989446e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 2.65e-05 2.25e-0
2h 1
4 2.1102521e+04 7.45e-02 7.98e+01 -1.0 1.09e+04 - 2.67e-02 1.00e+0
0h 1
5 1.5432123e+04 7.15e-02 5.55e+01 -1.0 2.13e+01 - 2.97e-01 3.84e-0
2f 1
6 1.4303813e+04 1.35e-02 2.41e+01 -1.0 1.11e+01 - 5.91e-01 7.46e-0
1f 1
7 1.4153593e+04 8.15e-03 2.49e-01 -1.0 1.97e+00 - 9.90e-01 1.00e+0
0f 1
8 1.3803441e+04 1.55e-03 2.91e-01 -1.7 4.96e+00 - 8.38e-01 1.00e+0
0f 1
9 1.3790655e+04 6.80e-04 1.12e+00 -1.7 1.96e+01 - 3.22e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3801306e+04 9.78e-07 5.00e-04 -1.7 1.59e+01 - 1.00e+00 1.00e+0
0h 1
11 1.3629942e+04 4.52e-04 2.26e-02 -2.5 3.24e+01 - 9.77e-01 9.65e-0
1f 1
12 1.3607762e+04 1.40e-04 2.00e-01 -3.8 9.13e+00 - 9.90e-01 7.25e-0
1h 1
13 1.3601756e+04 3.48e-07 2.86e-04 -3.8 2.51e+00 - 1.00e+00 1.00e+0
0h 1
14 1.3600269e+04 1.95e-08 4.47e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3600252e+04 7.78e-13 4.75e-10 -8.6 5.52e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.3600252157311141e+01 1.3600252157311141e+0
4
Dual infeasibility......: 4.7520744062420231e-10 4.7520744062420231e-0
7
Constraint violation....: 7.7758632865965183e-13 7.7758632865965183e-1
3
Complementarity.........: 5.2740610696974379e-09 5.2740610696974378e-0
6
Overall NLP error.......: 5.2740610696974379e-09 5.2740610696974378e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3004760e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 2.02e-03 9.81e-0
3h 1
2 9.2458171e+02 9.19e+03 5.23e+01 -1.0 5.43e+03 - 9.22e-06 2.42e-0
4h 1
3 4.8777176e+02 8.97e+03 5.24e+01 -1.0 9.19e+03 - 1.48e-04 2.34e-0
2h 1
4 2.1819681e+04 7.02e-02 7.81e+01 -1.0 8.97e+03 - 5.74e-02 1.00e+0
0h 1
5 1.3648766e+04 6.51e-02 4.65e+01 -1.0 1.06e+01 - 3.92e-01 6.72e-0
2f 1
6 1.2329076e+04 2.50e-02 1.99e+01 -1.0 6.90e+00 - 6.37e-01 1.00e+0
0f 1
7 1.2710449e+04 1.46e-03 1.70e-01 -1.0 2.42e+00 - 9.91e-01 1.00e+0
0f 1
8 1.2188896e+04 1.73e-03 6.89e-02 -1.7 7.63e+00 - 1.00e+00 1.00e+0
0f 1
9 1.2015268e+04 1.99e-03 3.42e-01 -2.5 3.07e+00 - 1.00e+00 7.99e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1992853e+04 1.62e-04 4.13e-02 -2.5 6.14e-01 - 1.00e+00 9.45e-0
1h 1
11 1.1995752e+04 6.80e-06 1.22e-03 -2.5 3.35e-02 - 1.00e+00 1.00e+0
0f 1
12 1.1965916e+04 7.60e-06 4.28e-03 -3.8 1.07e+01 - 1.00e+00 9.79e-0
1f 1
13 1.1965656e+04 1.37e-08 6.29e-06 -3.8 2.27e-01 - 1.00e+00 1.00e+0
0f 1
14 1.1964018e+04 1.73e-08 3.04e-06 -5.7 5.94e-01 - 1.00e+00 1.00e+0
0f 1
15 1.1963999e+04 1.28e-12 4.22e-10 -8.6 7.36e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.1963999157252724e+01 1.1963999157252723e+0
4
Dual infeasibility......: 4.2179926656212962e-10 4.2179926656212962e-0
7
Constraint violation....: 1.2799344917269195e-12 1.2799344917269195e-1
2
Complementarity.........: 2.8546494350157776e-09 2.8546494350157777e-0
6
Overall NLP error.......: 2.8546494350157776e-09 2.8546494350157777e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3708621e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 3.06e-03 9.81e-0
3h 1
2 9.2685228e+02 6.70e+03 5.23e+01 -1.0 5.16e+03 - 7.80e-06 4.30e-0
4h 1
3 4.2744385e+02 6.55e+03 5.24e+01 -1.0 6.70e+03 - 3.41e-04 2.27e-0
2h 1
4 1.9152600e+04 7.34e-02 7.71e+01 -1.0 6.55e+03 - 7.60e-02 1.00e+0
0h 1
5 1.1266474e+04 6.67e-02 2.37e+01 -1.0 4.40e+00 - 6.64e-01 8.47e-0
2f 1
6 1.0233662e+04 3.07e-02 9.29e+00 -1.0 4.78e+00 - 7.00e-01 1.00e+0
0f 1
7 1.0417809e+04 1.44e-02 2.61e-01 -1.0 1.29e+00 - 9.92e-01 9.96e-0
1f 1
8 1.0005480e+04 3.73e-03 3.38e-01 -1.7 1.53e+01 - 8.48e-01 1.00e+0
0f 1
9 9.9703826e+03 6.37e-04 4.37e-01 -1.7 3.05e+01 - 6.50e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.9961281e+03 2.05e-05 7.08e-04 -1.7 1.15e+01 - 1.00e+00 1.00e+0
0h 1
11 9.8126727e+03 2.98e-04 2.35e-02 -3.8 5.81e+01 - 8.67e-01 8.42e-0
1f 1
12 9.7884018e+03 4.54e-05 6.01e-02 -3.8 9.06e+00 - 1.00e+00 8.75e-0
1h 1
13 9.7856969e+03 5.22e-08 2.91e-05 -3.8 1.13e+00 - 1.00e+00 1.00e+0
0f 1
14 9.7842101e+03 1.69e-08 2.51e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0f 1
15 9.7841926e+03 1.73e-12 4.25e-10 -8.6 5.52e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 9.7841925937811123e+00 9.7841925937811120e+0
3
Dual infeasibility......: 4.2532689630548595e-10 4.2532689630548595e-0
7
Constraint violation....: 1.7266327256848513e-12 1.7266327256848513e-1
2
Complementarity.........: 2.8559714884864185e-09 2.8559714884864186e-0
6
Overall NLP error.......: 2.8559714884864185e-09 2.8559714884864186e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0887653e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0575715e+02 4.77e+03 5.23e+01 -1.0 4.05e+03 - 4.23e-05 1.17e-0
4h 1
3 6.7332408e+02 4.72e+03 5.24e+01 -1.0 4.77e+03 - 2.39e-05 1.03e-0
2f 1
4 4.3700847e+02 4.62e+03 5.18e+01 -1.0 4.72e+03 - 1.38e-02 2.11e-0
2h 1
5 1.3037787e+04 7.91e-02 7.80e+01 -1.0 4.62e+03 - 9.53e-02 1.00e+0
0h 1
6 8.3073578e+03 6.95e-02 2.11e+01 -1.0 2.25e+01 - 7.07e-01 1.14e-0
1f 1
7 6.9813418e+03 1.49e-02 1.23e+00 -1.0 1.41e+01 - 9.43e-01 7.79e-0
1f 1
8 7.2864193e+03 1.03e-02 7.22e-01 -1.0 4.36e+00 - 3.95e-01 9.21e-0
1f 1
9 6.8610513e+03 2.71e-03 2.58e-01 -1.7 2.90e+00 - 8.77e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.8360673e+03 8.54e-04 5.14e-01 -1.7 7.96e+00 - 6.42e-01 1.00e+0
0h 1
11 6.8625879e+03 6.96e-06 1.16e-01 -1.7 1.21e+01 - 8.20e-01 1.00e+0
0h 1
12 6.7036444e+03 4.75e-04 2.79e-02 -2.5 1.65e+01 - 9.73e-01 9.38e-0
1f 1
13 6.6706710e+03 1.36e-04 7.97e-02 -3.8 9.83e+00 - 9.82e-01 8.44e-0
1h 1
14 6.6673155e+03 1.82e-07 9.16e-02 -3.8 1.59e+00 - 9.28e-01 1.00e+0
0h 1
15 6.6672355e+03 4.92e-09 2.90e-05 -3.8 1.72e-04 - 1.00e+00 1.00e+0
0h 1
16 6.6659218e+03 1.93e-08 3.88e-03 -5.7 2.97e-01 - 1.00e+00 9.68e-0
1f 1
17 6.6658859e+03 5.75e-12 2.62e-08 -5.7 9.60e-03 - 1.00e+00 1.00e+0
0f 1
18 6.6658693e+03 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 6.6658693424542221e+00 6.6658693424542216e+0
3
Dual infeasibility......: 4.4780424494228595e-09 4.4780424494228595e-0
6
Constraint violation....: 2.6338237146816823e-12 2.6338237146816823e-1
2
Complementarity.........: 3.6085481580864467e-09 3.6085481580864467e-0
6
Overall NLP error.......: 4.4780424494228595e-09 4.4780424494228595e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2294726e+02 3.24e+03 5.23e+01 -1.0 3.27e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1945201e+02 3.24e+03 5.23e+01 -1.0 2.47e+03 - 3.93e-05 1.30e-0
4h 1
3 3.4573144e+02 3.17e+03 5.24e+01 -1.0 3.24e+03 - 4.04e-05 2.36e-0
2f 1
4 1.5906615e+04 6.81e-02 7.93e+01 -1.0 3.17e+03 - 4.21e-02 1.00e+0
0h 1
5 7.5933645e+03 6.41e-02 5.66e+01 -1.0 2.00e+01 - 2.81e-01 5.33e-0
2f 1
6 6.3092956e+03 1.54e-02 2.51e+01 -1.0 1.01e+01 - 5.90e-01 8.06e-0
1f 1
7 6.3346293e+03 6.22e-03 2.33e-01 -1.0 1.94e+00 - 9.91e-01 1.00e+0
0f 1
8 5.9358834e+03 1.57e-03 2.47e-01 -1.7 4.56e+00 - 8.31e-01 9.66e-0
1f 1
9 5.9084979e+03 7.45e-04 9.98e-01 -1.7 1.54e+01 - 4.21e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.9123921e+03 5.28e-06 1.34e-03 -1.7 1.14e+01 - 9.98e-01 1.00e+0
0h 1
11 5.7470690e+03 4.51e-04 2.31e-02 -3.8 3.14e+01 - 8.47e-01 8.31e-0
1f 1
12 5.7273734e+03 1.40e-04 2.01e-01 -3.8 5.17e+00 - 9.91e-01 7.24e-0
1h 1
13 5.7223529e+03 3.61e-07 2.89e-04 -3.8 1.42e+00 - 1.00e+00 1.00e+0
0h 1
14 5.7210150e+03 1.95e-08 4.45e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
15 5.7210000e+03 4.42e-12 8.26e-08 -8.6 3.67e-03 - 1.00e+00 1.00e+0
0h 1
16 5.7210001e+03 2.22e-16 2.14e-03 -8.6 1.90e-05 - 2.89e-01 1.00e+0
0f 1
17 5.7210000e+03 1.39e-16 2.53e-14 -8.6 1.47e-05 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 5.7210000441921078e+00 5.7210000441921075e+0
3
Dual infeasibility......: 2.5313084961453569e-14 2.5313084961453569e-1
1
Constraint violation....: 1.3877787807814457e-16 1.3877787807814457e-1
6
Complementarity.........: 3.9416912635373226e-09 3.9416912635373222e-0
6
Overall NLP error.......: 3.9416912635373226e-09 3.9416912635373222e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4538520e+02 2.00e+03 5.24e+01 -1.0 2.02e+03 - 3.98e-04 9.81e-0
3f 1
2 8.4231260e+02 2.00e+03 5.24e+01 -1.0 1.79e+03 - 1.02e-04 1.10e-0
4h 1
3 7.1124430e+02 1.99e+03 5.24e+01 -1.0 2.00e+03 - 2.16e-05 5.05e-0
3f 1
4 2.8981165e+02 1.95e+03 5.20e+01 -1.0 1.99e+03 - 1.05e-02 2.03e-0
2f 1
5 1.0201295e+04 6.58e-02 8.06e+01 -1.0 1.95e+03 - 7.71e-02 1.00e+0
0h 1
6 4.6339951e+03 5.92e-02 2.35e+01 -1.0 5.97e+01 - 6.87e-01 9.29e-0
2f 1
7 2.9806183e+03 3.57e-02 5.61e+00 -1.0 3.57e+01 - 7.27e-01 5.16e-0
1f 1
8 3.4333562e+03 5.70e-03 3.60e-01 -1.0 6.59e+00 - 9.67e-01 1.00e+0
0h 1
9 2.8155728e+03 1.00e-03 1.73e-01 -1.7 9.11e+00 - 1.00e+00 8.65e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.6595013e+03 1.27e-03 3.83e-01 -2.5 6.48e+00 - 7.67e-01 1.00e+0
0h 1
11 2.5900984e+03 2.05e-02 6.76e-02 -2.5 4.11e+00 - 9.30e-01 9.07e-0
1h 1
12 2.6017435e+03 7.28e-04 1.17e-02 -2.5 4.90e-01 - 1.00e+00 1.00e+0
0h 1
13 2.5815687e+03 2.61e-04 5.66e-02 -3.8 2.69e+00 - 9.94e-01 8.74e-0
1h 1
14 2.5805166e+03 1.09e-06 1.27e-04 -3.8 3.36e-01 - 1.00e+00 1.00e+0
0h 1
15 2.5794652e+03 3.43e-07 2.10e-03 -5.7 1.49e-01 - 1.00e+00 9.78e-0
1h 1
16 2.5794567e+03 3.85e-11 2.12e-08 -5.7 3.27e-03 - 1.00e+00 1.00e+0
0f 1
17 2.5794438e+03 6.30e-11 4.40e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 2.5794437896262918e+00 2.5794437896262916e+0
3
Dual infeasibility......: 4.3996647961948356e-09 4.3996647961948356e-0
6
Constraint violation....: 6.3006225237138835e-11 6.3006225237138835e-1
1
Complementarity.........: 3.3091808066645721e-09 3.3091808066645719e-0
6
Overall NLP error.......: 4.3996647961948356e-09 4.3996647961948356e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 44
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 22
inequality constraints with only lower bounds: 13
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6380553e+02 9.17e+02 5.24e+01 -1.0 9.17e+02 - 4.93e-04 9.91e-0
3h 1
2 7.9471025e+02 9.15e+02 5.24e+01 -1.0 8.82e+02 - 1.23e-04 2.56e-0
3h 1
3 2.6577263e+02 8.96e+02 5.25e+01 -1.0 9.15e+02 - 2.61e-03 2.12e-0
2h 1
4 1.1862581e+04 6.17e-02 8.04e+01 -1.0 8.96e+02 - 5.47e-02 1.00e+0
0h 1
5 4.1754722e+03 5.73e-02 4.98e+01 -1.0 6.82e+01 - 3.67e-01 6.55e-0
2f 1
6 2.5821624e+03 3.03e-02 2.47e+01 -1.0 3.84e+01 - 4.98e-01 4.41e-0
1f 1
7 2.1314476e+03 1.30e-02 2.23e+00 -1.0 1.06e+01 - 9.21e-01 1.00e+0
0f 1
8 2.3871694e+03 3.93e-04 6.62e-02 -1.0 4.38e+00 - 9.93e-01 1.00e+0
0f 1
9 1.8912228e+03 4.93e-04 6.07e-01 -2.5 9.10e+00 - 8.93e-01 6.52e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8222572e+03 2.61e-04 3.75e-01 -2.5 1.54e+01 - 8.84e-01 1.00e+0
0f 1
11 1.8053985e+03 6.22e-03 3.02e-01 -2.5 2.66e+00 - 1.00e+00 4.61e-0
1h 1
12 1.7927156e+03 1.06e-03 8.67e-03 -2.5 1.49e+00 - 1.00e+00 1.00e+0
0f 1
13 1.7525059e+03 1.16e-03 2.91e-02 -3.8 2.69e+01 - 8.16e-01 1.00e+0
0h 1
14 1.7496889e+03 2.10e-03 1.02e-03 -3.8 6.59e-02 - 1.00e+00 1.00e+0
0h 1
15 1.7501028e+03 5.10e-05 1.89e-04 -3.8 1.55e-02 - 1.00e+00 1.00e+0
0h 1
16 1.7474438e+03 1.07e-04 4.42e-04 -5.7 1.49e+00 - 9.51e-01 9.82e-0
1h 1
17 1.7474214e+03 2.00e-05 3.59e-03 -5.7 2.61e-02 - 1.00e+00 8.15e-0
1h 1
18 1.7474208e+03 7.54e-09 1.02e-06 -5.7 4.85e-03 - 1.00e+00 1.00e+0
0f 1
19 1.7473898e+03 8.76e-09 2.07e-05 -8.6 1.84e-02 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7473893e+03 1.48e-12 6.95e-11 -8.6 3.09e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.7473893330115320e+00 1.7473893330115320e+0
3
Dual infeasibility......: 6.9539907777300721e-11 6.9539907777300728e-0
8
Constraint violation....: 1.4770407119613083e-12 1.4770407119613083e-1
2
Complementarity.........: 2.6668751009703725e-09 2.6668751009703725e-0
6
Overall NLP error.......: 2.6668751009703725e-09 2.6668751009703725e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.05e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.57e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235598320e+00 1.6104063235598321e+0
3
Dual infeasibility......: 2.4577479694570047e-12 2.4577479694570047e-0
9
Constraint violation....: 7.5704776682802930e-16 7.5704776682802930e-1
6
Complementarity.........: 2.5062163919694781e-09 2.5062163919694780e-0
6
Overall NLP error.......: 2.5062163919694781e-09 2.5062163919694780e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933486e-01 5.8277753147933481e+0
2
Dual infeasibility......: 2.1031318724752505e-09 2.1031318724752505e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108897038180e-09 2.8882108897038180e-0
6
Overall NLP error.......: 2.8882108897038180e-09 2.8882108897038180e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146111910341e-01 6.4890146111910337e+0
2
Dual infeasibility......: 4.9126605618258596e-09 4.9126605618258596e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984572578e-09 4.3646094984572581e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605618258596e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.05e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.57e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235598320e+00 1.6104063235598321e+0
3
Dual infeasibility......: 2.4577479694570047e-12 2.4577479694570047e-0
9
Constraint violation....: 7.5704776682802930e-16 7.5704776682802930e-1
6
Complementarity.........: 2.5062163919694781e-09 2.5062163919694780e-0
6
Overall NLP error.......: 2.5062163919694781e-09 2.5062163919694780e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 46
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 23
inequality constraints with only lower bounds: 14
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2079560e+02 9.17e+02 5.24e+01 -1.0 9.16e+02 - 3.29e-04 9.92e-0
3h 1
2 7.5503363e+02 9.15e+02 5.24e+01 -1.0 8.80e+02 - 1.35e-04 2.41e-0
3h 1
3 2.4591981e+02 8.97e+02 5.26e+01 -1.0 9.15e+02 - 2.46e-03 2.05e-0
2h 1
4 1.1506898e+04 5.68e-02 8.26e+01 -1.0 8.97e+02 - 4.11e-02 1.00e+0
0h 1
5 3.8011082e+03 5.37e-02 4.82e+01 -1.0 7.38e+01 - 4.12e-01 5.37e-0
2f 1
6 1.8954271e+03 3.66e-02 2.48e+01 -1.0 3.94e+01 - 4.86e-01 4.94e-0
1f 1
7 3.0669748e+03 1.53e-02 1.40e+01 -1.0 1.70e+01 - 4.57e-01 5.00e-0
1f 2
8 1.9683848e+03 6.82e-03 2.08e-01 -1.0 1.06e+01 - 9.85e-01 1.00e+0
0f 1
9 1.6858881e+03 8.68e-04 1.49e-01 -1.7 7.62e+00 - 1.00e+00 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5742936e+03 2.13e-03 2.06e-01 -2.5 2.36e+01 - 7.69e-01 1.00e+0
0f 1
11 1.5404848e+03 3.09e-03 6.89e-02 -2.5 2.07e+00 - 1.00e+00 9.44e-0
1h 1
12 1.5504992e+03 1.74e-04 4.10e-03 -2.5 9.88e-01 - 1.00e+00 1.00e+0
0f 1
13 1.5046671e+03 1.73e-04 1.70e-02 -3.8 2.96e+01 - 9.94e-01 9.41e-0
1h 1
14 1.5028718e+03 6.24e-07 6.90e-05 -3.8 1.67e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5003295e+03 3.79e-07 1.85e-04 -5.7 1.63e+00 - 1.00e+00 9.96e-0
1h 1
16 1.5003246e+03 3.85e-11 3.02e-09 -5.7 8.31e-02 - 1.00e+00 1.00e+0
0f 1
17 1.5002933e+03 6.30e-11 2.17e-09 -8.6 2.03e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5002932923444547e+00 1.5002932923444548e+0
3
Dual infeasibility......: 2.1693919307204245e-09 2.1693919307204245e-0
6
Constraint violation....: 6.2995483829375587e-11 6.2995483829375587e-1
1
Complementarity.........: 2.8882155722262690e-09 2.8882155722262691e-0
6
Overall NLP error.......: 2.8882155722262690e-09 2.8882155722262691e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6359298e+02 9.17e+02 5.24e+01 -1.0 9.16e+02 - 4.93e-04 9.92e-0
3h 1
2 7.7277145e+02 9.14e+02 5.24e+01 -1.0 8.91e+02 - 1.33e-04 3.37e-0
3h 1
3 2.6770378e+02 8.95e+02 5.24e+01 -1.0 9.14e+02 - 3.45e-03 2.10e-0
2h 1
4 1.1510949e+04 6.25e-02 8.05e+01 -1.0 8.95e+02 - 5.67e-02 1.00e+0
0h 1
5 4.1343315e+03 5.79e-02 4.81e+01 -1.0 6.63e+01 - 3.88e-01 6.80e-0
2f 1
6 2.5462780e+03 3.03e-02 2.31e+01 -1.0 3.81e+01 - 5.11e-01 4.44e-0
1f 1
81 1.875524e+04 1.632511e+04 6.222583e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6794703e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.80e-0
3f 1
2 7.6502059e+02 1.57e+04 5.25e+01 -1.0 1.45e+04 - 3.26e-05 1.07e-0
4h 1
3 7.0467495e+02 1.57e+04 5.26e+01 -1.0 1.57e+04 - 1.09e-05 4.79e-0
3h 1
4 5.8464801e+02 1.54e+04 5.26e+01 -1.0 1.57e+04 - 5.10e-03 1.93e-0
2h 1
5 2.4826986e+04 6.31e-02 8.49e+01 -1.0 1.54e+04 - 3.35e-02 1.00e+0
0h 1
6 1.8159626e+04 6.02e-02 5.15e+01 -1.0 6.21e+01 - 3.96e-01 4.92e-0
2f 1
7 1.6670030e+04 4.56e-02 2.38e+01 -1.0 2.93e+01 - 5.32e-01 4.29e-0
1f 1
8 1.7215651e+04 2.76e-02 8.96e+00 -1.0 1.50e+01 - 4.96e-01 2.50e-0
1f 3
9 1.6795894e+04 5.68e-03 1.03e-01 -1.0 5.87e+00 - 9.92e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6503906e+04 9.81e-04 2.00e-01 -1.7 1.08e+01 - 1.00e+00 8.95e-0
1f 1
11 1.6378473e+04 1.88e-03 1.85e-01 -2.5 5.23e+00 - 8.03e-01 1.00e+0
0f 1
12 1.6343210e+04 2.59e-03 3.62e-02 -2.5 2.59e+00 - 1.00e+00 9.69e-0
1h 1
13 1.6352463e+04 1.37e-04 4.05e-03 -2.5 2.09e+00 - 1.00e+00 1.00e+0
0f 1
14 1.6326922e+04 1.64e-04 1.20e-02 -3.8 8.04e+00 - 9.95e-01 9.53e-0
1h 1
15 1.6326479e+04 5.97e-07 6.41e-05 -3.8 3.78e-01 - 1.00e+00 1.00e+0
0h 1
16 1.6325121e+04 3.81e-07 1.39e-04 -5.7 4.46e-01 - 1.00e+00 9.97e-0
1h 1
17 1.6325122e+04 3.85e-11 3.15e-09 -5.7 2.69e-02 - 1.00e+00 1.00e+0
0f 1
18 1.6325105e+04 6.20e-11 4.75e-06 -8.6 5.53e-03 - 1.00e+00 9.92e-0
1h 1
19 1.6325105e+04 3.84e-15 1.23e-13 -8.6 1.26e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.6325105280359708e+01 1.6325105280359707e+0
4
Dual infeasibility......: 1.2342550932658928e-13 1.2342550932658928e-1
0
Constraint violation....: 3.8441472227646045e-15 3.8441472227646045e-1
5
Complementarity.........: 7.3834112997005766e-09 7.3834112997005766e-0
6
Overall NLP error.......: 7.3834112997005766e-09 7.3834112997005766e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.1743324e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 3.14e-04 9.80e-0
3h 1
2 8.1457105e+02 1.50e+04 5.24e+01 -1.0 1.43e+04 - 4.70e-05 1.03e-0
4h 1
3 8.1341077e+02 1.50e+04 5.24e+01 -1.0 1.48e+04 - 6.55e-06 8.67e-0
5h 1
4 8.1195871e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 9.14e-05 1.10e-0
4h 1
5 5.3819108e+02 1.47e+04 5.26e+01 -1.0 1.50e+04 - 2.04e-04 2.11e-0
2f 1
6 2.6594970e+04 5.46e-02 8.26e+01 -1.0 1.47e+04 - 3.64e-02 1.00e+0
0h 1
7 1.7904968e+04 5.22e-02 5.94e+01 -1.0 8.24e+01 - 2.81e-01 4.81e-0
2f 1
8 1.5967682e+04 3.90e-02 3.16e+01 -1.0 3.78e+01 - 4.70e-01 4.98e-0
1f 1
9 1.6309926e+04 2.32e-02 1.48e+01 -1.0 2.01e+01 - 4.04e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6039032e+04 6.20e-03 3.25e-01 -1.0 5.42e+00 - 9.83e-01 1.00e+0
0h 1
11 1.5743176e+04 1.39e-03 3.61e-01 -1.7 5.10e+00 - 1.00e+00 8.39e-0
1f 1
12 1.5711642e+04 8.71e-04 1.29e-02 -1.7 1.96e+01 - 1.00e+00 1.00e+0
0f 1
13 1.5582616e+04 1.40e-03 9.49e-02 -3.8 2.22e+01 - 7.92e-01 9.30e-0
1f 1
14 1.5559565e+04 1.56e-03 7.55e-02 -3.8 1.70e+00 - 8.44e-01 7.60e-0
1h 1
15 1.5560158e+04 3.11e-06 8.09e-04 -3.8 9.40e-02 - 1.00e+00 1.00e+0
0h 1
16 1.5559221e+04 2.94e-07 6.54e-04 -5.7 1.49e-01 - 1.00e+00 9.88e-0
1h 1
17 1.5559215e+04 3.78e-11 6.51e-09 -5.7 3.27e-01 - 1.00e+00 1.00e+0
0f 1
18 1.5559202e+04 6.30e-11 2.14e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5559202159181128e+01 1.5559202159181128e+0
4
Dual infeasibility......: 2.1392627325694288e-09 2.1392627325694288e-0
6
Constraint violation....: 6.2997732031000453e-11 6.2997732031000453e-1
1
Complementarity.........: 2.8881041259249940e-09 2.8881041259249938e-0
6
Overall NLP error.......: 2.8881041259249940e-09 2.8881041259249938e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9469682e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 7.46e-04 9.80e-0
3h 1
2 8.9180484e+02 1.39e+04 5.24e+01 -1.0 1.24e+04 - 2.67e-05 1.11e-0
4h 1
3 8.9005694e+02 1.39e+04 5.24e+01 -1.0 1.38e+04 - 1.50e-05 1.28e-0
4h 1
4 8.8323084e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 1.40e-04 5.04e-0
4h 1
5 5.8143315e+02 1.36e+04 5.24e+01 -1.0 1.39e+04 - 6.54e-04 2.28e-0
2f 1
6 2.5988344e+04 6.37e-02 7.79e+01 -1.0 1.36e+04 - 6.90e-02 1.00e+0
0h 1
7 1.7594491e+04 5.83e-02 4.87e+01 -1.0 5.00e+01 - 3.58e-01 7.69e-0
2f 1
8 1.6290442e+04 2.68e-02 2.14e+01 -1.0 2.30e+01 - 5.53e-01 4.96e-0
1f 1
9 1.5787446e+04 7.20e-03 1.24e+00 -1.0 8.73e+00 - 9.36e-01 7.37e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6040325e+04 3.33e-04 8.09e-02 -1.0 2.87e+00 - 9.94e-01 1.00e+0
0f 1
11 1.5455351e+04 2.08e-03 9.11e-02 -2.5 4.32e+00 - 8.63e-01 8.27e-0
1f 1
12 1.5277398e+04 2.17e-03 3.61e-01 -2.5 1.07e+00 - 1.00e+00 7.74e-0
1f 1
13 1.5248420e+04 1.70e-04 5.16e-03 -2.5 2.17e-01 - 1.00e+00 1.00e+0
0h 1
14 1.5226315e+04 2.58e-05 4.67e-02 -3.8 5.43e+00 - 1.00e+00 8.74e-0
1h 1
15 1.5224406e+04 5.98e-08 6.09e-04 -3.8 6.46e-01 - 1.00e+00 1.00e+0
0f 1
16 1.5222954e+04 4.18e-08 2.88e-05 -5.7 2.97e-01 - 1.00e+00 9.99e-0
1f 1
17 1.5222957e+04 1.87e-12 1.03e-08 -5.7 2.49e-04 - 1.00e+00 1.00e+0
0f 1
18 1.5222940e+04 2.57e-12 2.64e-06 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
19 1.5222940e+04 8.46e-16 4.25e-14 -8.6 1.79e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.5222940101310506e+01 1.5222940101310505e+0
4
Dual infeasibility......: 4.2523388004391595e-14 4.2523388004391595e-1
1
Constraint violation....: 8.4583243687024498e-16 8.4583243687024498e-1
6
Complementarity.........: 2.5142258906150787e-09 2.5142258906150786e-0
6
Overall NLP error.......: 2.5142258906150787e-09 2.5142258906150786e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4548237e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.98e-04 9.80e-0
3h 1
2 8.4261832e+02 1.27e+04 5.24e+01 -1.0 1.20e+04 - 4.62e-05 1.04e-0
4h 1
3 8.0309466e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 7.81e-06 2.58e-0
3h 1
4 5.2937834e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 2.80e-03 2.08e-0
2h 1
5 2.3335798e+04 5.94e-02 8.14e+01 -1.0 1.24e+04 - 4.97e-02 1.00e+0
0h 1
6 1.5690537e+04 5.54e-02 4.84e+01 -1.0 7.33e+01 - 3.95e-01 6.13e-0
2f 1
7 1.3663628e+04 3.60e-02 2.49e+01 -1.0 4.16e+01 - 4.90e-01 5.24e-0
1f 1
8 1.4305428e+04 1.31e-02 2.79e+00 -1.0 1.59e+01 - 7.96e-01 5.00e-0
1f 2
9 1.3827023e+04 4.20e-03 1.76e-01 -1.0 7.73e+00 - 9.59e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3455833e+04 1.11e-03 3.89e-01 -1.7 5.64e+00 - 1.00e+00 8.15e-0
1f 1
11 1.3431557e+04 4.90e-04 2.48e-02 -1.7 3.49e+01 - 1.00e+00 1.00e+0
0f 1
12 1.3269592e+04 1.39e-03 1.20e-01 -3.8 3.98e+01 - 7.60e-01 9.23e-0
1f 1
13 1.3232163e+04 2.74e-03 2.16e-02 -3.8 3.01e+00 - 8.07e-01 8.28e-0
1h 1
14 1.3233886e+04 3.09e-04 1.34e-01 -3.8 5.17e-01 - 1.00e+00 9.07e-0
1h 1
15 1.3234267e+04 4.98e-07 2.20e-05 -3.8 2.38e-01 - 1.00e+00 1.00e+0
0f 1
16 1.3233079e+04 4.18e-07 2.33e-03 -5.7 2.97e-01 - 1.00e+00 9.77e-0
1h 1
17 1.3233066e+04 4.90e-11 2.26e-08 -5.7 5.81e-02 - 1.00e+00 1.00e+0
0f 1
18 1.3233051e+04 6.30e-11 4.40e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.3233050936170740e+01 1.3233050936170739e+0
4
Dual infeasibility......: 4.3985737555979886e-09 4.3985737555979886e-0
6
Constraint violation....: 6.2986907356510358e-11 6.2986907356510358e-1
1
Complementarity.........: 4.3669877431597082e-09 4.3669877431597080e-0
6
Overall NLP error.......: 4.3985737555979886e-09 4.3985737555979886e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2210225e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.46e-03 9.80e-0
3h 1
2 9.1932799e+02 1.11e+04 5.23e+01 -1.0 1.08e+04 - 7.54e-05 1.01e-0
4h 1
3 9.0257548e+02 1.11e+04 5.23e+01 -1.0 1.11e+04 - 4.34e-06 1.02e-0
3f 1
4 5.3655922e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 1.13e-03 2.30e-0
2h 1
5 2.3290160e+04 6.94e-02 7.66e+01 -1.0 1.09e+04 - 8.00e-02 1.00e+0
0h 1
6 1.5343160e+04 6.27e-02 2.43e+01 -1.0 1.45e+01 - 6.49e-01 8.77e-0
2f 1
7 1.4009062e+04 1.91e-02 1.02e+01 -1.0 1.03e+01 - 6.50e-01 8.81e-0
1f 1
8 1.4113243e+04 1.00e-02 6.47e-01 -1.0 2.90e+00 - 9.94e-01 4.83e-0
1f 2
9 1.3779362e+04 8.82e-03 2.69e-01 -1.7 8.66e+00 - 1.00e+00 8.36e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3748487e+04 2.14e-03 9.17e-01 -1.7 1.24e+01 - 1.00e+00 4.95e-0
1h 2
11 1.3742080e+04 2.05e-04 1.60e-02 -1.7 6.26e+00 - 1.00e+00 1.00e+0
0h 1
12 1.3586204e+04 4.85e-04 2.43e-02 -3.8 1.99e+01 - 8.46e-01 8.30e-0
1f 1
13 1.3567736e+04 1.55e-04 2.07e-01 -3.8 3.36e+00 - 9.89e-01 7.16e-0
1h 1
14 1.3563049e+04 4.09e-07 3.48e-04 -3.8 9.53e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3561859e+04 2.00e-08 4.52e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
16 1.3561846e+04 7.56e-13 4.98e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.3561846179514715e+01 1.3561846179514714e+0
4
Dual infeasibility......: 4.9781879208735970e-10 4.9781879208735970e-0
7
Constraint violation....: 7.5571493507453624e-13 7.5571493507453624e-1
3
Complementarity.........: 2.6176125198274192e-09 2.6176125198274190e-0
6
Overall NLP error.......: 2.6176125198274192e-09 2.6176125198274190e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0889550e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0544003e+02 9.19e+03 5.23e+01 -1.0 6.53e+03 - 1.88e-05 1.39e-0
4h 1
3 4.7820593e+02 8.97e+03 5.24e+01 -1.0 9.19e+03 - 4.54e-05 2.34e-0
2f 1
4 2.1767436e+04 6.51e-02 8.07e+01 -1.0 8.97e+03 - 2.85e-02 1.00e+0
0h 1
5 1.3313724e+04 6.22e-02 6.41e+01 -1.0 3.95e+01 - 2.06e-01 4.10e-0
2f 1
6 1.2046235e+04 2.08e-02 3.03e+01 -1.0 1.63e+01 - 5.38e-01 6.14e-0
1f 1
7 1.1599697e+04 6.95e-03 9.87e-01 -1.0 5.66e+00 - 9.55e-01 7.67e-0
1f 1
8 1.1862526e+04 2.40e-04 7.34e-02 -1.0 4.91e+00 - 1.00e+00 1.00e+0
0f 1
9 1.1304536e+04 2.07e-03 8.43e-02 -2.5 6.12e+00 - 8.56e-01 8.40e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1141064e+04 2.16e-03 4.29e-01 -2.5 1.00e+00 - 1.00e+00 7.59e-0
1f 1
11 1.1113966e+04 1.30e-04 4.69e-03 -2.5 2.27e-01 - 1.00e+00 1.00e+0
0h 1
12 1.1091123e+04 3.47e-05 1.49e-01 -3.8 1.07e+01 - 1.00e+00 7.59e-0
1h 1
13 1.1085027e+04 1.28e-07 3.42e-04 -3.8 2.58e+00 - 1.00e+00 1.00e+0
0f 1
14 1.1083360e+04 2.84e-08 9.75e-04 -5.7 5.94e-01 - 1.00e+00 9.85e-0
1f 1
15 1.1083341e+04 1.90e-12 1.38e-08 -5.7 8.84e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1083321e+04 2.63e-12 4.48e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.1083320761942781e+01 1.1083320761942781e+0
4
Dual infeasibility......: 4.4776949898425935e-09 4.4776949898425935e-0
6
Constraint violation....: 2.6307914180456748e-12 2.6307914180456748e-1
2
Complementarity.........: 3.6084982692738686e-09 3.6084982692738684e-0
6
Overall NLP error.......: 4.4776949898425935e-09 4.4776949898425935e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3708621e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 3.06e-03 9.81e-0
3h 1
2 9.2685228e+02 6.70e+03 5.23e+01 -1.0 5.16e+03 - 7.80e-06 4.30e-0
4h 1
3 4.2744385e+02 6.55e+03 5.24e+01 -1.0 6.70e+03 - 3.41e-04 2.27e-0
2h 1
4 1.9152600e+04 7.34e-02 7.71e+01 -1.0 6.55e+03 - 7.60e-02 1.00e+0
0h 1
5 1.1266474e+04 6.67e-02 2.37e+01 -1.0 4.40e+00 - 6.64e-01 8.47e-0
2f 1
6 1.0233662e+04 3.07e-02 9.29e+00 -1.0 4.78e+00 - 7.00e-01 1.00e+0
0f 1
7 1.0417809e+04 1.44e-02 2.61e-01 -1.0 1.29e+00 - 9.92e-01 9.96e-0
1f 1
8 1.0005495e+04 3.73e-03 3.38e-01 -1.7 1.54e+01 - 8.48e-01 1.00e+0
0f 1
9 9.9703985e+03 6.37e-04 4.26e-01 -1.7 3.05e+01 - 6.59e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.9961434e+03 2.04e-05 7.06e-04 -1.7 1.15e+01 - 1.00e+00 1.00e+0
0h 1
11 9.8126967e+03 2.98e-04 2.37e-02 -3.8 5.81e+01 - 8.67e-01 8.42e-0
1f 1
12 9.7884047e+03 4.54e-05 6.01e-02 -3.8 9.07e+00 - 1.00e+00 8.75e-0
1h 1
13 9.7856969e+03 5.22e-08 2.91e-05 -3.8 1.13e+00 - 1.00e+00 1.00e+0
0f 1
14 9.7842101e+03 1.69e-08 2.51e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0f 1
15 9.7841926e+03 1.73e-12 4.25e-10 -8.6 5.52e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 9.7841925937477008e+00 9.7841925937477008e+0
3
Dual infeasibility......: 4.2532712368385735e-10 4.2532712368385735e-0
7
Constraint violation....: 1.7261886364750012e-12 1.7261886364750012e-1
2
Complementarity.........: 2.8262135152333319e-09 2.8262135152333319e-0
6
Overall NLP error.......: 2.8262135152333319e-09 2.8262135152333319e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8772454e+02 4.77e+03 5.24e+01 -1.0 4.82e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8463069e+02 4.77e+03 5.24e+01 -1.0 4.12e+03 - 4.65e-05 1.15e-0
4h 1
3 6.9026556e+02 4.73e+03 5.24e+01 -1.0 4.77e+03 - 2.20e-05 8.53e-0
3f 1
4 4.0829903e+02 4.63e+03 5.20e+01 -1.0 4.73e+03 - 1.12e-02 2.07e-0
2h 1
5 1.3286163e+04 7.24e-02 7.77e+01 -1.0 4.63e+03 - 9.89e-02 1.00e+0
0h 1
6 7.8843057e+03 6.35e-02 2.09e+01 -1.0 4.48e+01 - 7.03e-01 1.14e-0
1f 1
7 6.3730706e+03 2.46e-02 2.05e+00 -1.0 2.21e+01 - 9.31e-01 6.56e-0
1f 1
8 6.5551438e+03 3.66e-03 1.09e+00 -1.0 3.60e+00 - 5.36e-01 1.00e+0
0f 1
9 6.7365776e+03 4.54e-04 1.06e+00 -1.0 7.46e+00 - 5.10e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.7266748e+03 7.93e-05 1.40e-01 -1.0 1.41e+01 - 6.29e-01 1.00e+0
0f 1
11 6.1061520e+03 1.84e-03 7.54e-02 -1.7 3.35e+00 - 1.00e+00 1.00e+0
0f 1
12 5.9477293e+03 1.19e-03 2.42e-01 -2.5 2.25e+01 - 9.57e-01 6.69e-0
1f 1
13 5.9424961e+03 1.70e-06 7.41e-03 -2.5 7.36e+00 - 1.00e+00 1.00e+0
0h 1
14 5.9217932e+03 3.92e-06 5.52e-02 -3.8 5.36e+00 - 9.43e-01 8.86e-0
1f 1
15 5.9184144e+03 5.27e-04 6.07e-04 -3.8 6.06e-01 - 1.00e+00 1.00e+0
0f 1
16 5.9173075e+03 5.36e-05 1.05e-02 -5.7 2.97e-01 - 8.29e-01 1.00e+0
0h 1
17 5.9171985e+03 3.23e-05 3.59e-05 -5.7 9.15e-03 - 1.00e+00 1.00e+0
0h 1
18 5.9172014e+03 5.70e-07 6.03e-06 -5.7 1.14e-03 - 1.00e+00 1.00e+0
0h 1
19 5.9171874e+03 3.97e-08 8.05e-05 -8.6 3.68e-03 - 1.00e+00 9.42e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 5.9171866e+03 7.74e-12 6.99e-11 -8.6 2.12e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 5.9171865521548641e+00 5.9171865521548643e+0
3
Dual infeasibility......: 6.9866376864446045e-11 6.9866376864446051e-0
8
Constraint violation....: 7.7381434593348786e-12 7.7381434593348786e-1
2
Complementarity.........: 3.0049119667730621e-09 3.0049119667730622e-0
6
Overall NLP error.......: 3.0049119667730621e-09 3.0049119667730622e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9469463e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3h 1
2 8.9070845e+02 3.24e+03 5.24e+01 -1.0 2.13e+03 - 3.61e-05 1.51e-0
4h 1
3 3.3042115e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 6.40e-05 2.31e-0
2f 1
4 1.5680539e+04 6.28e-02 8.02e+01 -1.0 3.17e+03 - 3.82e-02 1.00e+0
0h 1
5 7.1096018e+03 5.94e-02 5.80e+01 -1.0 5.03e+01 - 2.72e-01 4.93e-0
2f 1
6 5.7281758e+03 2.48e-02 2.85e+01 -1.0 2.32e+01 - 5.13e-01 5.39e-0
1f 1
7 5.1166765e+03 1.01e-02 1.45e+00 -1.0 8.86e+00 - 9.34e-01 7.73e-0
1f 1
8 5.4253179e+03 3.01e-04 8.57e-02 -1.0 3.30e+00 - 9.97e-01 1.00e+0
0f 1
9 4.7991921e+03 2.08e-03 7.86e-02 -2.5 4.57e+00 - 8.62e-01 8.55e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.6288201e+03 2.21e-03 3.38e-01 -2.5 1.40e+00 - 1.00e+00 7.83e-0
1f 1
11 4.6027951e+03 1.46e-04 4.56e-03 -2.5 3.46e-01 - 1.00e+00 1.00e+0
0h 1
12 4.5779322e+03 2.17e-05 4.20e-02 -3.8 8.05e+00 - 1.00e+00 8.86e-0
1h 1
13 4.5759311e+03 5.63e-08 5.97e-04 -3.8 9.13e-01 - 1.00e+00 1.00e+0
0f 1
14 4.5743282e+03 4.27e-08 6.23e-05 -5.7 4.46e-01 - 1.00e+00 9.98e-0
1f 1
15 4.5743286e+03 1.89e-12 1.37e-08 -5.7 1.03e-03 - 1.00e+00 1.00e+0
0f 1
16 4.5743102e+03 2.57e-12 3.30e-06 -8.6 5.53e-03 - 1.00e+00 9.99e-0
1f 1
17 4.5743102e+03 1.65e-15 4.87e-14 -8.6 2.09e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 4.5743102037750623e+00 4.5743102037750623e+0
3
Dual infeasibility......: 4.8742654030487989e-14 4.8742654030487989e-1
1
Constraint violation....: 1.6501057117267150e-15 1.6501057117267150e-1
5
Complementarity.........: 2.6870910012065997e-09 2.6870910012065997e-0
6
Overall NLP error.......: 2.6870910012065997e-09 2.6870910012065997e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8055761e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.81e-0
3f 1
2 8.7687121e+02 2.00e+03 5.24e+01 -1.0 1.46e+03 - 5.64e-05 1.36e-0
4h 1
3 8.6755992e+02 2.00e+03 5.24e+01 -1.0 1.99e+03 - 5.21e-05 3.63e-0
4h 1
4 2.9429068e+02 1.95e+03 7.08e+01 -1.0 2.00e+03 - 4.09e-04 2.26e-0
2f 1
5 1.4099799e+04 6.13e-02 7.92e+01 -1.0 1.95e+03 - 5.58e-02 1.00e+0
0h 1
6 5.5358032e+03 5.69e-02 5.29e+01 -1.0 6.47e+01 - 3.20e-01 6.49e-0
2f 1
7 4.1772488e+03 3.11e-02 2.60e+01 -1.0 3.23e+01 - 4.98e-01 4.20e-0
1f 1
8 3.3814418e+03 1.24e-02 2.08e+00 -1.0 1.10e+01 - 9.20e-01 9.18e-0
1f 1
9 3.8167791e+03 3.73e-04 2.77e-01 -1.0 4.94e+00 - 9.11e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.1080824e+03 1.19e-03 7.85e-01 -1.7 1.36e+01 - 5.57e-01 9.96e-0
1f 1
11 3.1739179e+03 4.34e-05 2.27e-02 -1.7 4.00e+00 - 1.00e+00 1.00e+0
0f 1
12 3.0621831e+03 4.74e-05 2.02e-01 -2.5 2.05e+01 - 1.00e+00 8.52e-0
1f 1
13 3.0594920e+03 8.62e-05 2.94e-03 -2.5 3.01e+00 - 1.00e+00 1.00e+0
0f 1
14 3.0432477e+03 2.62e-04 7.77e-02 -3.8 4.75e+00 - 7.77e-01 9.79e-0
1h 1
15 3.0404487e+03 1.59e-03 1.81e-03 -3.8 1.57e-01 - 9.79e-01 1.00e+0
0h 1
16 3.0404728e+03 7.76e-05 6.40e-05 -3.8 1.21e-02 - 1.00e+00 1.00e+0
0h 1
17 3.0392663e+03 1.30e-04 1.10e-03 -5.7 1.52e-01 - 9.18e-01 1.00e+0
0h 1
18 3.0392266e+03 3.25e-05 6.64e-06 -5.7 8.39e-03 - 1.00e+00 1.00e+0
0h 1
19 3.0392322e+03 1.79e-07 3.34e-06 -5.7 6.08e-04 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 3.0392189e+03 2.64e-08 3.25e-05 -8.6 1.84e-03 - 1.00e+00 9.57e-0
1h 1
21 3.0392184e+03 4.34e-12 5.14e-11 -8.6 7.81e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 3.0392183959952428e+00 3.0392183959952426e+0
3
Dual infeasibility......: 5.1361486879722048e-11 5.1361486879722048e-0
8
Constraint violation....: 4.3411940708892871e-12 4.3411940708892871e-1
2
Complementarity.........: 2.5095205307126003e-09 2.5095205307126004e-0
6
Overall NLP error.......: 2.5095205307126003e-09 2.5095205307126004e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 46
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 23
inequality constraints with only lower bounds: 14
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0708610e+02 9.17e+02 5.23e+01 -1.0 9.16e+02 - 9.01e-04 9.92e-0
3h 1
2 2.9011741e+02 8.95e+02 5.24e+01 -1.0 9.17e+02 - 1.31e-04 2.40e-0
2f 1
3 1.3647094e+04 6.66e-02 7.96e+01 -1.0 8.96e+02 - 3.62e-02 1.00e+0
0h 1
4 5.1516631e+03 6.32e-02 6.16e+01 -1.0 4.71e+01 - 2.22e-01 4.74e-0
2f 1
5 4.0925579e+03 3.19e-02 3.04e+01 -1.0 2.34e+01 - 4.97e-01 4.34e-0
1f 1
6 3.3301751e+03 1.56e-02 1.89e+00 -1.0 9.98e+00 - 9.27e-01 6.82e-0
1f 1
7 3.5734667e+03 1.10e-03 1.14e-01 -1.0 3.33e+00 - 9.93e-01 1.00e+0
0f 1
8 3.0795600e+03 1.90e-03 2.18e-01 -2.5 8.28e+00 - 8.61e-01 7.60e-0
1f 1
9 2.8944935e+03 2.19e-03 5.20e-01 -2.5 1.60e+01 - 1.00e+00 7.37e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8621916e+03 1.84e-04 4.32e-03 -2.5 9.38e+00 - 1.00e+00 1.00e+0
0h 1
11 2.8268118e+03 5.13e-05 1.88e-01 -3.8 2.96e+01 - 1.00e+00 7.33e-0
1h 1
12 2.8151165e+03 1.63e-07 3.80e-04 -3.8 7.83e+00 - 1.00e+00 1.00e+0
0f 1
13 2.8124290e+03 2.71e-08 8.76e-04 -5.7 1.63e+00 - 1.00e+00 9.86e-0
1f 1
14 2.8123969e+03 1.86e-12 1.28e-08 -5.7 2.24e-02 - 1.00e+00 1.00e+0
0f 1
15 2.8123637e+03 2.63e-12 4.48e-09 -8.6 2.03e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 2.8123637250150706e+00 2.8123637250150705e+0
3
Dual infeasibility......: 4.4776971090639704e-09 4.4776971090639704e-0
6
Constraint violation....: 2.6304444733504795e-12 2.6304444733504795e-1
2
Complementarity.........: 3.6085027543316075e-09 3.6085027543316073e-0
6
Overall NLP error.......: 4.4776971090639704e-09 4.4776971090639704e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.03e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.45e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643348e+00 1.6104063281643348e+0
3
Dual infeasibility......: 2.4573741756437962e-12 2.4573741756437962e-0
9
Constraint violation....: 7.4510994916722321e-16 7.4510994916722321e-1
6
Complementarity.........: 2.5062163910047547e-09 2.5062163910047545e-0
6
Overall NLP error.......: 2.5062163910047547e-09 2.5062163910047545e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318724210404e-09 2.1031318724210404e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896915596e-09 2.8882108896915594e-0
6
Overall NLP error.......: 2.8882108896915596e-09 2.8882108896915594e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254210190e-01 6.4890146254210185e+0
2
Dual infeasibility......: 4.9126604771035067e-09 4.9126604771035067e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646095252488115e-09 4.3646095252488111e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126604771035067e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.03e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.45e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643348e+00 1.6104063281643348e+0
3
Dual infeasibility......: 2.4573741756437962e-12 2.4573741756437962e-0
9
Constraint violation....: 7.4510994916722321e-16 7.4510994916722321e-1
6
Complementarity.........: 2.5062163910047547e-09 2.5062163910047545e-0
6
Overall NLP error.......: 2.5062163910047547e-09 2.5062163910047545e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2355451e+02 9.17e+02 5.24e+01 -1.0 9.24e+02 - 3.31e-04 9.84e-0
3f 1
2 8.1662500e+02 9.17e+02 5.24e+01 -1.0 5.55e+02 - 7.26e-05 2.50e-0
4h 1
3 2.4196991e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 1.96e-04 2.12e-0
2f 1
4 1.2636833e+04 5.48e-02 8.23e+01 -1.0 8.98e+02 - 3.79e-02 1.00e+0
0h 1
5 3.9066543e+03 5.23e-02 5.77e+01 -1.0 8.26e+01 - 2.96e-01 4.93e-0
2f 1
6 1.9129688e+03 3.74e-02 3.11e+01 -1.0 3.92e+01 - 4.66e-01 5.08e-0
1f 1
7 4.7067283e+03 1.23e-02 2.76e+01 -1.0 2.08e+01 - 3.97e-01 1.00e+0
0h 1
8 1.8774461e+03 1.23e-02 1.09e+00 -1.0 2.59e+01 - 9.87e-01 8.86e-0
1f 1
9 1.9927655e+03 2.09e-04 4.90e-02 -1.0 2.51e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7260747e+03 2.23e-04 1.23e+00 -2.5 1.90e+01 - 9.37e-01 5.95e-0
1f 1
11 1.5380610e+03 3.77e-03 1.32e-01 -2.5 7.57e+00 - 7.96e-01 1.00e+0
0f 1
12 1.5153061e+03 4.98e-03 3.07e-01 -2.5 1.80e+00 - 1.00e+00 7.69e-0
1h 1
13 1.5275650e+03 2.35e-04 4.67e-03 -2.5 7.22e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5024753e+03 1.70e-04 2.15e-02 -3.8 8.08e+00 - 9.90e-01 9.29e-0
1h 1
15 1.5016701e+03 7.28e-07 6.85e-05 -3.8 5.51e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003100e+03 3.77e-07 1.78e-04 -5.7 4.46e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003099e+03 3.79e-11 2.92e-09 -5.7 4.21e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932726742306e+00 1.5002932726742306e+0
3
Dual infeasibility......: 2.1737237412002349e-09 2.1737237412002349e-0
6
Constraint violation....: 6.2995525462739010e-11 6.2995525462739010e-1
1
Complementarity.........: 2.8882174509583692e-09 2.8882174509583692e-0
6
Overall NLP error.......: 2.8882174509583692e-09 2.8882174509583692e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6598311e+02 9.17e+02 5.24e+01 -1.0 9.24e+02 - 4.97e-04 9.84e-0
3h 1
2 8.5884059e+02 9.17e+02 5.24e+01 -1.0 5.71e+02 - 7.06e-05 2.62e-0
4h 1
3 2.6203260e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 2.08e-04 2.23e-0
2f 1
4 1.3003571e+04 5.93e-02 8.01e+01 -1.0 8.97e+02 - 4.95e-02 1.00e+0
0h 1
5 4.3038712e+03 5.54e-02 5.41e+01 -1.0 7.44e+01 - 3.14e-01 5.91e-0
2f 1
82 1.751112e+04 1.632511e+04 6.277569e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2433284e+02 1.57e+04 5.24e+01 -1.0 1.59e+04 - 3.31e-04 9.80e-0
3h 1
2 8.2134519e+02 1.57e+04 5.24e+01 -1.0 1.37e+04 - 2.39e-05 1.14e-0
4h 1
3 8.1381551e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 1.82e-05 6.05e-0
4h 1
4 5.6315563e+02 1.54e+04 5.26e+01 -1.0 1.57e+04 - 6.18e-04 2.10e-0
2h 1
5 2.7260411e+04 5.51e-02 8.36e+01 -1.0 1.54e+04 - 2.33e-02 1.00e+0
0h 1
6 1.8798584e+04 5.33e-02 6.90e+01 -1.0 8.34e+01 - 1.80e-01 3.66e-0
2f 1
7 1.6805503e+04 4.35e-02 3.70e+01 -1.0 3.38e+01 - 4.71e-01 5.50e-0
1f 1
8 1.7143070e+04 2.10e-02 1.97e+01 -1.0 1.94e+01 - 3.70e-01 1.25e-0
1f 4
9 1.6795198e+04 6.84e-03 4.43e-01 -1.0 7.90e+00 - 9.81e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6510382e+04 1.64e-03 4.17e-01 -1.7 4.95e+00 - 9.95e-01 8.19e-0
1f 1
11 1.6521361e+04 9.09e-04 3.07e-01 -1.7 6.02e+01 - 7.13e-02 1.00e+0
0f 1
12 1.6526474e+04 6.70e-06 7.31e-04 -1.7 4.84e+00 - 1.00e+00 1.00e+0
0h 1
13 1.6351347e+04 1.24e-03 9.70e-02 -3.8 7.19e+01 - 7.93e-01 9.24e-0
1f 1
14 1.6325921e+04 1.55e-03 5.49e-02 -3.8 1.81e+00 - 8.36e-01 7.74e-0
1h 1
15 1.6326346e+04 2.48e-06 7.67e-04 -3.8 8.55e-02 - 1.00e+00 1.00e+0
0h 1
16 1.6325132e+04 3.05e-07 7.37e-04 -5.7 4.46e-01 - 1.00e+00 9.87e-0
1h 1
17 1.6325122e+04 3.91e-11 6.13e-09 -5.7 7.18e-02 - 1.00e+00 1.00e+0
0f 1
18 1.6325105e+04 6.20e-11 5.03e-06 -8.6 5.53e-03 - 1.00e+00 9.92e-0
1h 1
19 1.6325105e+04 5.33e-15 1.32e-13 -8.6 1.01e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.6325105280396485e+01 1.6325105280396485e+0
4
Dual infeasibility......: 1.3172132581861934e-13 1.3172132581861934e-1
0
Constraint violation....: 5.3290705182007514e-15 5.3290705182007514e-1
5
Complementarity.........: 7.4237621846977363e-09 7.4237621846977358e-0
6
Overall NLP error.......: 7.4237621846977363e-09 7.4237621846977358e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9092744e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 6.99e-04 9.80e-0
3h 1
2 8.8813262e+02 1.50e+04 5.24e+01 -1.0 1.42e+04 - 4.18e-05 1.04e-0
4h 1
3 8.8662485e+02 1.50e+04 5.24e+01 -1.0 1.49e+04 - 7.12e-06 1.19e-0
4h 1
4 8.8477567e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 1.24e-04 1.48e-0
4h 1
5 6.0097784e+02 1.46e+04 5.25e+01 -1.0 1.50e+04 - 2.78e-04 2.29e-0
2f 1
6 2.7208422e+04 6.27e-02 7.83e+01 -1.0 1.46e+04 - 6.34e-02 1.00e+0
0h 1
7 1.8645227e+04 5.77e-02 5.09e+01 -1.0 5.52e+01 - 3.36e-01 7.15e-0
2f 1
8 1.7352512e+04 2.89e-02 2.34e+01 -1.0 2.57e+01 - 5.30e-01 4.60e-0
1f 1
9 1.6724933e+04 9.41e-03 1.19e+00 -1.0 9.95e+00 - 9.28e-01 7.67e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7011358e+04 3.36e-04 8.25e-02 -1.0 3.39e+00 - 9.99e-01 1.00e+0
0f 1
11 1.6382742e+04 2.08e-03 8.05e-02 -2.5 4.92e+00 - 8.66e-01 8.51e-0
1f 1
12 1.6202394e+04 2.17e-03 2.00e-01 -2.5 1.05e+00 - 1.00e+00 8.36e-0
1f 1
13 1.6185719e+04 8.48e-05 3.84e-03 -2.5 1.46e-01 - 1.00e+00 1.00e+0
0h 1
14 1.6174720e+04 4.52e-05 1.11e+00 -3.8 2.74e+00 - 1.00e+00 4.98e-0
1h 1
15 1.6171402e+04 3.44e-07 1.13e-01 -3.8 1.35e+00 - 9.68e-01 1.00e+0
0f 1
16 1.6170367e+04 1.56e-08 1.80e-03 -3.8 3.29e-02 - 1.00e+00 1.00e+0
0H 1
17 1.6170565e+04 1.15e-05 2.78e-04 -3.8 3.79e-03 - 1.00e+00 1.00e+0
0f 1
18 1.6169798e+04 1.87e-06 6.30e-02 -5.7 1.49e-01 - 7.77e-01 9.69e-0
1h 1
19 1.6169626e+04 1.24e-05 2.12e-04 -5.7 5.04e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6169632e+04 2.67e-08 2.11e-06 -5.7 2.55e-04 - 1.00e+00 1.00e+0
0h 1
21 1.6169617e+04 2.72e-08 7.59e-06 -8.6 1.84e-03 - 9.82e-01 9.88e-0
1h 1
22 1.6169617e+04 2.96e-13 3.33e-11 -8.6 2.22e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.6169617049952397e+01 1.6169617049952396e+0
4
Dual infeasibility......: 3.3260123973953573e-11 3.3260123973953573e-0
8
Constraint violation....: 2.9642954757491680e-13 2.9642954757491680e-1
3
Complementarity.........: 2.5121498667957185e-09 2.5121498667957183e-0
6
Overall NLP error.......: 2.5121498667957185e-09 2.5121498667957183e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6663632e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 4.97e-04 9.80e-0
3h 1
2 8.6385551e+02 1.39e+04 5.24e+01 -1.0 1.37e+04 - 9.10e-05 1.01e-0
4h 1
3 8.5474456e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 3.12e-06 6.56e-0
4f 1
4 5.5736289e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 7.05e-04 2.21e-0
2h 1
5 2.5729005e+04 5.98e-02 8.02e+01 -1.0 1.36e+04 - 5.05e-02 1.00e+0
0h 1
6 1.7257833e+04 5.58e-02 5.33e+01 -1.0 7.29e+01 - 3.25e-01 6.04e-0
2f 1
7 1.5669674e+04 3.02e-02 2.77e+01 -1.0 3.88e+01 - 4.75e-01 4.33e-0
1f 1
8 1.5391032e+04 1.45e-02 2.54e+00 -1.0 1.10e+01 - 9.18e-01 5.00e-0
1f 2
9 1.5231410e+04 7.14e-03 1.81e+00 -1.0 7.85e+00 - 1.00e+00 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5334693e+04 5.59e-04 4.23e-02 -1.0 9.95e+01 - 1.00e+00 1.00e+0
0f 1
11 1.4902809e+04 4.46e-04 9.63e-01 -2.5 9.82e+01 - 9.17e-01 5.84e-0
1f 1
12 1.4780239e+04 2.23e-04 2.20e-01 -2.5 4.04e+01 - 9.25e-01 1.00e+0
0f 1
13 1.4754279e+04 3.09e-03 1.97e-02 -2.5 1.15e+00 - 1.00e+00 1.00e+0
0h 1
14 1.4740982e+04 8.07e-04 3.65e-02 -3.8 2.68e+00 - 8.02e-01 1.00e+0
0h 1
15 1.4738047e+04 2.15e-03 1.02e-03 -3.8 4.89e-02 - 1.00e+00 1.00e+0
0h 1
16 1.4738260e+04 4.87e-05 1.38e-04 -3.8 1.22e-02 - 1.00e+00 1.00e+0
0h 1
17 1.4736958e+04 1.01e-04 3.31e-04 -5.7 1.49e-01 - 9.50e-01 9.74e-0
1h 1
18 1.4736944e+04 2.31e-05 3.85e-03 -5.7 3.81e-03 - 1.00e+00 7.72e-0
1h 1
19 1.4736946e+04 9.00e-09 1.28e-06 -5.7 8.67e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.4736932e+04 9.08e-09 1.93e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
21 1.4736931e+04 1.37e-12 6.54e-11 -8.6 3.06e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.4736931429575051e+01 1.4736931429575052e+0
4
Dual infeasibility......: 6.5446542794797110e-11 6.5446542794797110e-0
8
Constraint violation....: 1.3695711231775931e-12 1.3695711231775931e-1
2
Complementarity.........: 2.5092871219100991e-09 2.5092871219100992e-0
6
Overall NLP error.......: 2.5092871219100991e-09 2.5092871219100992e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4547453e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.98e-04 9.80e-0
3h 1
2 8.4252031e+02 1.27e+04 5.24e+01 -1.0 1.14e+04 - 3.11e-05 1.10e-0
4h 1
3 8.2595635e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 1.44e-05 1.08e-0
3h 1
4 5.1565719e+02 1.24e+04 5.26e+01 -1.0 1.26e+04 - 1.09e-03 2.13e-0
2h 1
5 2.4121564e+04 5.77e-02 8.26e+01 -1.0 1.24e+04 - 2.98e-02 1.00e+0
0h 1
6 1.5873656e+04 5.50e-02 6.29e+01 -1.0 7.59e+01 - 2.40e-01 4.25e-0
2f 1
7 1.3731650e+04 3.97e-02 3.44e+01 -1.0 3.63e+01 - 4.67e-01 5.91e-0
1f 1
8 1.4069741e+04 1.90e-02 1.92e+01 -1.0 1.84e+01 - 3.42e-01 1.25e-0
1f 4
9 1.3846998e+04 4.99e-03 1.03e+00 -1.0 5.34e+00 - 9.55e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3782633e+04 3.55e-04 1.03e-01 -1.0 4.77e+00 - 9.51e-01 1.00e+0
0f 1
11 1.3471260e+04 3.27e-04 1.12e+00 -2.5 6.28e+00 - 9.27e-01 5.96e-0
1f 1
12 1.3300527e+04 2.11e-03 3.08e-01 -2.5 6.93e+00 - 7.33e-01 1.00e+0
0f 1
13 1.3249453e+04 7.52e-03 1.36e-01 -2.5 3.36e+00 - 1.00e+00 8.48e-0
1h 1
14 1.3259397e+04 3.33e-04 1.10e-02 -2.5 4.77e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3235320e+04 2.96e-04 4.98e-02 -3.8 6.22e+00 - 9.88e-01 8.78e-0
1h 1
16 1.3234271e+04 1.46e-06 1.44e-04 -3.8 3.83e-01 - 1.00e+00 1.00e+0
0h 1
17 1.3233076e+04 3.35e-07 2.12e-03 -5.7 2.95e-01 - 1.00e+00 9.78e-0
1h 1
18 1.3233066e+04 3.83e-11 2.12e-08 -5.7 5.09e-03 - 1.00e+00 1.00e+0
0f 1
19 1.3233051e+04 6.30e-11 4.40e-09 -8.6 3.69e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.3233050935942613e+01 1.3233050935942612e+0
4
Dual infeasibility......: 4.3996466904568946e-09 4.3996466904568946e-0
6
Constraint violation....: 6.3006558304046223e-11 6.3006558304046223e-1
1
Complementarity.........: 3.3018716247074709e-09 3.3018716247074708e-0
6
Overall NLP error.......: 4.3996466904568946e-09 4.3996466904568946e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2232925e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.47e-03 9.80e-0
3h 1
2 9.1955424e+02 1.11e+04 5.23e+01 -1.0 1.08e+04 - 7.52e-05 1.01e-0
4h 1
3 9.0274882e+02 1.11e+04 5.23e+01 -1.0 1.11e+04 - 4.35e-06 1.02e-0
3f 1
4 5.3667650e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 1.14e-03 2.30e-0
2h 1
5 2.3289992e+04 6.94e-02 7.66e+01 -1.0 1.09e+04 - 8.00e-02 1.00e+0
0h 1
6 1.5347980e+04 6.28e-02 2.43e+01 -1.0 1.43e+01 - 6.48e-01 8.77e-0
2f 1
7 1.4015044e+04 1.95e-02 1.02e+01 -1.0 1.02e+01 - 6.51e-01 8.85e-0
1f 1
8 1.4121108e+04 1.02e-02 6.30e-01 -1.0 2.90e+00 - 9.94e-01 4.83e-0
1f 2
9 1.3788925e+04 8.72e-03 2.69e-01 -1.7 8.66e+00 - 1.00e+00 8.36e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3757989e+04 2.14e-03 9.08e-01 -1.7 1.24e+01 - 1.00e+00 4.97e-0
1h 2
11 1.3751466e+04 2.02e-04 1.57e-02 -1.7 6.22e+00 - 1.00e+00 1.00e+0
0h 1
12 1.3595628e+04 4.83e-04 2.43e-02 -3.8 1.99e+01 - 8.46e-01 8.30e-0
1f 1
13 1.3577229e+04 1.53e-04 2.07e-01 -3.8 3.35e+00 - 9.89e-01 7.17e-0
1h 1
14 1.3572558e+04 4.03e-07 3.37e-04 -3.8 9.49e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3571369e+04 1.99e-08 4.50e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
16 1.3571356e+04 7.64e-13 4.93e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.3571356057173118e+01 1.3571356057173118e+0
4
Dual infeasibility......: 4.9320225596355760e-10 4.9320225596355760e-0
7
Constraint violation....: 7.6395834103237803e-13 7.6395834103237803e-1
3
Complementarity.........: 2.6164102931856718e-09 2.6164102931856718e-0
6
Overall NLP error.......: 2.6164102931856718e-09 2.6164102931856718e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0889550e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0544003e+02 9.19e+03 5.23e+01 -1.0 6.53e+03 - 1.88e-05 1.39e-0
4h 1
3 4.7820593e+02 8.97e+03 5.24e+01 -1.0 9.19e+03 - 4.54e-05 2.34e-0
2f 1
4 2.1767436e+04 6.51e-02 8.07e+01 -1.0 8.97e+03 - 2.85e-02 1.00e+0
0h 1
5 1.3313724e+04 6.22e-02 6.41e+01 -1.0 3.95e+01 - 2.06e-01 4.10e-0
2f 1
6 1.2046235e+04 2.08e-02 3.03e+01 -1.0 1.63e+01 - 5.38e-01 6.14e-0
1f 1
7 1.1599697e+04 6.95e-03 9.87e-01 -1.0 5.66e+00 - 9.55e-01 7.67e-0
1f 1
8 1.1862526e+04 2.40e-04 7.34e-02 -1.0 4.91e+00 - 1.00e+00 1.00e+0
0f 1
9 1.1304536e+04 2.07e-03 8.43e-02 -2.5 6.12e+00 - 8.56e-01 8.40e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1141064e+04 2.16e-03 4.29e-01 -2.5 1.00e+00 - 1.00e+00 7.59e-0
1f 1
11 1.1113966e+04 1.30e-04 4.69e-03 -2.5 2.27e-01 - 1.00e+00 1.00e+0
0h 1
12 1.1091123e+04 3.47e-05 1.49e-01 -3.8 1.07e+01 - 1.00e+00 7.59e-0
1h 1
13 1.1085027e+04 1.28e-07 3.42e-04 -3.8 2.58e+00 - 1.00e+00 1.00e+0
0f 1
14 1.1083360e+04 2.84e-08 9.75e-04 -5.7 5.94e-01 - 1.00e+00 9.85e-0
1f 1
15 1.1083341e+04 1.90e-12 1.38e-08 -5.7 8.84e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1083321e+04 2.63e-12 4.48e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.1083320761980701e+01 1.1083320761980702e+0
4
Dual infeasibility......: 4.4776949715195768e-09 4.4776949715195768e-0
6
Constraint violation....: 2.6309232570298491e-12 2.6309232570298491e-1
2
Complementarity.........: 3.6084982692528260e-09 3.6084982692528260e-0
6
Overall NLP error.......: 4.4776949715195768e-09 4.4776949715195768e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0888295e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0557265e+02 6.71e+03 5.23e+01 -1.0 5.21e+03 - 2.69e-05 1.27e-0
4h 1
3 4.1986899e+02 6.55e+03 5.24e+01 -1.0 6.70e+03 - 3.43e-05 2.35e-0
2f 1
4 1.9285646e+04 6.51e-02 8.06e+01 -1.0 6.55e+03 - 2.96e-02 1.00e+0
0h 1
5 1.0827936e+04 6.21e-02 6.35e+01 -1.0 3.91e+01 - 2.12e-01 4.20e-0
2f 1
6 9.5566169e+03 2.07e-02 3.00e+01 -1.0 1.63e+01 - 5.39e-01 6.15e-0
1f 1
7 9.1167531e+03 6.69e-03 9.63e-01 -1.0 5.59e+00 - 9.55e-01 7.70e-0
1f 1
8 9.3796749e+03 2.25e-04 7.29e-02 -1.0 4.69e+00 - 9.84e-01 1.00e+0
0f 1
9 8.8173442e+03 2.07e-03 8.44e-02 -2.5 3.16e+00 - 8.56e-01 8.40e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.6549724e+03 2.15e-03 4.33e-01 -2.5 1.77e+00 - 1.00e+00 7.57e-0
1f 1
11 8.6281050e+03 1.34e-04 4.74e-03 -2.5 6.86e-01 - 1.00e+00 1.00e+0
0h 1
12 8.6073522e+03 3.57e-05 1.51e-01 -3.8 8.04e+00 - 1.00e+00 7.58e-0
1h 1
13 8.6018718e+03 1.30e-07 3.45e-04 -3.8 1.95e+00 - 1.00e+00 1.00e+0
0f 1
14 8.6003514e+03 2.83e-08 9.62e-04 -5.7 4.46e-01 - 1.00e+00 9.85e-0
1h 1
15 8.6003344e+03 1.88e-12 1.37e-08 -5.7 6.57e-03 - 1.00e+00 1.00e+0
0f 1
16 8.6003159e+03 2.63e-12 4.48e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 8.6003159357097001e+00 8.6003159357096993e+0
3
Dual infeasibility......: 4.4776944093327983e-09 4.4776944093327983e-0
6
Constraint violation....: 2.6308955014542335e-12 2.6308955014542335e-1
2
Complementarity.........: 3.6084985470647112e-09 3.6084985470647110e-0
6
Overall NLP error.......: 4.4776944093327983e-09 4.4776944093327983e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3000909e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 2.02e-03 9.81e-0
3h 1
2 9.2540939e+02 4.77e+03 5.23e+01 -1.0 2.66e+03 - 1.91e-05 1.78e-0
4h 1
3 3.8379504e+02 4.66e+03 5.24e+01 -1.0 4.77e+03 - 8.68e-05 2.34e-0
2f 1
4 1.7424477e+04 7.01e-02 7.87e+01 -1.0 4.66e+03 - 5.08e-02 1.00e+0
0h 1
5 9.2441130e+03 6.55e-02 5.13e+01 -1.0 1.16e+01 - 3.39e-01 6.13e-0
2f 1
6 7.9204820e+03 2.27e-02 2.21e+01 -1.0 7.02e+00 - 6.27e-01 9.88e-0
1f 1
7 8.2927286e+03 2.17e-03 1.90e-01 -1.0 2.55e+00 - 9.91e-01 1.00e+0
0f 1
8 7.7707352e+03 1.76e-03 6.99e-02 -1.7 6.34e+00 - 1.00e+00 9.92e-0
1f 1
9 7.5980706e+03 1.95e-03 3.69e-01 -2.5 1.68e+00 - 1.00e+00 7.91e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.5727495e+03 1.82e-04 4.79e-02 -2.5 3.46e-01 - 1.00e+00 9.36e-0
1h 1
11 7.5754877e+03 7.05e-06 1.34e-03 -2.5 2.22e-02 - 1.00e+00 1.00e+0
0f 1
12 7.5482488e+03 7.66e-06 4.23e-03 -3.8 8.04e+00 - 1.00e+00 9.79e-0
1f 1
13 7.5480543e+03 1.37e-08 6.27e-06 -3.8 1.66e-01 - 1.00e+00 1.00e+0
0f 1
14 7.5465649e+03 1.73e-08 3.04e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0f 1
15 7.5465477e+03 1.28e-12 4.22e-10 -8.6 5.52e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 7.5465477388211788e+00 7.5465477388211784e+0
3
Dual infeasibility......: 4.2179927613826060e-10 4.2179927613826060e-0
7
Constraint violation....: 1.2800732696049977e-12 1.2800732696049977e-1
2
Complementarity.........: 3.5317019434278965e-09 3.5317019434278964e-0
6
Overall NLP error.......: 3.5317019434278965e-09 3.5317019434278964e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2294726e+02 3.24e+03 5.23e+01 -1.0 3.27e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1945201e+02 3.24e+03 5.23e+01 -1.0 2.47e+03 - 3.93e-05 1.30e-0
4h 1
3 3.4573144e+02 3.17e+03 5.24e+01 -1.0 3.24e+03 - 4.04e-05 2.36e-0
2f 1
4 1.5906615e+04 6.81e-02 7.93e+01 -1.0 3.17e+03 - 4.21e-02 1.00e+0
0h 1
5 7.5933645e+03 6.41e-02 5.66e+01 -1.0 2.00e+01 - 2.81e-01 5.33e-0
2f 1
6 6.3092956e+03 1.54e-02 2.51e+01 -1.0 1.01e+01 - 5.90e-01 8.06e-0
1f 1
7 6.3346294e+03 6.22e-03 2.30e-01 -1.0 1.94e+00 - 9.91e-01 1.00e+0
0f 1
8 5.9359407e+03 1.57e-03 8.52e-02 -1.7 4.62e+00 - 9.46e-01 9.66e-0
1f 1
9 5.7822790e+03 1.58e-03 1.38e-01 -2.5 1.12e+00 - 8.23e-01 7.53e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.7447159e+03 3.81e-04 1.04e-01 -2.5 3.52e-01 - 1.00e+00 8.97e-0
1h 1
11 5.7479197e+03 1.34e-05 4.99e-03 -2.5 6.15e-02 - 1.00e+00 1.00e+0
0f 1
12 5.7227022e+03 1.12e-05 6.56e-03 -3.8 5.36e+00 - 1.00e+00 9.68e-0
1f 1
13 5.7223578e+03 1.60e-08 1.24e-05 -3.8 1.66e-01 - 1.00e+00 1.00e+0
0f 1
14 5.7210148e+03 1.79e-08 5.06e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0f 1
15 5.7210000e+03 6.40e-13 4.12e-10 -8.6 3.67e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.7210000430727082e+00 5.7210000430727077e+0
3
Dual infeasibility......: 4.1156019078997195e-10 4.1156019078997195e-0
7
Constraint violation....: 6.4048766290625281e-13 6.4048766290625281e-1
3
Complementarity.........: 3.3393346883046754e-09 3.3393346883046752e-0
6
Overall NLP error.......: 3.3393346883046754e-09 3.3393346883046752e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4528265e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 3.98e-04 9.81e-0
3f 1
2 8.4160251e+02 2.00e+03 5.24e+01 -1.0 1.48e+03 - 5.90e-05 1.34e-0
4h 1
3 2.7509537e+02 1.95e+03 5.26e+01 -1.0 2.00e+03 - 4.97e-05 2.18e-0
2f 1
4 1.3978763e+04 5.67e-02 8.10e+01 -1.0 1.95e+03 - 4.46e-02 1.00e+0
0h 1
5 5.1663756e+03 5.32e-02 5.38e+01 -1.0 8.22e+01 - 3.29e-01 5.48e-0
2f 1
6 3.0169279e+03 3.33e-02 2.97e+01 -1.0 4.25e+01 - 4.59e-01 5.39e-0
1f 1
7 5.0512416e+03 9.15e-03 1.65e+01 -1.0 2.43e+01 - 5.91e-01 1.00e+0
0h 1
8 3.0927580e+03 7.42e-03 4.15e-01 -1.0 2.10e+01 - 9.67e-01 1.00e+0
0f 1
9 2.7847845e+03 1.00e-03 1.63e-01 -1.7 5.24e+00 - 1.00e+00 9.12e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.6486959e+03 1.59e-03 2.72e-01 -2.5 6.05e+00 - 7.52e-01 1.00e+0
0f 1
11 2.5962169e+03 4.61e-03 3.97e-02 -2.5 2.93e+00 - 1.00e+00 1.00e+0
0h 1
12 2.6062895e+03 2.11e-04 6.40e-03 -2.5 4.76e-01 - 1.00e+00 1.00e+0
0h 1
13 2.5818658e+03 2.58e-04 4.25e-02 -3.8 5.37e+00 - 9.87e-01 8.87e-0
1h 1
14 2.5806677e+03 1.91e-06 1.63e-04 -3.8 6.01e-01 - 1.00e+00 1.00e+0
0h 1
15 2.5794704e+03 3.21e-07 2.10e-03 -5.7 2.97e-01 - 1.00e+00 9.78e-0
1h 1
16 2.5794585e+03 3.73e-11 2.11e-08 -5.7 6.59e-03 - 1.00e+00 1.00e+0
0f 1
17 2.5794438e+03 6.29e-11 1.29e-06 -8.6 3.68e-03 - 1.00e+00 9.99e-0
1h 1
18 2.5794438e+03 7.22e-15 2.51e-14 -8.6 1.24e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 2.5794437943817510e+00 2.5794437943817511e+0
3
Dual infeasibility......: 2.5059164812657464e-14 2.5059164812657464e-1
1
Constraint violation....: 7.2164496600635175e-15 7.2164496600635175e-1
5
Complementarity.........: 4.9910947145570423e-09 4.9910947145570424e-0
6
Overall NLP error.......: 4.9910947145570423e-09 4.9910947145570424e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0771883e+02 9.17e+02 5.23e+01 -1.0 9.24e+02 - 9.83e-04 9.84e-0
3h 1
2 8.9952716e+02 9.17e+02 5.23e+01 -1.0 6.20e+02 - 6.50e-05 3.05e-0
4h 1
3 2.8382095e+02 8.96e+02 5.24e+01 -1.0 9.17e+02 - 2.52e-04 2.33e-0
2f 1
4 1.3374088e+04 6.53e-02 7.63e+01 -1.0 8.96e+02 - 8.27e-02 1.00e+0
0h 1
5 4.8579610e+03 5.89e-02 3.97e+01 -1.0 3.08e+01 - 4.54e-01 8.89e-0
2f 1
6 3.3740342e+03 1.97e-02 1.66e+01 -1.0 1.57e+01 - 6.03e-01 7.16e-0
1f 1
7 3.3962990e+03 5.60e-03 2.73e-01 -1.0 2.18e+00 - 9.85e-01 1.00e+0
0f 1
8 2.9883957e+03 1.47e-03 1.24e-01 -1.7 4.63e+00 - 1.00e+00 1.00e+0
0f 1
9 2.8379075e+03 1.96e-03 4.43e-01 -2.5 3.37e+00 - 1.00e+00 7.76e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8116664e+03 1.76e-04 5.28e-03 -2.5 6.96e-01 - 1.00e+00 1.00e+0
0h 1
11 2.7913074e+03 4.47e-05 1.54e-01 -3.8 8.08e+00 - 1.00e+00 7.56e-0
1h 1
12 2.7858519e+03 1.46e-07 4.13e-04 -3.8 1.95e+00 - 1.00e+00 1.00e+0
0f 1
13 2.7843254e+03 2.93e-08 8.13e-04 -5.7 4.46e-01 - 1.00e+00 9.87e-0
1h 1
14 2.7843103e+03 1.88e-12 1.44e-08 -5.7 5.88e-03 - 1.00e+00 1.00e+0
0f 1
15 2.7842919e+03 2.63e-12 5.21e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 2.7842918894433204e+00 2.7842918894433205e+0
3
Dual infeasibility......: 5.2101690438143766e-09 5.2101690438143766e-0
6
Constraint violation....: 2.6305554956529420e-12 2.6305554956529420e-1
2
Complementarity.........: 3.7933407199787327e-09 3.7933407199787328e-0
6
Overall NLP error.......: 5.2101690438143766e-09 5.2101690438143766e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.05e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 6.36e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281623779e+00 1.6104063281623778e+0
3
Dual infeasibility......: 2.4574297011515741e-12 2.4574297011515741e-0
9
Constraint violation....: 6.3603122732965359e-15 6.3603122732965359e-1
5
Complementarity.........: 2.5062163910051637e-09 2.5062163910051636e-0
6
Overall NLP error.......: 2.5062163910051637e-09 2.5062163910051636e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031320943161440e-09 2.1031320943161440e-0
6
Constraint violation....: 6.2994429117502193e-11 6.2994429117502193e-1
1
Complementarity.........: 2.8882108896910881e-09 2.8882108896910880e-0
6
Overall NLP error.......: 2.8882108896910881e-09 2.8882108896910880e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254149694e-01 6.4890146254149693e+0
2
Dual infeasibility......: 4.9126604805630010e-09 4.9126604805630010e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646095252328627e-09 4.3646095252328623e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126604805630010e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.05e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 6.36e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281623779e+00 1.6104063281623778e+0
3
Dual infeasibility......: 2.4574297011515741e-12 2.4574297011515741e-0
9
Constraint violation....: 6.3603122732965359e-15 6.3603122732965359e-1
5
Complementarity.........: 2.5062163910051637e-09 2.5062163910051636e-0
6
Overall NLP error.......: 2.5062163910051637e-09 2.5062163910051636e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2260299e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 3.29e-04 9.85e-0
3h 1
2 8.1269924e+02 9.17e+02 5.24e+01 -1.0 6.65e+02 - 7.54e-05 3.59e-0
4h 1
3 2.4184175e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 3.16e-04 2.12e-0
2f 1
4 1.2567185e+04 5.49e-02 8.23e+01 -1.0 8.98e+02 - 3.79e-02 1.00e+0
0h 1
5 3.8955825e+03 5.24e-02 5.75e+01 -1.0 8.21e+01 - 3.00e-01 4.94e-0
2f 1
6 1.9119394e+03 3.76e-02 3.09e+01 -1.0 3.91e+01 - 4.67e-01 5.06e-0
1f 1
7 4.6932192e+03 1.23e-02 2.74e+01 -1.0 2.07e+01 - 3.99e-01 1.00e+0
0h 1
8 1.8763380e+03 1.21e-02 1.06e+00 -1.0 2.57e+01 - 9.88e-01 8.88e-0
1f 1
9 1.9957112e+03 2.00e-04 4.81e-02 -1.0 2.81e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7289248e+03 2.20e-04 1.23e+00 -2.5 1.92e+01 - 9.37e-01 5.95e-0
1f 1
11 1.5409153e+03 3.77e-03 1.32e-01 -2.5 7.57e+00 - 7.97e-01 1.00e+0
0f 1
12 1.5181340e+03 5.10e-03 3.05e-01 -2.5 1.80e+00 - 1.00e+00 7.70e-0
1h 1
13 1.5303935e+03 2.39e-04 4.64e-03 -2.5 7.17e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5027999e+03 1.70e-04 2.13e-02 -3.8 1.08e+01 - 9.90e-01 9.30e-0
1h 1
15 1.5018205e+03 7.25e-07 6.85e-05 -3.8 7.29e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003123e+03 3.77e-07 1.76e-04 -5.7 5.94e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003117e+03 3.79e-11 2.93e-09 -5.7 3.99e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932751793789e+00 1.5002932751793790e+0
3
Dual infeasibility......: 2.1693892188796458e-09 2.1693892188796458e-0
6
Constraint violation....: 6.2995691996192704e-11 6.2995691996192704e-1
1
Complementarity.........: 2.8882170478302987e-09 2.8882170478302988e-0
6
Overall NLP error.......: 2.8882170478302987e-09 2.8882170478302988e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
1 8.6507768e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 4.93e-04 9.85e-0
3h 1
2 8.5461326e+02 9.17e+02 5.24e+01 -1.0 6.82e+02 - 7.35e-05 3.85e-0
4h 1
3 2.6184924e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 3.42e-04 2.22e-0
2f 1
4 1.2929370e+04 5.93e-02 8.01e+01 -1.0 8.97e+02 - 4.95e-02 1.00e+0
0h 1
5 4.2893383e+03 5.55e-02 5.39e+01 -1.0 7.44e+01 - 3.17e-01 5.92e-0
2f 1
83 1.874937e+04 1.632511e+04 6.333134e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1154264e+02 1.57e+04 5.50e+01 -1.0 1.59e+04 - 1.75e-04 9.80e-0
3h 1
2 7.0856650e+02 1.57e+04 5.50e+01 -1.0 1.38e+04 - 2.58e-05 1.13e-0
4h 1
3 5.9012913e+02 1.56e+04 5.45e+01 -1.0 1.57e+04 - 1.70e-05 9.57e-0
3h 1
4 6.8119708e+02 1.53e+04 5.33e+01 -1.0 1.56e+04 - 1.02e-02 2.12e-0
2h 1
5 2.2992979e+04 7.31e-02 8.53e+01 -1.0 1.53e+04 - 3.50e-02 1.00e+0
0h 1
6 1.7835288e+04 6.92e-02 3.99e+01 -1.0 4.51e+01 - 5.32e-01 5.53e-0
2f 1
7 1.6619395e+04 4.52e-02 1.40e+01 -1.0 2.19e+01 - 6.33e-01 4.20e-0
1f 1
8 1.7420892e+04 7.47e-03 6.22e-01 -1.0 5.06e+00 - 9.70e-01 1.00e+0
0f 1
9 1.6480444e+04 1.84e-03 4.55e-01 -1.7 1.10e+01 - 5.51e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6475443e+04 2.17e-04 4.14e-01 -1.7 6.42e+00 - 4.57e-01 1.00e+0
0h 1
11 1.6476411e+04 1.18e-04 5.75e-02 -1.7 1.01e+01 - 8.46e-01 1.00e+0
0f 1
12 1.6376058e+04 9.21e-04 5.82e-02 -2.5 4.72e+00 - 9.10e-01 1.00e+0
0f 1
13 1.6350555e+04 1.34e-03 1.23e-02 -2.5 5.45e+00 - 1.00e+00 1.00e+0
0h 1
14 1.6329086e+04 2.17e-04 8.51e-02 -3.8 1.10e+01 - 1.00e+00 8.53e-0
1h 1
15 1.6326638e+04 2.57e-07 1.02e-04 -3.8 3.39e+00 - 1.00e+00 1.00e+0
0h 1
16 1.6325122e+04 4.06e-07 1.00e-04 -5.7 5.94e-01 - 1.00e+00 9.98e-0
1h 1
17 1.6325123e+04 3.80e-11 2.97e-09 -5.7 2.38e-01 - 1.00e+00 1.00e+0
0f 1
18 1.6325106e+04 5.77e-11 2.43e-05 -8.6 7.34e-03 - 1.00e+00 9.60e-0
1h 1
19 1.6325105e+04 9.96e-14 3.25e-12 -8.6 5.50e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.6325105282334654e+01 1.6325105282334654e+0
4
Dual infeasibility......: 3.2501036901573458e-12 3.2501036901573458e-0
9
Constraint violation....: 9.9614760884492171e-14 9.9614760884492171e-1
4
Complementarity.........: 9.3563698982108679e-09 9.3563698982108669e-0
6
Overall NLP error.......: 9.3563698982108679e-09 9.3563698982108669e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9876945e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.75e-04 9.80e-0
3f 1
2 7.9589771e+02 1.50e+04 5.25e+01 -1.0 1.43e+04 - 4.75e-05 1.03e-0
4h 1
3 7.6855773e+02 1.49e+04 5.25e+01 -1.0 1.50e+04 - 6.43e-06 2.05e-0
3h 1
4 5.4431268e+02 1.46e+04 5.26e+01 -1.0 1.49e+04 - 2.19e-03 2.00e-0
2h 1
5 2.5504371e+04 5.52e-02 8.37e+01 -1.0 1.46e+04 - 3.49e-02 1.00e+0
0h 1
6 1.7685870e+04 5.28e-02 5.75e+01 -1.0 7.44e+01 - 3.15e-01 4.82e-0
2f 1
7 1.5945344e+04 4.23e-02 2.90e+01 -1.0 3.45e+01 - 4.93e-01 4.66e-0
1f 1
8 1.6258514e+04 2.65e-02 1.21e+01 -1.0 1.78e+01 - 4.37e-01 1.25e-0
1f 4
9 1.6022809e+04 6.10e-03 1.38e-01 -1.0 4.87e+00 - 9.92e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5738178e+04 1.23e-03 2.92e-01 -1.7 6.98e+00 - 1.00e+00 8.62e-0
1f 1
11 1.5729527e+04 7.40e-04 1.21e-02 -1.7 3.35e+01 - 1.00e+00 1.00e+0
0f 1
12 1.5585586e+04 1.34e-03 9.10e-02 -3.8 3.98e+01 - 7.97e-01 9.32e-0
1f 1
13 1.5560342e+04 1.49e-03 6.43e-02 -3.8 2.69e+00 - 8.47e-01 7.71e-0
1h 1
14 1.5560316e+04 2.72e-06 7.50e-04 -3.8 6.15e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5559225e+04 3.13e-07 6.12e-04 -5.7 2.97e-01 - 1.00e+00 9.88e-0
1h 1
16 1.5559217e+04 3.91e-11 6.21e-09 -5.7 1.04e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5559202e+04 6.30e-11 2.10e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5559202161660357e+01 1.5559202161660356e+0
4
Dual infeasibility......: 2.0959922567371870e-09 2.0959922567371870e-0
6
Constraint violation....: 6.2996885485944176e-11 6.2996885485944176e-1
1
Complementarity.........: 2.8881084978824468e-09 2.8881084978824467e-0
6
Overall NLP error.......: 2.8881084978824468e-09 2.8881084978824467e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8638456e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 6.50e-04 9.80e-0
3h 1
2 8.8357507e+02 1.39e+04 5.24e+01 -1.0 1.32e+04 - 4.25e-05 1.04e-0
4h 1
3 8.4765870e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 7.53e-06 2.63e-0
3h 1
4 5.8995310e+02 1.36e+04 5.24e+01 -1.0 1.39e+04 - 2.84e-03 2.16e-0
2h 1
5 2.5005810e+04 6.47e-02 7.89e+01 -1.0 1.36e+04 - 6.64e-02 1.00e+0
0h 1
6 1.7391198e+04 5.93e-02 4.77e+01 -1.0 5.51e+01 - 3.79e-01 7.61e-0
2f 1
7 1.6073238e+04 2.98e-02 2.07e+01 -1.0 2.75e+01 - 5.53e-01 4.56e-0
1f 1
8 1.5498897e+04 5.83e-03 1.08e+00 -1.0 1.01e+01 - 9.27e-01 7.90e-0
1f 1
9 1.5786120e+04 2.06e-04 6.57e-02 -1.0 3.57e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5116851e+04 2.20e-03 9.46e-02 -2.5 5.22e+00 - 8.72e-01 8.92e-0
1f 1
11 1.5051510e+04 1.06e-03 1.09e+00 -2.5 6.87e-01 - 1.00e+00 4.78e-0
1h 1
12 1.5047011e+04 4.42e-06 8.91e-03 -2.5 2.46e-01 - 1.00e+00 1.00e+0
0h 1
13 1.5027423e+04 2.99e-05 6.26e-02 -3.8 5.36e+00 - 8.44e-01 9.26e-0
1f 1
14 1.5024165e+04 6.03e-04 1.01e-03 -3.8 3.96e-01 - 1.00e+00 1.00e+0
0f 1
15 1.5022921e+04 1.21e-04 7.54e-03 -5.7 2.97e-01 - 8.18e-01 1.00e+0
0h 1
16 1.5022821e+04 5.06e-05 2.29e-05 -5.7 1.11e-02 - 1.00e+00 1.00e+0
0h 1
17 1.5022819e+04 5.60e-06 8.53e-05 -5.7 2.69e-03 - 1.00e+00 9.66e-0
1h 1
18 1.5022823e+04 5.30e-08 8.36e-07 -5.7 3.54e-04 - 1.00e+00 1.00e+0
0f 1
19 1.5022806e+04 5.58e-08 4.11e-06 -8.6 3.68e-03 - 9.98e-01 9.85e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5022806e+04 2.39e-13 2.61e-11 -8.6 5.45e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.5022805953048893e+01 1.5022805953048894e+0
4
Dual infeasibility......: 2.6075818251386061e-11 2.6075818251386061e-0
8
Constraint violation....: 2.3853141684071488e-13 2.3853141684071488e-1
3
Complementarity.........: 2.9837443337912102e-09 2.9837443337912102e-0
6
Overall NLP error.......: 2.9837443337912102e-09 2.9837443337912102e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.028
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4547453e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.98e-04 9.80e-0
3h 1
2 8.4252031e+02 1.27e+04 5.24e+01 -1.0 1.14e+04 - 3.11e-05 1.10e-0
4h 1
3 8.2168337e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 1.44e-05 1.36e-0
3h 1
4 5.1798251e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 1.36e-03 2.12e-0
2h 1
5 2.3988214e+04 5.80e-02 8.24e+01 -1.0 1.24e+04 - 3.38e-02 1.00e+0
0h 1
6 1.5841398e+04 5.51e-02 5.89e+01 -1.0 7.47e+01 - 2.83e-01 4.62e-0
2f 1
7 1.3709773e+04 3.76e-02 3.21e+01 -1.0 3.80e+01 - 4.67e-01 5.75e-0
1f 1
8 1.4049870e+04 1.97e-02 1.73e+01 -1.0 1.86e+01 - 3.51e-01 1.25e-0
1f 4
9 1.3867062e+04 5.13e-03 1.05e+00 -1.0 6.13e+00 - 9.49e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3783748e+04 4.68e-04 1.26e-01 -1.0 4.45e+00 - 9.37e-01 1.00e+0
0f 1
11 1.3471086e+04 3.60e-04 1.13e+00 -2.5 6.28e+00 - 9.27e-01 5.94e-0
1f 1
12 1.3301468e+04 2.07e-03 3.14e-01 -2.5 6.88e+00 - 7.35e-01 1.00e+0
0f 1
13 1.3249790e+04 7.70e-03 1.38e-01 -2.5 3.41e+00 - 1.00e+00 8.44e-0
1h 1
14 1.3259405e+04 3.38e-04 1.14e-02 -2.5 4.57e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3235297e+04 3.01e-04 5.12e-02 -3.8 6.44e+00 - 9.88e-01 8.76e-0
1h 1
16 1.3234268e+04 1.49e-06 1.41e-04 -3.8 3.39e-01 - 1.00e+00 1.00e+0
0h 1
17 1.3233076e+04 3.35e-07 2.12e-03 -5.7 2.94e-01 - 1.00e+00 9.78e-0
1h 1
18 1.3233066e+04 3.82e-11 2.12e-08 -5.7 4.58e-03 - 1.00e+00 1.00e+0
0f 1
19 1.3233051e+04 6.30e-11 4.40e-09 -8.6 3.69e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.3233050935867720e+01 1.3233050935867719e+0
4
Dual infeasibility......: 4.3996555272267962e-09 4.3996555272267962e-0
6
Constraint violation....: 6.3006808104226764e-11 6.3006808104226764e-1
1
Complementarity.........: 3.3104218746429690e-09 3.3104218746429688e-0
6
Overall NLP error.......: 4.3996555272267962e-09 4.3996555272267962e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9413213e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 7.39e-04 9.80e-0
3h 1
2 8.9129061e+02 1.11e+04 5.24e+01 -1.0 1.04e+04 - 4.19e-05 1.06e-0
4h 1
3 8.3481207e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 9.61e-06 3.45e-0
3h 1
4 5.3560589e+02 1.08e+04 5.24e+01 -1.0 1.11e+04 - 3.83e-03 2.15e-0
2h 1
5 2.1931554e+04 6.69e-02 7.80e+01 -1.0 1.08e+04 - 7.89e-02 1.00e+0
0h 1
6 1.4666060e+04 6.05e-02 4.27e+01 -1.0 4.61e+01 - 4.32e-01 8.83e-0
2f 1
7 1.3326354e+04 2.85e-02 1.59e+01 -1.0 2.18e+01 - 6.15e-01 5.35e-0
1f 1
8 1.2993694e+04 4.54e-03 9.34e-01 -1.0 7.21e+00 - 9.46e-01 7.55e-0
1f 1
9 1.3238970e+04 1.46e-04 5.99e-02 -1.0 6.01e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2647817e+04 2.19e-03 8.36e-02 -2.5 4.04e+00 - 8.62e-01 8.44e-0
1f 1
11 1.2477334e+04 2.15e-03 3.32e-01 -2.5 8.80e-01 - 1.00e+00 7.84e-0
1f 1
12 1.2452287e+04 1.55e-04 4.70e-03 -2.5 1.75e-01 - 1.00e+00 1.00e+0
0h 1
13 1.2430461e+04 2.77e-05 5.79e-02 -3.8 5.36e+00 - 1.00e+00 8.51e-0
1h 1
14 1.2427998e+04 7.18e-08 5.86e-04 -3.8 7.96e-01 - 1.00e+00 1.00e+0
0f 1
15 1.2426564e+04 3.96e-08 2.09e-04 -5.7 2.97e-01 - 1.00e+00 9.94e-0
1f 1
16 1.2426561e+04 1.89e-12 1.57e-08 -5.7 1.68e-03 - 1.00e+00 1.00e+0
0f 1
17 1.2426545e+04 2.56e-12 6.74e-07 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
18 1.2426545e+04 8.33e-16 2.51e-14 -8.6 9.04e-08 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.2426544865246399e+01 1.2426544865246398e+0
4
Dual infeasibility......: 2.5091040356528538e-14 2.5091040356528538e-1
1
Constraint violation....: 8.3265867240794175e-16 8.3265867240794175e-1
6
Complementarity.........: 2.5190503751396678e-09 2.5190503751396679e-0
6
Overall NLP error.......: 2.5190503751396678e-09 2.5190503751396679e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891076e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0602418e+02 9.19e+03 5.23e+01 -1.0 8.41e+03 - 3.92e-05 1.08e-0
4h 1
3 8.1828317e+02 9.14e+03 5.24e+01 -1.0 9.19e+03 - 1.24e-05 4.81e-0
3h 1
4 5.0911016e+02 8.95e+03 5.22e+01 -1.0 9.14e+03 - 5.53e-03 2.13e-0
2h 1
5 1.9574028e+04 7.15e-02 7.74e+01 -1.0 8.95e+03 - 8.67e-02 1.00e+0
0h 1
6 1.2972291e+04 6.39e-02 3.14e+01 -1.0 2.60e+01 - 5.69e-01 9.74e-0
2f 1
7 1.1456842e+04 1.98e-02 1.02e+01 -1.0 1.50e+01 - 6.92e-01 7.89e-0
1f 1
8 1.1617387e+04 7.35e-03 8.73e-01 -1.0 3.38e+00 - 9.92e-01 5.00e-0
1f 2
9 1.1302366e+04 1.11e-02 5.20e-01 -1.7 1.03e+01 - 5.20e-01 8.28e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1280424e+04 7.61e-04 7.29e-01 -1.7 1.31e+01 - 6.56e-01 1.00e+0
0f 1
11 1.1287809e+04 7.91e-05 2.71e-03 -1.7 1.22e+01 - 1.00e+00 1.00e+0
0h 1
12 1.1114195e+04 5.73e-04 2.52e-02 -3.8 3.41e+01 - 8.35e-01 8.34e-0
1f 1
13 1.1087182e+04 1.49e-04 7.86e-02 -3.8 5.62e+00 - 9.89e-01 8.38e-0
1h 1
14 1.1084767e+04 1.94e-07 1.06e-01 -3.8 9.11e-01 - 9.16e-01 1.00e+0
0h 1
15 1.1084687e+04 4.72e-09 3.02e-05 -3.8 1.60e-04 - 1.00e+00 1.00e+0
0h 1
16 1.1083373e+04 1.92e-08 3.89e-03 -5.7 2.97e-01 - 1.00e+00 9.68e-0
1f 1
17 1.1083337e+04 5.76e-12 2.63e-08 -5.7 9.61e-03 - 1.00e+00 1.00e+0
0f 1
18 1.1083321e+04 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1083320758704854e+01 1.1083320758704855e+0
4
Dual infeasibility......: 4.4780429934259582e-09 4.4780429934259582e-0
6
Constraint violation....: 2.6337820813182589e-12 2.6337820813182589e-1
2
Complementarity.........: 3.6085483040114407e-09 3.6085483040114406e-0
6
Overall NLP error.......: 4.4780429934259582e-09 4.4780429934259582e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3707629e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 2.45e-03 9.81e-0
3h 1
2 8.5523139e+02 6.68e+03 5.23e+01 -1.0 6.53e+03 - 7.68e-06 3.82e-0
3h 1
3 4.5403987e+02 6.54e+03 5.23e+01 -1.0 6.68e+03 - 4.34e-03 2.17e-0
2h 1
4 1.7781600e+04 7.81e-02 8.07e+01 -1.0 6.54e+03 - 4.36e-02 1.00e+0
0h 1
5 1.1209962e+04 7.33e-02 5.55e+01 -1.0 1.53e+01 - 3.07e-01 5.81e-0
2f 1
6 1.0338040e+04 1.80e-02 1.97e+01 -1.0 7.87e+00 - 6.50e-01 6.82e-0
1f 1
7 1.0329594e+04 8.92e-03 1.89e-01 -1.0 2.93e+00 - 9.91e-01 1.00e+0
0f 1
8 9.9909840e+03 1.40e-03 1.12e-01 -1.7 6.88e+00 - 9.68e-01 1.00e+0
0f 1
9 9.8391525e+03 1.26e-03 1.77e-01 -2.5 2.92e+00 - 8.78e-01 7.86e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.8125231e+03 6.43e-05 8.27e-03 -2.5 1.55e+00 - 1.00e+00 9.89e-0
1f 1
11 9.7857397e+03 2.38e-06 7.13e-04 -3.8 1.06e+01 - 1.00e+00 1.00e+0
0f 1
12 9.7842120e+03 2.13e-08 3.77e-06 -5.7 5.92e-01 - 1.00e+00 1.00e+0
0h 1
13 9.7841926e+03 1.77e-12 4.08e-10 -8.6 7.36e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 13
(scaled) (unscaled)
Objective...............: 9.7841925957897260e+00 9.7841925957897256e+0
3
Dual infeasibility......: 4.0756762773575030e-10 4.0756762773575030e-0
7
Constraint violation....: 1.7684048669863728e-12 1.7684048669863728e-1
2
Complementarity.........: 2.8439616874146508e-09 2.8439616874146508e-0
6
Overall NLP error.......: 2.8439616874146508e-09 2.8439616874146508e-0
6
Number of objective function evaluations = 14
Number of objective gradient evaluations = 14
Number of equality constraint evaluations = 14
Number of inequality constraint evaluations = 14
Number of equality constraint Jacobian evaluations = 14
Number of inequality constraint Jacobian evaluations = 14
Number of Lagrangian Hessian evaluations = 13
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3002852e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 2.02e-03 9.81e-0
3h 1
2 9.2665255e+02 4.77e+03 5.23e+01 -1.0 3.78e+03 - 3.07e-05 1.25e-0
4h 1
3 4.3498191e+02 4.67e+03 5.24e+01 -1.0 4.77e+03 - 3.22e-05 2.12e-0
2f 1
4 1.2082450e+04 8.33e-02 7.86e+01 -1.0 4.67e+03 - 3.26e-02 1.00e+0
0h 1
5 9.1245156e+03 7.96e-02 2.66e+01 -1.0 1.08e+01 - 6.13e-01 4.30e-0
2f 1
6 7.9979665e+03 1.30e-02 1.10e+01 -1.0 9.06e+00 - 6.51e-01 8.24e-0
1f 1
7 8.1341108e+03 8.57e-03 1.53e-01 -1.0 2.78e+00 - 9.92e-01 9.38e-0
1f 1
8 7.7605711e+03 2.57e-03 6.04e-01 -1.7 9.50e+00 - 6.90e-01 1.00e+0
0f 1
9 7.7260188e+03 4.55e-04 5.27e-01 -1.7 1.51e+01 - 6.70e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.7411889e+03 2.76e-05 1.47e-03 -1.7 1.12e+01 - 1.00e+00 1.00e+0
0h 1
11 7.5708413e+03 3.96e-04 2.01e-02 -3.8 3.64e+01 - 8.53e-01 8.42e-0
1f 1
12 7.5517109e+03 9.11e-05 1.41e-01 -3.8 5.62e+00 - 9.98e-01 7.90e-0
1h 1
13 7.5479002e+03 1.60e-07 9.89e-05 -3.8 1.18e+00 - 1.00e+00 1.00e+0
0f 1
14 7.5465631e+03 1.76e-08 3.01e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
15 7.5465477e+03 1.29e-12 4.23e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 7.5465477389354643e+00 7.5465477389354637e+0
3
Dual infeasibility......: 4.2288202519396136e-10 4.2288202519396136e-0
7
Constraint violation....: 1.2856382625159313e-12 1.2856382625159313e-1
2
Complementarity.........: 3.4996713337377576e-09 3.4996713337377575e-0
6
Overall NLP error.......: 3.4996713337377576e-09 3.4996713337377575e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9469463e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3h 1
2 8.9070845e+02 3.24e+03 5.24e+01 -1.0 2.13e+03 - 3.61e-05 1.51e-0
4h 1
3 3.3042115e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 6.40e-05 2.31e-0
2f 1
4 1.5680539e+04 6.28e-02 8.02e+01 -1.0 3.17e+03 - 3.82e-02 1.00e+0
0h 1
5 7.1096018e+03 5.94e-02 5.80e+01 -1.0 5.03e+01 - 2.72e-01 4.93e-0
2f 1
6 5.7281759e+03 2.48e-02 2.85e+01 -1.0 2.32e+01 - 5.13e-01 5.39e-0
1f 1
7 5.1166765e+03 1.01e-02 1.45e+00 -1.0 8.86e+00 - 9.34e-01 7.73e-0
1f 1
8 5.4253179e+03 3.01e-04 8.55e-02 -1.0 3.30e+00 - 9.99e-01 1.00e+0
0f 1
9 4.7996328e+03 2.08e-03 7.85e-02 -2.5 4.57e+00 - 8.62e-01 8.55e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.6289030e+03 2.21e-03 3.37e-01 -2.5 1.04e+00 - 1.00e+00 7.83e-0
1f 1
11 4.6027998e+03 1.45e-04 4.55e-03 -2.5 2.22e-01 - 1.00e+00 1.00e+0
0h 1
12 4.5779299e+03 2.16e-05 4.19e-02 -3.8 8.05e+00 - 1.00e+00 8.86e-0
1h 1
13 4.5759312e+03 5.62e-08 5.97e-04 -3.8 9.12e-01 - 1.00e+00 1.00e+0
0f 1
14 4.5743283e+03 4.27e-08 6.40e-05 -5.7 4.46e-01 - 1.00e+00 9.98e-0
1f 1
15 4.5743286e+03 1.89e-12 1.38e-08 -5.7 1.05e-03 - 1.00e+00 1.00e+0
0f 1
16 4.5743102e+03 2.57e-12 3.30e-06 -8.6 5.53e-03 - 1.00e+00 9.99e-0
1f 1
17 4.5743102e+03 5.47e-15 4.87e-14 -8.6 2.94e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 4.5743102093088170e+00 4.5743102093088173e+0
3
Dual infeasibility......: 4.8656774089539176e-14 4.8656774089539176e-1
1
Constraint violation....: 5.4679831737791829e-15 5.4679831737791829e-1
5
Complementarity.........: 2.6390800087157374e-09 2.6390800087157375e-0
6
Overall NLP error.......: 2.6390800087157374e-09 2.6390800087157375e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4518010e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 3.98e-04 9.82e-0
3f 1
2 8.4053778e+02 2.00e+03 5.24e+01 -1.0 1.16e+03 - 4.81e-05 1.70e-0
4h 1
3 8.2353645e+02 2.00e+03 5.24e+01 -1.0 1.99e+03 - 9.16e-05 6.55e-0
4h 1
4 2.7656041e+02 1.95e+03 5.26e+01 -1.0 2.00e+03 - 7.38e-04 2.15e-0
2f 1
5 1.3590711e+04 5.75e-02 8.12e+01 -1.0 1.95e+03 - 4.60e-02 1.00e+0
0h 1
6 5.1287502e+03 5.39e-02 5.24e+01 -1.0 7.94e+01 - 3.46e-01 5.65e-0
2f 1
7 3.0120352e+03 3.43e-02 2.84e+01 -1.0 4.22e+01 - 4.66e-01 5.35e-0
1f 1
8 4.8303721e+03 7.84e-03 1.41e+01 -1.0 2.16e+01 - 6.33e-01 1.00e+0
0h 1
9 3.1436435e+03 5.61e-03 3.45e-01 -1.0 1.83e+01 - 9.68e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.7927335e+03 1.05e-03 4.76e-02 -1.7 5.61e+00 - 8.78e-01 8.81e-0
1f 1
11 2.6624445e+03 1.03e-03 3.41e-01 -2.5 5.47e+00 - 7.76e-01 1.00e+0
0h 1
12 2.5963520e+03 8.59e-03 4.86e-02 -2.5 3.67e+00 - 1.00e+00 1.00e+0
0h 1
13 2.6068714e+03 3.19e-04 6.33e-03 -2.5 5.02e-01 - 1.00e+00 1.00e+0
0h 1
14 2.5817390e+03 2.17e-04 5.21e-02 -3.8 6.99e+00 - 9.85e-01 8.71e-0
1h 1
15 2.5806495e+03 2.20e-06 1.53e-04 -3.8 2.80e-01 - 1.00e+00 1.00e+0
0h 1
16 2.5794666e+03 3.11e-07 2.15e-03 -5.7 2.90e-01 - 1.00e+00 9.77e-0
1h 1
17 2.5794585e+03 3.61e-11 2.15e-08 -5.7 2.88e-03 - 1.00e+00 1.00e+0
0f 1
18 2.5794438e+03 6.29e-11 1.49e-06 -8.6 3.69e-03 - 1.00e+00 9.99e-0
1h 1
19 2.5794438e+03 7.33e-15 2.53e-14 -8.6 2.14e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 2.5794437943793551e+00 2.5794437943793550e+0
3
Dual infeasibility......: 2.5313084961453569e-14 2.5313084961453569e-1
1
Constraint violation....: 7.3274719625260332e-15 7.3274719625260332e-1
5
Complementarity.........: 4.9880089711061520e-09 4.9880089711061518e-0
6
Overall NLP error.......: 4.9880089711061520e-09 4.9880089711061518e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2260400e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 3.29e-04 9.85e-0
3h 1
2 8.1270024e+02 9.17e+02 5.24e+01 -1.0 6.65e+02 - 7.54e-05 3.59e-0
4h 1
3 2.4184220e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 3.16e-04 2.12e-0
2f 1
4 1.2567193e+04 5.49e-02 8.23e+01 -1.0 8.98e+02 - 3.79e-02 1.00e+0
0h 1
5 3.8955907e+03 5.24e-02 5.75e+01 -1.0 8.21e+01 - 3.00e-01 4.94e-0
2f 1
6 1.9119399e+03 3.76e-02 3.09e+01 -1.0 3.91e+01 - 4.67e-01 5.06e-0
1f 1
7 4.6932269e+03 1.23e-02 2.74e+01 -1.0 2.07e+01 - 3.99e-01 1.00e+0
0h 1
8 1.8763389e+03 1.21e-02 1.06e+00 -1.0 2.57e+01 - 9.88e-01 8.88e-0
1f 1
9 1.9957111e+03 2.00e-04 4.81e-02 -1.0 2.81e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7289250e+03 2.20e-04 1.23e+00 -2.5 1.92e+01 - 9.37e-01 5.95e-0
1f 1
11 1.5409154e+03 3.77e-03 1.32e-01 -2.5 7.57e+00 - 7.97e-01 1.00e+0
0f 1
12 1.5181340e+03 5.10e-03 3.05e-01 -2.5 1.80e+00 - 1.00e+00 7.70e-0
1h 1
13 1.5303935e+03 2.39e-04 4.64e-03 -2.5 7.17e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5027999e+03 1.70e-04 2.13e-02 -3.8 1.08e+01 - 9.90e-01 9.30e-0
1h 1
15 1.5018205e+03 7.25e-07 6.85e-05 -3.8 7.29e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003123e+03 3.77e-07 1.76e-04 -5.7 5.94e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003117e+03 3.79e-11 2.93e-09 -5.7 3.99e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932751793752e+00 1.5002932751793751e+0
3
Dual infeasibility......: 2.1693952293453949e-09 2.1693952293453949e-0
6
Constraint violation....: 6.2995858529646398e-11 6.2995858529646398e-1
1
Complementarity.........: 2.8882170483819938e-09 2.8882170483819938e-0
6
Overall NLP error.......: 2.8882170483819938e-09 2.8882170483819938e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.30e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9758554e+02 4.11e+01 5.96e+01 -1.0 1.43e+01 - 6.96e-04 4.22e-0
2f 1
2 1.2224033e+04 6.06e-02 7.87e+01 -1.0 1.80e+01 - 7.04e-02 1.00e+0
0h 1
3 3.6170164e+03 5.54e-02 5.16e+01 -1.0 5.49e+01 - 3.32e-01 7.83e-0
2f 1
4 2.3474892e+03 2.94e-02 2.29e+01 -1.0 2.73e+01 - 5.43e-01 4.45e-0
1f 1
5 1.7453033e+03 8.58e-03 1.20e+00 -1.0 1.00e+01 - 9.27e-01 7.72e-0
1f 1
6 2.0210792e+03 3.36e-04 8.13e-02 -1.0 3.40e+00 - 1.00e+00 1.00e+0
0h 1
7 1.3898568e+03 2.08e-03 8.01e-02 -2.5 4.92e+00 - 8.66e-01 8.53e-0
1f 1
8 1.2104438e+03 2.16e-03 1.86e-01 -2.5 1.04e+00 - 1.00e+00 8.43e-0
1f 1
9 1.1996795e+03 5.03e-05 5.09e-03 -2.5 1.23e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1927547e+03 2.75e-05 1.75e+00 -3.8 9.03e-02 - 1.00e+00 4.75e-0
1h 1
11 1.1900537e+03 1.04e-06 8.87e-02 -3.8 6.94e-02 - 9.43e-01 1.00e+0
0f 1
12 1.1895890e+03 2.46e-05 1.76e-01 -3.8 2.52e-02 - 1.00e+00 4.57e-0
1h 2
13 1.1893620e+03 3.47e-06 1.29e-04 -3.8 1.19e-02 - 1.00e+00 1.00e+0
0h 1
14 1.1886453e+03 6.73e-06 5.58e-02 -5.7 1.33e-02 - 7.11e-01 9.85e-0
1h 1
15 1.1884704e+03 1.84e-05 2.22e-04 -5.7 6.50e-03 - 9.83e-01 1.00e+0
0f 1
16 1.1884746e+03 7.07e-09 1.30e-06 -5.7 1.33e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1884624e+03 1.56e-08 3.72e-05 -8.6 1.74e-04 - 9.91e-01 9.62e-0
1h 1
18 1.1884620e+03 3.56e-12 5.06e-11 -8.6 6.67e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1884620141834639e+00 1.1884620141834639e+0
3
Dual infeasibility......: 5.0595878871583846e-11 5.0595878871583846e-0
8
Constraint violation....: 3.5573766155039266e-12 3.5573766155039266e-1
2
Complementarity.........: 2.5125712892560961e-09 2.5125712892560960e-0
6
Overall NLP error.......: 2.5125712892560961e-09 2.5125712892560960e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1565540e+02 1.10e+02 1.13e+02 -1.0 3.77e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1395943e+04 5.38e-02 8.36e+01 -1.0 4.54e+01 - 3.09e-02 1.00e+0
0h 1
3 2.7823207e+03 5.17e-02 6.49e+01 -1.0 8.43e+01 - 2.27e-01 4.31e-0
2f 1
4 9.8130957e+02 4.24e-02 3.38e+01 -1.0 3.40e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5884596e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.22e-01 1.00e+0
0h 1
6 9.4486041e+02 1.01e-02 8.70e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6263091e+02 4.58e-04 6.61e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536194e+02 1.94e-03 1.93e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379511e+02 3.25e-03 6.09e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140263e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388121e+02 1.57e-04 1.68e-02 -3.8 7.57e-01 - 9.93e-01 9.42e-0
1h 1
12 5.8370190e+02 7.28e-07 6.65e-05 -3.8 8.53e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278678e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.07e-09 -5.7 3.36e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148959133e-01 5.8277753148959130e+0
2
Dual infeasibility......: 2.0876970729965562e-09 2.0876970729965562e-0
6
Constraint violation....: 6.2994234828472884e-11 6.2994234828472884e-1
1
Complementarity.........: 2.8882094112925391e-09 2.8882094112925390e-0
6
Overall NLP error.......: 2.8882094112925391e-09 2.8882094112925390e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.80e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.4977364e+02 7.52e+01 9.06e+01 -1.0 2.60e+01 - 3.82e-04 3.52e-0
2f 1
2 1.1816093e+04 5.63e-02 8.12e+01 -1.0 2.88e+01 - 4.62e-02 1.00e+0
0h 1
3 3.1563690e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.64e-0
2f 1
4 1.0149187e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8288043e+03 7.32e-03 1.59e+01 -1.0 1.90e+01 - 6.03e-01 1.00e+0
0h 1
6 1.1132459e+03 5.44e-03 4.06e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8140924e+02 9.79e-04 2.02e-01 -1.7 5.70e+00 - 1.00e+00 8.92e-0
1h 1
8 7.2726452e+02 8.60e-04 1.29e-02 -1.7 3.47e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0949027e+02 1.50e-03 1.12e-01 -3.8 4.46e+00 - 7.72e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8220790e+02 2.13e-03 7.56e-02 -3.8 2.09e+00 - 8.08e-01 7.38e-0
1h 1
11 5.8339022e+02 7.15e-05 3.61e-02 -3.8 3.05e-02 - 1.00e+00 9.66e-0
1h 1
12 5.8368704e+02 2.74e-07 1.07e-05 -3.8 4.04e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278916e+02 4.12e-07 5.13e-04 -5.7 3.46e-02 - 1.00e+00 9.92e-0
1h 1
14 5.8278859e+02 4.35e-11 3.44e-09 -5.7 2.53e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.61e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753113976094e-01 5.8277753113976098e+0
2
Dual infeasibility......: 2.6141554008278285e-09 2.6141554008278285e-0
6
Constraint violation....: 6.3001728833889103e-11 6.3001728833889103e-1
1
Complementarity.........: 2.8882627332692871e-09 2.8882627332692872e-0
6
Overall NLP error.......: 2.8882627332692871e-09 2.8882627332692872e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.30e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9758554e+02 4.11e+01 5.96e+01 -1.0 1.43e+01 - 6.96e-04 4.22e-0
2f 1
2 1.2224033e+04 6.06e-02 7.87e+01 -1.0 1.80e+01 - 7.04e-02 1.00e+0
0h 1
3 3.6170164e+03 5.54e-02 5.16e+01 -1.0 5.49e+01 - 3.32e-01 7.83e-0
2f 1
4 2.3474892e+03 2.94e-02 2.29e+01 -1.0 2.73e+01 - 5.43e-01 4.45e-0
1f 1
5 1.7453033e+03 8.58e-03 1.20e+00 -1.0 1.00e+01 - 9.27e-01 7.72e-0
1f 1
6 2.0210792e+03 3.36e-04 8.13e-02 -1.0 3.40e+00 - 1.00e+00 1.00e+0
0h 1
7 1.3898568e+03 2.08e-03 8.01e-02 -2.5 4.92e+00 - 8.66e-01 8.53e-0
1f 1
8 1.2104438e+03 2.16e-03 1.86e-01 -2.5 1.04e+00 - 1.00e+00 8.43e-0
1f 1
9 1.1996795e+03 5.03e-05 5.09e-03 -2.5 1.23e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1927547e+03 2.75e-05 1.75e+00 -3.8 9.03e-02 - 1.00e+00 4.75e-0
1h 1
11 1.1900537e+03 1.04e-06 8.87e-02 -3.8 6.94e-02 - 9.43e-01 1.00e+0
0f 1
12 1.1895890e+03 2.46e-05 1.76e-01 -3.8 2.52e-02 - 1.00e+00 4.57e-0
1h 2
13 1.1893620e+03 3.47e-06 1.29e-04 -3.8 1.19e-02 - 1.00e+00 1.00e+0
0h 1
14 1.1886453e+03 6.73e-06 5.58e-02 -5.7 1.33e-02 - 7.11e-01 9.85e-0
1h 1
15 1.1884704e+03 1.84e-05 2.22e-04 -5.7 6.50e-03 - 9.83e-01 1.00e+0
0f 1
16 1.1884746e+03 7.07e-09 1.30e-06 -5.7 1.33e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1884624e+03 1.56e-08 3.72e-05 -8.6 1.74e-04 - 9.91e-01 9.62e-0
1h 1
18 1.1884620e+03 3.56e-12 5.06e-11 -8.6 6.67e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1884620141834639e+00 1.1884620141834639e+0
3
Dual infeasibility......: 5.0595878871583846e-11 5.0595878871583846e-0
8
Constraint violation....: 3.5573766155039266e-12 3.5573766155039266e-1
2
Complementarity.........: 2.5125712892560961e-09 2.5125712892560960e-0
6
Overall NLP error.......: 2.5125712892560961e-09 2.5125712892560960e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2234563e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 3.29e-04 9.86e-0
3h 1
2 8.1011857e+02 9.17e+02 5.24e+01 -1.0 7.13e+02 - 8.40e-05 4.44e-0
4h 1
3 7.5208287e+02 9.15e+02 5.24e+01 -1.0 9.17e+02 - 4.03e-04 2.16e-0
3h 1
4 2.4682894e+02 8.96e+02 5.25e+01 -1.0 9.15e+02 - 2.69e-03 2.06e-0
2f 1
5 1.1251064e+04 5.73e-02 8.27e+01 -1.0 8.96e+02 - 4.20e-02 1.00e+0
0h 1
6 3.7757466e+03 5.40e-02 4.69e+01 -1.0 7.19e+01 - 4.27e-01 5.49e-0
2f 1
7 1.8936184e+03 3.70e-02 2.37e+01 -1.0 3.92e+01 - 4.93e-01 4.92e-0
1f 1
8 3.8202258e+03 8.52e-03 1.68e+01 -1.0 1.36e+01 - 5.27e-01 1.00e+0
0h 1
9 1.9346925e+03 5.17e-03 3.56e-01 -1.0 1.55e+01 - 9.88e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6818346e+03 4.13e-04 7.72e-02 -1.7 8.22e+00 - 1.00e+00 1.00e+0
0f 1
11 1.5537023e+03 2.16e-03 2.09e-01 -2.5 5.87e+00 - 7.51e-01 1.00e+0
0f 1
12 1.5217319e+03 3.01e-03 4.48e-02 -2.5 1.96e+00 - 1.00e+00 9.65e-0
1h 1
13 1.5307963e+03 1.52e-04 3.57e-03 -2.5 9.02e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5024618e+03 1.69e-04 1.80e-02 -3.8 1.11e+01 - 9.94e-01 9.39e-0
1h 1
15 1.5018187e+03 6.58e-07 6.88e-05 -3.8 4.84e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003119e+03 3.79e-07 1.84e-04 -5.7 5.95e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003117e+03 3.85e-11 3.02e-09 -5.7 7.19e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932750907982e+00 1.5002932750907983e+0
3
Dual infeasibility......: 2.1693801903762134e-09 2.1693801903762134e-0
6
Constraint violation....: 6.2995664240617089e-11 6.2995664240617089e-1
1
Complementarity.........: 2.8882156702630609e-09 2.8882156702630609e-0
6
Overall NLP error.......: 2.8882156702630609e-09 2.8882156702630609e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6486637e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 4.93e-04 9.86e-0
3h 1
2 8.5179238e+02 9.17e+02 5.24e+01 -1.0 7.29e+02 - 8.21e-05 4.82e-0
4h 1
3 7.8783012e+02 9.15e+02 5.24e+01 -1.0 9.17e+02 - 4.40e-04 2.40e-0
3h 1
4 2.6702963e+02 8.95e+02 5.24e+01 -1.0 9.15e+02 - 2.99e-03 2.14e-0
2f 1
5 1.1541169e+04 6.24e-02 8.05e+01 -1.0 8.95e+02 - 5.67e-02 1.00e+0
0h 1
84 1.561126e+04 1.632511e+04 6.392955e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6792846e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.81e-0
3h 1
2 7.6482965e+02 1.57e+04 5.25e+01 -1.0 1.29e+04 - 2.09e-05 1.21e-0
4h 1
3 7.5831640e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 2.56e-05 5.16e-0
4h 1
4 5.2049776e+02 1.54e+04 5.27e+01 -1.0 1.57e+04 - 5.36e-04 1.98e-0
2h 1
5 2.6858962e+04 6.07e-02 8.55e+01 -1.0 1.54e+04 - 2.14e-02 1.00e+0
0h 1
6 1.8313778e+04 5.88e-02 7.30e+01 -1.0 8.58e+01 - 1.53e-01 3.53e-0
2f 1
7 1.6716174e+04 4.60e-02 3.66e+01 -1.0 2.75e+01 - 4.96e-01 4.49e-0
1f 1
8 1.7312391e+04 2.62e-02 1.72e+01 -1.0 1.63e+01 - 4.57e-01 2.50e-0
1f 3
9 1.6758248e+04 6.22e-03 2.10e-01 -1.0 6.24e+00 - 9.90e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6492926e+04 8.82e-04 1.13e+00 -1.7 5.53e+00 - 4.08e-01 9.24e-0
1f 1
11 1.6488875e+04 2.02e-04 4.14e-01 -1.7 8.44e+00 - 7.29e-01 1.00e+0
0f 1
12 1.6492405e+04 1.32e-04 1.60e-01 -1.7 2.19e+01 - 4.92e-01 1.00e+0
0f 1
13 1.6385490e+04 8.59e-04 6.70e-02 -2.5 1.19e+01 - 9.13e-01 1.00e+0
0f 1
14 1.6350986e+04 1.48e-03 1.60e-02 -2.5 1.15e+01 - 1.00e+00 1.00e+0
0h 1
15 1.6329493e+04 2.63e-04 1.06e-01 -3.8 1.21e+01 - 1.00e+00 8.34e-0
1h 1
16 1.6326634e+04 5.48e-07 1.27e-04 -3.8 1.84e+00 - 1.00e+00 1.00e+0
0h 1
17 1.6325122e+04 4.02e-07 1.10e-04 -5.7 5.94e-01 - 1.00e+00 9.98e-0
1h 1
18 1.6325123e+04 3.83e-11 3.01e-09 -5.7 7.70e-03 - 1.00e+00 1.00e+0
0f 1
19 1.6325106e+04 5.80e-11 2.30e-05 -8.6 7.34e-03 - 1.00e+00 9.63e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325105e+04 8.82e-14 2.89e-12 -8.6 3.70e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.6325105282123264e+01 1.6325105282123264e+0
4
Dual infeasibility......: 2.8907918625958596e-12 2.8907918625958596e-0
9
Constraint violation....: 8.8179463730853058e-14 8.8179463730853058e-1
4
Complementarity.........: 9.1396326851899695e-09 9.1396326851899696e-0
6
Overall NLP error.......: 9.1396326851899695e-09 9.1396326851899696e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6676934e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 4.98e-04 9.80e-0
3h 1
2 8.6388327e+02 1.50e+04 5.24e+01 -1.0 1.36e+04 - 2.94e-05 1.09e-0
4h 1
3 8.6193236e+02 1.50e+04 5.24e+01 -1.0 1.49e+04 - 1.27e-05 1.51e-0
4h 1
4 8.5536572e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 1.61e-04 5.16e-0
4h 1
5 5.8296163e+02 1.46e+04 5.25e+01 -1.0 1.50e+04 - 6.90e-04 2.21e-0
2f 1
6 2.6762844e+04 5.99e-02 8.02e+01 -1.0 1.46e+04 - 5.08e-02 1.00e+0
0h 1
7 1.8333378e+04 5.59e-02 5.31e+01 -1.0 7.26e+01 - 3.27e-01 6.07e-0
2f 1
8 1.6748660e+04 3.02e-02 2.75e+01 -1.0 3.87e+01 - 4.76e-01 4.33e-0
1f 1
9 1.6190628e+04 1.45e-02 2.54e+00 -1.0 1.10e+01 - 9.19e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6528221e+04 4.13e-04 8.83e-02 -1.0 4.13e+00 - 9.96e-01 1.00e+0
0f 1
11 1.5942782e+04 6.89e-04 3.79e-01 -2.5 7.90e+00 - 8.83e-01 7.24e-0
1f 1
12 1.5868773e+04 2.38e-04 3.49e-01 -2.5 2.55e+00 - 8.85e-01 1.00e+0
0h 1
13 1.5861054e+04 7.55e-04 4.14e-01 -2.5 1.43e+00 - 1.00e+00 2.19e-0
1h 2
14 1.5841176e+04 8.81e-04 1.08e-02 -2.5 9.25e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5822327e+04 1.21e-03 3.32e-02 -3.8 5.45e+00 - 7.94e-01 1.00e+0
0h 1
16 1.5819222e+04 2.45e-03 9.52e-04 -3.8 4.27e-02 - 1.00e+00 1.00e+0
0h 1
17 1.5819548e+04 4.69e-05 1.20e-04 -3.8 1.48e-02 - 1.00e+00 1.00e+0
0h 1
18 1.5818093e+04 1.03e-04 3.65e-04 -5.7 2.97e-01 - 9.51e-01 9.77e-0
1h 1
19 1.5818078e+04 2.27e-05 3.61e-03 -5.7 6.57e-03 - 1.00e+00 7.81e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5818081e+04 8.86e-09 1.24e-06 -5.7 1.44e-03 - 1.00e+00 1.00e+0
0f 1
21 1.5818064e+04 9.09e-09 1.91e-05 -8.6 3.68e-03 - 1.00e+00 9.83e-0
1h 1
22 1.5818064e+04 1.36e-12 6.44e-11 -8.6 6.12e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.5818063741634454e+01 1.5818063741634454e+0
4
Dual infeasibility......: 6.4427124270936933e-11 6.4427124270936933e-0
8
Constraint violation....: 1.3556933353697787e-12 1.3556933353697787e-1
2
Complementarity.........: 2.5358779066019385e-09 2.5358779066019383e-0
6
Overall NLP error.......: 2.5358779066019385e-09 2.5358779066019383e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6663159e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 4.97e-04 9.80e-0
3h 1
2 8.6380228e+02 1.39e+04 5.24e+01 -1.0 1.32e+04 - 4.46e-05 1.04e-0
4h 1
3 8.2981809e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 7.27e-06 2.45e-0
3h 1
4 5.7278541e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 2.64e-03 2.13e-0
2h 1
5 2.4870492e+04 6.18e-02 8.04e+01 -1.0 1.36e+04 - 5.47e-02 1.00e+0
0h 1
6 1.7166036e+04 5.73e-02 5.00e+01 -1.0 6.81e+01 - 3.66e-01 6.55e-0
2f 1
7 1.5586788e+04 3.04e-02 2.47e+01 -1.0 3.82e+01 - 4.98e-01 4.39e-0
1f 1
8 1.5108141e+04 1.32e-02 2.24e+00 -1.0 1.07e+01 - 9.21e-01 1.00e+0
0f 1
9 1.5385167e+04 3.90e-04 8.04e-02 -1.0 4.29e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4871095e+04 5.17e-04 5.73e-01 -2.5 7.30e+00 - 8.91e-01 6.62e-0
1f 1
11 1.4791323e+04 2.37e-04 3.76e-01 -2.5 2.48e+00 - 8.87e-01 1.00e+0
0h 1
12 1.4770540e+04 6.21e-03 2.47e-01 -2.5 1.64e+00 - 1.00e+00 5.48e-0
1h 1
13 1.4759458e+04 8.25e-04 6.71e-03 -2.5 5.43e-01 - 1.00e+00 1.00e+0
0f 1
14 1.4740960e+04 1.13e-03 2.85e-02 -3.8 5.36e+00 - 8.14e-01 1.00e+0
0h 1
15 1.4738037e+04 2.14e-03 1.05e-03 -3.8 4.67e-02 - 1.00e+00 1.00e+0
0h 1
16 1.4738429e+04 4.79e-05 1.56e-04 -3.8 1.54e-02 - 1.00e+00 1.00e+0
0h 1
17 1.4736951e+04 1.07e-04 4.46e-04 -5.7 2.97e-01 - 9.51e-01 9.83e-0
1h 1
18 1.4736945e+04 2.17e-05 3.52e-03 -5.7 4.97e-03 - 1.00e+00 7.97e-0
1h 1
19 1.4736948e+04 8.51e-09 1.09e-06 -5.7 1.01e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.4736932e+04 8.96e-09 1.93e-05 -8.6 3.68e-03 - 1.00e+00 9.83e-0
1h 1
21 1.4736931e+04 1.38e-12 6.47e-11 -8.6 6.13e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.4736931430974373e+01 1.4736931430974373e+0
4
Dual infeasibility......: 6.4720552812583168e-11 6.4720552812583168e-0
8
Constraint violation....: 1.3780088181647443e-12 1.3780088181647443e-1
2
Complementarity.........: 2.9612443639643024e-09 2.9612443639643023e-0
6
Overall NLP error.......: 2.9612443639643024e-09 2.9612443639643023e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4547453e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.98e-04 9.80e-0
3h 1
2 8.4252031e+02 1.27e+04 5.24e+01 -1.0 1.14e+04 - 3.11e-05 1.10e-0
4h 1
3 8.2164047e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 1.44e-05 1.36e-0
3h 1
4 5.1800640e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 1.37e-03 2.12e-0
2h 1
5 2.3986887e+04 5.80e-02 8.24e+01 -1.0 1.24e+04 - 3.38e-02 1.00e+0
0h 1
6 1.5841028e+04 5.51e-02 5.89e+01 -1.0 7.47e+01 - 2.84e-01 4.62e-0
2f 1
7 1.3709517e+04 3.76e-02 3.21e+01 -1.0 3.80e+01 - 4.67e-01 5.75e-0
1f 1
8 1.4049634e+04 1.98e-02 1.73e+01 -1.0 1.86e+01 - 3.51e-01 1.25e-0
1f 4
9 1.3867322e+04 5.14e-03 1.05e+00 -1.0 6.14e+00 - 9.49e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3783767e+04 4.70e-04 1.26e-01 -1.0 4.46e+00 - 9.37e-01 1.00e+0
0f 1
11 1.3471087e+04 3.61e-04 1.13e+00 -2.5 6.28e+00 - 9.27e-01 5.94e-0
1f 1
12 1.3301482e+04 2.07e-03 3.14e-01 -2.5 6.88e+00 - 7.35e-01 1.00e+0
0f 1
13 1.3249794e+04 7.71e-03 1.38e-01 -2.5 3.42e+00 - 1.00e+00 8.44e-0
1h 1
14 1.3259405e+04 3.38e-04 1.14e-02 -2.5 4.57e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3235297e+04 3.01e-04 5.12e-02 -3.8 6.44e+00 - 9.88e-01 8.76e-0
1h 1
16 1.3234268e+04 1.49e-06 1.41e-04 -3.8 3.39e-01 - 1.00e+00 1.00e+0
0h 1
17 1.3233076e+04 3.35e-07 2.12e-03 -5.7 2.94e-01 - 1.00e+00 9.78e-0
1h 1
18 1.3233066e+04 3.82e-11 2.12e-08 -5.7 4.57e-03 - 1.00e+00 1.00e+0
0f 1
19 1.3233051e+04 6.30e-11 4.40e-09 -8.6 3.69e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.3233050935866927e+01 1.3233050935866928e+0
4
Dual infeasibility......: 4.3996557736761144e-09 4.3996557736761144e-0
6
Constraint violation....: 6.3006877493165803e-11 6.3006877493165803e-1
1
Complementarity.........: 3.3105447495326999e-09 3.3105447495326998e-0
6
Overall NLP error.......: 4.3996557736761144e-09 4.3996557736761144e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6592818e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 4.93e-04 9.80e-0
3h 1
2 8.6294512e+02 1.11e+04 5.24e+01 -1.0 9.80e+03 - 3.04e-05 1.12e-0
4h 1
3 7.2301272e+02 1.10e+04 5.24e+01 -1.0 1.11e+04 - 1.69e-05 8.39e-0
3h 1
4 5.7729031e+02 1.08e+04 5.22e+01 -1.0 1.10e+04 - 9.31e-03 2.05e-0
2h 1
5 1.9796250e+04 6.71e-02 8.00e+01 -1.0 1.08e+04 - 7.41e-02 1.00e+0
0h 1
6 1.4059663e+04 6.07e-02 2.68e+01 -1.0 5.78e+01 - 6.40e-01 8.90e-0
2f 1
7 1.2487468e+04 3.08e-02 3.74e+00 -1.0 3.50e+01 - 8.10e-01 4.95e-0
1f 1
8 1.2329420e+04 8.57e-03 4.54e-01 -1.0 9.03e+00 - 9.42e-01 1.00e+0
0f 1
9 1.2074408e+04 2.22e-03 5.70e-01 -1.7 3.97e+00 - 5.82e-01 7.42e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2070637e+04 1.62e-04 9.43e-01 -1.7 7.81e+00 - 5.74e-01 1.00e+0
0f 1
11 1.2068922e+04 6.21e-05 2.53e-01 -1.7 1.33e+01 - 6.62e-01 1.00e+0
0f 1
12 1.2087901e+04 1.42e-05 3.49e-03 -1.7 1.85e+01 - 9.86e-01 1.00e+0
0f 1
13 1.1983190e+04 6.64e-05 1.65e-02 -2.5 3.48e+01 - 1.00e+00 9.87e-0
1f 1
14 1.1958909e+04 3.00e-03 8.00e-02 -3.8 8.89e+00 - 6.44e-01 9.89e-0
1h 1
15 1.1953998e+04 5.88e-03 1.26e-02 -3.8 9.62e-02 - 8.42e-01 1.00e+0
0h 1
16 1.1954451e+04 6.44e-05 4.99e-04 -3.8 1.38e-02 - 1.00e+00 1.00e+0
0h 1
17 1.1952811e+04 1.24e-04 7.71e-04 -5.7 4.46e-01 - 9.40e-01 9.92e-0
1h 1
18 1.1952807e+04 3.74e-05 5.77e-03 -5.7 3.58e-03 - 1.00e+00 7.01e-0
1h 1
19 1.1952816e+04 1.36e-08 1.59e-06 -5.7 1.07e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.1952797e+04 9.32e-09 2.47e-05 -8.6 5.53e-03 - 1.00e+00 9.82e-0
1h 1
21 1.1952797e+04 1.76e-12 9.24e-11 -8.6 1.02e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.1952796974946079e+01 1.1952796974946079e+0
4
Dual infeasibility......: 9.2389840074298644e-11 9.2389840074298644e-0
8
Constraint violation....: 1.7581491817963979e-12 1.7581491817963979e-1
2
Complementarity.........: 3.1330572906794756e-09 3.1330572906794754e-0
6
Overall NLP error.......: 3.1330572906794756e-09 3.1330572906794754e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8777320e+02 9.19e+03 5.24e+01 -1.0 9.28e+03 - 6.64e-04 9.80e-0
3h 1
2 8.8499164e+02 9.19e+03 5.24e+01 -1.0 8.96e+03 - 8.88e-05 1.02e-0
4h 1
3 8.6604553e+02 9.18e+03 5.24e+01 -1.0 9.18e+03 - 4.81e-06 1.03e-0
3f 1
4 4.6753384e+02 8.97e+03 5.24e+01 -1.0 9.18e+03 - 1.16e-03 2.24e-0
2h 1
5 2.1019834e+04 6.31e-02 7.87e+01 -1.0 8.97e+03 - 6.27e-02 1.00e+0
0h 1
6 1.2779542e+04 5.82e-02 5.04e+01 -1.0 5.68e+01 - 3.45e-01 7.15e-0
2f 1
7 1.1474093e+04 2.98e-02 2.31e+01 -1.0 2.74e+01 - 5.30e-01 4.48e-0
1f 1
8 1.0826912e+04 8.86e-03 1.29e+00 -1.0 1.03e+01 - 9.25e-01 7.95e-0
1f 1
9 1.1132672e+04 2.56e-04 7.50e-02 -1.0 3.69e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.0462579e+04 2.14e-03 9.04e-02 -2.5 5.27e+00 - 8.69e-01 8.83e-0
1f 1
11 1.0356962e+04 1.11e-03 4.48e-01 -2.5 8.53e-01 - 1.00e+00 6.12e-0
1f 1
12 1.0357041e+04 2.64e-06 8.39e-03 -2.5 1.73e-01 - 1.00e+00 1.00e+0
0h 1
13 1.0339021e+04 7.22e-06 6.55e-03 -3.8 2.68e+00 - 9.00e-01 8.93e-0
1f 1
14 1.0335760e+04 4.68e-04 3.83e-04 -3.8 2.86e-01 - 1.00e+00 1.00e+0
0f 1
15 1.0334765e+04 6.30e-05 1.15e-02 -5.7 1.49e-01 - 8.13e-01 1.00e+0
0h 1
16 1.0334649e+04 3.63e-05 4.09e-05 -5.7 9.71e-03 - 1.00e+00 1.00e+0
0h 1
17 1.0334650e+04 1.61e-06 3.43e-05 -5.7 1.54e-03 - 1.00e+00 9.90e-0
1h 1
18 1.0334653e+04 3.53e-08 5.13e-07 -5.7 2.92e-04 - 1.00e+00 1.00e+0
0f 1
19 1.0334638e+04 3.96e-08 7.26e-06 -8.6 1.84e-03 - 9.97e-01 9.81e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.0334638e+04 5.32e-13 2.97e-11 -8.6 3.54e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.0334637965283328e+01 1.0334637965283328e+0
4
Dual infeasibility......: 2.9731376407046716e-11 2.9731376407046716e-0
8
Constraint violation....: 5.3157478419052495e-13 5.3157478419052495e-1
3
Complementarity.........: 2.5100786379180987e-09 2.5100786379180988e-0
6
Overall NLP error.......: 2.5100786379180987e-09 2.5100786379180988e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2296054e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1571270e+02 6.70e+03 5.23e+01 -1.0 4.60e+03 - 1.30e-05 3.15e-0
4h 1
3 4.2797948e+02 6.55e+03 5.24e+01 -1.0 6.70e+03 - 2.24e-04 2.35e-0
2h 1
4 1.9299628e+04 6.83e-02 7.77e+01 -1.0 6.55e+03 - 6.26e-02 1.00e+0
0h 1
5 1.1011211e+04 6.30e-02 4.17e+01 -1.0 1.59e+01 - 4.45e-01 7.15e-0
2f 1
6 9.6133739e+03 1.74e-02 1.83e+01 -1.0 9.77e+00 - 6.18e-01 9.11e-0
1f 1
7 9.8840102e+03 2.09e-03 1.66e-01 -1.0 2.94e+00 - 9.91e-01 1.00e+0
0f 1
8 9.4106165e+03 1.73e-03 1.03e-01 -1.7 8.33e+00 - 1.00e+00 1.00e+0
0f 1
9 9.2373078e+03 2.02e-03 3.90e-01 -2.5 5.16e+00 - 1.00e+00 7.86e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.2145210e+03 2.75e-04 8.28e-02 -2.5 1.09e+00 - 1.00e+00 9.10e-0
1h 1
11 9.2179467e+03 1.04e-05 3.29e-03 -2.5 9.89e-02 - 1.00e+00 1.00e+0
0f 1
12 9.1855792e+03 1.00e-05 9.82e-03 -3.8 1.34e+01 - 1.00e+00 9.56e-0
1f 1
13 9.1846100e+03 1.55e-08 1.45e-05 -3.8 5.87e-01 - 1.00e+00 1.00e+0
0f 1
14 9.1828211e+03 1.79e-08 5.06e-06 -5.7 7.43e-01 - 1.00e+00 1.00e+0
0f 1
15 9.1828008e+03 6.40e-13 4.11e-10 -8.6 9.20e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 9.1828007874907822e+00 9.1828007874907817e+0
3
Dual infeasibility......: 4.1130978003420159e-10 4.1130978003420159e-0
7
Constraint violation....: 6.4026561830132778e-13 6.4026561830132778e-1
3
Complementarity.........: 2.7858601602308260e-09 2.7858601602308260e-0
6
Overall NLP error.......: 2.7858601602308260e-09 2.7858601602308260e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8775283e+02 4.77e+03 5.24e+01 -1.0 4.82e+03 - 6.64e-04 9.80e-0
3f 1
2 8.8490545e+02 4.77e+03 5.24e+01 -1.0 4.54e+03 - 9.09e-05 1.04e-0
4h 1
3 8.3891577e+02 4.76e+03 5.24e+01 -1.0 4.77e+03 - 9.27e-06 2.02e-0
3f 1
4 3.6771363e+02 4.66e+03 5.24e+01 -1.0 4.76e+03 - 2.59e-03 2.19e-0
2h 1
5 1.5982222e+04 6.47e-02 7.88e+01 -1.0 4.66e+03 - 6.69e-02 1.00e+0
0h 1
6 8.2942245e+03 5.93e-02 4.78e+01 -1.0 5.43e+01 - 3.77e-01 7.64e-0
2f 1
7 6.9811110e+03 2.94e-02 2.07e+01 -1.0 2.67e+01 - 5.54e-01 4.62e-0
1f 1
8 6.4193393e+03 6.17e-03 1.02e+00 -1.0 9.91e+00 - 9.28e-01 7.77e-0
1f 1
9 6.6977348e+03 2.38e-04 6.93e-02 -1.0 3.42e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0467842e+03 2.17e-03 8.37e-02 -2.5 5.05e+00 - 8.70e-01 8.75e-0
1f 1
11 5.9396938e+03 1.10e-03 4.47e-01 -2.5 8.28e-01 - 1.00e+00 6.10e-0
1f 1
12 5.9395944e+03 2.61e-06 8.30e-03 -2.5 1.67e-01 - 1.00e+00 1.00e+0
0h 1
13 5.9215589e+03 6.87e-06 1.24e-02 -3.8 2.68e+00 - 9.05e-01 8.92e-0
1f 1
14 5.9183066e+03 4.65e-04 4.13e-04 -3.8 2.89e-01 - 1.00e+00 1.00e+0
0f 1
15 5.9173128e+03 6.28e-05 1.14e-02 -5.7 1.49e-01 - 8.14e-01 1.00e+0
0h 1
16 5.9171977e+03 3.58e-05 4.03e-05 -5.7 9.65e-03 - 1.00e+00 1.00e+0
0h 1
17 5.9171990e+03 1.44e-06 2.56e-05 -5.7 1.50e-03 - 1.00e+00 9.93e-0
1h 1
18 5.9172014e+03 3.51e-08 4.96e-07 -5.7 2.91e-04 - 1.00e+00 1.00e+0
0f 1
19 5.9171868e+03 3.95e-08 7.31e-06 -8.6 1.84e-03 - 9.97e-01 9.81e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 5.9171866e+03 5.37e-13 2.98e-11 -8.6 3.55e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 5.9171865524727005e+00 5.9171865524727000e+0
3
Dual infeasibility......: 2.9758893358476047e-11 2.9758893358476047e-0
8
Constraint violation....: 5.3690385470872570e-13 5.3690385470872570e-1
3
Complementarity.........: 2.5100799351838652e-09 2.5100799351838651e-0
6
Overall NLP error.......: 2.5100799351838652e-09 2.5100799351838651e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6642462e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 4.97e-04 9.81e-0
3h 1
2 8.6166973e+02 3.24e+03 5.24e+01 -1.0 1.78e+03 - 3.43e-05 1.80e-0
4h 1
3 3.1407266e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 9.62e-05 2.24e-0
2f 1
4 1.5404000e+04 5.91e-02 8.11e+01 -1.0 3.17e+03 - 3.62e-02 1.00e+0
0h 1
5 6.7204816e+03 5.60e-02 5.89e+01 -1.0 7.11e+01 - 2.71e-01 4.74e-0
2f 1
6 4.9268594e+03 2.53e-02 3.18e+01 -1.0 3.51e+01 - 4.68e-01 5.22e-0
1f 1
7 4.4315069e+03 1.19e-02 2.56e+00 -1.0 9.58e+00 - 9.27e-01 1.00e+0
0f 1
8 4.7750401e+03 6.02e-04 6.76e-02 -1.0 2.91e+00 - 9.97e-01 1.00e+0
0f 1
9 4.1958083e+03 6.59e-04 3.54e-01 -2.5 7.48e+00 - 8.90e-01 7.46e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.1311794e+03 2.03e-04 2.33e-01 -2.5 3.64e+00 - 9.11e-01 1.00e+0
0h 1
11 4.1149279e+03 1.80e-04 1.07e-01 -2.5 9.31e-01 - 1.00e+00 7.31e-0
1H 1
12 4.1119663e+03 3.45e-04 2.18e-03 -2.5 1.46e-01 - 1.00e+00 1.00e+0
0f 1
13 4.0880964e+03 1.22e-03 3.17e-02 -3.8 1.07e+01 - 7.97e-01 1.00e+0
0h 1
14 4.0847468e+03 2.76e-03 1.10e-03 -3.8 4.88e-02 - 1.00e+00 1.00e+0
0h 1
15 4.0851060e+03 3.91e-05 1.31e-04 -3.8 1.37e-02 - 1.00e+00 1.00e+0
0h 1
16 4.0833633e+03 1.01e-04 3.57e-04 -5.7 5.94e-01 - 9.51e-01 9.77e-0
1h 1
17 4.0833439e+03 2.19e-05 3.67e-03 -5.7 1.35e-02 - 1.00e+00 7.84e-0
1h 1
18 4.0833449e+03 8.57e-09 1.20e-06 -5.7 2.92e-03 - 1.00e+00 1.00e+0
0f 1
19 4.0833247e+03 9.02e-09 1.93e-05 -8.6 7.37e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 4.0833244e+03 1.37e-12 6.48e-11 -8.6 1.22e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 4.0833244010562142e+00 4.0833244010562139e+0
3
Dual infeasibility......: 6.4815378309777481e-11 6.4815378309777481e-0
8
Constraint violation....: 1.3692380562702056e-12 1.3692380562702056e-1
2
Complementarity.........: 2.7568115854230719e-09 2.7568115854230718e-0
6
Overall NLP error.......: 2.7568115854230719e-09 2.7568115854230718e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1576532e+02 2.00e+03 5.23e+01 -1.0 2.01e+03 - 1.20e-03 9.82e-0
3h 1
2 9.1032836e+02 2.00e+03 5.23e+01 -1.0 1.03e+03 - 3.89e-05 2.05e-0
4h 1
3 8.9169582e+02 1.99e+03 5.23e+01 -1.0 1.99e+03 - 1.27e-04 7.33e-0
4h 1
4 3.1451619e+02 1.95e+03 5.24e+01 -1.0 2.00e+03 - 8.51e-04 2.31e-0
2f 1
5 1.4206160e+04 6.77e-02 7.65e+01 -1.0 1.95e+03 - 8.14e-02 1.00e+0
0h 1
6 6.0885035e+03 6.11e-02 3.13e+01 -1.0 2.05e+01 - 5.61e-01 8.85e-0
2f 1
7 4.5608598e+03 1.69e-02 1.34e+01 -1.0 1.27e+01 - 6.30e-01 8.72e-0
1f 1
8 4.8973623e+03 1.32e-03 2.99e-01 -1.0 3.87e+00 - 9.78e-01 1.00e+0
0f 1
9 4.4190695e+03 1.95e-03 4.03e-01 -1.7 6.16e+00 - 7.74e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.3635204e+03 6.43e-04 5.88e-01 -1.7 1.04e+01 - 5.82e-01 1.00e+0
0h 1
11 4.3813552e+03 1.08e-05 1.51e-01 -1.7 1.77e+01 - 7.68e-01 1.00e+0
0h 1
12 4.2193220e+03 4.63e-04 2.09e-02 -2.5 2.29e+01 - 9.67e-01 9.39e-0
1f 1
13 4.1877494e+03 1.60e-04 1.38e-01 -3.8 1.45e+01 - 9.82e-01 7.39e-0
1h 1
14 4.1815807e+03 4.27e-07 6.80e-04 -3.8 2.51e+00 - 1.00e+00 1.00e+0
0h 1
15 4.1805040e+03 2.64e-08 2.78e-06 -5.7 1.28e-02 - 1.00e+00 1.00e+0
0h 1
16 4.1804892e+03 7.15e-11 1.84e-06 -8.6 3.24e-03 - 1.00e+00 9.97e-0
1h 1
17 4.1804892e+03 3.21e-15 2.88e-04 -8.6 1.00e-05 - 7.22e-01 1.00e+0
0f 1
18 4.1804892e+03 3.55e-15 2.51e-14 -8.6 6.59e-06 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 4.1804891618877935e+00 4.1804891618877937e+0
3
Dual infeasibility......: 2.5059663681756452e-14 2.5059663681756452e-1
1
Constraint violation....: 3.5527136788005009e-15 3.5527136788005009e-1
5
Complementarity.........: 3.1095534278224678e-09 3.1095534278224677e-0
6
Overall NLP error.......: 3.1095534278224678e-09 3.1095534278224677e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6555975e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 4.97e-04 9.86e-0
3h 1
2 8.5246197e+02 9.17e+02 5.24e+01 -1.0 7.30e+02 - 8.21e-05 4.83e-0
4h 1
3 7.8833472e+02 9.15e+02 5.24e+01 -1.0 9.17e+02 - 4.41e-04 2.41e-0
3h 1
4 2.6738790e+02 8.95e+02 5.24e+01 -1.0 9.15e+02 - 3.00e-03 2.14e-0
2f 1
5 1.1545110e+04 6.25e-02 8.04e+01 -1.0 8.95e+02 - 5.69e-02 1.00e+0
0h 1
6 4.1431485e+03 5.79e-02 4.82e+01 -1.0 6.62e+01 - 3.87e-01 6.82e-0
2f 1
7 2.5701489e+03 3.04e-02 2.31e+01 -1.0 3.78e+01 - 5.11e-01 4.42e-0
1f 1
8 2.1270809e+03 1.26e-02 2.08e+00 -1.0 1.05e+01 - 9.22e-01 1.00e+0
0f 1
9 2.3828248e+03 3.93e-04 6.04e-02 -1.0 4.29e+00 - 9.92e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8967149e+03 5.07e-04 6.52e-01 -2.5 7.11e+00 - 8.93e-01 6.38e-0
1f 1
11 1.8182900e+03 2.37e-04 3.83e-01 -2.5 4.08e+00 - 8.89e-01 1.00e+0
0h 1
12 1.7947264e+03 5.98e-03 2.12e-01 -2.5 1.70e+00 - 1.00e+00 6.15e-0
1h 1
13 1.7856673e+03 6.79e-04 5.33e-03 -2.5 4.57e-01 - 1.00e+00 1.00e+0
0f 1
14 1.7614111e+03 1.15e-03 2.94e-02 -3.8 1.11e+01 - 8.09e-01 1.00e+0
0h 1
15 1.7585883e+03 2.27e-03 1.06e-03 -3.8 1.99e-01 - 1.00e+00 1.00e+0
0h 1
16 1.7589675e+03 4.43e-05 1.46e-04 -3.8 1.49e-02 - 1.00e+00 1.00e+0
0h 1
17 1.7572037e+03 1.05e-04 4.23e-04 -5.7 5.96e-01 - 9.51e-01 9.82e-0
1h 1
18 1.7571910e+03 2.18e-05 3.57e-03 -5.7 1.03e-02 - 1.00e+00 7.93e-0
1h 1
19 1.7571934e+03 8.55e-09 1.12e-06 -5.7 2.12e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7571732e+03 8.98e-09 1.93e-05 -8.6 7.37e-03 - 1.00e+00 9.83e-0
1h 1
21 1.7571729e+03 1.38e-12 6.48e-11 -8.6 1.22e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.7571729200757682e+00 1.7571729200757682e+0
3
Dual infeasibility......: 6.4770309277037848e-11 6.4770309277037848e-0
8
Constraint violation....: 1.3761214390228815e-12 1.3761214390228815e-1
2
Complementarity.........: 2.5092048842977800e-09 2.5092048842977799e-0
6
Overall NLP error.......: 2.5092048842977800e-09 2.5092048842977799e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318724481455e-09 2.1031318724481455e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896894379e-09 2.8882108896894380e-0
6
Overall NLP error.......: 2.8882108896894379e-09 2.8882108896894380e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318724481455e-09 2.1031318724481455e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896894379e-09 2.8882108896894380e-0
6
Overall NLP error.......: 2.8882108896894379e-09 2.8882108896894380e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101521e-01 6.4890146112101525e+0
2
Dual infeasibility......: 4.9126605618489413e-09 4.9126605618489413e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984918224e-09 4.3646094984918221e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605618489413e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.04e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.57e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235660171e+00 1.6104063235660171e+0
3
Dual infeasibility......: 2.4574009793760635e-12 2.4574009793760635e-0
9
Constraint violation....: 7.5703172614159067e-16 7.5703172614159067e-1
6
Complementarity.........: 2.5062163919681798e-09 2.5062163919681799e-0
6
Overall NLP error.......: 2.5062163919681798e-09 2.5062163919681799e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2303872e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 3.31e-04 9.86e-0
3h 1
2 8.0919006e+02 9.17e+02 5.24e+01 -1.0 7.37e+02 - 8.12e-05 5.04e-0
4h 1
3 2.4239398e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 4.72e-04 2.11e-0
2f 1
4 1.2489447e+04 5.50e-02 8.23e+01 -1.0 8.98e+02 - 3.83e-02 1.00e+0
0h 1
5 3.8941148e+03 5.25e-02 5.67e+01 -1.0 8.14e+01 - 3.09e-01 4.98e-0
2f 1
6 1.9112633e+03 3.73e-02 3.04e+01 -1.0 3.92e+01 - 4.68e-01 5.06e-0
1f 1
7 4.6876227e+03 1.23e-02 2.71e+01 -1.0 2.07e+01 - 3.99e-01 1.00e+0
0h 1
8 1.8763004e+03 1.20e-02 1.04e+00 -1.0 2.56e+01 - 9.88e-01 8.91e-0
1f 1
9 1.9981274e+03 1.95e-04 4.76e-02 -1.0 2.98e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7321093e+03 2.19e-04 1.23e+00 -2.5 1.80e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5439398e+03 3.77e-03 1.33e-01 -2.5 7.59e+00 - 7.95e-01 1.00e+0
0f 1
12 1.5209204e+03 5.17e-03 3.09e-01 -2.5 1.82e+00 - 1.00e+00 7.67e-0
1h 1
13 1.5332321e+03 2.41e-04 4.72e-03 -2.5 7.16e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5031438e+03 1.70e-04 2.15e-02 -3.8 1.35e+01 - 9.90e-01 9.29e-0
1h 1
15 1.5019709e+03 7.24e-07 6.84e-05 -3.8 9.19e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003148e+03 3.77e-07 1.78e-04 -5.7 7.43e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.79e-11 2.92e-09 -5.7 4.20e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932772896143e+00 1.5002932772896143e+0
3
Dual infeasibility......: 2.1737232849336558e-09 2.1737232849336558e-0
6
Constraint violation....: 6.2995803018495167e-11 6.2995803018495167e-1
1
Complementarity.........: 2.8882174443527476e-09 2.8882174443527476e-0
6
Overall NLP error.......: 2.8882174443527476e-09 2.8882174443527476e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
1 8.6555952e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 4.97e-04 9.86e-0
3h 1
2 8.5049278e+02 9.17e+02 5.24e+01 -1.0 7.54e+02 - 7.94e-05 5.56e-0
4h 1
3 2.6243053e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 5.25e-04 2.21e-0
2h 1
4 1.2843590e+04 5.96e-02 8.01e+01 -1.0 8.97e+02 - 5.01e-02 1.00e+0
0h 1
5 4.2877637e+03 5.57e-02 5.36e+01 -1.0 7.35e+01 - 3.21e-01 5.99e-0
2f 1
85 1.289232e+04 1.632511e+04 6.450022e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2432714e+02 1.57e+04 5.24e+01 -1.0 1.59e+04 - 3.31e-04 9.81e-0
3h 1
2 8.2123420e+02 1.57e+04 5.24e+01 -1.0 1.27e+04 - 1.98e-05 1.23e-0
4h 1
3 8.1117528e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 2.72e-05 8.09e-0
4h 1
4 5.6538110e+02 1.54e+04 5.26e+01 -1.0 1.57e+04 - 8.28e-04 2.09e-0
2h 1
5 2.7151227e+04 5.53e-02 8.37e+01 -1.0 1.54e+04 - 2.37e-02 1.00e+0
0h 1
6 1.8788568e+04 5.34e-02 6.85e+01 -1.0 8.24e+01 - 1.86e-01 3.71e-0
2f 1
7 1.6803734e+04 4.35e-02 3.67e+01 -1.0 3.40e+01 - 4.71e-01 5.47e-0
1f 1
8 1.7140569e+04 2.11e-02 1.94e+01 -1.0 1.94e+01 - 3.72e-01 1.25e-0
1f 4
9 1.6795473e+04 6.83e-03 4.33e-01 -1.0 7.81e+00 - 9.82e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6510671e+04 1.63e-03 3.70e-01 -1.7 4.95e+00 - 9.76e-01 8.20e-0
1f 1
11 1.6514297e+04 8.51e-04 3.59e-01 -1.7 5.16e+01 - 7.16e-02 1.00e+0
0f 1
12 1.6534834e+04 1.08e-05 9.69e-04 -1.7 2.14e+01 - 1.00e+00 1.00e+0
0h 1
13 1.6352435e+04 1.24e-03 9.74e-02 -3.8 7.97e+01 - 7.93e-01 9.24e-0
1f 1
14 1.6326241e+04 1.56e-03 5.50e-02 -3.8 1.81e+00 - 8.36e-01 7.74e-0
1h 1
15 1.6326494e+04 2.54e-06 7.68e-04 -3.8 2.54e-01 - 1.00e+00 1.00e+0
0h 1
16 1.6325135e+04 3.03e-07 7.38e-04 -5.7 5.94e-01 - 1.00e+00 9.87e-0
1h 1
17 1.6325123e+04 3.90e-11 6.14e-09 -5.7 8.73e-02 - 1.00e+00 1.00e+0
0f 1
18 1.6325106e+04 5.76e-11 2.74e-05 -8.6 7.33e-03 - 1.00e+00 9.58e-0
1h 1
19 1.6325105e+04 1.13e-13 3.89e-12 -8.6 1.23e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.6325105282556795e+01 1.6325105282556795e+0
4
Dual infeasibility......: 3.8904309535313412e-12 3.8904309535313412e-0
9
Constraint violation....: 1.1284029266533935e-13 1.1284029266533935e-1
3
Complementarity.........: 9.5838885828909693e-09 9.5838885828909695e-0
6
Overall NLP error.......: 9.5838885828909693e-09 9.5838885828909695e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9225646e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.64e-04 9.80e-0
3f 1
2 7.8942213e+02 1.50e+04 5.25e+01 -1.0 1.48e+04 - 9.52e-05 1.00e-0
4h 1
3 7.8170927e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 2.83e-06 5.80e-0
4f 1
4 5.2281552e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 6.18e-04 2.03e-0
2h 1
5 2.6203227e+04 5.40e-02 8.38e+01 -1.0 1.47e+04 - 3.24e-02 1.00e+0
0h 1
6 1.7690202e+04 5.18e-02 6.38e+01 -1.0 8.06e+01 - 2.42e-01 4.50e-0
2f 1
7 1.5948436e+04 4.29e-02 3.26e+01 -1.0 3.30e+01 - 4.86e-01 4.64e-0
1f 1
8 1.6265612e+04 2.68e-02 1.43e+01 -1.0 1.79e+01 - 4.33e-01 1.25e-0
1f 4
9 1.6015509e+04 6.01e-03 1.46e-01 -1.0 4.94e+00 - 9.92e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5733624e+04 1.19e-03 2.76e-01 -1.7 4.61e+00 - 1.00e+00 8.68e-0
1f 1
11 1.5708922e+04 7.68e-04 1.10e-02 -1.7 1.57e+01 - 1.00e+00 1.00e+0
0f 1
12 1.5584125e+04 1.33e-03 8.93e-02 -3.8 1.99e+01 - 7.99e-01 9.32e-0
1f 1
13 1.5559913e+04 1.47e-03 6.38e-02 -3.8 1.70e+00 - 8.49e-01 7.73e-0
1h 1
14 1.5560166e+04 2.69e-06 7.40e-04 -3.8 3.04e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5559221e+04 3.16e-07 6.09e-04 -5.7 1.49e-01 - 1.00e+00 9.88e-0
1h 1
16 1.5559215e+04 3.95e-11 6.17e-09 -5.7 1.23e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5559202e+04 6.30e-11 2.09e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5559202161137945e+01 1.5559202161137944e+0
4
Dual infeasibility......: 2.0878333417267224e-09 2.0878333417267224e-0
6
Constraint violation....: 6.2996233229917209e-11 6.2996233229917209e-1
1
Complementarity.........: 2.8881089270670842e-09 2.8881089270670840e-0
6
Overall NLP error.......: 2.8881089270670842e-09 2.8881089270670840e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4129288e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.82e-04 9.80e-0
3h 1
2 8.3836377e+02 1.39e+04 5.24e+01 -1.0 1.26e+04 - 3.10e-05 1.09e-0
4h 1
3 7.5250566e+02 1.38e+04 5.25e+01 -1.0 1.39e+04 - 1.30e-05 6.07e-0
3h 1
4 6.0217850e+02 1.35e+04 5.23e+01 -1.0 1.38e+04 - 6.56e-03 2.01e-0
2h 1
5 2.3117644e+04 6.20e-02 8.16e+01 -1.0 1.35e+04 - 5.69e-02 1.00e+0
0h 1
6 1.6732531e+04 5.72e-02 3.75e+01 -1.0 6.46e+01 - 5.24e-01 7.09e-0
2f 1
7 1.4887820e+04 3.69e-02 1.60e+01 -1.0 4.00e+01 - 5.65e-01 5.05e-0
1f 1
8 1.5269149e+04 1.37e-02 3.34e+00 -1.0 8.22e+00 - 9.70e-01 5.00e-0
1f 2
9 1.5054108e+04 2.81e-03 9.11e-02 -1.0 1.23e+01 - 9.95e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4698991e+04 1.22e-03 7.43e-01 -2.5 6.71e+00 - 9.21e-01 6.66e-0
1f 1
11 1.4528902e+04 2.58e-03 2.32e-01 -2.5 7.20e+00 - 7.46e-01 1.00e+0
0f 1
12 1.4499179e+04 8.43e-04 2.50e-01 -2.5 2.25e+00 - 1.00e+00 8.14e-0
1H 1
13 1.4508300e+04 1.57e-04 6.30e-03 -2.5 5.12e-01 - 1.00e+00 1.00e+0
0f 1
14 1.4482664e+04 2.07e-04 3.67e-02 -3.8 8.04e+00 - 9.91e-01 9.02e-0
1h 1
15 1.4481429e+04 9.69e-07 8.77e-05 -3.8 7.90e-01 - 1.00e+00 1.00e+0
0h 1
16 1.4480072e+04 3.59e-07 4.32e-04 -5.7 4.46e-01 - 1.00e+00 9.92e-0
1h 1
17 1.4480068e+04 3.85e-11 3.39e-09 -5.7 1.40e-02 - 1.00e+00 1.00e+0
0f 1
18 1.4480052e+04 6.30e-11 2.62e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.4480051789558516e+01 1.4480051789558516e+0
4
Dual infeasibility......: 2.6172355502361313e-09 2.6172355502361313e-0
6
Constraint violation....: 6.3003421924001657e-11 6.3003421924001657e-1
1
Complementarity.........: 2.8882708906590698e-09 2.8882708906590696e-0
6
Overall NLP error.......: 2.8882708906590698e-09 2.8882708906590696e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.7796843e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.75e-04 9.80e-0
3h 1
2 8.7503900e+02 1.27e+04 5.24e+01 -1.0 1.13e+04 - 2.89e-05 1.11e-0
4h 1
3 8.5407101e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 1.53e-05 1.40e-0
3h 1
4 5.4310211e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 1.40e-03 2.20e-0
2h 1
5 2.4292693e+04 6.20e-02 8.14e+01 -1.0 1.24e+04 - 3.50e-02 1.00e+0
0h 1
6 1.6232299e+04 5.88e-02 5.78e+01 -1.0 6.11e+01 - 2.87e-01 4.72e-0
2f 1
7 1.4633449e+04 2.59e-02 2.97e+01 -1.0 3.05e+01 - 4.90e-01 5.22e-0
1f 1
8 1.4278371e+04 1.23e-02 2.18e+00 -1.0 9.91e+00 - 9.26e-01 5.00e-0
1f 2
9 1.4099355e+04 2.97e-03 1.40e-01 -1.0 4.79e+00 - 9.60e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3716067e+04 1.17e-03 5.88e-01 -2.5 2.91e+00 - 9.19e-01 6.96e-0
1f 1
11 1.3682786e+04 1.48e-05 1.04e-02 -2.5 1.55e+00 - 1.00e+00 1.00e+0
0h 1
12 1.3657967e+04 7.17e-04 6.85e-02 -3.8 5.77e+00 - 7.07e-01 9.73e-0
1f 1
13 1.3654149e+04 2.72e-03 2.55e-02 -3.8 3.16e-01 - 2.81e-01 1.00e+0
0f 1
14 1.3654348e+04 7.58e-05 2.94e-05 -3.8 1.43e-02 - 1.00e+00 1.00e+0
0h 1
15 1.3652882e+04 1.93e-04 9.53e-04 -5.7 3.01e-01 - 9.14e-01 1.00e+0
0h 1
16 1.3652832e+04 4.73e-05 2.27e-05 -5.7 1.00e-02 - 1.00e+00 1.00e+0
0h 1
17 1.3652830e+04 4.07e-06 7.86e-05 -5.7 2.04e-03 - 1.00e+00 9.73e-0
1h 1
18 1.3652834e+04 5.49e-08 1.29e-06 -5.7 3.40e-04 - 1.00e+00 1.00e+0
0f 1
19 1.3652817e+04 6.59e-08 3.07e-05 -8.6 3.69e-03 - 1.00e+00 9.61e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.3652817e+04 3.32e-12 1.31e-10 -8.6 1.43e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.3652816691664210e+01 1.3652816691664209e+0
4
Dual infeasibility......: 1.3122773910174103e-10 1.3122773910174104e-0
7
Constraint violation....: 3.3201219551415306e-12 3.3201219551415306e-1
2
Complementarity.........: 2.5911301817606067e-09 2.5911301817606065e-0
6
Overall NLP error.......: 2.5911301817606067e-09 2.5911301817606065e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9480772e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 7.48e-04 9.81e-0
3h 1
2 8.9162464e+02 1.11e+04 5.24e+01 -1.0 8.69e+03 - 2.06e-05 1.27e-0
4h 1
3 5.1290112e+02 1.09e+04 5.25e+01 -1.0 1.11e+04 - 3.20e-05 2.31e-0
2f 1
4 2.3582703e+04 6.28e-02 8.12e+01 -1.0 1.09e+04 - 2.63e-02 1.00e+0
0h 1
5 1.5032894e+04 6.01e-02 6.55e+01 -1.0 5.38e+01 - 1.95e-01 3.89e-0
2f 1
6 1.3619996e+04 2.36e-02 3.27e+01 -1.0 2.22e+01 - 5.07e-01 5.64e-0
1f 1
7 1.2982565e+04 1.15e-02 1.88e+00 -1.0 8.84e+00 - 9.34e-01 8.17e-0
1f 1
8 1.3331217e+04 3.04e-04 9.00e-02 -1.0 3.35e+00 - 9.95e-01 1.00e+0
0f 1
9 1.2667800e+04 2.09e-03 9.72e-02 -2.5 4.84e+00 - 8.61e-01 8.80e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2507338e+04 2.22e-03 3.13e-01 -2.5 3.34e+00 - 1.00e+00 7.93e-0
1f 1
11 1.2485240e+04 1.19e-04 4.06e-03 -2.5 9.86e-01 - 1.00e+00 1.00e+0
0h 1
12 1.2457471e+04 1.87e-05 3.86e-02 -3.8 1.07e+01 - 1.00e+00 8.93e-0
1h 1
13 1.2455337e+04 5.38e-08 5.89e-04 -3.8 1.14e+00 - 1.00e+00 1.00e+0
0f 1
14 1.2453584e+04 4.33e-08 9.38e-05 -5.7 5.94e-01 - 1.00e+00 9.97e-0
1f 1
15 1.2453583e+04 1.90e-12 1.58e-08 -5.7 1.92e-03 - 1.00e+00 1.00e+0
0f 1
16 1.2453562e+04 2.57e-12 3.29e-06 -8.6 7.37e-03 - 1.00e+00 9.99e-0
1f 1
17 1.2453562e+04 5.46e-15 4.86e-14 -8.6 2.70e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.2453562318746423e+01 1.2453562318746423e+0
4
Dual infeasibility......: 4.8565171107616512e-14 4.8565171107616512e-1
1
Constraint violation....: 5.4550863824731869e-15 5.4550863824731869e-1
5
Complementarity.........: 2.8054246471092207e-09 2.8054246471092207e-0
6
Overall NLP error.......: 2.8054246471092207e-09 2.8054246471092207e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8776327e+02 9.19e+03 5.24e+01 -1.0 9.28e+03 - 6.64e-04 9.80e-0
3h 1
2 8.8487848e+02 9.19e+03 5.24e+01 -1.0 8.49e+03 - 4.35e-05 1.07e-0
4h 1
3 8.1017714e+02 9.15e+03 5.24e+01 -1.0 9.19e+03 - 1.14e-05 4.07e-0
3h 1
4 4.8829981e+02 8.96e+03 5.23e+01 -1.0 9.15e+03 - 4.62e-03 2.12e-0
2h 1
5 1.9624075e+04 6.67e-02 7.88e+01 -1.0 8.96e+03 - 7.36e-02 1.00e+0
0h 1
6 1.2613352e+04 6.06e-02 4.34e+01 -1.0 5.13e+01 - 4.30e-01 8.42e-0
2f 1
7 1.1287965e+04 2.91e-02 1.67e+01 -1.0 2.55e+01 - 6.00e-01 4.84e-0
1f 1
8 1.0844638e+04 5.12e-03 9.75e-01 -1.0 9.16e+00 - 9.34e-01 7.59e-0
1f 1
9 1.1096445e+04 1.87e-04 6.24e-02 -1.0 4.66e+00 - 9.65e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.0465980e+04 2.21e-03 7.64e-02 -2.5 4.80e+00 - 8.70e-01 8.65e-0
1f 1
11 1.0359550e+04 1.08e-03 4.56e-01 -2.5 7.53e-01 - 1.00e+00 6.05e-0
1f 1
12 1.0359616e+04 2.49e-06 8.03e-03 -2.5 1.99e-01 - 1.00e+00 1.00e+0
0h 1
13 1.0339422e+04 6.09e-06 2.51e-02 -3.8 5.36e+00 - 9.14e-01 8.89e-0
1f 1
14 1.0335905e+04 4.64e-04 4.79e-04 -3.8 5.94e-01 - 1.00e+00 1.00e+0
0f 1
15 1.0334764e+04 6.24e-05 1.13e-02 -5.7 2.97e-01 - 8.14e-01 1.00e+0
0h 1
16 1.0334651e+04 3.52e-05 3.94e-05 -5.7 9.56e-03 - 1.00e+00 1.00e+0
0h 1
17 1.0334652e+04 1.18e-06 1.12e-05 -5.7 1.43e-03 - 1.00e+00 9.97e-0
1h 1
18 1.0334638e+04 2.46e-09 1.80e-08 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
19 1.0334638e+04 3.53e-14 1.10e-13 -9.0 1.81e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.0334637955079662e+01 1.0334637955079663e+0
4
Dual infeasibility......: 1.0972278538585929e-13 1.0972278538585929e-1
0
Constraint violation....: 3.5305092183079978e-14 3.5305092183079978e-1
4
Complementarity.........: 1.8121040959301064e-09 1.8121040959301065e-0
6
Overall NLP error.......: 1.8121040959301064e-09 1.8121040959301065e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2299660e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1994562e+02 6.71e+03 5.23e+01 -1.0 5.82e+03 - 3.44e-05 1.14e-0
4h 1
3 7.2850999e+02 6.64e+03 5.23e+01 -1.0 6.70e+03 - 1.95e-05 9.17e-0
3f 1
4 4.9339543e+02 6.50e+03 5.19e+01 -1.0 6.64e+03 - 1.16e-02 2.10e-0
2h 1
5 1.5628522e+04 8.10e-02 7.81e+01 -1.0 6.50e+03 - 8.90e-02 1.00e+0
0h 1
6 1.0636045e+04 7.19e-02 2.13e+01 -1.0 1.24e+01 - 7.05e-01 1.06e-0
1f 1
7 9.4596867e+03 2.23e-02 3.10e+00 -1.0 9.08e+00 - 8.57e-01 8.74e-0
1f 1
8 9.7561577e+03 1.77e-02 3.57e-01 -1.0 2.44e+00 - 8.86e-01 9.15e-0
1f 1
9 9.3846899e+03 3.10e-03 7.36e-01 -1.7 2.75e+00 - 5.98e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.3509364e+03 4.06e-04 6.10e-01 -1.7 5.73e+00 - 6.51e-01 1.00e+0
0h 1
11 9.3676577e+03 5.41e-05 1.97e-01 -1.7 1.06e+01 - 7.52e-01 1.00e+0
0h 1
12 9.2189354e+03 4.25e-04 1.80e-02 -2.5 1.06e+01 - 9.63e-01 9.32e-0
1f 1
13 9.1916567e+03 1.44e-04 1.93e-01 -3.8 1.06e+01 - 9.87e-01 7.22e-0
1h 1
14 9.1841521e+03 4.33e-07 3.41e-04 -3.8 3.12e+00 - 1.00e+00 1.00e+0
0h 1
15 9.1828158e+03 2.02e-08 4.20e-06 -5.7 2.98e-01 - 1.00e+00 1.00e+0
0h 1
16 9.1828008e+03 8.53e-13 5.02e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 9.1828007854333382e+00 9.1828007854333373e+0
3
Dual infeasibility......: 5.0223553329405349e-10 5.0223553329405349e-0
7
Constraint violation....: 8.5270679406335148e-13 8.5270679406335148e-1
3
Complementarity.........: 4.4983555848687995e-09 4.4983555848687990e-0
6
Overall NLP error.......: 4.4983555848687995e-09 4.4983555848687990e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3002852e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 2.02e-03 9.81e-0
3h 1
2 9.2665255e+02 4.77e+03 5.23e+01 -1.0 3.78e+03 - 3.07e-05 1.25e-0
4h 1
3 4.3498324e+02 4.67e+03 5.24e+01 -1.0 4.77e+03 - 3.22e-05 2.12e-0
2f 1
4 1.2082314e+04 8.33e-02 7.86e+01 -1.0 4.67e+03 - 3.26e-02 1.00e+0
0h 1
5 9.1245116e+03 7.96e-02 2.66e+01 -1.0 1.08e+01 - 6.13e-01 4.30e-0
2f 1
6 7.9979591e+03 1.30e-02 1.10e+01 -1.0 9.06e+00 - 6.51e-01 8.24e-0
1f 1
7 8.1341077e+03 8.57e-03 1.53e-01 -1.0 2.78e+00 - 9.90e-01 9.38e-0
1f 1
8 7.7587169e+03 2.58e-03 1.27e+00 -1.7 7.80e+00 - 3.46e-01 1.00e+0
0f 1
9 7.7259457e+03 2.37e-04 5.62e-01 -1.7 8.66e+00 - 7.24e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.7378991e+03 1.06e-04 7.29e-02 -1.7 1.33e+01 - 9.14e-01 1.00e+0
0f 1
11 7.5760217e+03 4.11e-04 1.77e-02 -2.5 2.34e+01 - 9.75e-01 9.52e-0
1f 1
12 7.5529821e+03 1.04e-04 1.57e-01 -3.8 7.88e+00 - 9.98e-01 7.74e-0
1h 1
13 7.5478988e+03 2.01e-07 1.27e-04 -3.8 1.79e+00 - 1.00e+00 1.00e+0
0f 1
14 7.5465631e+03 1.77e-08 2.99e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
15 7.5465477e+03 1.29e-12 4.23e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 7.5465477405087062e+00 7.5465477405087058e+0
3
Dual infeasibility......: 4.2340537099547107e-10 4.2340537099547107e-0
7
Constraint violation....: 1.2931739012955745e-12 1.2931739012955745e-1
2
Complementarity.........: 3.9051374560612801e-09 3.9051374560612799e-0
6
Overall NLP error.......: 3.9051374560612801e-09 3.9051374560612799e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9460641e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.82e-0
3h 1
2 8.8800409e+02 3.24e+03 5.24e+01 -1.0 2.00e+03 - 2.99e-05 2.58e-0
4h 1
3 3.3060749e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 1.77e-04 2.30e-0
2f 1
4 1.5630204e+04 6.30e-02 7.96e+01 -1.0 3.17e+03 - 4.56e-02 1.00e+0
0h 1
5 7.0765126e+03 5.91e-02 5.23e+01 -1.0 4.93e+01 - 3.34e-01 5.58e-0
2f 1
6 5.7030812e+03 2.49e-02 2.52e+01 -1.0 2.35e+01 - 5.21e-01 5.35e-0
1f 1
7 5.1298731e+03 7.96e-03 1.17e+00 -1.0 8.67e+00 - 9.36e-01 7.44e-0
1f 1
8 5.4098905e+03 3.10e-04 8.19e-02 -1.0 4.22e+00 - 9.96e-01 1.00e+0
0f 1
9 4.8068262e+03 2.10e-03 8.44e-02 -2.5 6.58e+00 - 8.62e-01 8.42e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.6349267e+03 2.19e-03 3.51e-01 -2.5 3.79e+00 - 1.00e+00 7.77e-0
1f 1
11 4.6082704e+03 1.61e-04 4.95e-03 -2.5 1.08e+00 - 1.00e+00 1.00e+0
0h 1
12 4.5789461e+03 2.36e-05 4.36e-02 -3.8 1.34e+01 - 1.00e+00 8.82e-0
1h 1
13 4.5762301e+03 5.79e-08 6.03e-04 -3.8 1.57e+00 - 1.00e+00 1.00e+0
0f 1
14 4.5743316e+03 4.23e-08 4.24e-05 -5.7 7.43e-01 - 1.00e+00 9.98e-0
1f 1
15 4.5743323e+03 1.88e-12 1.22e-08 -5.7 1.24e-03 - 1.00e+00 1.00e+0
0f 1
16 4.5743102e+03 2.57e-12 3.30e-06 -8.6 9.21e-03 - 1.00e+00 9.99e-0
1f 1
17 4.5743102e+03 7.11e-15 4.84e-14 -8.6 5.19e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 4.5743102133349147e+00 4.5743102133349148e+0
3
Dual infeasibility......: 4.8401127695868372e-14 4.8401127695868372e-1
1
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.6244110309710723e-09 2.6244110309710723e-0
6
Overall NLP error.......: 2.6244110309710723e-09 2.6244110309710723e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4528265e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 3.98e-04 9.81e-0
3f 1
2 8.4160251e+02 2.00e+03 5.24e+01 -1.0 1.48e+03 - 5.90e-05 1.34e-0
4h 1
3 2.7509537e+02 1.95e+03 5.26e+01 -1.0 2.00e+03 - 4.97e-05 2.18e-0
2f 1
4 1.3978763e+04 5.67e-02 8.10e+01 -1.0 1.95e+03 - 4.46e-02 1.00e+0
0h 1
5 5.1663757e+03 5.32e-02 5.38e+01 -1.0 8.22e+01 - 3.29e-01 5.48e-0
2f 1
6 3.0169279e+03 3.33e-02 2.97e+01 -1.0 4.25e+01 - 4.59e-01 5.39e-0
1f 1
7 5.0512416e+03 9.15e-03 1.65e+01 -1.0 2.43e+01 - 5.91e-01 1.00e+0
0h 1
8 3.0927580e+03 7.42e-03 4.15e-01 -1.0 2.10e+01 - 9.67e-01 1.00e+0
0f 1
9 2.7847845e+03 1.00e-03 1.63e-01 -1.7 5.24e+00 - 1.00e+00 9.12e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.6486959e+03 1.59e-03 2.72e-01 -2.5 6.05e+00 - 7.52e-01 1.00e+0
0f 1
11 2.5962169e+03 4.61e-03 3.97e-02 -2.5 2.93e+00 - 1.00e+00 1.00e+0
0h 1
12 2.6062895e+03 2.11e-04 6.40e-03 -2.5 4.76e-01 - 1.00e+00 1.00e+0
0h 1
13 2.5818658e+03 2.58e-04 4.25e-02 -3.8 5.37e+00 - 9.87e-01 8.87e-0
1h 1
14 2.5806677e+03 1.91e-06 1.63e-04 -3.8 6.01e-01 - 1.00e+00 1.00e+0
0h 1
15 2.5794704e+03 3.21e-07 2.10e-03 -5.7 2.97e-01 - 1.00e+00 9.78e-0
1h 1
16 2.5794585e+03 3.73e-11 2.11e-08 -5.7 6.59e-03 - 1.00e+00 1.00e+0
0f 1
17 2.5794438e+03 6.30e-11 1.22e-07 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
18 2.5794438e+03 4.11e-15 2.58e-14 -8.6 1.24e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 2.5794437943878679e+00 2.5794437943878679e+0
3
Dual infeasibility......: 2.5757174171303632e-14 2.5757174171303632e-1
1
Constraint violation....: 4.1078251911130792e-15 4.1078251911130792e-1
5
Complementarity.........: 4.9971978235248745e-09 4.9971978235248746e-0
6
Overall NLP error.......: 4.9971978235248745e-09 4.9971978235248746e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6486513e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 4.93e-04 9.86e-0
3h 1
2 8.4983232e+02 9.17e+02 5.24e+01 -1.0 7.54e+02 - 7.95e-05 5.55e-0
4h 1
3 2.6208366e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 5.24e-04 2.21e-0
2h 1
4 1.2837708e+04 5.95e-02 8.02e+01 -1.0 8.97e+02 - 4.99e-02 1.00e+0
0h 1
5 4.2800837e+03 5.56e-02 5.36e+01 -1.0 7.38e+01 - 3.21e-01 5.97e-0
2f 1
6 2.6765037e+03 3.00e-02 2.80e+01 -1.0 3.91e+01 - 4.72e-01 4.34e-0
1f 1
7 2.1363407e+03 1.45e-02 2.60e+00 -1.0 1.10e+01 - 9.18e-01 1.00e+0
0f 1
8 2.4585799e+03 4.43e-04 8.55e-02 -1.0 4.21e+00 - 9.95e-01 1.00e+0
0f 1
9 1.8797663e+03 6.89e-04 3.75e-01 -2.5 8.00e+00 - 8.82e-01 7.24e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8062488e+03 2.67e-04 3.48e-01 -2.5 5.75e+00 - 8.80e-01 1.00e+0
0h 1
11 1.8006952e+03 6.84e-04 4.79e-01 -2.5 1.46e+00 - 1.00e+00 1.48e-0
1h 2
12 1.7790960e+03 1.37e-03 1.37e-02 -2.5 1.01e+00 - 1.00e+00 1.00e+0
0h 1
13 1.7518967e+03 1.27e-03 3.44e-02 -3.8 1.35e+01 - 7.93e-01 1.00e+0
0h 1
14 1.7489400e+03 2.26e-03 8.91e-04 -3.8 3.96e-02 - 1.00e+00 1.00e+0
0h 1
15 1.7493023e+03 4.34e-05 1.62e-04 -3.8 1.59e-02 - 1.00e+00 1.00e+0
0h 1
16 1.7473872e+03 1.06e-04 3.72e-04 -5.7 7.43e-01 - 9.51e-01 9.77e-0
1h 1
17 1.7473671e+03 2.26e-05 3.99e-03 -5.7 1.68e-02 - 1.00e+00 7.87e-0
1h 1
18 1.7473673e+03 8.06e-09 1.16e-06 -5.7 3.57e-03 - 1.00e+00 1.00e+0
0f 1
19 1.7473453e+03 8.84e-09 2.07e-05 -8.6 9.21e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7473450e+03 1.47e-12 7.02e-11 -8.6 1.54e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.7473449961454557e+00 1.7473449961454558e+0
3
Dual infeasibility......: 7.0180931773511698e-11 7.0180931773511704e-0
8
Constraint violation....: 1.4740431097948203e-12 1.4740431097948203e-1
2
Complementarity.........: 2.7913649831656744e-09 2.7913649831656743e-0
6
Overall NLP error.......: 2.7913649831656744e-09 2.7913649831656743e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.03e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.11e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235598041e+00 1.6104063235598039e+0
3
Dual infeasibility......: 2.4574912305877009e-12 2.4574912305877009e-0
9
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5062163919694818e-09 2.5062163919694818e-0
6
Overall NLP error.......: 2.5062163919694818e-09 2.5062163919694818e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933498e-01 5.8277753147933493e+0
2
Dual infeasibility......: 2.1031318724752505e-09 2.1031318724752505e-0
6
Constraint violation....: 6.2994637284319310e-11 6.2994637284319310e-1
1
Complementarity.........: 2.8882108897038180e-09 2.8882108897038180e-0
6
Overall NLP error.......: 2.8882108897038180e-09 2.8882108897038180e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146111909519e-01 6.4890146111909519e+0
2
Dual infeasibility......: 4.9126605687672946e-09 4.9126605687672946e-0
6
Constraint violation....: 6.2123813870940126e-09 6.2123813870940126e-0
9
Complementarity.........: 4.3646094984423049e-09 4.3646094984423046e-0
6
Overall NLP error.......: 6.2123813870940126e-09 4.9126605687672946e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.03e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.11e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235598041e+00 1.6104063235598039e+0
3
Dual infeasibility......: 2.4574912305877009e-12 2.4574912305877009e-0
9
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5062163919694818e-09 2.5062163919694818e-0
6
Overall NLP error.......: 2.5062163919694818e-09 2.5062163919694818e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2208569e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 3.29e-04 9.87e-0
3h 1
2 8.0324098e+02 9.17e+02 5.24e+01 -1.0 7.85e+02 - 8.88e-05 6.87e-0
4h 1
3 2.4240484e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 6.67e-04 2.10e-0
2h 1
4 1.2380471e+04 5.52e-02 8.24e+01 -1.0 8.98e+02 - 3.84e-02 1.00e+0
0h 1
5 3.8796354e+03 5.26e-02 5.61e+01 -1.0 8.06e+01 - 3.16e-01 5.00e-0
2f 1
6 1.9096184e+03 3.75e-02 3.00e+01 -1.0 3.91e+01 - 4.70e-01 5.04e-0
1f 1
7 4.6686539e+03 1.22e-02 2.67e+01 -1.0 2.05e+01 - 4.02e-01 1.00e+0
0h 1
8 1.8748446e+03 1.18e-02 1.00e+00 -1.0 2.53e+01 - 9.88e-01 8.94e-0
1f 1
9 2.0007636e+03 1.82e-04 4.63e-02 -1.0 3.23e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7349596e+03 2.15e-04 1.23e+00 -2.5 1.77e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5468548e+03 3.76e-03 1.33e-01 -2.5 7.59e+00 - 7.96e-01 1.00e+0
0f 1
12 1.5237336e+03 5.33e-03 3.08e-01 -2.5 1.83e+00 - 1.00e+00 7.68e-0
1h 1
13 1.5360585e+03 2.45e-04 4.69e-03 -2.5 7.08e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5034659e+03 1.70e-04 2.13e-02 -3.8 1.62e+01 - 9.91e-01 9.30e-0
1h 1
15 1.5021214e+03 7.20e-07 6.83e-05 -3.8 1.09e+00 - 1.00e+00 1.00e+0
0h 1
16 1.5003171e+03 3.77e-07 1.76e-04 -5.7 8.92e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003154e+03 3.79e-11 2.93e-09 -5.7 3.96e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.11e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932795349899e+00 1.5002932795349898e+0
3
Dual infeasibility......: 2.1693889206368040e-09 2.1693889206368040e-0
6
Constraint violation....: 6.2995927918585437e-11 6.2995927918585437e-1
1
Complementarity.........: 2.8882170398710457e-09 2.8882170398710457e-0
6
Overall NLP error.......: 2.8882170398710457e-09 2.8882170398710457e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6465258e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 4.93e-04 9.87e-0
3h 1
2 8.4355068e+02 9.17e+02 5.24e+01 -1.0 8.01e+02 - 8.70e-05 7.80e-0
4h 1
3 2.6241313e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 7.62e-04 2.20e-0
2h 1
4 1.2719104e+04 5.98e-02 8.02e+01 -1.0 8.97e+02 - 5.04e-02 1.00e+0
0h 1
5 4.2679713e+03 5.58e-02 5.32e+01 -1.0 7.31e+01 - 3.26e-01 6.03e-0
2f 1
86 1.483421e+04 1.632511e+04 6.505215e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6792846e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.81e-0
3h 1
2 7.6482949e+02 1.57e+04 5.25e+01 -1.0 1.29e+04 - 2.09e-05 1.21e-0
4h 1
3 5.2429893e+02 1.54e+04 5.27e+01 -1.0 1.57e+04 - 2.56e-05 1.91e-0
2h 1
4 2.5014044e+04 6.23e-02 8.48e+01 -1.0 1.54e+04 - 2.04e-02 1.00e+0
0h 1
5 1.8303735e+04 6.04e-02 6.86e+01 -1.0 7.48e+01 - 1.97e-01 3.31e-0
2f 1
6 1.6732270e+04 4.76e-02 3.41e+01 -1.0 2.79e+01 - 5.00e-01 4.54e-0
1f 1
7 1.7319006e+04 2.66e-02 1.58e+01 -1.0 1.63e+01 - 4.57e-01 2.50e-0
1f 3
8 1.6760042e+04 6.40e-03 3.27e-01 -1.0 6.32e+00 - 9.83e-01 1.00e+0
0f 1
9 1.6492185e+04 9.31e-04 1.54e+00 -1.7 4.47e+00 - 2.50e-01 9.18e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6488855e+04 1.54e-04 6.20e-01 -1.7 5.52e+00 - 6.88e-01 1.00e+0
0f 1
11 1.6482663e+04 1.32e-04 2.27e-01 -1.7 1.48e+01 - 5.53e-01 1.00e+0
0f 1
12 1.6502812e+04 1.36e-05 3.40e-02 -1.7 2.29e+01 - 8.44e-01 1.00e+0
0f 1
13 1.6381395e+04 9.66e-04 4.89e-02 -2.5 2.49e+01 - 9.23e-01 1.00e+0
0f 1
14 1.6353610e+04 1.12e-03 1.18e-02 -2.5 8.58e+00 - 1.00e+00 1.00e+0
0h 1
15 1.6329697e+04 1.88e-04 8.55e-02 -3.8 1.36e+01 - 1.00e+00 8.53e-0
1h 1
16 1.6326786e+04 5.65e-07 1.01e-04 -3.8 2.00e+00 - 1.00e+00 1.00e+0
0h 1
17 1.6325124e+04 4.00e-07 1.11e-04 -5.7 7.43e-01 - 1.00e+00 9.97e-0
1h 1
18 1.6325125e+04 3.81e-11 2.98e-09 -5.7 1.72e-03 - 1.00e+00 1.00e+0
0f 1
19 1.6325106e+04 5.56e-11 3.46e-05 -8.6 9.17e-03 - 1.00e+00 9.44e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325105e+04 1.98e-13 6.50e-12 -8.6 3.07e-05 - 1.00e+00 1.00e+0
0f 1
21 1.6325105e+04 1.07e-14 9.10e-15 -9.0 1.03e-05 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.6325105264632739e+01 1.6325105264632739e+0
4
Dual infeasibility......: 9.1038288019262836e-15 9.1038288019262836e-1
2
Constraint violation....: 1.0658141036401503e-14 1.0658141036401503e-1
4
Complementarity.........: 1.2108131842793128e-09 1.2108131842793128e-0
6
Overall NLP error.......: 1.2108131842793128e-09 1.2108131842793128e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6677301e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 4.98e-04 9.80e-0
3h 1
2 8.6395417e+02 1.50e+04 5.24e+01 -1.0 1.43e+04 - 4.44e-05 1.04e-0
4h 1
3 8.6282290e+02 1.50e+04 5.24e+01 -1.0 1.48e+04 - 6.82e-06 8.72e-0
5h 1
4 8.6139315e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 9.22e-05 1.12e-0
4h 1
5 5.7899667e+02 1.46e+04 5.25e+01 -1.0 1.50e+04 - 2.07e-04 2.23e-0
2f 1
6 2.7026808e+04 5.94e-02 8.01e+01 -1.0 1.46e+04 - 4.97e-02 1.00e+0
0h 1
7 1.8360381e+04 5.55e-02 5.40e+01 -1.0 7.41e+01 - 3.15e-01 5.93e-0
2f 1
8 1.6773540e+04 3.02e-02 2.83e+01 -1.0 3.89e+01 - 4.70e-01 4.31e-0
1f 1
9 1.6483408e+04 1.45e-02 2.60e+00 -1.0 1.10e+01 - 9.18e-01 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6312572e+04 7.23e-03 1.87e+00 -1.0 8.28e+00 - 9.98e-01 4.93e-0
1f 2
11 1.6432513e+04 5.85e-04 4.31e-02 -1.0 1.16e+02 - 1.00e+00 1.00e+0
0f 1
12 1.5979163e+04 4.58e-04 9.58e-01 -2.5 1.33e+02 - 9.17e-01 5.85e-0
1f 1
13 1.5859102e+04 2.18e-04 2.19e-01 -2.5 3.86e+01 - 9.26e-01 1.00e+0
0f 1
14 1.5835474e+04 3.07e-03 1.92e-02 -2.5 2.27e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5822085e+04 7.98e-04 3.58e-02 -3.8 2.75e+00 - 8.04e-01 1.00e+0
0h 1
16 1.5819177e+04 2.14e-03 1.02e-03 -3.8 4.83e-02 - 1.00e+00 1.00e+0
0h 1
17 1.5819391e+04 4.91e-05 1.31e-04 -3.8 1.22e-02 - 1.00e+00 1.00e+0
0h 1
18 1.5818089e+04 1.01e-04 3.42e-04 -5.7 1.49e-01 - 9.50e-01 9.75e-0
1h 1
19 1.5818076e+04 2.31e-05 3.77e-03 -5.7 3.61e-03 - 1.00e+00 7.73e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5818079e+04 9.13e-09 1.28e-06 -5.7 8.20e-04 - 1.00e+00 1.00e+0
0f 1
21 1.5818064e+04 9.12e-09 1.91e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
22 1.5818064e+04 1.36e-12 6.49e-11 -8.6 3.06e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.5818063707795142e+01 1.5818063707795141e+0
4
Dual infeasibility......: 6.4918558579071227e-11 6.4918558579071227e-0
8
Constraint violation....: 1.3582468483264165e-12 1.3582468483264165e-1
2
Complementarity.........: 2.5092893378967569e-09 2.5092893378967568e-0
6
Overall NLP error.......: 2.5092893378967569e-09 2.5092893378967568e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6662212e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 4.97e-04 9.80e-0
3h 1
2 8.6359992e+02 1.39e+04 5.24e+01 -1.0 1.17e+04 - 2.24e-05 1.18e-0
4h 1
3 8.4860717e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 2.24e-05 1.08e-0
3h 1
4 5.6043243e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 1.09e-03 2.18e-0
2h 1
5 2.5569211e+04 6.02e-02 8.22e+01 -1.0 1.36e+04 - 2.73e-02 1.00e+0
0h 1
6 1.7379056e+04 5.75e-02 6.42e+01 -1.0 6.92e+01 - 2.21e-01 4.02e-0
2f 1
7 1.5459762e+04 3.16e-02 3.45e+01 -1.0 3.21e+01 - 4.76e-01 5.92e-0
1f 1
8 1.5196816e+04 8.26e-03 2.41e+00 -1.0 8.17e+00 - 9.36e-01 1.00e+0
0f 1
9 1.5264848e+04 6.05e-04 5.60e-02 -1.0 4.02e+00 - 9.82e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4855490e+04 3.71e-04 7.99e-01 -2.5 5.62e+00 - 9.11e-01 6.15e-0
1f 1
11 1.4783900e+04 1.68e-04 2.07e-01 -2.5 3.11e+00 - 9.31e-01 1.00e+0
0h 1
12 1.4760117e+04 4.27e-03 3.20e-02 -2.5 1.02e+00 - 1.00e+00 1.00e+0
0h 1
13 1.4763292e+04 5.53e-04 2.15e-03 -2.5 9.17e-02 - 1.00e+00 1.00e+0
0h 1
14 1.4741444e+04 1.18e-03 3.27e-02 -3.8 8.80e+00 - 7.92e-01 1.00e+0
0h 1
15 1.4738247e+04 3.04e-03 1.10e-03 -3.8 3.43e-01 - 1.00e+00 1.00e+0
0h 1
16 1.4738554e+04 3.92e-05 1.18e-04 -3.8 1.21e-02 - 1.00e+00 1.00e+0
0h 1
17 1.4736970e+04 9.75e-05 2.96e-04 -5.7 4.48e-01 - 9.52e-01 9.73e-0
1h 1
18 1.4736949e+04 2.16e-05 3.68e-03 -5.7 1.07e-02 - 1.00e+00 7.80e-0
1h 1
19 1.4736950e+04 8.52e-09 1.25e-06 -5.7 2.36e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.4736932e+04 9.05e-09 1.92e-05 -8.6 5.53e-03 - 1.00e+00 9.83e-0
1h 1
21 1.4736931e+04 1.36e-12 6.47e-11 -8.6 9.13e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.4736931433106164e+01 1.4736931433106165e+0
4
Dual infeasibility......: 6.4712099927674764e-11 6.4712099927674764e-0
8
Constraint violation....: 1.3613554727953669e-12 1.3613554727953669e-1
2
Complementarity.........: 2.7336513291661832e-09 2.7336513291661833e-0
6
Overall NLP error.......: 2.7336513291661832e-09 2.7336513291661833e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8073105e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.97e-04 9.80e-0
3h 1
2 8.7796146e+02 1.27e+04 5.24e+01 -1.0 1.24e+04 - 8.93e-05 1.01e-0
4h 1
3 8.6692458e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 3.47e-06 7.37e-0
4f 1
4 5.4092019e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 7.99e-04 2.24e-0
2h 1
5 2.4576710e+04 6.17e-02 7.93e+01 -1.0 1.24e+04 - 5.67e-02 1.00e+0
0h 1
6 1.6171478e+04 5.73e-02 5.23e+01 -1.0 6.39e+01 - 3.28e-01 6.59e-0
2f 1
7 1.4812866e+04 3.11e-02 2.54e+01 -1.0 3.21e+01 - 5.03e-01 4.22e-0
1f 1
8 1.4040427e+04 1.14e-02 2.00e+00 -1.0 1.10e+01 - 9.20e-01 9.11e-0
1f 1
9 1.4460004e+04 3.38e-04 9.28e-02 -1.0 4.85e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3750291e+04 1.39e-03 7.06e-02 -2.5 6.50e+00 - 8.71e-01 8.55e-0
1f 1
11 1.3727058e+04 1.41e-05 1.70e-02 -2.5 6.60e-01 - 1.00e+00 1.00e+0
0h 1
12 1.3695913e+04 1.35e-03 3.69e-02 -3.8 2.68e+00 - 7.12e-01 1.00e+0
0f 1
13 1.3693938e+04 9.56e-04 1.56e-03 -3.8 3.41e-02 - 9.61e-01 1.00e+0
0h 1
14 1.3694087e+04 1.22e-04 1.32e-04 -3.8 1.60e-02 - 1.00e+00 1.00e+0
0h 1
15 1.3692879e+04 1.38e-04 1.17e-03 -5.7 1.49e-01 - 9.16e-01 1.00e+0
0h 1
16 1.3692835e+04 3.55e-05 7.55e-06 -5.7 8.77e-03 - 1.00e+00 1.00e+0
0h 1
17 1.3692839e+04 4.36e-07 4.70e-06 -5.7 9.55e-04 - 1.00e+00 1.00e+0
0h 1
18 1.3692826e+04 3.62e-08 4.80e-05 -8.6 1.84e-03 - 1.00e+00 9.49e-0
1h 1
19 1.3692826e+04 6.54e-12 6.63e-11 -8.6 9.47e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.3692825539299381e+01 1.3692825539299381e+0
4
Dual infeasibility......: 6.6307840964151223e-11 6.6307840964151229e-0
8
Constraint violation....: 6.5411009941840348e-12 6.5411009941840348e-1
2
Complementarity.........: 2.5095397414807469e-09 2.5095397414807466e-0
6
Overall NLP error.......: 2.5095397414807469e-09 2.5095397414807466e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6660712e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 4.97e-04 9.81e-0
3h 1
2 8.6345326e+02 1.11e+04 5.24e+01 -1.0 8.98e+03 - 2.33e-05 1.23e-0
4h 1
3 5.2990892e+02 1.09e+04 5.25e+01 -1.0 1.11e+04 - 2.80e-05 2.00e-0
2h 1
4 1.7458962e+04 7.26e-02 8.04e+01 -1.0 1.09e+04 - 2.24e-02 1.00e+0
0h 1
5 1.4556343e+04 7.01e-02 4.24e+01 -1.0 4.49e+01 - 4.41e-01 3.29e-0
2f 1
6 1.2638396e+04 3.29e-02 2.22e+01 -1.0 3.68e+01 - 4.93e-01 5.69e-0
1f 1
7 1.2354008e+04 7.82e-03 1.83e+00 -1.0 8.91e+00 - 9.32e-01 1.00e+0
0f 1
8 1.2498437e+04 3.29e-04 3.41e-02 -1.0 4.22e+00 - 9.82e-01 1.00e+0
0f 1
9 1.2092176e+04 4.14e-04 8.89e-01 -2.5 5.92e+00 - 9.07e-01 5.91e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2016309e+04 1.95e-04 2.73e-01 -2.5 4.48e+00 - 9.16e-01 1.00e+0
0f 1
11 1.1987684e+04 3.95e-03 3.69e-02 -2.5 1.30e+00 - 1.00e+00 1.00e+0
0h 1
12 1.1991315e+04 5.41e-04 2.67e-03 -2.5 1.25e-01 - 1.00e+00 1.00e+0
0h 1
13 1.1967531e+04 1.20e-03 3.28e-02 -3.8 1.07e+01 - 7.91e-01 1.00e+0
0h 1
14 1.1964039e+04 2.97e-03 1.10e-03 -3.8 4.87e-02 - 1.00e+00 1.00e+0
0h 1
15 1.1964349e+04 3.98e-05 1.21e-04 -3.8 1.23e-02 - 1.00e+00 1.00e+0
0h 1
16 1.1962621e+04 9.80e-05 3.05e-04 -5.7 5.94e-01 - 9.51e-01 9.74e-0
1h 1
17 1.1962597e+04 2.16e-05 3.67e-03 -5.7 1.56e-02 - 1.00e+00 7.80e-0
1h 1
18 1.1962597e+04 8.53e-09 1.25e-06 -5.7 3.43e-03 - 1.00e+00 1.00e+0
0f 1
19 1.1962577e+04 9.04e-09 1.92e-05 -8.6 7.37e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.1962577e+04 1.36e-12 6.47e-11 -8.6 1.22e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.1962576513867020e+01 1.1962576513867019e+0
4
Dual infeasibility......: 6.4733058930904654e-11 6.4733058930904654e-0
8
Constraint violation....: 1.3624656958199921e-12 1.3624656958199921e-1
2
Complementarity.........: 2.8594349394097723e-09 2.8594349394097724e-0
6
Overall NLP error.......: 2.8594349394097723e-09 2.8594349394097724e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891076e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0602418e+02 9.19e+03 5.23e+01 -1.0 8.41e+03 - 3.92e-05 1.08e-0
4h 1
3 8.1828324e+02 9.14e+03 5.24e+01 -1.0 9.19e+03 - 1.24e-05 4.81e-0
3h 1
4 5.0911013e+02 8.95e+03 5.22e+01 -1.0 9.14e+03 - 5.53e-03 2.13e-0
2h 1
5 1.9574029e+04 7.15e-02 7.74e+01 -1.0 8.95e+03 - 8.67e-02 1.00e+0
0h 1
6 1.2972291e+04 6.39e-02 3.14e+01 -1.0 2.60e+01 - 5.69e-01 9.74e-0
2f 1
7 1.1456842e+04 1.98e-02 1.02e+01 -1.0 1.50e+01 - 6.92e-01 7.89e-0
1f 1
8 1.1617387e+04 7.35e-03 8.73e-01 -1.0 3.38e+00 - 9.91e-01 5.00e-0
1f 2
9 1.1301741e+04 1.11e-02 8.06e-01 -1.7 9.57e+00 - 3.39e-01 8.28e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1285794e+04 6.67e-04 7.35e-01 -1.7 1.03e+01 - 6.86e-01 1.00e+0
0f 1
11 1.1285583e+04 1.17e-04 3.09e-02 -1.7 1.29e+01 - 9.61e-01 1.00e+0
0h 1
12 1.1114045e+04 6.13e-04 2.60e-02 -2.5 2.54e+01 - 9.64e-01 9.72e-0
1f 1
13 1.1087276e+04 1.55e-04 7.64e-02 -3.8 6.68e+00 - 9.81e-01 8.35e-0
1h 1
14 1.1084766e+04 1.98e-07 1.13e-01 -3.8 1.11e+00 - 9.12e-01 1.00e+0
0h 1
15 1.1084687e+04 4.78e-09 3.13e-05 -3.8 1.58e-04 - 1.00e+00 1.00e+0
0h 1
16 1.1083373e+04 1.92e-08 3.89e-03 -5.7 2.97e-01 - 1.00e+00 9.68e-0
1f 1
17 1.1083337e+04 5.75e-12 2.63e-08 -5.7 9.60e-03 - 1.00e+00 1.00e+0
0f 1
18 1.1083321e+04 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1083320752811696e+01 1.1083320752811696e+0
4
Dual infeasibility......: 4.4780427378108965e-09 4.4780427378108965e-0
6
Constraint violation....: 2.6337126923792198e-12 2.6337126923792198e-1
2
Complementarity.........: 3.7123865577400208e-09 3.7123865577400206e-0
6
Overall NLP error.......: 4.4780427378108965e-09 4.4780427378108965e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0889707e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0591739e+02 6.71e+03 5.23e+01 -1.0 5.95e+03 - 4.04e-05 1.12e-0
4h 1
3 7.6488228e+02 6.66e+03 5.24e+01 -1.0 6.70e+03 - 1.70e-05 6.81e-0
3h 1
4 4.6074229e+02 6.52e+03 5.21e+01 -1.0 6.66e+03 - 8.31e-03 2.09e-0
2h 1
5 1.6247927e+04 7.43e-02 7.77e+01 -1.0 6.52e+03 - 8.93e-02 1.00e+0
0h 1
6 1.0403222e+04 6.60e-02 2.72e+01 -1.0 2.46e+01 - 6.25e-01 1.03e-0
1f 1
7 8.8840630e+03 1.77e-02 6.66e+00 -1.0 1.48e+01 - 7.64e-01 8.19e-0
1f 1
8 9.0908601e+03 9.00e-03 6.86e-01 -1.0 4.18e+00 - 9.91e-01 4.95e-0
1f 2
9 8.8156626e+03 1.08e-02 9.94e-01 -1.7 1.24e+01 - 2.21e-01 8.25e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.8120547e+03 5.54e-04 5.92e-01 -1.7 1.08e+01 - 7.57e-01 1.00e+0
0f 1
11 8.8059114e+03 1.48e-04 2.59e-03 -1.7 1.30e+01 - 1.00e+00 1.00e+0
0h 1
12 8.6309986e+03 6.09e-04 2.54e-02 -2.5 2.91e+01 - 9.68e-01 9.67e-0
1f 1
13 8.6042896e+03 1.54e-04 7.80e-02 -3.8 6.26e+00 - 9.83e-01 8.34e-0
1h 1
14 8.6017611e+03 1.98e-07 1.12e-01 -3.8 1.03e+00 - 9.12e-01 1.00e+0
0h 1
15 8.6016820e+03 4.74e-09 3.10e-05 -3.8 1.62e-04 - 1.00e+00 1.00e+0
0h 1
16 8.6003684e+03 1.92e-08 3.89e-03 -5.7 2.97e-01 - 1.00e+00 9.68e-0
1f 1
17 8.6003325e+03 5.76e-12 2.63e-08 -5.7 9.60e-03 - 1.00e+00 1.00e+0
0f 1
18 8.6003159e+03 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 8.6003159352161713e+00 8.6003159352161711e+0
3
Dual infeasibility......: 4.4780429355160097e-09 4.4780429355160097e-0
6
Constraint violation....: 2.6338028979999706e-12 2.6338028979999706e-1
2
Complementarity.........: 3.6085483084218461e-09 3.6085483084218459e-0
6
Overall NLP error.......: 4.4780429355160097e-09 4.4780429355160097e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3000909e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 2.02e-03 9.81e-0
3h 1
2 9.2540939e+02 4.77e+03 5.23e+01 -1.0 2.66e+03 - 1.91e-05 1.78e-0
4h 1
3 3.8379504e+02 4.66e+03 5.24e+01 -1.0 4.77e+03 - 8.68e-05 2.34e-0
2f 1
4 1.7424477e+04 7.01e-02 7.87e+01 -1.0 4.66e+03 - 5.08e-02 1.00e+0
0h 1
5 9.2441130e+03 6.55e-02 5.13e+01 -1.0 1.16e+01 - 3.39e-01 6.13e-0
2f 1
6 7.9204820e+03 2.27e-02 2.21e+01 -1.0 7.02e+00 - 6.27e-01 9.88e-0
1f 1
7 8.2927286e+03 2.17e-03 1.89e-01 -1.0 2.55e+00 - 9.91e-01 1.00e+0
0f 1
8 7.7707489e+03 1.76e-03 6.99e-02 -1.7 6.35e+00 - 1.00e+00 9.92e-0
1f 1
9 7.5980730e+03 1.95e-03 3.69e-01 -2.5 1.67e+00 - 1.00e+00 7.91e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.5727497e+03 1.82e-04 4.79e-02 -2.5 3.43e-01 - 1.00e+00 9.36e-0
1h 1
11 7.5754877e+03 7.05e-06 1.34e-03 -2.5 2.20e-02 - 1.00e+00 1.00e+0
0f 1
12 7.5482488e+03 7.66e-06 4.23e-03 -3.8 8.04e+00 - 1.00e+00 9.79e-0
1f 1
13 7.5480543e+03 1.37e-08 6.27e-06 -3.8 1.66e-01 - 1.00e+00 1.00e+0
0f 1
14 7.5465649e+03 1.73e-08 3.04e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0f 1
15 7.5465477e+03 1.28e-12 4.22e-10 -8.6 5.52e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 7.5465477420214127e+00 7.5465477420214129e+0
3
Dual infeasibility......: 4.2179949817439520e-10 4.2179949817439520e-0
7
Constraint violation....: 1.2798789805756883e-12 1.2798789805756883e-1
2
Complementarity.........: 2.8029758057300762e-09 2.8029758057300762e-0
6
Overall NLP error.......: 2.8029758057300762e-09 2.8029758057300762e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9469463e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3h 1
2 8.9070845e+02 3.24e+03 5.24e+01 -1.0 2.13e+03 - 3.61e-05 1.51e-0
4h 1
3 3.3042115e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 6.40e-05 2.31e-0
2f 1
4 1.5680539e+04 6.28e-02 8.02e+01 -1.0 3.17e+03 - 3.82e-02 1.00e+0
0h 1
5 7.1096018e+03 5.94e-02 5.80e+01 -1.0 5.03e+01 - 2.72e-01 4.93e-0
2f 1
6 5.7281759e+03 2.48e-02 2.85e+01 -1.0 2.32e+01 - 5.13e-01 5.39e-0
1f 1
7 5.1166765e+03 1.01e-02 1.45e+00 -1.0 8.86e+00 - 9.34e-01 7.73e-0
1f 1
8 5.4253179e+03 3.01e-04 8.55e-02 -1.0 3.30e+00 - 9.99e-01 1.00e+0
0f 1
9 4.7996391e+03 2.08e-03 7.85e-02 -2.5 4.57e+00 - 8.62e-01 8.55e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.6289041e+03 2.21e-03 3.37e-01 -2.5 1.04e+00 - 1.00e+00 7.83e-0
1f 1
11 4.6027998e+03 1.45e-04 4.55e-03 -2.5 2.20e-01 - 1.00e+00 1.00e+0
0h 1
12 4.5779299e+03 2.16e-05 4.19e-02 -3.8 8.05e+00 - 1.00e+00 8.86e-0
1h 1
13 4.5759312e+03 5.62e-08 5.97e-04 -3.8 9.12e-01 - 1.00e+00 1.00e+0
0f 1
14 4.5743283e+03 4.27e-08 6.40e-05 -5.7 4.46e-01 - 1.00e+00 9.98e-0
1f 1
15 4.5743286e+03 1.89e-12 1.38e-08 -5.7 1.05e-03 - 1.00e+00 1.00e+0
0f 1
16 4.5743102e+03 2.57e-12 3.30e-06 -8.6 5.53e-03 - 1.00e+00 9.99e-0
1f 1
17 4.5743102e+03 7.11e-15 4.87e-14 -8.6 2.94e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 4.5743102093272148e+00 4.5743102093272146e+0
3
Dual infeasibility......: 4.8654682761056502e-14 4.8654682761056502e-1
1
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.6352491543946366e-09 2.6352491543946365e-0
6
Overall NLP error.......: 2.6352491543946366e-09 2.6352491543946365e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8047271e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.82e-0
3h 1
2 8.7572174e+02 2.00e+03 5.24e+01 -1.0 1.12e+03 - 4.57e-05 1.77e-0
4h 1
3 8.5855984e+02 2.00e+03 5.24e+01 -1.0 1.99e+03 - 9.83e-05 6.70e-0
4h 1
4 2.9495305e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 7.60e-04 2.24e-0
2f 1
5 1.3917021e+04 6.17e-02 7.93e+01 -1.0 1.95e+03 - 5.68e-02 1.00e+0
0h 1
6 5.5167035e+03 5.73e-02 5.23e+01 -1.0 6.38e+01 - 3.28e-01 6.60e-0
2f 1
7 4.1582065e+03 3.11e-02 2.54e+01 -1.0 3.21e+01 - 5.03e-01 4.22e-0
1f 1
8 3.3871337e+03 1.13e-02 1.99e+00 -1.0 1.10e+01 - 9.20e-01 9.10e-0
1f 1
9 3.8059789e+03 3.36e-04 1.98e-01 -1.0 4.84e+00 - 9.33e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.1152314e+03 1.20e-03 9.52e-01 -1.7 1.93e+01 - 4.70e-01 9.97e-0
1f 1
11 3.1850765e+03 4.48e-05 2.37e-02 -1.7 6.90e+00 - 1.00e+00 1.00e+0
0f 1
12 3.0667845e+03 4.90e-05 1.82e-01 -2.5 2.55e+01 - 1.00e+00 8.60e-0
1f 1
13 3.0614714e+03 8.55e-05 2.75e-03 -2.5 2.84e-01 - 1.00e+00 1.00e+0
0f 1
14 3.0435426e+03 2.49e-04 6.74e-02 -3.8 7.00e+00 - 7.79e-01 9.54e-0
1h 1
15 3.0406301e+03 1.60e-03 1.55e-03 -3.8 3.26e-01 - 9.82e-01 1.00e+0
0f 1
16 3.0406230e+03 8.22e-05 6.20e-05 -3.8 2.29e-02 - 1.00e+00 1.00e+0
0h 1
17 3.0392663e+03 1.30e-04 1.10e-03 -5.7 3.04e-01 - 9.19e-01 1.00e+0
0h 1
18 3.0392284e+03 3.23e-05 6.59e-06 -5.7 8.38e-03 - 1.00e+00 1.00e+0
0h 1
19 3.0392341e+03 1.71e-07 3.29e-06 -5.7 5.94e-04 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 3.0392190e+03 2.64e-08 3.19e-05 -8.6 3.69e-03 - 1.00e+00 9.58e-0
1h 1
21 3.0392184e+03 2.31e-11 5.70e-08 -8.6 1.55e-04 - 1.00e+00 9.99e-0
1f 1
22 3.0392184e+03 1.84e-15 2.51e-14 -8.6 4.84e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 3.0392183983302208e+00 3.0392183983302207e+0
3
Dual infeasibility......: 2.5063284780912909e-14 2.5063284780912909e-1
1
Constraint violation....: 1.8412737356453957e-15 1.8412737356453957e-1
5
Complementarity.........: 4.7576534514847783e-09 4.7576534514847781e-0
6
Overall NLP error.......: 4.7576534514847783e-09 4.7576534514847781e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2278083e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 3.31e-04 9.87e-0
3h 1
2 8.0391474e+02 9.17e+02 5.24e+01 -1.0 7.85e+02 - 8.87e-05 6.88e-0
4h 1
3 2.4271271e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 6.68e-04 2.10e-0
2h 1
4 1.2385916e+04 5.52e-02 8.23e+01 -1.0 8.98e+02 - 3.86e-02 1.00e+0
0h 1
5 3.8851959e+03 5.26e-02 5.59e+01 -1.0 8.06e+01 - 3.19e-01 5.02e-0
2f 1
6 1.9099004e+03 3.73e-02 2.99e+01 -1.0 3.93e+01 - 4.69e-01 5.04e-0
1f 1
7 4.6737272e+03 1.22e-02 2.67e+01 -1.0 2.06e+01 - 4.01e-01 1.00e+0
0h 1
8 1.8754601e+03 1.19e-02 1.01e+00 -1.0 2.53e+01 - 9.88e-01 8.94e-0
1f 1
9 2.0005994e+03 1.84e-04 4.66e-02 -1.0 3.18e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7351413e+03 2.16e-04 1.24e+00 -2.5 1.71e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5469297e+03 3.76e-03 1.33e-01 -2.5 7.60e+00 - 7.95e-01 1.00e+0
0f 1
12 1.5237159e+03 5.30e-03 3.11e-01 -2.5 1.84e+00 - 1.00e+00 7.66e-0
1h 1
13 1.5360639e+03 2.44e-04 4.74e-03 -2.5 7.11e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5034784e+03 1.70e-04 2.15e-02 -3.8 1.62e+01 - 9.91e-01 9.29e-0
1h 1
15 1.5021214e+03 7.21e-07 6.83e-05 -3.8 1.10e+00 - 1.00e+00 1.00e+0
0h 1
16 1.5003172e+03 3.77e-07 1.78e-04 -5.7 8.92e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003154e+03 3.79e-11 2.92e-09 -5.7 4.18e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.11e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932795321093e+00 1.5002932795321094e+0
3
Dual infeasibility......: 2.1737235540415289e-09 2.1737235540415289e-0
6
Constraint violation....: 6.2995483829375587e-11 6.2995483829375587e-1
1
Complementarity.........: 2.8882174399889662e-09 2.8882174399889660e-0
6
Overall NLP error.......: 2.8882174399889662e-09 2.8882174399889660e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.27e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9796468e+02 4.09e+01 5.94e+01 -1.0 1.42e+01 - 6.99e-04 4.23e-0
2f 1
2 1.2226496e+04 6.07e-02 7.87e+01 -1.0 1.80e+01 - 7.07e-02 1.00e+0
0h 1
3 3.6201828e+03 5.54e-02 5.15e+01 -1.0 5.45e+01 - 3.33e-01 7.87e-0
2f 1
4 2.3523806e+03 2.93e-02 2.28e+01 -1.0 2.70e+01 - 5.45e-01 4.46e-0
1f 1
5 1.7571753e+03 8.49e-03 1.17e+00 -1.0 9.96e+00 - 9.27e-01 7.68e-0
1f 1
6 2.0298789e+03 3.42e-04 8.15e-02 -1.0 3.35e+00 - 1.00e+00 1.00e+0
0h 1
7 1.4033439e+03 2.08e-03 8.15e-02 -2.5 4.87e+00 - 8.66e-01 8.50e-0
1f 1
8 1.2236663e+03 2.16e-03 2.06e-01 -2.5 1.05e+00 - 1.00e+00 8.33e-0
1f 1
9 1.2066808e+03 8.65e-05 3.81e-03 -2.5 1.49e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1969329e+03 4.60e-05 1.08e+00 -3.8 9.70e-02 - 1.00e+00 4.99e-0
1h 1
11 1.1949888e+03 3.31e-07 1.13e-01 -3.8 3.83e-02 - 9.68e-01 1.00e+0
0f 1
12 1.1939522e+03 1.38e-08 1.76e-03 -3.8 3.31e-02 - 1.00e+00 1.00e+0
0H 1
13 1.1941490e+03 1.10e-05 2.71e-04 -3.8 3.66e-03 - 1.00e+00 1.00e+0
0f 1
14 1.1935288e+03 1.78e-06 6.37e-02 -5.7 1.23e-02 - 7.78e-01 9.68e-0
1h 1
15 1.1933608e+03 1.24e-05 2.14e-04 -5.7 5.02e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1933669e+03 2.91e-08 2.23e-06 -5.7 2.67e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1933536e+03 2.76e-08 9.71e-06 -8.6 2.46e-04 - 9.82e-01 9.89e-0
1h 1
18 1.1933535e+03 2.43e-13 3.27e-11 -8.6 1.97e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1933534990113133e+00 1.1933534990113133e+0
3
Dual infeasibility......: 3.2690570316929778e-11 3.2690570316929778e-0
8
Constraint violation....: 2.4302782009044677e-13 2.4302782009044677e-1
3
Complementarity.........: 2.5120655771128867e-09 2.5120655771128866e-0
6
Overall NLP error.......: 2.5120655771128867e-09 2.5120655771128866e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1584839e+02 1.09e+02 1.13e+02 -1.0 3.76e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1398692e+04 5.38e-02 8.36e+01 -1.0 4.53e+01 - 3.10e-02 1.00e+0
0h 1
3 2.7848913e+03 5.17e-02 6.48e+01 -1.0 8.43e+01 - 2.27e-01 4.32e-0
2f 1
4 9.8155782e+02 4.24e-02 3.38e+01 -1.0 3.41e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5909720e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.21e-01 1.00e+0
0h 1
6 9.4491031e+02 1.01e-02 8.73e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6264865e+02 4.59e-04 6.60e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536469e+02 1.94e-03 1.94e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379741e+02 3.25e-03 6.12e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140235e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388164e+02 1.57e-04 1.69e-02 -3.8 7.57e-01 - 9.93e-01 9.41e-0
1h 1
12 5.8370191e+02 7.28e-07 6.65e-05 -3.8 8.63e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278679e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.06e-09 -5.7 3.41e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148935374e-01 5.8277753148935369e+0
2
Dual infeasibility......: 2.0880537879639588e-09 2.0880537879639588e-0
6
Constraint violation....: 6.2994207072897268e-11 6.2994207072897268e-1
1
Complementarity.........: 2.8882094461374997e-09 2.8882094461374996e-0
6
Overall NLP error.......: 2.8882094461374997e-09 2.8882094461374996e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.77e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5003658e+02 7.50e+01 9.04e+01 -1.0 2.59e+01 - 3.83e-04 3.52e-0
2f 1
2 1.1818872e+04 5.63e-02 8.12e+01 -1.0 2.87e+01 - 4.64e-02 1.00e+0
0h 1
3 3.1585741e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.65e-0
2f 1
4 1.0154810e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8148913e+03 7.28e-03 1.55e+01 -1.0 1.93e+01 - 6.11e-01 1.00e+0
0h 1
6 1.1196665e+03 5.40e-03 4.04e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8244198e+02 9.99e-04 2.10e-01 -1.7 5.71e+00 - 1.00e+00 8.87e-0
1h 1
8 7.2817504e+02 8.46e-04 1.35e-02 -1.7 3.45e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0982255e+02 1.50e-03 1.13e-01 -3.8 4.49e+00 - 7.71e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8216110e+02 2.17e-03 7.23e-02 -3.8 2.11e+00 - 8.07e-01 7.40e-0
1h 1
11 5.8336685e+02 9.52e-05 4.78e-02 -3.8 3.17e-02 - 1.00e+00 9.56e-0
1h 1
12 5.8368716e+02 2.82e-07 1.33e-05 -3.8 3.28e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278928e+02 4.12e-07 5.39e-04 -5.7 3.47e-02 - 1.00e+00 9.91e-0
1h 1
14 5.8278859e+02 4.36e-11 3.52e-09 -5.7 2.10e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.65e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753111573005e-01 5.8277753111573008e+0
2
Dual infeasibility......: 2.6503201671236074e-09 2.6503201671236074e-0
6
Constraint violation....: 6.3002450478855110e-11 6.3002450478855110e-1
1
Complementarity.........: 2.8882681466328354e-09 2.8882681466328355e-0
6
Overall NLP error.......: 2.8882681466328354e-09 2.8882681466328355e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.27e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9796468e+02 4.09e+01 5.94e+01 -1.0 1.42e+01 - 6.99e-04 4.23e-0
2f 1
2 1.2226496e+04 6.07e-02 7.87e+01 -1.0 1.80e+01 - 7.07e-02 1.00e+0
0h 1
3 3.6201828e+03 5.54e-02 5.15e+01 -1.0 5.45e+01 - 3.33e-01 7.87e-0
2f 1
4 2.3523806e+03 2.93e-02 2.28e+01 -1.0 2.70e+01 - 5.45e-01 4.46e-0
1f 1
5 1.7571753e+03 8.49e-03 1.17e+00 -1.0 9.96e+00 - 9.27e-01 7.68e-0
1f 1
6 2.0298789e+03 3.42e-04 8.15e-02 -1.0 3.35e+00 - 1.00e+00 1.00e+0
0h 1
7 1.4033439e+03 2.08e-03 8.15e-02 -2.5 4.87e+00 - 8.66e-01 8.50e-0
1f 1
8 1.2236663e+03 2.16e-03 2.06e-01 -2.5 1.05e+00 - 1.00e+00 8.33e-0
1f 1
9 1.2066808e+03 8.65e-05 3.81e-03 -2.5 1.49e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1969329e+03 4.60e-05 1.08e+00 -3.8 9.70e-02 - 1.00e+00 4.99e-0
1h 1
11 1.1949888e+03 3.31e-07 1.13e-01 -3.8 3.83e-02 - 9.68e-01 1.00e+0
0f 1
12 1.1939522e+03 1.38e-08 1.76e-03 -3.8 3.31e-02 - 1.00e+00 1.00e+0
0H 1
13 1.1941490e+03 1.10e-05 2.71e-04 -3.8 3.66e-03 - 1.00e+00 1.00e+0
0f 1
14 1.1935288e+03 1.78e-06 6.37e-02 -5.7 1.23e-02 - 7.78e-01 9.68e-0
1h 1
15 1.1933608e+03 1.24e-05 2.14e-04 -5.7 5.02e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1933669e+03 2.91e-08 2.23e-06 -5.7 2.67e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1933536e+03 2.76e-08 9.71e-06 -8.6 2.46e-04 - 9.82e-01 9.89e-0
1h 1
18 1.1933535e+03 2.43e-13 3.27e-11 -8.6 1.97e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1933534990113133e+00 1.1933534990113133e+0
3
Dual infeasibility......: 3.2690570316929778e-11 3.2690570316929778e-0
8
Constraint violation....: 2.4302782009044677e-13 2.4302782009044677e-1
3
Complementarity.........: 2.5120655771128867e-09 2.5120655771128866e-0
6
Overall NLP error.......: 2.5120655771128867e-09 2.5120655771128866e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2252332e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 3.31e-04 9.88e-0
3h 1
2 8.0153381e+02 9.17e+02 5.24e+01 -1.0 7.99e+02 - 9.95e-05 7.66e-0
4h 1
3 5.3153833e+02 9.08e+02 5.25e+01 -1.0 9.17e+02 - 7.42e-04 1.01e-0
2h 1
4 2.7943622e+02 8.88e+02 5.21e+01 -1.0 9.08e+02 - 1.15e-02 2.18e-0
2f 1
5 8.4079686e+03 6.33e-02 8.19e+01 -1.0 8.88e+02 - 6.36e-02 1.00e+0
0h 1
6 3.4045711e+03 5.76e-02 2.46e+01 -1.0 5.34e+01 - 6.81e-01 8.27e-0
2f 1
7 1.8648424e+03 3.67e-02 6.81e+00 -1.0 3.49e+01 - 6.93e-01 4.95e-0
1f 1
8 2.2942280e+03 6.22e-03 1.12e+00 -1.0 1.29e+00 - 9.10e-01 1.00e+0
0f 1
9 2.0562305e+03 6.05e-04 1.05e+00 -1.0 9.16e+00 - 2.67e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.0507087e+03 8.42e-05 6.60e-01 -1.0 1.24e+01 - 5.49e-01 1.00e+0
0f 1
11 1.7383519e+03 2.64e-04 5.16e-01 -1.7 5.27e+00 - 9.55e-01 7.83e-0
1f 1
12 1.7194241e+03 7.61e-04 2.92e-01 -1.7 5.25e+01 - 4.80e-01 1.00e+0
0f 1
13 1.7479474e+03 4.08e-05 2.07e-03 -1.7 3.48e+01 - 1.00e+00 1.00e+0
0h 1
14 1.5288931e+03 1.25e-03 9.74e-02 -3.8 1.19e+02 - 7.92e-01 9.24e-0
1f 1
15 1.5019307e+03 1.57e-03 5.53e-02 -3.8 2.49e+00 - 8.36e-01 7.74e-0
1h 1
16 1.5019831e+03 2.66e-06 7.66e-04 -3.8 4.56e-01 - 1.00e+00 1.00e+0
0h 1
17 1.5003306e+03 3.00e-07 7.25e-04 -5.7 8.90e-01 - 1.00e+00 9.87e-0
1h 1
18 1.5003154e+03 3.84e-11 6.11e-09 -5.7 1.04e-02 - 1.00e+00 1.00e+0
0f 1
19 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.11e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.5002932793466925e+00 1.5002932793466925e+0
3
Dual infeasibility......: 2.1735038471086249e-09 2.1735038471086249e-0
6
Constraint violation....: 6.2998425920390844e-11 6.2998425920390844e-1
1
Complementarity.........: 2.9005060058685800e-09 2.9005060058685799e-0
6
Overall NLP error.......: 2.9005060058685800e-09 2.9005060058685799e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6513624e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 4.97e-04 9.88e-0
3h 1
2 8.4156626e+02 9.17e+02 5.24e+01 -1.0 8.13e+02 - 9.77e-05 8.72e-0
4h 1
3 4.8682782e+02 9.04e+02 5.24e+01 -1.0 9.17e+02 - 8.47e-04 1.35e-0
2h 1
4 3.2667788e+02 8.82e+02 5.19e+01 -1.0 9.04e+02 - 1.52e-02 2.52e-0
2f 1
87 1.486084e+04 1.632511e+04 6.561519e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1151691e+02 1.57e+04 5.50e+01 -1.0 1.59e+04 - 1.75e-04 9.81e-0
3h 1
2 7.0833659e+02 1.57e+04 5.50e+01 -1.0 1.21e+04 - 1.89e-05 1.29e-0
4h 1
3 6.9577091e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 3.44e-05 1.02e-0
3h 1
4 4.9165722e+02 1.54e+04 5.39e+01 -1.0 1.57e+04 - 1.04e-03 1.87e-0
2h 1
5 2.6208500e+04 7.61e-02 8.72e+01 -1.0 1.54e+04 - 2.16e-02 1.00e+0
0h 1
6 1.7901027e+04 7.35e-02 7.53e+01 -1.0 7.63e+01 - 1.45e-01 3.65e-0
2f 1
7 1.6638046e+04 4.63e-02 3.51e+01 -1.0 1.95e+01 - 5.29e-01 3.81e-0
1f 1
8 1.7140539e+04 3.51e-02 1.20e+01 -1.0 1.35e+01 - 5.62e-01 2.50e-0
1f 3
9 1.6798044e+04 7.54e-03 2.47e-01 -1.0 1.42e+00 - 9.84e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6498539e+04 7.12e-04 1.43e+00 -1.7 5.73e+00 - 2.30e-01 9.18e-0
1f 1
11 1.6490739e+04 1.49e-04 5.75e-01 -1.7 6.25e+00 - 6.93e-01 1.00e+0
0f 1
12 1.6485427e+04 1.36e-04 2.05e-01 -1.7 1.70e+01 - 5.45e-01 1.00e+0
0f 1
13 1.6508395e+04 1.39e-05 2.79e-02 -1.7 2.59e+01 - 8.57e-01 1.00e+0
0f 1
14 1.6380709e+04 9.46e-04 4.56e-02 -2.5 3.22e+01 - 9.27e-01 1.00e+0
0f 1
15 1.6353767e+04 1.09e-03 1.14e-02 -2.5 7.66e+00 - 1.00e+00 1.00e+0
0h 1
16 1.6329403e+04 1.82e-04 8.24e-02 -3.8 1.40e+01 - 1.00e+00 8.56e-0
1h 1
17 1.6326782e+04 5.78e-07 9.72e-05 -3.8 1.73e+00 - 1.00e+00 1.00e+0
0h 1
18 1.6325123e+04 4.00e-07 1.03e-04 -5.7 7.40e-01 - 1.00e+00 9.98e-0
1h 1
19 1.6325125e+04 3.80e-11 2.99e-09 -5.7 2.35e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325106e+04 5.58e-11 3.31e-05 -8.6 9.17e-03 - 1.00e+00 9.46e-0
1h 1
21 1.6325105e+04 1.85e-13 6.02e-12 -8.6 5.53e-04 - 1.00e+00 1.00e+0
0f 1
22 1.6325105e+04 1.42e-14 1.02e-14 -9.0 1.00e-05 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.6325105264622831e+01 1.6325105264622831e+0
4
Dual infeasibility......: 1.0172836075079783e-14 1.0172836075079783e-1
1
Constraint violation....: 1.4210854715202004e-14 1.4210854715202004e-1
4
Complementarity.........: 1.2009519544366118e-09 1.2009519544366118e-0
6
Overall NLP error.......: 1.2009519544366118e-09 1.2009519544366118e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.4942965e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.08e-04 9.80e-0
3f 1
2 7.4655362e+02 1.50e+04 5.25e+01 -1.0 1.43e+04 - 4.85e-05 1.03e-0
4h 1
3 7.1996490e+02 1.49e+04 5.25e+01 -1.0 1.50e+04 - 6.34e-06 2.00e-0
3h 1
4 5.1236387e+02 1.47e+04 5.27e+01 -1.0 1.49e+04 - 2.13e-03 1.92e-0
2h 1
5 2.5154338e+04 6.66e-02 8.55e+01 -1.0 1.47e+04 - 2.88e-02 1.00e+0
0h 1
6 1.7345157e+04 6.39e-02 6.64e+01 -1.0 7.13e+01 - 2.30e-01 4.32e-0
2f 1
7 1.5905238e+04 4.64e-02 3.17e+01 -1.0 2.57e+01 - 5.17e-01 4.13e-0
1f 1
8 1.6179900e+04 3.42e-02 1.13e+01 -1.0 1.49e+01 - 5.03e-01 1.25e-0
1f 4
9 1.6020124e+04 5.38e-03 1.66e-01 -1.0 2.80e+00 - 9.92e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5734717e+04 9.34e-04 2.30e-01 -1.7 7.34e+00 - 1.00e+00 8.85e-0
1f 1
11 1.5727162e+04 7.31e-04 9.76e-03 -1.7 3.30e+01 - 1.00e+00 1.00e+0
0f 1
12 1.5585618e+04 1.28e-03 8.50e-02 -3.8 3.98e+01 - 8.04e-01 9.33e-0
1f 1
13 1.5560391e+04 1.42e-03 6.28e-02 -3.8 2.62e+00 - 8.54e-01 7.77e-0
1h 1
14 1.5560324e+04 2.49e-06 7.07e-04 -3.8 5.83e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5559224e+04 3.27e-07 5.68e-04 -5.7 2.97e-01 - 1.00e+00 9.89e-0
1h 1
16 1.5559217e+04 4.00e-11 5.95e-09 -5.7 3.46e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5559202e+04 6.30e-11 2.06e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5559202162568816e+01 1.5559202162568816e+0
4
Dual infeasibility......: 2.0613867163250217e-09 2.0613867163250217e-0
6
Constraint violation....: 6.2995261784770662e-11 6.2995261784770662e-1
1
Complementarity.........: 3.1994977101970786e-09 3.1994977101970787e-0
6
Overall NLP error.......: 3.1994977101970786e-09 3.1994977101970787e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.8248561e+02 1.39e+04 5.25e+01 -1.0 1.40e+04 - 2.49e-04 9.80e-0
3f 1
2 7.7959938e+02 1.39e+04 5.25e+01 -1.0 1.33e+04 - 4.80e-05 1.04e-0
4h 1
3 7.4798381e+02 1.39e+04 5.25e+01 -1.0 1.39e+04 - 6.89e-06 2.19e-0
3h 1
4 5.1186752e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 2.35e-03 1.97e-0
2h 1
5 2.4218848e+04 5.80e-02 8.44e+01 -1.0 1.36e+04 - 3.26e-02 1.00e+0
0h 1
6 1.6483605e+04 5.55e-02 6.05e+01 -1.0 7.29e+01 - 2.86e-01 4.64e-0
2f 1
7 1.4854180e+04 4.44e-02 2.99e+01 -1.0 3.14e+01 - 5.03e-01 4.47e-0
1f 1
8 1.5153228e+04 2.90e-02 1.19e+01 -1.0 1.66e+01 - 4.57e-01 1.25e-0
1f 4
9 1.4938794e+04 5.75e-03 1.41e-01 -1.0 4.50e+00 - 9.92e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4656057e+04 1.13e-03 2.64e-01 -1.7 7.07e+00 - 1.00e+00 8.72e-0
1f 1
11 1.4649530e+04 7.20e-04 1.13e-02 -1.7 3.34e+01 - 1.00e+00 1.00e+0
0f 1
12 1.4506541e+04 1.32e-03 8.85e-02 -3.8 3.98e+01 - 8.00e-01 9.32e-0
1f 1
13 1.4481217e+04 1.46e-03 6.22e-02 -3.8 2.66e+00 - 8.50e-01 7.75e-0
1h 1
14 1.4481169e+04 2.59e-06 7.28e-04 -3.8 5.97e-01 - 1.00e+00 1.00e+0
0h 1
15 1.4480074e+04 3.20e-07 5.93e-04 -5.7 2.97e-01 - 1.00e+00 9.89e-0
1h 1
16 1.4480067e+04 3.96e-11 6.09e-09 -5.7 1.04e-01 - 1.00e+00 1.00e+0
0f 1
17 1.4480052e+04 6.30e-11 2.08e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.4480051787868721e+01 1.4480051787868721e+0
4
Dual infeasibility......: 2.0787132865090196e-09 2.0787132865090196e-0
6
Constraint violation....: 6.2995497707163395e-11 6.2995497707163395e-1
1
Complementarity.........: 3.0180764901411235e-09 3.0180764901411233e-0
6
Overall NLP error.......: 3.0180764901411235e-09 3.0180764901411233e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8660955e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 6.52e-04 9.80e-0
3h 1
2 8.8384625e+02 1.27e+04 5.24e+01 -1.0 1.24e+04 - 8.84e-05 1.01e-0
4h 1
3 8.7272326e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 3.49e-06 7.46e-0
4f 1
4 5.4574990e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 8.09e-04 2.25e-0
2h 1
5 2.4631517e+04 6.26e-02 7.88e+01 -1.0 1.24e+04 - 6.08e-02 1.00e+0
0h 1
6 1.6243553e+04 5.78e-02 5.13e+01 -1.0 5.87e+01 - 3.35e-01 6.95e-0
2f 1
7 1.4934198e+04 3.01e-02 2.40e+01 -1.0 2.84e+01 - 5.21e-01 4.40e-0
1f 1
8 1.4243021e+04 9.93e-03 1.46e+00 -1.0 1.05e+01 - 9.23e-01 8.16e-0
1f 1
9 1.4571462e+04 2.25e-04 7.45e-02 -1.0 3.93e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3872212e+04 2.15e-03 1.05e-01 -2.5 5.51e+00 - 8.71e-01 9.05e-0
1f 1
11 1.3804021e+04 1.02e-03 9.81e-01 -2.5 7.21e-01 - 1.00e+00 4.98e-0
1h 1
12 1.3800602e+04 4.16e-06 9.03e-03 -2.5 2.42e-01 - 1.00e+00 1.00e+0
0h 1
13 1.3783403e+04 2.58e-05 6.08e-02 -3.8 2.68e+00 - 8.45e-01 9.22e-0
1f 1
14 1.3780309e+04 5.83e-04 1.01e-03 -3.8 2.07e-01 - 1.00e+00 1.00e+0
0f 1
15 1.3779221e+04 1.14e-04 8.17e-03 -5.7 1.49e-01 - 8.14e-01 1.00e+0
0h 1
16 1.3779118e+04 4.94e-05 2.58e-05 -5.7 1.10e-02 - 1.00e+00 1.00e+0
0h 1
17 1.3779116e+04 5.37e-06 8.99e-05 -5.7 2.62e-03 - 1.00e+00 9.65e-0
1h 1
18 1.3779119e+04 5.08e-08 8.29e-07 -5.7 3.47e-04 - 1.00e+00 1.00e+0
0f 1
19 1.3779104e+04 5.36e-08 4.39e-06 -8.6 1.84e-03 - 9.98e-01 9.85e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.3779104e+04 2.48e-13 2.65e-11 -8.6 2.81e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.3779104307834483e+01 1.3779104307834483e+0
4
Dual infeasibility......: 2.6472422198647142e-11 2.6472422198647142e-0
8
Constraint violation....: 2.4824586830618500e-13 2.4824586830618500e-1
3
Complementarity.........: 2.5096336367417966e-09 2.5096336367417964e-0
6
Overall NLP error.......: 2.5096336367417966e-09 2.5096336367417964e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6659874e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 4.97e-04 9.81e-0
3h 1
2 8.6320928e+02 1.11e+04 5.24e+01 -1.0 8.05e+03 - 1.95e-05 1.37e-0
4h 1
3 4.9056631e+02 1.09e+04 5.25e+01 -1.0 1.11e+04 - 4.28e-05 2.24e-0
2f 1
4 2.3317614e+04 5.90e-02 8.20e+01 -1.0 1.09e+04 - 2.52e-02 1.00e+0
0h 1
5 1.4657640e+04 5.66e-02 6.67e+01 -1.0 7.27e+01 - 1.89e-01 3.78e-0
2f 1
6 1.2692342e+04 3.20e-02 3.63e+01 -1.0 3.12e+01 - 4.72e-01 6.10e-0
1f 1
7 1.2454028e+04 7.86e-03 2.51e+00 -1.0 8.09e+00 - 9.36e-01 1.00e+0
0f 1
8 1.2472020e+04 7.61e-04 6.83e-02 -1.0 4.97e+00 - 9.96e-01 1.00e+0
0f 1
9 1.2079568e+04 3.87e-04 8.10e-01 -2.5 6.64e+00 - 9.15e-01 6.15e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2013059e+04 1.56e-04 1.74e-01 -2.5 6.26e+00 - 9.39e-01 1.00e+0
0h 1
11 1.1991348e+04 4.07e-03 2.65e-02 -2.5 9.10e-01 - 1.00e+00 1.00e+0
0h 1
12 1.1966928e+04 6.88e-04 3.65e-02 -3.8 1.34e+01 - 7.97e-01 1.00e+0
0h 1
13 1.1964315e+04 1.75e-03 1.20e-03 -3.8 5.03e-02 - 9.73e-01 1.00e+0
0h 1
14 1.1964511e+04 5.10e-05 1.47e-04 -3.8 1.26e-02 - 1.00e+00 1.00e+0
0h 1
15 1.1962623e+04 1.03e-04 3.60e-04 -5.7 7.43e-01 - 9.50e-01 9.76e-0
1h 1
16 1.1962599e+04 2.39e-05 3.90e-03 -5.7 1.79e-02 - 1.00e+00 7.70e-0
1h 1
17 1.1962599e+04 9.24e-09 1.29e-06 -5.7 4.13e-03 - 1.00e+00 1.00e+0
0f 1
18 1.1962577e+04 9.10e-09 1.94e-05 -8.6 9.21e-03 - 1.00e+00 9.83e-0
1h 1
19 1.1962577e+04 1.37e-12 6.59e-11 -8.6 1.53e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.1962576515629960e+01 1.1962576515629960e+0
4
Dual infeasibility......: 6.5869134597894553e-11 6.5869134597894553e-0
8
Constraint violation....: 1.3745671267884063e-12 1.3745671267884063e-1
2
Complementarity.........: 3.0787777709734528e-09 3.0787777709734527e-0
6
Overall NLP error.......: 3.0787777709734528e-09 3.0787777709734527e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8775333e+02 9.19e+03 5.24e+01 -1.0 9.28e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8469544e+02 9.19e+03 5.24e+01 -1.0 7.80e+03 - 2.91e-05 1.17e-0
4h 1
3 6.6462201e+02 9.08e+03 5.24e+01 -1.0 9.19e+03 - 2.18e-05 1.20e-0
2h 1
4 5.9228745e+02 8.88e+03 5.19e+01 -1.0 9.08e+03 - 1.38e-02 2.17e-0
2h 1
5 1.7105309e+04 7.36e-02 7.74e+01 -1.0 8.88e+03 - 1.04e-01 1.00e+0
0h 1
6 1.2211573e+04 6.40e-02 2.02e+01 -1.0 4.24e+01 - 7.12e-01 1.21e-0
1f 1
7 1.0749761e+04 2.49e-02 1.83e+00 -1.0 2.14e+01 - 9.33e-01 6.71e-0
1f 1
8 1.0985588e+04 3.01e-03 1.23e+00 -1.0 4.35e+00 - 4.31e-01 1.00e+0
0f 1
9 1.1155660e+04 5.06e-04 1.15e+00 -1.0 7.45e+00 - 5.03e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1144846e+04 1.23e-04 1.11e-01 -1.0 1.43e+01 - 7.01e-01 1.00e+0
0f 1
11 1.0527891e+04 1.85e-03 1.14e-01 -1.7 5.00e+00 - 9.39e-01 1.00e+0
0f 1
12 1.0370973e+04 1.16e-03 1.39e-01 -2.5 1.69e+01 - 8.78e-01 6.95e-0
1f 1
13 1.0363734e+04 1.97e-06 7.89e-03 -2.5 1.07e+01 - 1.00e+00 1.00e+0
0h 1
14 1.0339590e+04 3.87e-06 5.23e-02 -3.8 8.49e+00 - 9.48e-01 8.92e-0
1f 1
15 1.0336005e+04 5.36e-04 6.24e-04 -3.8 9.17e-01 - 1.00e+00 1.00e+0
0f 1
16 1.0334762e+04 5.19e-05 1.05e-02 -5.7 4.46e-01 - 8.32e-01 1.00e+0
0h 1
17 1.0334652e+04 3.25e-05 3.57e-05 -5.7 9.19e-03 - 1.00e+00 1.00e+0
0h 1
18 1.0334655e+04 5.90e-07 6.12e-06 -5.7 1.16e-03 - 1.00e+00 1.00e+0
0h 1
19 1.0334639e+04 4.11e-08 8.18e-05 -8.6 5.53e-03 - 1.00e+00 9.42e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.0334638e+04 7.76e-12 7.07e-11 -8.6 3.19e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.0334637966777732e+01 1.0334637966777733e+0
4
Dual infeasibility......: 7.0721394834974211e-11 7.0721394834974204e-0
8
Constraint violation....: 7.7564621392411937e-12 7.7564621392411937e-1
2
Complementarity.........: 3.2346181800586114e-09 3.2346181800586115e-0
6
Overall NLP error.......: 3.2346181800586114e-09 3.2346181800586115e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3710605e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 3.06e-03 9.80e-0
3h 1
2 9.3410771e+02 6.71e+03 5.23e+01 -1.0 6.33e+03 - 5.53e-05 1.05e-0
4h 1
3 8.7601628e+02 6.69e+03 5.23e+01 -1.0 6.70e+03 - 8.90e-06 2.62e-0
3f 1
4 4.4078555e+02 6.54e+03 5.23e+01 -1.0 6.69e+03 - 3.32e-03 2.17e-0
2h 1
5 1.7952488e+04 7.75e-02 7.79e+01 -1.0 6.54e+03 - 7.84e-02 1.00e+0
0h 1
6 1.1162158e+04 7.00e-02 2.30e+01 -1.0 4.32e+00 - 6.80e-01 8.97e-0
2f 1
7 1.0161093e+04 3.32e-02 7.43e+00 -1.0 4.23e+00 - 7.42e-01 1.00e+0
0f 1
8 1.0283900e+04 1.70e-02 7.27e-01 -1.0 1.10e+00 - 9.96e-01 4.94e-0
1f 2
9 1.0000013e+04 8.27e-03 3.35e-01 -1.7 1.28e+01 - 1.00e+00 8.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.9361941e+03 1.02e-03 1.04e-01 -1.7 8.95e+00 - 1.00e+00 1.00e+0
0f 1
11 9.8169976e+03 2.77e-04 1.12e-01 -2.5 1.73e+01 - 9.89e-01 8.85e-0
1f 1
12 9.8069007e+03 4.94e-06 1.10e-03 -2.5 1.95e+00 - 1.00e+00 1.00e+0
0f 1
13 9.7851225e+03 5.56e-06 7.61e-04 -3.8 2.68e+00 - 1.00e+00 1.00e+0
0f 1
14 9.7842068e+03 3.44e-09 3.52e-06 -5.7 1.48e-01 - 1.00e+00 1.00e+0
0h 1
15 9.7841926e+03 2.34e-12 4.09e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 9.7841925875082101e+00 9.7841925875082106e+0
3
Dual infeasibility......: 4.0868829584806167e-10 4.0868829584806167e-0
7
Constraint violation....: 2.3424734374444256e-12 2.3424734374444256e-1
2
Complementarity.........: 2.5729802584946399e-09 2.5729802584946401e-0
6
Overall NLP error.......: 2.5729802584946399e-09 2.5729802584946401e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8766795e+02 4.77e+03 5.24e+01 -1.0 4.81e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8353498e+02 4.77e+03 5.24e+01 -1.0 2.95e+03 - 2.75e-05 1.60e-0
4h 1
3 3.6139295e+02 4.66e+03 5.25e+01 -1.0 4.77e+03 - 7.13e-05 2.29e-0
2f 1
4 1.7143198e+04 6.18e-02 8.09e+01 -1.0 4.66e+03 - 3.19e-02 1.00e+0
0h 1
5 8.5555969e+03 5.88e-02 6.21e+01 -1.0 5.76e+01 - 2.31e-01 4.38e-0
2f 1
6 7.0738960e+03 2.50e-02 3.16e+01 -1.0 2.58e+01 - 4.96e-01 5.36e-0
1f 1
7 6.3640765e+03 1.22e-02 2.14e+00 -1.0 9.64e+00 - 9.28e-01 8.84e-0
1f 1
8 6.7865441e+03 4.25e-04 9.17e-02 -1.0 4.06e+00 - 9.97e-01 1.00e+0
0f 1
9 6.0100519e+03 2.23e-03 2.08e-01 -2.5 5.77e+00 - 8.66e-01 9.60e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.9413767e+03 1.05e-03 6.02e-01 -2.5 2.36e+00 - 1.00e+00 5.77e-0
1h 1
11 5.9461430e+03 3.58e-06 8.22e-03 -2.5 1.12e+00 - 1.00e+00 1.00e+0
0h 1
12 5.9228026e+03 5.05e-06 3.84e-02 -3.8 1.07e+01 - 9.20e-01 8.83e-0
1f 1
13 5.9187561e+03 4.66e-04 5.79e-04 -3.8 1.25e+00 - 1.00e+00 1.00e+0
0f 1
14 5.9173185e+03 6.39e-05 1.15e-02 -5.7 5.94e-01 - 8.12e-01 1.00e+0
0h 1
15 5.9172028e+03 3.63e-05 4.14e-05 -5.7 9.71e-03 - 1.00e+00 1.00e+0
0h 1
16 5.9172045e+03 1.60e-06 4.42e-05 -5.7 1.47e-03 - 1.00e+00 9.88e-0
1h 1
17 5.9172070e+03 3.53e-08 5.14e-07 -5.7 2.92e-04 - 1.00e+00 1.00e+0
0f 1
18 5.9171869e+03 3.96e-08 7.28e-06 -8.6 7.37e-03 - 9.97e-01 9.81e-0
1h 1
19 5.9171866e+03 5.33e-13 2.97e-11 -8.6 1.42e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 5.9171865581670327e+00 5.9171865581670327e+0
3
Dual infeasibility......: 2.9739911170610033e-11 2.9739911170610033e-0
8
Constraint violation....: 5.3324011872746269e-13 5.3324011872746269e-1
3
Complementarity.........: 2.9709256235847738e-09 2.9709256235847739e-0
6
Overall NLP error.......: 2.9709256235847738e-09 2.9709256235847739e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9473874e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3h 1
2 8.9143292e+02 3.24e+03 5.24e+01 -1.0 2.62e+03 - 4.85e-05 1.23e-0
4h 1
3 5.1813355e+02 3.19e+03 5.24e+01 -1.0 3.24e+03 - 3.31e-05 1.54e-0
2f 1
4 4.4980940e+02 3.11e+03 5.12e+01 -1.0 3.19e+03 - 2.40e-02 2.62e-0
2f 1
5 9.7252612e+03 8.18e-02 7.70e+01 -1.0 3.11e+03 - 1.16e-01 1.00e+0
0h 1
6 6.1329500e+03 7.03e-02 1.96e+01 -1.0 2.92e+01 - 7.30e-01 1.45e-0
1f 1
7 4.8587705e+03 1.43e-02 8.63e-01 -1.0 1.60e+01 - 9.43e-01 8.10e-0
1f 1
8 5.2613068e+03 6.24e-03 9.22e-01 -1.0 4.92e+00 - 1.53e-01 9.43e-0
1f 1
9 5.4818950e+03 2.77e-03 1.26e+00 -1.0 5.65e+00 - 6.38e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.4498601e+03 1.01e-03 1.59e-01 -1.0 1.45e+01 - 6.09e-01 1.00e+0
0f 1
11 4.8418771e+03 1.98e-03 8.01e-02 -1.7 2.99e+00 - 1.00e+00 1.00e+0
0f 1
12 4.6233268e+03 2.06e-03 8.77e-02 -2.5 2.21e+01 - 9.04e-01 8.39e-0
1f 1
13 4.6005008e+03 1.81e-04 5.70e-03 -2.5 3.45e+00 - 1.00e+00 1.00e+0
0h 1
14 4.5776728e+03 2.54e-05 3.95e-02 -3.8 5.36e+00 - 1.00e+00 8.82e-0
1h 1
15 4.5757765e+03 6.22e-08 6.01e-04 -3.8 6.27e-01 - 1.00e+00 1.00e+0
0f 1
16 4.5743256e+03 4.18e-08 5.05e-05 -5.7 2.97e-01 - 1.00e+00 9.98e-0
1f 1
17 4.5743268e+03 1.88e-12 1.27e-08 -5.7 5.72e-04 - 1.00e+00 1.00e+0
0f 1
18 4.5743102e+03 2.57e-12 3.30e-06 -8.6 3.68e-03 - 1.00e+00 9.99e-0
1f 1
19 4.5743102e+03 1.65e-15 4.86e-14 -8.6 1.75e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 4.5743102032624012e+00 4.5743102032624010e+0
3
Dual infeasibility......: 4.8648201392329926e-14 4.8648201392329926e-1
1
Constraint violation....: 1.6502061182181892e-15 1.6502061182181892e-1
5
Complementarity.........: 2.7176512406130432e-09 2.7176512406130430e-0
6
Overall NLP error.......: 2.7176512406130432e-09 2.7176512406130430e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1583257e+02 2.00e+03 5.23e+01 -1.0 2.01e+03 - 1.20e-03 9.81e-0
3h 1
2 9.1195716e+02 2.00e+03 5.23e+01 -1.0 1.37e+03 - 4.87e-05 1.44e-0
4h 1
3 3.1303385e+02 1.95e+03 5.24e+01 -1.0 2.00e+03 - 6.04e-05 2.36e-0
2f 1
4 1.4608110e+04 6.65e-02 7.72e+01 -1.0 1.95e+03 - 6.92e-02 1.00e+0
0h 1
5 6.1485043e+03 6.09e-02 3.60e+01 -1.0 2.22e+01 - 5.08e-01 7.70e-0
2f 1
6 4.6744427e+03 1.15e-02 1.62e+01 -1.0 1.30e+01 - 6.04e-01 8.35e-0
1f 1
7 4.8737737e+03 2.78e-03 1.38e-01 -1.0 3.28e+00 - 9.92e-01 1.00e+0
0f 1
8 4.4144374e+03 1.77e-03 1.46e-01 -1.7 7.19e+00 - 1.00e+00 1.00e+0
0f 1
9 4.2301365e+03 2.01e-03 3.83e-01 -2.5 2.11e+00 - 1.00e+00 7.84e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2032537e+03 1.87e-04 1.95e-02 -2.5 4.39e-01 - 1.00e+00 9.81e-0
1f 1
11 4.1817214e+03 1.90e-06 1.87e-02 -3.8 5.38e+00 - 9.84e-01 1.00e+0
0h 1
12 4.1818471e+03 1.75e-09 4.85e-06 -3.8 6.74e-03 - 1.00e+00 1.00e+0
0h 1
13 4.1805081e+03 1.80e-08 1.81e-04 -5.7 2.97e-01 - 1.00e+00 9.96e-0
1f 1
14 4.1805057e+03 1.80e-12 2.29e-09 -5.7 1.19e-03 - 1.00e+00 1.00e+0
0f 1
15 4.1804892e+03 2.63e-12 4.02e-08 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
16 4.1804892e+03 3.33e-16 2.53e-14 -8.6 5.00e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 4.1804891681052263e+00 4.1804891681052259e+0
3
Dual infeasibility......: 2.5313084961453569e-14 2.5313084961453569e-1
1
Constraint violation....: 3.3306690738754696e-16 3.3306690738754696e-1
6
Complementarity.........: 4.9936169431580072e-09 4.9936169431580073e-0
6
Overall NLP error.......: 4.9936169431580072e-09 4.9936169431580073e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6513624e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 4.97e-04 9.88e-0
3h 1
2 8.4156626e+02 9.17e+02 5.24e+01 -1.0 8.13e+02 - 9.77e-05 8.72e-0
4h 1
3 4.8682782e+02 9.04e+02 5.24e+01 -1.0 9.17e+02 - 8.47e-04 1.35e-0
2h 1
4 3.2667788e+02 8.82e+02 5.19e+01 -1.0 9.04e+02 - 1.52e-02 2.52e-0
2f 1
5 8.0911258e+03 7.01e-02 7.77e+01 -1.0 8.82e+02 - 1.07e-01 1.00e+0
0h 1
6 3.4824427e+03 6.05e-02 2.24e+01 -1.0 5.26e+01 - 6.88e-01 1.27e-0
1f 1
7 2.0901702e+03 3.37e-02 2.22e+00 -1.0 2.81e+01 - 9.23e-01 5.67e-0
1f 1
8 2.2794924e+03 4.95e-03 3.32e+00 -1.0 5.40e+00 - 2.00e-01 1.00e+0
0f 1
9 2.2797622e+03 6.56e-04 5.45e-01 -1.0 4.40e+00 - 7.16e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8941039e+03 5.27e-04 3.40e-01 -1.7 5.23e+00 - 8.08e-01 6.83e-0
1f 1
11 1.8909234e+03 4.65e-05 6.84e-01 -1.7 1.36e+01 - 7.45e-01 1.00e+0
0f 1
12 1.9070676e+03 1.55e-05 1.81e-01 -1.7 3.61e+01 - 5.25e-01 1.00e+0
0f 1
13 1.8170373e+03 5.15e-05 4.36e-02 -2.5 2.33e+01 - 1.00e+00 9.60e-0
1f 1
14 1.7914576e+03 1.64e-03 1.43e-03 -2.5 2.04e+01 - 1.00e+00 1.00e+0
0f 1
15 1.7621775e+03 1.03e-03 3.13e-02 -3.8 1.65e+01 - 8.09e-01 1.00e+0
0h 1
16 1.7588390e+03 3.18e-03 1.13e-03 -3.8 2.93e-01 - 1.00e+00 1.00e+0
0h 1
17 1.7592546e+03 3.93e-05 1.25e-04 -3.8 1.36e-02 - 1.00e+00 1.00e+0
0h 1
18 1.7572198e+03 1.01e-04 3.66e-04 -5.7 8.94e-01 - 9.51e-01 9.78e-0
1h 1
19 1.7571972e+03 2.20e-05 3.76e-03 -5.7 1.89e-02 - 1.00e+00 7.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7571971e+03 8.58e-09 1.19e-06 -5.7 4.11e-03 - 1.00e+00 1.00e+0
0f 1
21 1.7571733e+03 9.00e-09 1.93e-05 -8.6 1.11e-02 - 1.00e+00 9.83e-0
1h 1
22 1.7571729e+03 1.37e-12 6.49e-11 -8.6 1.84e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.7571729244422716e+00 1.7571729244422716e+0
3
Dual infeasibility......: 6.4889706691975195e-11 6.4889706691975188e-0
8
Constraint violation....: 1.3729017922514686e-12 1.3729017922514686e-1
2
Complementarity.........: 2.7051989701860713e-09 2.7051989701860714e-0
6
Overall NLP error.......: 2.7051989701860713e-09 2.7051989701860714e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318724481455e-09 2.1031318724481455e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896894379e-09 2.8882108896894380e-0
6
Overall NLP error.......: 2.8882108896894379e-09 2.8882108896894380e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318724481455e-09 2.1031318724481455e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896894379e-09 2.8882108896894380e-0
6
Overall NLP error.......: 2.8882108896894379e-09 2.8882108896894380e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101521e-01 6.4890146112101525e+0
2
Dual infeasibility......: 4.9126605618489413e-09 4.9126605618489413e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984918224e-09 4.3646094984918221e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605618489413e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.04e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.57e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235660171e+00 1.6104063235660171e+0
3
Dual infeasibility......: 2.4574009793760635e-12 2.4574009793760635e-0
9
Constraint violation....: 7.5703172614159067e-16 7.5703172614159067e-1
6
Complementarity.........: 2.5062163919681798e-09 2.5062163919681799e-0
6
Overall NLP error.......: 2.5062163919681798e-09 2.5062163919681799e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2278083e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 3.31e-04 9.87e-0
3h 1
2 8.0391474e+02 9.17e+02 5.24e+01 -1.0 7.85e+02 - 8.87e-05 6.88e-0
4h 1
3 2.4271271e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 6.68e-04 2.10e-0
2h 1
4 1.2385916e+04 5.52e-02 8.23e+01 -1.0 8.98e+02 - 3.86e-02 1.00e+0
0h 1
5 3.8851959e+03 5.26e-02 5.59e+01 -1.0 8.06e+01 - 3.19e-01 5.02e-0
2f 1
6 1.9099004e+03 3.73e-02 2.99e+01 -1.0 3.93e+01 - 4.69e-01 5.04e-0
1f 1
7 4.6737272e+03 1.22e-02 2.67e+01 -1.0 2.06e+01 - 4.01e-01 1.00e+0
0h 1
8 1.8754601e+03 1.19e-02 1.01e+00 -1.0 2.53e+01 - 9.88e-01 8.94e-0
1f 1
9 2.0005994e+03 1.84e-04 4.66e-02 -1.0 3.18e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7351413e+03 2.16e-04 1.24e+00 -2.5 1.71e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5469297e+03 3.76e-03 1.33e-01 -2.5 7.60e+00 - 7.95e-01 1.00e+0
0f 1
12 1.5237159e+03 5.30e-03 3.11e-01 -2.5 1.84e+00 - 1.00e+00 7.66e-0
1h 1
13 1.5360639e+03 2.44e-04 4.74e-03 -2.5 7.11e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5034784e+03 1.70e-04 2.15e-02 -3.8 1.62e+01 - 9.91e-01 9.29e-0
1h 1
15 1.5021214e+03 7.21e-07 6.83e-05 -3.8 1.10e+00 - 1.00e+00 1.00e+0
0h 1
16 1.5003172e+03 3.77e-07 1.78e-04 -5.7 8.92e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003154e+03 3.79e-11 2.92e-09 -5.7 4.18e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.11e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932795325474e+00 1.5002932795325473e+0
3
Dual infeasibility......: 2.1737235544485282e-09 2.1737235544485282e-0
6
Constraint violation....: 6.2995803018495167e-11 6.2995803018495167e-1
1
Complementarity.........: 2.8882174400026205e-09 2.8882174400026206e-0
6
Overall NLP error.......: 2.8882174400026205e-09 2.8882174400026206e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6534772e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 4.97e-04 9.87e-0
3h 1
2 8.4418057e+02 9.17e+02 5.24e+01 -1.0 8.02e+02 - 8.70e-05 7.83e-0
4h 1
3 2.6276094e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 7.65e-04 2.20e-0
2h 1
4 1.2724514e+04 5.99e-02 8.02e+01 -1.0 8.97e+02 - 5.06e-02 1.00e+0
0h 1
5 4.2755874e+03 5.59e-02 5.32e+01 -1.0 7.28e+01 - 3.26e-01 6.05e-0
2f 1
88 1.402479e+04 1.632511e+04 6.617926e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1150404e+02 1.57e+04 5.50e+01 -1.0 1.59e+04 - 1.75e-04 9.81e-0
3h 1
2 7.0818866e+02 1.57e+04 5.50e+01 -1.0 1.11e+04 - 1.72e-05 1.40e-0
4h 1
3 7.0204849e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 4.58e-05 4.96e-0
4h 1
4 4.8422622e+02 1.54e+04 5.40e+01 -1.0 1.57e+04 - 5.36e-04 1.87e-0
2h 1
5 2.6472748e+04 7.61e-02 8.73e+01 -1.0 1.54e+04 - 2.05e-02 1.00e+0
0h 1
6 1.7906905e+04 7.36e-02 7.65e+01 -1.0 8.01e+01 - 1.32e-01 3.53e-0
2f 1
7 1.6637437e+04 4.63e-02 3.58e+01 -1.0 1.93e+01 - 5.27e-01 3.82e-0
1f 1
8 1.7142327e+04 3.51e-02 1.24e+01 -1.0 1.35e+01 - 5.62e-01 2.50e-0
1f 3
9 1.6797449e+04 7.61e-03 9.44e-01 -1.0 1.27e+00 - 9.40e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6819061e+04 1.97e-04 2.13e+00 -1.0 5.92e+00 - 1.29e-01 1.00e+0
0f 1
11 1.6831355e+04 6.22e-06 6.84e-01 -1.0 6.82e+00 - 6.94e-01 1.00e+0
0f 1
12 1.6536861e+04 2.29e-04 2.41e-01 -1.7 4.73e+00 - 8.52e-01 8.05e-0
1f 1
13 1.6504650e+04 5.33e-04 2.17e-01 -1.7 2.19e+01 - 7.24e-01 1.00e+0
0f 1
14 1.6532695e+04 7.53e-05 6.98e-02 -1.7 4.07e+01 - 6.99e-01 1.00e+0
0h 1
15 1.6382897e+04 9.50e-04 4.43e-02 -2.5 5.43e+01 - 9.29e-01 1.00e+0
0f 1
16 1.6353732e+04 1.08e-03 1.17e-02 -2.5 1.03e+01 - 1.00e+00 1.00e+0
0h 1
17 1.6329247e+04 1.80e-04 8.31e-02 -3.8 1.42e+01 - 1.00e+00 8.56e-0
1h 1
18 1.6326781e+04 5.87e-07 9.92e-05 -3.8 1.56e+00 - 1.00e+00 1.00e+0
0h 1
19 1.6325123e+04 4.00e-07 1.05e-04 -5.7 7.40e-01 - 1.00e+00 9.98e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325125e+04 3.81e-11 3.01e-09 -5.7 2.36e-03 - 1.00e+00 1.00e+0
0f 1
21 1.6325106e+04 5.60e-11 3.25e-05 -8.6 9.17e-03 - 1.00e+00 9.47e-0
1h 1
22 1.6325105e+04 1.78e-13 5.79e-12 -8.6 6.83e-05 - 1.00e+00 1.00e+0
0f 1
23 1.6325105e+04 7.11e-15 9.10e-15 -9.0 9.90e-06 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 23
(scaled) (unscaled)
Objective...............: 1.6325105264618010e+01 1.6325105264618009e+0
4
Dual infeasibility......: 9.1038288019262836e-15 9.1038288019262836e-1
2
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 1.1961539074876137e-09 1.1961539074876136e-0
6
Overall NLP error.......: 1.1961539074876137e-09 1.1961539074876136e-0
6
Number of objective function evaluations = 26
Number of objective gradient evaluations = 24
Number of equality constraint evaluations = 26
Number of inequality constraint evaluations = 26
Number of equality constraint Jacobian evaluations = 24
Number of inequality constraint Jacobian evaluations = 24
Number of Lagrangian Hessian evaluations = 23
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9876123e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.75e-04 9.80e-0
3h 1
2 7.9582765e+02 1.50e+04 5.25e+01 -1.0 1.37e+04 - 3.21e-05 1.08e-0
4h 1
3 7.9417056e+02 1.50e+04 5.25e+01 -1.0 1.49e+04 - 1.17e-05 1.23e-0
4h 1
4 7.8856449e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 1.33e-04 4.25e-0
4h 1
5 5.2809379e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 5.65e-04 2.05e-0
2f 1
6 2.6239746e+04 5.41e-02 8.35e+01 -1.0 1.47e+04 - 3.34e-02 1.00e+0
0h 1
7 1.7739672e+04 5.18e-02 6.24e+01 -1.0 8.06e+01 - 2.55e-01 4.59e-0
2f 1
8 1.5953473e+04 4.21e-02 3.22e+01 -1.0 3.42e+01 - 4.83e-01 4.72e-0
1f 1
9 1.6276204e+04 2.59e-02 1.43e+01 -1.0 1.83e+01 - 4.26e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6018299e+04 6.13e-03 1.74e-01 -1.0 5.19e+00 - 9.91e-01 1.00e+0
0h 1
11 1.5735222e+04 1.24e-03 2.90e-01 -1.7 4.64e+00 - 1.00e+00 8.63e-0
1f 1
12 1.5731176e+04 7.79e-04 2.75e-02 -1.7 3.76e+01 - 9.02e-01 1.00e+0
0f 1
13 1.5594725e+04 1.12e-03 4.62e-02 -2.5 3.75e+01 - 9.24e-01 1.00e+0
0f 1
14 1.5578996e+04 1.13e-03 1.33e-02 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5562228e+04 1.93e-04 9.20e-02 -3.8 5.44e+00 - 1.00e+00 8.47e-0
1h 1
16 1.5560430e+04 6.10e-07 1.16e-04 -3.8 8.00e-01 - 1.00e+00 1.00e+0
0h 1
17 1.5559216e+04 4.00e-07 1.26e-04 -5.7 2.97e-01 - 1.00e+00 9.97e-0
1h 1
18 1.5559217e+04 3.85e-11 3.01e-09 -5.7 1.63e-02 - 1.00e+00 1.00e+0
0f 1
19 1.5559202e+04 6.30e-11 2.10e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.5559202162578185e+01 1.5559202162578184e+0
4
Dual infeasibility......: 2.0962151641095433e-09 2.0962151641095433e-0
6
Constraint violation....: 6.2993901761565496e-11 6.2993901761565496e-1
1
Complementarity.........: 3.0736582629378374e-09 3.0736582629378373e-0
6
Overall NLP error.......: 3.0736582629378374e-09 3.0736582629378373e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4409474e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.92e-04 9.80e-0
3h 1
2 8.4116806e+02 1.39e+04 5.24e+01 -1.0 1.26e+04 - 3.09e-05 1.09e-0
4h 1
3 8.3964842e+02 1.39e+04 5.24e+01 -1.0 1.38e+04 - 1.32e-05 1.07e-0
4h 1
4 8.3380479e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 1.17e-04 4.16e-0
4h 1
5 5.3868278e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 5.40e-04 2.16e-0
2f 1
6 2.5565051e+04 5.71e-02 8.12e+01 -1.0 1.36e+04 - 4.51e-02 1.00e+0
0h 1
7 1.7026034e+04 5.36e-02 5.26e+01 -1.0 8.02e+01 - 3.44e-01 5.57e-0
2f 1
8 1.4909750e+04 3.41e-02 2.87e+01 -1.0 4.22e+01 - 4.65e-01 5.34e-0
1f 1
9 1.5390691e+04 1.84e-02 8.28e+00 -1.0 2.08e+01 - 5.85e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5065120e+04 5.26e-03 5.59e-01 -1.0 6.09e+00 - 9.52e-01 1.00e+0
0h 1
11 1.4710341e+04 1.46e-03 5.13e-01 -1.7 6.65e+00 - 1.00e+00 7.86e-0
1f 1
12 1.4672245e+04 7.15e-04 3.27e-01 -1.7 4.01e+01 - 2.09e-01 1.00e+0
0f 1
13 1.4670445e+04 1.62e-05 1.75e-03 -1.7 1.11e-01 - 1.00e+00 1.00e+0
0h 1
14 1.4514359e+04 1.23e-03 1.11e-01 -3.8 4.28e+01 - 7.78e-01 9.16e-0
1f 1
15 1.4480262e+04 2.27e-03 3.23e-02 -3.8 2.32e+00 - 8.08e-01 7.77e-0
1h 1
16 1.4480842e+04 2.84e-04 1.50e-01 -3.8 4.46e-01 - 1.00e+00 8.74e-0
1h 1
17 1.4481265e+04 3.42e-07 4.07e-05 -3.8 5.50e-02 - 1.00e+00 1.00e+0
0f 1
18 1.4480073e+04 4.15e-07 9.98e-04 -5.7 2.97e-01 - 1.00e+00 9.87e-0
1h 1
19 1.4480067e+04 4.51e-11 4.91e-09 -5.7 3.88e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.4480052e+04 6.30e-11 3.21e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.4480051787127922e+01 1.4480051787127921e+0
4
Dual infeasibility......: 3.2134121488797810e-09 3.2134121488797810e-0
6
Constraint violation....: 6.3005947681382679e-11 6.3005947681382679e-1
1
Complementarity.........: 2.9331916738002680e-09 2.9331916738002677e-0
6
Overall NLP error.......: 3.2134121488797810e-09 3.2134121488797810e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.7935299e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.86e-04 9.80e-0
3h 1
2 8.7658187e+02 1.27e+04 5.24e+01 -1.0 1.24e+04 - 8.95e-05 1.01e-0
4h 1
3 8.6556168e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 3.46e-06 7.35e-0
4f 1
4 5.3979166e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 7.97e-04 2.23e-0
2h 1
5 2.4563821e+04 6.16e-02 7.94e+01 -1.0 1.24e+04 - 5.60e-02 1.00e+0
0h 1
6 1.6154849e+04 5.71e-02 5.25e+01 -1.0 6.49e+01 - 3.27e-01 6.52e-0
2f 1
7 1.4780206e+04 3.12e-02 2.57e+01 -1.0 3.29e+01 - 4.99e-01 4.20e-0
1f 1
8 1.3997393e+04 1.27e-02 2.13e+00 -1.0 1.10e+01 - 9.20e-01 9.35e-0
1f 1
9 1.4442431e+04 3.58e-04 1.07e-01 -1.0 5.07e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3755523e+04 1.11e-03 7.31e-02 -1.7 1.80e+01 - 1.00e+00 9.82e-0
1f 1
11 1.3710323e+04 2.29e-04 1.03e+00 -2.5 1.70e+01 - 1.00e+00 7.96e-0
1h 1
12 1.3690334e+04 3.43e-04 1.02e-02 -2.5 3.44e+00 - 1.00e+00 1.00e+0
0f 1
13 1.3676739e+04 2.76e-04 7.14e-02 -3.8 2.68e+00 - 8.00e-01 1.00e+0
0h 1
14 1.3673892e+04 1.80e-03 2.07e-03 -3.8 4.00e-02 - 1.00e+00 1.00e+0
0h 1
15 1.3674028e+04 6.78e-05 6.09e-05 -3.8 1.14e-02 - 1.00e+00 1.00e+0
0h 1
16 1.3672814e+04 1.31e-04 8.22e-04 -5.7 1.49e-01 - 9.28e-01 1.00e+0
0h 1
17 1.3672774e+04 3.06e-05 5.98e-06 -5.7 8.09e-03 - 1.00e+00 1.00e+0
0h 1
18 1.3672779e+04 1.38e-07 3.53e-06 -5.7 5.32e-04 - 1.00e+00 1.00e+0
0h 1
19 1.3672766e+04 2.36e-08 5.86e-05 -8.6 1.84e-03 - 1.00e+00 9.45e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.3672765e+04 7.98e-12 1.01e-10 -8.6 1.02e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.3672765137883882e+01 1.3672765137883882e+0
4
Dual infeasibility......: 1.0094148287424732e-10 1.0094148287424733e-0
7
Constraint violation....: 7.9755091419997370e-12 7.9755091419997370e-1
2
Complementarity.........: 2.5162583854905143e-09 2.5162583854905143e-0
6
Overall NLP error.......: 2.5162583854905143e-09 2.5162583854905143e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6659874e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 4.97e-04 9.81e-0
3h 1
2 8.6320928e+02 1.11e+04 5.24e+01 -1.0 8.05e+03 - 1.95e-05 1.37e-0
4h 1
3 4.9056631e+02 1.09e+04 5.25e+01 -1.0 1.11e+04 - 4.28e-05 2.24e-0
2f 1
4 2.3317614e+04 5.90e-02 8.20e+01 -1.0 1.09e+04 - 2.52e-02 1.00e+0
0h 1
5 1.4657640e+04 5.66e-02 6.67e+01 -1.0 7.27e+01 - 1.89e-01 3.78e-0
2f 1
6 1.2692342e+04 3.20e-02 3.63e+01 -1.0 3.12e+01 - 4.72e-01 6.10e-0
1f 1
7 1.2454028e+04 7.86e-03 2.51e+00 -1.0 8.09e+00 - 9.36e-01 1.00e+0
0f 1
8 1.2472020e+04 7.61e-04 6.83e-02 -1.0 4.97e+00 - 9.96e-01 1.00e+0
0f 1
9 1.2079569e+04 3.87e-04 8.10e-01 -2.5 6.64e+00 - 9.15e-01 6.15e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2013060e+04 1.56e-04 1.74e-01 -2.5 6.26e+00 - 9.39e-01 1.00e+0
0h 1
11 1.1991348e+04 4.07e-03 2.65e-02 -2.5 9.10e-01 - 1.00e+00 1.00e+0
0h 1
12 1.1966928e+04 6.88e-04 3.65e-02 -3.8 1.34e+01 - 7.97e-01 1.00e+0
0h 1
13 1.1964315e+04 1.75e-03 1.20e-03 -3.8 5.03e-02 - 9.73e-01 1.00e+0
0h 1
14 1.1964511e+04 5.10e-05 1.47e-04 -3.8 1.26e-02 - 1.00e+00 1.00e+0
0h 1
15 1.1962623e+04 1.03e-04 3.60e-04 -5.7 7.43e-01 - 9.50e-01 9.76e-0
1h 1
16 1.1962599e+04 2.39e-05 3.90e-03 -5.7 1.79e-02 - 1.00e+00 7.70e-0
1h 1
17 1.1962599e+04 9.24e-09 1.29e-06 -5.7 4.13e-03 - 1.00e+00 1.00e+0
0f 1
18 1.1962577e+04 9.10e-09 1.94e-05 -8.6 9.21e-03 - 1.00e+00 9.83e-0
1h 1
19 1.1962577e+04 1.37e-12 6.59e-11 -8.6 1.53e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.1962576515844690e+01 1.1962576515844690e+0
4
Dual infeasibility......: 6.5869136641492233e-11 6.5869136641492233e-0
8
Constraint violation....: 1.3744561044859438e-12 1.3744561044859438e-1
2
Complementarity.........: 2.8877165073870655e-09 2.8877165073870654e-0
6
Overall NLP error.......: 2.8877165073870655e-09 2.8877165073870654e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0889550e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0544003e+02 9.19e+03 5.23e+01 -1.0 6.53e+03 - 1.88e-05 1.39e-0
4h 1
3 4.7820593e+02 8.97e+03 5.24e+01 -1.0 9.19e+03 - 4.54e-05 2.34e-0
2f 1
4 2.1767436e+04 6.51e-02 8.07e+01 -1.0 8.97e+03 - 2.85e-02 1.00e+0
0h 1
5 1.3313724e+04 6.22e-02 6.41e+01 -1.0 3.95e+01 - 2.06e-01 4.10e-0
2f 1
6 1.2046235e+04 2.08e-02 3.03e+01 -1.0 1.63e+01 - 5.38e-01 6.14e-0
1f 1
7 1.1599697e+04 6.95e-03 9.87e-01 -1.0 5.66e+00 - 9.55e-01 7.67e-0
1f 1
8 1.1862526e+04 2.40e-04 7.35e-02 -1.0 4.91e+00 - 9.99e-01 1.00e+0
0f 1
9 1.1304225e+04 2.07e-03 8.44e-02 -2.5 5.71e+00 - 8.56e-01 8.40e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1140999e+04 2.16e-03 4.29e-01 -2.5 1.27e+00 - 1.00e+00 7.59e-0
1f 1
11 1.1113964e+04 1.30e-04 4.69e-03 -2.5 3.19e-01 - 1.00e+00 1.00e+0
0h 1
12 1.1091125e+04 3.48e-05 1.49e-01 -3.8 1.07e+01 - 1.00e+00 7.59e-0
1h 1
13 1.1085027e+04 1.28e-07 3.42e-04 -3.8 2.58e+00 - 1.00e+00 1.00e+0
0f 1
14 1.1083360e+04 2.84e-08 9.74e-04 -5.7 5.94e-01 - 1.00e+00 9.85e-0
1f 1
15 1.1083341e+04 1.89e-12 1.38e-08 -5.7 8.84e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1083321e+04 2.63e-12 4.48e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.1083320755395045e+01 1.1083320755395045e+0
4
Dual infeasibility......: 4.4776951483063643e-09 4.4776951483063643e-0
6
Constraint violation....: 2.6308955014542335e-12 2.6308955014542335e-1
2
Complementarity.........: 3.6084983169098675e-09 3.6084983169098676e-0
6
Overall NLP error.......: 4.4776951483063643e-09 4.4776951483063643e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3710605e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 3.06e-03 9.80e-0
3h 1
2 9.3410771e+02 6.71e+03 5.23e+01 -1.0 6.33e+03 - 5.53e-05 1.05e-0
4h 1
3 8.7601628e+02 6.69e+03 5.23e+01 -1.0 6.70e+03 - 8.90e-06 2.62e-0
3f 1
4 4.4078555e+02 6.54e+03 5.23e+01 -1.0 6.69e+03 - 3.32e-03 2.17e-0
2h 1
5 1.7952487e+04 7.75e-02 7.79e+01 -1.0 6.54e+03 - 7.84e-02 1.00e+0
0h 1
6 1.1162158e+04 7.00e-02 2.30e+01 -1.0 4.32e+00 - 6.80e-01 8.97e-0
2f 1
7 1.0161093e+04 3.32e-02 7.43e+00 -1.0 4.23e+00 - 7.42e-01 1.00e+0
0f 1
8 1.0283900e+04 1.70e-02 7.27e-01 -1.0 1.10e+00 - 9.96e-01 4.94e-0
1f 2
9 1.0000013e+04 8.27e-03 3.35e-01 -1.7 1.28e+01 - 1.00e+00 8.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.9361941e+03 1.02e-03 1.04e-01 -1.7 8.95e+00 - 1.00e+00 1.00e+0
0f 1
11 9.8169976e+03 2.77e-04 1.12e-01 -2.5 1.73e+01 - 9.89e-01 8.85e-0
1f 1
12 9.8069007e+03 4.94e-06 1.10e-03 -2.5 1.95e+00 - 1.00e+00 1.00e+0
0f 1
13 9.7851225e+03 5.56e-06 7.61e-04 -3.8 2.68e+00 - 1.00e+00 1.00e+0
0f 1
14 9.7842068e+03 3.44e-09 3.52e-06 -5.7 1.48e-01 - 1.00e+00 1.00e+0
0h 1
15 9.7841926e+03 2.34e-12 4.09e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 9.7841925937019791e+00 9.7841925937019787e+0
3
Dual infeasibility......: 4.0868829584382650e-10 4.0868829584382650e-0
7
Constraint violation....: 2.3423485373541553e-12 2.3423485373541553e-1
2
Complementarity.........: 2.5729802580433016e-09 2.5729802580433015e-0
6
Overall NLP error.......: 2.5729802580433016e-09 2.5729802580433015e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8763965e+02 4.77e+03 5.24e+01 -1.0 4.81e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8260399e+02 4.77e+03 5.24e+01 -1.0 2.41e+03 - 2.49e-05 2.00e-0
4h 1
3 3.6148267e+02 4.66e+03 5.25e+01 -1.0 4.77e+03 - 1.13e-04 2.29e-0
2f 1
4 1.7124683e+04 6.19e-02 8.08e+01 -1.0 4.66e+03 - 3.33e-02 1.00e+0
0h 1
5 8.5486089e+03 5.88e-02 6.12e+01 -1.0 5.72e+01 - 2.41e-01 4.50e-0
2f 1
6 7.0753812e+03 2.53e-02 3.10e+01 -1.0 2.60e+01 - 4.97e-01 5.31e-0
1f 1
7 6.3654600e+03 1.22e-02 2.08e+00 -1.0 9.69e+00 - 9.28e-01 8.76e-0
1f 1
8 6.7815393e+03 4.09e-04 8.46e-02 -1.0 4.02e+00 - 9.96e-01 1.00e+0
0f 1
9 6.0144307e+03 2.22e-03 1.93e-01 -2.5 6.42e+00 - 8.66e-01 9.54e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.9436433e+03 1.05e-03 5.82e-01 -2.5 4.17e+00 - 1.00e+00 5.83e-0
1h 1
11 5.9490643e+03 3.19e-06 8.15e-03 -2.5 2.11e+00 - 1.00e+00 1.00e+0
0h 1
12 5.9232707e+03 5.19e-06 3.60e-02 -3.8 1.34e+01 - 9.18e-01 8.84e-0
1f 1
13 5.9189072e+03 4.66e-04 5.62e-04 -3.8 1.55e+00 - 1.00e+00 1.00e+0
0f 1
14 5.9173203e+03 6.38e-05 1.15e-02 -5.7 7.43e-01 - 8.12e-01 1.00e+0
0h 1
15 5.9172047e+03 3.63e-05 4.13e-05 -5.7 9.70e-03 - 1.00e+00 1.00e+0
0h 1
16 5.9172063e+03 1.59e-06 4.30e-05 -5.7 1.47e-03 - 1.00e+00 9.88e-0
1h 1
17 5.9172088e+03 3.53e-08 5.13e-07 -5.7 2.92e-04 - 1.00e+00 1.00e+0
0f 1
18 5.9171869e+03 3.96e-08 7.28e-06 -8.6 9.21e-03 - 9.97e-01 9.81e-0
1h 1
19 5.9171866e+03 5.33e-13 2.97e-11 -8.6 1.77e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 5.9171865596900020e+00 5.9171865596900016e+0
3
Dual infeasibility......: 2.9740951589541942e-11 2.9740951589541942e-0
8
Constraint violation....: 5.3346216333238772e-13 5.3346216333238772e-1
3
Complementarity.........: 3.2403090038311334e-09 3.2403090038311332e-0
6
Overall NLP error.......: 3.2403090038311334e-09 3.2403090038311332e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.028
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2291184e+02 3.24e+03 5.23e+01 -1.0 3.27e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1824882e+02 3.24e+03 5.23e+01 -1.0 1.80e+03 - 2.80e-05 1.78e-0
4h 1
3 3.4580800e+02 3.17e+03 5.24e+01 -1.0 3.24e+03 - 9.12e-05 2.35e-0
2f 1
4 1.5889383e+04 6.81e-02 7.83e+01 -1.0 3.17e+03 - 5.42e-02 1.00e+0
0h 1
5 7.5694720e+03 6.34e-02 4.88e+01 -1.0 1.73e+01 - 3.65e-01 6.40e-0
2f 1
6 6.2120976e+03 1.27e-02 2.15e+01 -1.0 9.82e+00 - 6.05e-01 8.68e-0
1f 1
7 6.3908340e+03 3.81e-03 1.94e-01 -1.0 2.40e+00 - 9.91e-01 1.00e+0
0f 1
8 5.9352805e+03 1.50e-03 8.74e-02 -1.7 6.24e+00 - 1.00e+00 1.00e+0
0f 1
9 5.7758901e+03 1.91e-03 4.70e-01 -2.5 1.75e+00 - 1.00e+00 7.62e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.7472956e+03 2.95e-04 8.78e-02 -2.5 4.07e-01 - 1.00e+00 9.05e-0
1h 1
11 5.7505454e+03 1.10e-05 3.63e-03 -2.5 3.88e-02 - 1.00e+00 1.00e+0
0f 1
12 5.7231763e+03 1.03e-05 8.91e-03 -3.8 8.05e+00 - 1.00e+00 9.59e-0
1f 1
13 5.7225084e+03 1.56e-08 1.41e-05 -3.8 3.28e-01 - 1.00e+00 1.00e+0
0f 1
14 5.7210166e+03 1.79e-08 5.06e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0f 1
15 5.7210000e+03 6.40e-13 4.11e-10 -8.6 5.51e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.7210000387883246e+00 5.7210000387883247e+0
3
Dual infeasibility......: 4.1136441974861935e-10 4.1136441974861935e-0
7
Constraint violation....: 6.4021010715009652e-13 6.4021010715009652e-1
3
Complementarity.........: 3.9670698221032552e-09 3.9670698221032555e-0
6
Overall NLP error.......: 3.9670698221032552e-09 3.9670698221032555e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4528265e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 3.98e-04 9.81e-0
3f 1
2 8.4160251e+02 2.00e+03 5.24e+01 -1.0 1.48e+03 - 5.90e-05 1.34e-0
4h 1
3 2.7509537e+02 1.95e+03 5.26e+01 -1.0 2.00e+03 - 4.97e-05 2.18e-0
2f 1
4 1.3978763e+04 5.67e-02 8.10e+01 -1.0 1.95e+03 - 4.46e-02 1.00e+0
0h 1
5 5.1663757e+03 5.32e-02 5.38e+01 -1.0 8.22e+01 - 3.29e-01 5.48e-0
2f 1
6 3.0169279e+03 3.33e-02 2.97e+01 -1.0 4.25e+01 - 4.59e-01 5.39e-0
1f 1
7 5.0512416e+03 9.15e-03 1.65e+01 -1.0 2.43e+01 - 5.91e-01 1.00e+0
0h 1
8 3.0927580e+03 7.42e-03 4.15e-01 -1.0 2.10e+01 - 9.67e-01 1.00e+0
0f 1
9 2.7847845e+03 1.00e-03 1.63e-01 -1.7 5.24e+00 - 1.00e+00 9.12e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.6486959e+03 1.59e-03 2.72e-01 -2.5 6.05e+00 - 7.52e-01 1.00e+0
0f 1
11 2.5962169e+03 4.61e-03 3.97e-02 -2.5 2.93e+00 - 1.00e+00 1.00e+0
0h 1
12 2.6062895e+03 2.11e-04 6.40e-03 -2.5 4.76e-01 - 1.00e+00 1.00e+0
0h 1
13 2.5818658e+03 2.58e-04 4.25e-02 -3.8 5.37e+00 - 9.87e-01 8.87e-0
1h 1
14 2.5806677e+03 1.91e-06 1.63e-04 -3.8 6.01e-01 - 1.00e+00 1.00e+0
0h 1
15 2.5794704e+03 3.21e-07 2.10e-03 -5.7 2.97e-01 - 1.00e+00 9.78e-0
1h 1
16 2.5794585e+03 3.73e-11 2.11e-08 -5.7 6.59e-03 - 1.00e+00 1.00e+0
0f 1
17 2.5794438e+03 6.30e-11 4.40e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 2.5794437878981200e+00 2.5794437878981198e+0
3
Dual infeasibility......: 4.3996201091018779e-09 4.3996201091018779e-0
6
Constraint violation....: 6.3009319983819978e-11 6.3009319983819978e-1
1
Complementarity.........: 4.6199552868324162e-09 4.6199552868324162e-0
6
Overall NLP error.......: 4.6199552868324162e-09 4.6199552868324162e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2208552e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 3.29e-04 9.87e-0
3h 1
2 8.0324081e+02 9.17e+02 5.24e+01 -1.0 7.85e+02 - 8.88e-05 6.87e-0
4h 1
3 2.4240476e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 6.67e-04 2.10e-0
2h 1
4 1.2380470e+04 5.52e-02 8.24e+01 -1.0 8.98e+02 - 3.84e-02 1.00e+0
0h 1
5 3.8796340e+03 5.26e-02 5.61e+01 -1.0 8.06e+01 - 3.16e-01 5.00e-0
2f 1
6 1.9096184e+03 3.75e-02 3.00e+01 -1.0 3.91e+01 - 4.70e-01 5.04e-0
1f 1
7 4.6686527e+03 1.22e-02 2.67e+01 -1.0 2.05e+01 - 4.02e-01 1.00e+0
0h 1
8 1.8748444e+03 1.18e-02 1.00e+00 -1.0 2.53e+01 - 9.88e-01 8.94e-0
1f 1
9 2.0007636e+03 1.82e-04 4.63e-02 -1.0 3.23e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7349595e+03 2.15e-04 1.23e+00 -2.5 1.77e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5468547e+03 3.76e-03 1.33e-01 -2.5 7.59e+00 - 7.96e-01 1.00e+0
0f 1
12 1.5237336e+03 5.33e-03 3.08e-01 -2.5 1.83e+00 - 1.00e+00 7.68e-0
1h 1
13 1.5360585e+03 2.45e-04 4.69e-03 -2.5 7.08e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5034659e+03 1.70e-04 2.13e-02 -3.8 1.62e+01 - 9.91e-01 9.30e-0
1h 1
15 1.5021214e+03 7.20e-07 6.83e-05 -3.8 1.09e+00 - 1.00e+00 1.00e+0
0h 1
16 1.5003171e+03 3.77e-07 1.76e-04 -5.7 8.92e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003154e+03 3.79e-11 2.93e-09 -5.7 3.96e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.11e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932795354287e+00 1.5002932795354286e+0
3
Dual infeasibility......: 2.1693880296500466e-09 2.1693880296500466e-0
6
Constraint violation....: 6.2995608729465857e-11 6.2995608729465857e-1
1
Complementarity.........: 2.8882170397676303e-09 2.8882170397676302e-0
6
Overall NLP error.......: 2.8882170397676303e-09 2.8882170397676302e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.80e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.4977314e+02 7.52e+01 9.06e+01 -1.0 2.60e+01 - 3.82e-04 3.52e-0
2f 1
2 1.1816088e+04 5.63e-02 8.12e+01 -1.0 2.88e+01 - 4.62e-02 1.00e+0
0h 1
3 3.1563648e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.64e-0
2f 1
4 1.0149177e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8288318e+03 7.32e-03 1.59e+01 -1.0 1.90e+01 - 6.03e-01 1.00e+0
0h 1
6 1.1132333e+03 5.44e-03 4.06e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8140714e+02 9.79e-04 2.02e-01 -1.7 5.70e+00 - 1.00e+00 8.92e-0
1h 1
8 7.2726279e+02 8.60e-04 1.29e-02 -1.7 3.47e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0948966e+02 1.50e-03 1.12e-01 -3.8 4.46e+00 - 7.72e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8220799e+02 2.13e-03 7.56e-02 -3.8 2.09e+00 - 8.08e-01 7.38e-0
1h 1
11 5.8339027e+02 7.14e-05 3.61e-02 -3.8 3.05e-02 - 1.00e+00 9.66e-0
1h 1
12 5.8368704e+02 2.74e-07 1.07e-05 -3.8 4.04e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278916e+02 4.12e-07 5.13e-04 -5.7 3.46e-02 - 1.00e+00 9.92e-0
1h 1
14 5.8278859e+02 4.35e-11 3.44e-09 -5.7 2.53e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.61e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753113980446e-01 5.8277753113980441e+0
2
Dual infeasibility......: 2.6140898937573539e-09 2.6140898937573539e-0
6
Constraint violation....: 6.3001784345040335e-11 6.3001784345040335e-1
1
Complementarity.........: 2.8882627235961349e-09 2.8882627235961349e-0
6
Overall NLP error.......: 2.8882627235961349e-09 2.8882627235961349e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1565503e+02 1.10e+02 1.13e+02 -1.0 3.77e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1395938e+04 5.38e-02 8.36e+01 -1.0 4.54e+01 - 3.09e-02 1.00e+0
0h 1
3 2.7823158e+03 5.17e-02 6.49e+01 -1.0 8.43e+01 - 2.27e-01 4.31e-0
2f 1
4 9.8130909e+02 4.24e-02 3.38e+01 -1.0 3.40e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5884548e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.22e-01 1.00e+0
0h 1
6 9.4486031e+02 1.01e-02 8.70e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6263088e+02 4.58e-04 6.61e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536193e+02 1.94e-03 1.93e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379511e+02 3.25e-03 6.09e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140263e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388121e+02 1.57e-04 1.68e-02 -3.8 7.57e-01 - 9.93e-01 9.42e-0
1h 1
12 5.8370190e+02 7.28e-07 6.65e-05 -3.8 8.53e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278678e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.07e-09 -5.7 3.36e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148959155e-01 5.8277753148959152e+0
2
Dual infeasibility......: 2.0876966282288729e-09 2.0876966282288729e-0
6
Constraint violation....: 6.2994290339624115e-11 6.2994290339624115e-1
1
Complementarity.........: 2.8882094112246830e-09 2.8882094112246828e-0
6
Overall NLP error.......: 2.8882094112246830e-09 2.8882094112246828e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.80e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.4977314e+02 7.52e+01 9.06e+01 -1.0 2.60e+01 - 3.82e-04 3.52e-0
2f 1
2 1.1816088e+04 5.63e-02 8.12e+01 -1.0 2.88e+01 - 4.62e-02 1.00e+0
0h 1
3 3.1563648e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.64e-0
2f 1
4 1.0149177e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8288318e+03 7.32e-03 1.59e+01 -1.0 1.90e+01 - 6.03e-01 1.00e+0
0h 1
6 1.1132333e+03 5.44e-03 4.06e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8140714e+02 9.79e-04 2.02e-01 -1.7 5.70e+00 - 1.00e+00 8.92e-0
1h 1
8 7.2726279e+02 8.60e-04 1.29e-02 -1.7 3.47e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0948966e+02 1.50e-03 1.12e-01 -3.8 4.46e+00 - 7.72e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8220799e+02 2.13e-03 7.56e-02 -3.8 2.09e+00 - 8.08e-01 7.38e-0
1h 1
11 5.8339027e+02 7.14e-05 3.61e-02 -3.8 3.05e-02 - 1.00e+00 9.66e-0
1h 1
12 5.8368704e+02 2.74e-07 1.07e-05 -3.8 4.04e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278916e+02 4.12e-07 5.13e-04 -5.7 3.46e-02 - 1.00e+00 9.92e-0
1h 1
14 5.8278859e+02 4.35e-11 3.44e-09 -5.7 2.53e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.61e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753113980446e-01 5.8277753113980441e+0
2
Dual infeasibility......: 2.6140898937573539e-09 2.6140898937573539e-0
6
Constraint violation....: 6.3001784345040335e-11 6.3001784345040335e-1
1
Complementarity.........: 2.8882627235961349e-09 2.8882627235961349e-0
6
Overall NLP error.......: 2.8882627235961349e-09 2.8882627235961349e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.30e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9758482e+02 4.11e+01 5.96e+01 -1.0 1.43e+01 - 6.95e-04 4.22e-0
2f 1
2 1.2224028e+04 6.06e-02 7.87e+01 -1.0 1.80e+01 - 7.04e-02 1.00e+0
0h 1
3 3.6170103e+03 5.54e-02 5.16e+01 -1.0 5.49e+01 - 3.32e-01 7.83e-0
2f 1
4 2.3474797e+03 2.94e-02 2.29e+01 -1.0 2.73e+01 - 5.43e-01 4.45e-0
1f 1
5 1.7452804e+03 8.58e-03 1.20e+00 -1.0 1.00e+01 - 9.27e-01 7.72e-0
1f 1
6 2.0210624e+03 3.36e-04 8.13e-02 -1.0 3.40e+00 - 1.00e+00 1.00e+0
0h 1
7 1.3898308e+03 2.08e-03 8.01e-02 -2.5 4.92e+00 - 8.66e-01 8.53e-0
1f 1
8 1.2104183e+03 2.16e-03 1.86e-01 -2.5 1.04e+00 - 1.00e+00 8.43e-0
1f 1
9 1.1996702e+03 5.02e-05 5.09e-03 -2.5 1.23e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1927457e+03 2.75e-05 1.75e+00 -3.8 9.03e-02 - 1.00e+00 4.75e-0
1h 1
11 1.1900440e+03 1.04e-06 8.86e-02 -3.8 6.95e-02 - 9.43e-01 1.00e+0
0f 1
12 1.1895795e+03 2.47e-05 1.76e-01 -3.8 2.52e-02 - 1.00e+00 4.57e-0
1h 2
13 1.1893527e+03 3.47e-06 1.29e-04 -3.8 1.19e-02 - 1.00e+00 1.00e+0
0h 1
14 1.1886358e+03 6.75e-06 5.57e-02 -5.7 1.33e-02 - 7.11e-01 9.85e-0
1h 1
15 1.1884610e+03 1.84e-05 2.22e-04 -5.7 6.50e-03 - 9.83e-01 1.00e+0
0f 1
16 1.1884651e+03 7.14e-09 1.31e-06 -5.7 1.34e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1884530e+03 1.55e-08 3.73e-05 -8.6 1.74e-04 - 9.91e-01 9.62e-0
1h 1
18 1.1884526e+03 3.57e-12 5.06e-11 -8.6 6.68e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1884526086212670e+00 1.1884526086212670e+0
3
Dual infeasibility......: 5.0629973080504902e-11 5.0629973080504902e-0
8
Constraint violation....: 3.5653702212812277e-12 3.5653702212812277e-1
2
Complementarity.........: 2.5125693002625665e-09 2.5125693002625666e-0
6
Overall NLP error.......: 2.5125693002625665e-09 2.5125693002625666e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2182726e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 3.29e-04 9.88e-0
3h 1
2 8.0089614e+02 9.17e+02 5.24e+01 -1.0 7.99e+02 - 9.95e-05 7.63e-0
4h 1
3 5.3166681e+02 9.08e+02 5.25e+01 -1.0 9.17e+02 - 7.40e-04 1.01e-0
2h 1
4 2.7894062e+02 8.88e+02 5.21e+01 -1.0 9.08e+02 - 1.15e-02 2.18e-0
2f 1
5 8.4112974e+03 6.32e-02 8.19e+01 -1.0 8.88e+02 - 6.31e-02 1.00e+0
0h 1
6 3.4032392e+03 5.76e-02 2.47e+01 -1.0 5.33e+01 - 6.80e-01 8.22e-0
2f 1
7 1.8640304e+03 3.67e-02 6.88e+00 -1.0 3.49e+01 - 6.91e-01 4.95e-0
1f 1
8 2.2961850e+03 6.24e-03 1.09e+00 -1.0 1.31e+00 - 9.13e-01 1.00e+0
0f 1
9 2.0564607e+03 6.09e-04 1.06e+00 -1.0 9.39e+00 - 2.61e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.0505247e+03 8.47e-05 6.62e-01 -1.0 1.26e+01 - 5.50e-01 1.00e+0
0f 1
11 1.7381690e+03 2.65e-04 5.13e-01 -1.7 5.27e+00 - 9.55e-01 7.85e-0
1f 1
12 1.7202651e+03 7.64e-04 2.87e-01 -1.7 5.32e+01 - 4.82e-01 1.00e+0
0f 1
13 1.7486158e+03 4.01e-05 2.04e-03 -1.7 3.45e+01 - 1.00e+00 1.00e+0
0h 1
14 1.5289007e+03 1.24e-03 9.71e-02 -3.8 1.20e+02 - 7.93e-01 9.24e-0
1f 1
15 1.5019418e+03 1.56e-03 5.49e-02 -3.8 2.52e+00 - 8.36e-01 7.74e-0
1h 1
16 1.5019843e+03 2.63e-06 7.61e-04 -3.8 4.60e-01 - 1.00e+00 1.00e+0
0h 1
17 1.5003305e+03 3.01e-07 7.19e-04 -5.7 8.90e-01 - 1.00e+00 9.87e-0
1h 1
18 1.5003154e+03 3.86e-11 6.09e-09 -5.7 1.04e-02 - 1.00e+00 1.00e+0
0f 1
19 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.11e-02 - 1.00e+00 1.00e+0
0h 1
1 8.6444018e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 4.93e-04 9.88e-0
3h 1
2 8.4098793e+02 9.17e+02 5.24e+01 -1.0 8.13e+02 - 9.78e-05 8.68e-0
4h 1
3 4.8928285e+02 9.04e+02 5.24e+01 -1.0 9.17e+02 - 8.43e-04 1.34e-0
2h 1
4 3.2495380e+02 8.82e+02 5.19e+01 -1.0 9.05e+02 - 1.50e-02 2.49e-0
2f 1
89 1.395590e+04 1.632511e+04 6.674392e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 40
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 20
inequality constraints with only lower bounds: 11
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1149117e+02 1.57e+04 5.50e+01 -1.0 1.59e+04 - 1.75e-04 9.81e-0
3h 1
2 7.0801705e+02 1.57e+04 5.50e+01 -1.0 1.02e+04 - 1.61e-05 1.53e-0
4h 1
3 7.0346476e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 5.90e-05 3.68e-0
4h 1
4 6.7504027e+02 1.57e+04 5.49e+01 -1.0 1.57e+04 - 4.23e-04 2.42e-0
3h 1
5 5.2731816e+02 1.54e+04 5.38e+01 -1.0 1.57e+04 - 3.03e-03 1.90e-0
2f 1
6 2.5077242e+04 7.58e-02 8.66e+01 -1.0 1.54e+04 - 2.71e-02 1.00e+0
0h 1
7 1.7876339e+04 7.27e-02 6.70e+01 -1.0 6.21e+01 - 2.35e-01 4.29e-0
2f 1
8 1.6631925e+04 4.74e-02 3.04e+01 -1.0 2.06e+01 - 5.40e-01 3.79e-0
1f 1
9 1.7123904e+04 3.49e-02 2.18e+01 -1.0 1.32e+01 - 5.66e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6802677e+04 7.02e-03 2.91e+00 -1.0 2.33e+00 - 7.76e-01 1.00e+0
0f 1
11 1.6815882e+04 2.20e-04 1.60e+00 -1.0 3.17e+00 - 3.94e-01 1.00e+0
0f 1
12 1.6822854e+04 6.47e-06 6.92e-01 -1.0 3.01e+00 - 5.92e-01 1.00e+0
0f 1
13 1.6830490e+04 2.31e-07 2.70e-01 -1.0 6.91e+00 - 6.05e-01 1.00e+0
0f 1
14 1.6538658e+04 2.18e-04 2.96e-01 -1.7 4.70e+00 - 8.75e-01 7.83e-0
1f 1
15 1.6502921e+04 5.60e-04 2.88e-01 -1.7 2.18e+01 - 6.38e-01 1.00e+0
0f 1
16 1.6527505e+04 7.05e-05 4.95e-02 -1.7 3.75e+01 - 7.30e-01 1.00e+0
0h 1
17 1.6383556e+04 9.49e-04 4.67e-02 -2.5 4.85e+01 - 9.27e-01 1.00e+0
0f 1
18 1.6353897e+04 1.09e-03 1.17e-02 -2.5 1.06e+01 - 1.00e+00 1.00e+0
0h 1
19 1.6329095e+04 1.83e-04 8.32e-02 -3.8 1.46e+01 - 1.00e+00 8.56e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6326780e+04 6.19e-07 9.90e-05 -3.8 1.41e+00 - 1.00e+00 1.00e+0
0h 1
21 1.6325122e+04 3.99e-07 1.05e-04 -5.7 7.40e-01 - 1.00e+00 9.98e-0
1h 1
22 1.6325125e+04 3.81e-11 3.00e-09 -5.7 3.83e-03 - 1.00e+00 1.00e+0
0f 1
23 1.6325106e+04 5.59e-11 3.27e-05 -8.6 9.17e-03 - 1.00e+00 9.47e-0
1h 1
24 1.6325105e+04 1.80e-13 5.88e-12 -8.6 1.02e-04 - 1.00e+00 1.00e+0
0f 1
25 1.6325105e+04 2.13e-14 9.10e-15 -9.0 9.96e-06 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 25
(scaled) (unscaled)
Objective...............: 1.6325105264621577e+01 1.6325105264621576e+0
4
Dual infeasibility......: 9.1038288019262836e-15 9.1038288019262836e-1
2
Constraint violation....: 2.1316282072803006e-14 2.1316282072803006e-1
4
Complementarity.........: 1.1997039694827733e-09 1.1997039694827732e-0
6
Overall NLP error.......: 1.1997039694827733e-09 1.1997039694827732e-0
6
Number of objective function evaluations = 28
Number of objective gradient evaluations = 26
Number of equality constraint evaluations = 28
Number of inequality constraint evaluations = 28
Number of equality constraint Jacobian evaluations = 26
Number of inequality constraint Jacobian evaluations = 26
Number of Lagrangian Hessian evaluations = 25
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4810430e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 4.08e-04 9.80e-0
3h 1
2 8.4520165e+02 1.50e+04 5.24e+01 -1.0 1.37e+04 - 3.05e-05 1.09e-0
4h 1
3 8.4323540e+02 1.50e+04 5.24e+01 -1.0 1.49e+04 - 1.23e-05 1.50e-0
4h 1
4 8.3670415e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 1.60e-04 5.07e-0
4h 1
5 5.6730653e+02 1.46e+04 5.26e+01 -1.0 1.50e+04 - 6.79e-04 2.16e-0
2f 1
6 2.6591598e+04 5.78e-02 8.10e+01 -1.0 1.46e+04 - 4.64e-02 1.00e+0
0h 1
7 1.8134724e+04 5.41e-02 5.25e+01 -1.0 7.88e+01 - 3.43e-01 5.69e-0
2f 1
8 1.6066079e+04 3.29e-02 2.84e+01 -1.0 4.22e+01 - 4.66e-01 5.25e-0
1f 1
9 1.6597582e+04 1.26e-02 2.76e+00 -1.0 2.01e+01 - 8.51e-01 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6086025e+04 4.97e-03 1.88e-01 -1.0 1.02e+01 - 9.55e-01 1.00e+0
0f 1
11 1.5782536e+04 1.27e-03 2.41e-01 -1.7 4.33e+00 - 8.95e-01 7.92e-0
1f 1
12 1.5757354e+04 2.75e-04 5.74e-01 -1.7 1.94e+01 - 3.44e-01 1.00e+0
0f 1
13 1.5756426e+04 3.15e-05 1.14e-03 -1.7 1.14e+01 - 1.00e+00 1.00e+0
0h 1
14 1.5605008e+04 1.02e-03 1.09e-01 -3.8 3.66e+01 - 7.80e-01 9.15e-0
1f 1
15 1.5574735e+04 1.39e-03 3.17e-02 -3.8 2.15e+00 - 8.28e-01 7.36e-0
1h 1
16 1.5575112e+04 4.39e-06 7.14e-02 -3.8 3.40e-01 - 9.61e-01 1.00e+0
0h 1
17 1.5574114e+04 9.93e-05 5.00e-04 -3.8 1.43e-02 - 1.00e+00 1.00e+0
0h 1
18 1.5572899e+04 1.51e-05 7.58e-03 -5.7 2.97e-01 - 9.12e-01 9.83e-0
1h 1
19 1.5572845e+04 5.03e-07 1.72e-06 -5.7 4.84e-03 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5572829e+04 4.66e-09 3.86e-07 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
21 1.5572829e+04 1.42e-14 3.70e-14 -8.6 2.26e-07 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.5572828784406168e+01 1.5572828784406167e+0
4
Dual infeasibility......: 3.7016167301534639e-14 3.7016167301534639e-1
1
Constraint violation....: 1.4210854715202004e-14 1.4210854715202004e-1
4
Complementarity.........: 2.5288066462879325e-09 2.5288066462879323e-0
6
Overall NLP error.......: 2.5288066462879325e-09 2.5288066462879323e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0892160e+02 1.39e+04 5.23e+01 -1.0 1.40e+04 - 1.00e-03 9.80e-0
3h 1
2 9.0601595e+02 1.39e+04 5.23e+01 -1.0 1.22e+04 - 2.38e-05 1.13e-0
4h 1
3 8.8662973e+02 1.39e+04 5.23e+01 -1.0 1.39e+04 - 1.65e-05 1.43e-0
3h 1
4 5.9750885e+02 1.36e+04 5.24e+01 -1.0 1.39e+04 - 1.44e-03 2.26e-0
2h 1
5 2.5845436e+04 6.69e-02 8.07e+01 -1.0 1.36e+04 - 3.42e-02 1.00e+0
0h 1
6 1.7963300e+04 6.35e-02 5.93e+01 -1.0 3.54e+01 - 2.63e-01 4.68e-0
2f 1
7 1.6680998e+04 1.98e-02 2.71e+01 -1.0 1.62e+01 - 5.53e-01 6.33e-0
1f 1
8 1.6493658e+04 1.13e-02 2.14e+00 -1.0 4.69e+00 - 9.61e-01 4.08e-0
1f 2
9 1.6486286e+04 2.62e-03 1.45e-01 -1.0 4.34e+00 - 9.32e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6030958e+04 2.29e-03 2.48e-01 -2.5 2.75e+00 - 8.60e-01 7.46e-0
1f 1
11 1.5855765e+04 2.02e-03 5.89e-01 -2.5 1.07e+00 - 1.00e+00 7.13e-0
1f 1
12 1.5816643e+04 2.42e-04 5.68e-03 -2.5 3.64e-01 - 1.00e+00 1.00e+0
0h 1
13 1.5799010e+04 7.05e-05 2.19e-01 -3.8 6.35e+00 - 1.00e+00 7.16e-0
1h 1
14 1.5793495e+04 2.05e-07 4.24e-04 -3.8 1.40e+00 - 1.00e+00 1.00e+0
0f 1
15 1.5792149e+04 2.61e-08 7.64e-04 -5.7 2.78e-01 - 1.00e+00 9.87e-0
1h 1
16 1.5792139e+04 1.86e-12 1.17e-08 -5.7 1.65e-03 - 1.00e+00 1.00e+0
0f 1
17 1.5792122e+04 2.63e-12 4.48e-09 -8.6 3.69e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5792122218155622e+01 1.5792122218155622e+0
4
Dual infeasibility......: 4.4776962707563095e-09 4.4776962707563095e-0
6
Constraint violation....: 2.6301183453369958e-12 2.6301183453369958e-1
2
Complementarity.........: 3.6085068006977626e-09 3.6085068006977624e-0
6
Overall NLP error.......: 4.4776962707563095e-09 4.4776962707563095e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8073105e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.97e-04 9.80e-0
3h 1
2 8.7796146e+02 1.27e+04 5.24e+01 -1.0 1.24e+04 - 8.93e-05 1.01e-0
4h 1
3 8.6692458e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 3.47e-06 7.37e-0
4f 1
4 5.4092019e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 7.99e-04 2.24e-0
2h 1
5 2.4576710e+04 6.17e-02 7.93e+01 -1.0 1.24e+04 - 5.67e-02 1.00e+0
0h 1
6 1.6171478e+04 5.73e-02 5.23e+01 -1.0 6.39e+01 - 3.28e-01 6.59e-0
2f 1
7 1.4812866e+04 3.11e-02 2.54e+01 -1.0 3.21e+01 - 5.03e-01 4.22e-0
1f 1
8 1.4040427e+04 1.14e-02 2.00e+00 -1.0 1.10e+01 - 9.20e-01 9.11e-0
1f 1
9 1.4460004e+04 3.38e-04 9.28e-02 -1.0 4.85e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3750291e+04 1.39e-03 7.06e-02 -2.5 6.50e+00 - 8.71e-01 8.55e-0
1f 1
11 1.3727058e+04 1.41e-05 1.70e-02 -2.5 6.60e-01 - 1.00e+00 1.00e+0
0h 1
12 1.3695913e+04 1.35e-03 3.69e-02 -3.8 2.68e+00 - 7.12e-01 1.00e+0
0f 1
13 1.3693938e+04 9.56e-04 1.56e-03 -3.8 3.41e-02 - 9.61e-01 1.00e+0
0h 1
14 1.3694087e+04 1.22e-04 1.32e-04 -3.8 1.60e-02 - 1.00e+00 1.00e+0
0h 1
15 1.3692879e+04 1.38e-04 1.17e-03 -5.7 1.49e-01 - 9.16e-01 1.00e+0
0h 1
16 1.3692835e+04 3.55e-05 7.55e-06 -5.7 8.77e-03 - 1.00e+00 1.00e+0
0h 1
17 1.3692839e+04 4.36e-07 4.70e-06 -5.7 9.55e-04 - 1.00e+00 1.00e+0
0h 1
18 1.3692826e+04 3.62e-08 4.80e-05 -8.6 1.84e-03 - 1.00e+00 9.49e-0
1h 1
19 1.3692826e+04 6.54e-12 6.63e-11 -8.6 9.47e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.3692825544740392e+01 1.3692825544740392e+0
4
Dual infeasibility......: 6.6307835845832216e-11 6.6307835845832223e-0
8
Constraint violation....: 6.5408789495791098e-12 6.5408789495791098e-1
2
Complementarity.........: 2.5095397411936172e-09 2.5095397411936173e-0
6
Overall NLP error.......: 2.5095397411936172e-09 2.5095397411936173e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2300170e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.51e-03 9.81e-0
3h 1
2 9.1196834e+02 1.11e+04 5.23e+01 -1.0 9.29e+03 - 7.50e-06 6.02e-0
4h 1
3 5.3385923e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 5.09e-04 2.33e-0
2h 1
4 2.3594575e+04 6.87e-02 7.64e+01 -1.0 1.09e+04 - 7.95e-02 1.00e+0
0h 1
5 1.5384889e+04 6.21e-02 2.55e+01 -1.0 1.38e+01 - 6.32e-01 8.67e-0
2f 1
6 1.4033821e+04 2.15e-02 1.11e+01 -1.0 9.93e+00 - 6.46e-01 9.09e-0
1f 1
7 1.4269831e+04 3.16e-03 1.12e-01 -1.0 2.98e+00 - 9.91e-01 9.81e-0
1f 1
8 1.3841886e+04 2.66e-03 1.97e-01 -1.7 1.40e+01 - 9.31e-01 1.00e+0
0f 1
9 1.3668197e+04 1.70e-03 8.11e-02 -2.5 1.26e+00 - 8.01e-01 7.48e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3634355e+04 4.17e-04 1.11e-01 -2.5 8.74e-01 - 1.00e+00 9.05e-0
1h 1
11 1.3638487e+04 1.35e-05 5.03e-03 -2.5 1.72e-01 - 1.00e+00 1.00e+0
0f 1
12 1.3602884e+04 1.12e-05 6.47e-03 -3.8 1.61e+01 - 1.00e+00 9.69e-0
1f 1
13 1.3602212e+04 1.60e-08 1.24e-05 -3.8 5.02e-01 - 1.00e+00 1.00e+0
0f 1
14 1.3600274e+04 1.79e-08 5.06e-06 -5.7 8.91e-01 - 1.00e+00 1.00e+0
0f 1
15 1.3600252e+04 6.40e-13 4.12e-10 -8.6 1.11e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.3600252158890166e+01 1.3600252158890165e+0
4
Dual infeasibility......: 4.1156905171682966e-10 4.1156905171682966e-0
7
Constraint violation....: 6.4043215175502155e-13 6.4043215175502155e-1
3
Complementarity.........: 3.1281077294172553e-09 3.1281077294172554e-0
6
Overall NLP error.......: 3.1281077294172553e-09 3.1281077294172554e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3005826e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 2.02e-03 9.80e-0
3h 1
2 9.2703232e+02 9.19e+03 5.23e+01 -1.0 8.09e+03 - 2.76e-05 1.12e-0
4h 1
3 7.5783114e+02 9.11e+03 5.23e+01 -1.0 9.19e+03 - 1.67e-05 9.02e-0
3f 1
4 5.7019940e+02 8.91e+03 5.19e+01 -1.0 9.11e+03 - 1.10e-02 2.10e-0
2h 1
5 1.8305222e+04 8.28e-02 7.82e+01 -1.0 8.91e+03 - 8.71e-02 1.00e+0
0h 1
6 1.3289624e+04 7.37e-02 2.12e+01 -1.0 7.99e+00 - 7.08e-01 1.04e-0
1f 1
7 1.2190257e+04 3.47e-02 3.50e+00 -1.0 6.47e+00 - 8.56e-01 9.70e-0
1f 1
8 1.2545395e+04 3.12e-02 3.79e-01 -1.0 2.06e+00 - 9.00e-01 9.51e-0
1f 1
9 1.2151862e+04 4.32e-03 8.67e-01 -1.7 3.07e+00 - 5.83e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2125401e+04 4.49e-04 6.45e-01 -1.7 6.09e+00 - 6.59e-01 1.00e+0
0h 1
11 1.2146093e+04 6.37e-05 1.73e-01 -1.7 1.10e+01 - 7.67e-01 1.00e+0
0f 1
12 1.1998430e+04 3.67e-04 2.35e-02 -2.5 1.20e+01 - 9.73e-01 9.37e-0
1f 1
13 1.1971353e+04 9.70e-05 1.46e-01 -3.8 1.05e+01 - 9.93e-01 7.77e-0
1h 1
14 1.1965349e+04 2.41e-07 1.34e-04 -3.8 2.44e+00 - 1.00e+00 1.00e+0
0f 1
15 1.1964015e+04 1.79e-08 2.99e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
16 1.1963999e+04 1.29e-12 4.23e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.1963999151911169e+01 1.1963999151911168e+0
4
Dual infeasibility......: 4.2346965952900638e-10 4.2346965952900638e-0
7
Constraint violation....: 1.2936873794444637e-12 1.2936873794444637e-1
2
Complementarity.........: 4.7057989242955714e-09 4.7057989242955711e-0
6
Overall NLP error.......: 4.7057989242955714e-09 4.7057989242955711e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2300862e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.80e-0
3h 1
2 9.2018520e+02 6.71e+03 5.23e+01 -1.0 6.43e+03 - 7.59e-05 1.03e-0
4h 1
3 8.8417723e+02 6.69e+03 5.23e+01 -1.0 6.70e+03 - 7.25e-06 1.73e-0
3f 1
4 4.3415243e+02 6.54e+03 5.24e+01 -1.0 6.69e+03 - 2.08e-03 2.26e-0
2h 1
5 1.8486105e+04 7.08e-02 7.69e+01 -1.0 6.54e+03 - 8.04e-02 1.00e+0
0h 1
6 1.0916142e+04 6.40e-02 2.32e+01 -1.0 1.36e+01 - 6.65e-01 8.89e-0
2f 1
7 9.6154376e+03 1.98e-02 9.31e+00 -1.0 9.91e+00 - 6.64e-01 8.81e-0
1f 1
8 9.7199904e+03 1.05e-02 6.35e-01 -1.0 2.75e+00 - 9.95e-01 4.77e-0
1f 2
9 9.3967776e+03 9.36e-03 2.78e-01 -1.7 9.45e+00 - 1.00e+00 8.30e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.3672965e+03 2.18e-03 9.40e-01 -1.7 1.18e+01 - 1.00e+00 4.90e-0
1h 2
11 9.3624199e+03 2.10e-04 1.67e-02 -1.7 6.01e+00 - 1.00e+00 1.00e+0
0h 1
12 9.2069203e+03 4.79e-04 2.44e-02 -3.8 2.00e+01 - 8.46e-01 8.30e-0
1f 1
13 9.1886242e+03 1.49e-04 2.05e-01 -3.8 3.34e+00 - 9.89e-01 7.21e-0
1h 1
14 9.1840024e+03 3.89e-07 3.07e-04 -3.8 9.33e-01 - 1.00e+00 1.00e+0
0h 1
15 9.1828139e+03 1.95e-08 4.40e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
16 9.1828008e+03 7.96e-13 4.82e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 9.1828007878827336e+00 9.1828007878827339e+0
3
Dual infeasibility......: 4.8230730084716957e-10 4.8230730084716957e-0
7
Constraint violation....: 7.9648787565389512e-13 7.9648787565389512e-1
3
Complementarity.........: 2.6134527997795960e-09 2.6134527997795960e-0
6
Overall NLP error.......: 2.6134527997795960e-09 2.6134527997795960e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0880494e+02 4.77e+03 5.23e+01 -1.0 4.81e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0291924e+02 4.77e+03 5.23e+01 -1.0 2.79e+03 - 2.15e-05 2.38e-0
4h 1
3 3.7467532e+02 4.66e+03 5.24e+01 -1.0 4.77e+03 - 1.51e-04 2.34e-0
2f 1
4 1.7300257e+04 6.53e-02 7.97e+01 -1.0 4.66e+03 - 4.04e-02 1.00e+0
0h 1
5 8.8617124e+03 6.16e-02 5.71e+01 -1.0 3.53e+01 - 2.79e-01 5.15e-0
2f 1
6 7.5509801e+03 1.93e-02 2.65e+01 -1.0 1.63e+01 - 5.49e-01 6.34e-0
1f 1
7 7.1819282e+03 5.83e-03 7.45e-01 -1.0 4.62e+00 - 9.62e-01 8.21e-0
1f 1
8 7.4584045e+03 1.60e-04 6.14e-02 -1.0 6.90e+00 - 9.99e-01 1.00e+0
0f 1
9 6.8763864e+03 2.23e-03 9.86e-02 -2.5 6.56e+00 - 8.54e-01 8.68e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.7217370e+03 2.17e-03 3.89e-01 -2.5 1.16e+00 - 1.00e+00 7.71e-0
1f 1
11 6.6995759e+03 1.09e-04 4.63e-03 -2.5 2.74e-01 - 1.00e+00 1.00e+0
0h 1
12 6.6742284e+03 2.92e-05 1.37e-01 -3.8 1.34e+01 - 1.00e+00 7.68e-0
1h 1
13 6.6677284e+03 1.17e-07 3.28e-04 -3.8 3.11e+00 - 1.00e+00 1.00e+0
0f 1
14 6.6659140e+03 2.88e-08 1.03e-03 -5.7 7.43e-01 - 1.00e+00 9.85e-0
1f 1
15 6.6658915e+03 1.98e-12 1.42e-08 -5.7 1.14e-02 - 1.00e+00 1.00e+0
0f 1
16 6.6658694e+03 2.63e-12 4.48e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.6658693501289017e+00 6.6658693501289017e+0
3
Dual infeasibility......: 4.4776956682774442e-09 4.4776956682774442e-0
6
Constraint violation....: 2.6310550960140233e-12 2.6310550960140233e-1
2
Complementarity.........: 3.6084966358488367e-09 3.6084966358488367e-0
6
Overall NLP error.......: 4.4776956682774442e-09 4.4776956682774442e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9469463e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3h 1
2 8.9070845e+02 3.24e+03 5.24e+01 -1.0 2.13e+03 - 3.61e-05 1.51e-0
4h 1
3 3.3042115e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 6.40e-05 2.31e-0
2f 1
4 1.5680539e+04 6.28e-02 8.02e+01 -1.0 3.17e+03 - 3.82e-02 1.00e+0
0h 1
5 7.1096018e+03 5.94e-02 5.80e+01 -1.0 5.03e+01 - 2.72e-01 4.93e-0
2f 1
6 5.7281758e+03 2.48e-02 2.85e+01 -1.0 2.32e+01 - 5.13e-01 5.39e-0
1f 1
7 5.1166765e+03 1.01e-02 1.45e+00 -1.0 8.86e+00 - 9.34e-01 7.73e-0
1f 1
8 5.4253179e+03 3.01e-04 8.56e-02 -1.0 3.30e+00 - 9.98e-01 1.00e+0
0f 1
9 4.7993725e+03 2.08e-03 7.86e-02 -2.5 4.57e+00 - 8.62e-01 8.55e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.6288550e+03 2.21e-03 3.37e-01 -2.5 1.23e+00 - 1.00e+00 7.83e-0
1f 1
11 4.6027971e+03 1.46e-04 4.56e-03 -2.5 2.93e-01 - 1.00e+00 1.00e+0
0h 1
12 4.5779312e+03 2.16e-05 4.20e-02 -3.8 8.05e+00 - 1.00e+00 8.86e-0
1h 1
13 4.5759311e+03 5.62e-08 5.97e-04 -3.8 9.13e-01 - 1.00e+00 1.00e+0
0f 1
14 4.5743283e+03 4.27e-08 6.30e-05 -5.7 4.46e-01 - 1.00e+00 9.98e-0
1f 1
15 4.5743286e+03 1.89e-12 1.37e-08 -5.7 1.04e-03 - 1.00e+00 1.00e+0
0f 1
16 4.5743102e+03 2.57e-12 3.30e-06 -8.6 5.53e-03 - 1.00e+00 9.99e-0
1f 1
17 4.5743102e+03 5.47e-15 4.87e-14 -8.6 2.42e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 4.5743102085932339e+00 4.5743102085932342e+0
3
Dual infeasibility......: 4.8652189661024143e-14 4.8652189661024143e-1
1
Constraint violation....: 5.4677053271201488e-15 5.4677053271201488e-1
5
Complementarity.........: 2.7563433097154752e-09 2.7563433097154752e-0
6
Overall NLP error.......: 2.7563433097154752e-09 2.7563433097154752e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8047271e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.82e-0
3h 1
2 8.7572175e+02 2.00e+03 5.24e+01 -1.0 1.12e+03 - 4.57e-05 1.77e-0
4h 1
3 8.5856300e+02 2.00e+03 5.24e+01 -1.0 1.99e+03 - 9.83e-05 6.70e-0
4h 1
4 2.9495283e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 7.60e-04 2.24e-0
2f 1
5 1.3917078e+04 6.17e-02 7.93e+01 -1.0 1.95e+03 - 5.68e-02 1.00e+0
0h 1
6 5.5167096e+03 5.73e-02 5.23e+01 -1.0 6.38e+01 - 3.28e-01 6.60e-0
2f 1
7 4.1582126e+03 3.11e-02 2.54e+01 -1.0 3.21e+01 - 5.03e-01 4.22e-0
1f 1
8 3.3871319e+03 1.13e-02 1.99e+00 -1.0 1.10e+01 - 9.20e-01 9.10e-0
1f 1
9 3.8059823e+03 3.36e-04 1.98e-01 -1.0 4.84e+00 - 9.33e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.1154313e+03 1.20e-03 9.57e-01 -1.7 1.95e+01 - 4.67e-01 9.97e-0
1f 1
11 3.1852525e+03 4.48e-05 2.37e-02 -1.7 6.86e+00 - 1.00e+00 1.00e+0
0f 1
12 3.0668129e+03 4.90e-05 1.82e-01 -2.5 2.56e+01 - 1.00e+00 8.60e-0
1f 1
13 3.0614613e+03 8.55e-05 2.75e-03 -2.5 2.84e-01 - 1.00e+00 1.00e+0
0f 1
14 3.0435482e+03 2.48e-04 6.72e-02 -3.8 6.99e+00 - 7.79e-01 9.53e-0
1h 1
15 3.0406304e+03 1.60e-03 1.54e-03 -3.8 3.26e-01 - 9.82e-01 1.00e+0
0f 1
16 3.0406230e+03 8.23e-05 6.19e-05 -3.8 2.30e-02 - 1.00e+00 1.00e+0
0h 1
17 3.0392663e+03 1.30e-04 1.10e-03 -5.7 3.04e-01 - 9.19e-01 1.00e+0
0h 1
18 3.0392284e+03 3.23e-05 6.59e-06 -5.7 8.38e-03 - 1.00e+00 1.00e+0
0h 1
19 3.0392341e+03 1.71e-07 3.29e-06 -5.7 5.94e-04 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 3.0392190e+03 2.64e-08 3.19e-05 -8.6 3.69e-03 - 1.00e+00 9.58e-0
1h 1
21 3.0392184e+03 4.26e-12 5.09e-11 -8.6 1.55e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 3.0392183943829316e+00 3.0392183943829314e+0
3
Dual infeasibility......: 5.0925437747872056e-11 5.0925437747872056e-0
8
Constraint violation....: 4.2577052994374753e-12 4.2577052994374753e-1
2
Complementarity.........: 4.5522886111443192e-09 4.5522886111443191e-0
6
Overall NLP error.......: 4.5522886111443192e-09 4.5522886111443191e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6513624e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 4.97e-04 9.88e-0
3h 1
2 8.4161129e+02 9.17e+02 5.24e+01 -1.0 8.13e+02 - 9.77e-05 8.71e-0
4h 1
3 4.8720279e+02 9.04e+02 5.24e+01 -1.0 9.17e+02 - 8.46e-04 1.35e-0
2h 1
4 3.2650456e+02 8.82e+02 5.19e+01 -1.0 9.04e+02 - 1.51e-02 2.51e-0
2f 1
5 8.0957788e+03 7.01e-02 7.77e+01 -1.0 8.82e+02 - 1.07e-01 1.00e+0
0h 1
6 3.4841068e+03 6.05e-02 2.23e+01 -1.0 5.26e+01 - 6.88e-01 1.27e-0
1f 1
7 2.0904182e+03 3.37e-02 2.23e+00 -1.0 2.82e+01 - 9.21e-01 5.66e-0
1f 1
8 2.2795223e+03 4.95e-03 3.32e+00 -1.0 5.41e+00 - 2.04e-01 1.00e+0
0f 1
9 2.2796171e+03 6.53e-04 5.48e-01 -1.0 4.36e+00 - 7.15e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8939706e+03 5.25e-04 3.41e-01 -1.7 5.23e+00 - 8.08e-01 6.83e-0
1f 1
11 1.8906836e+03 4.64e-05 6.86e-01 -1.7 1.35e+01 - 7.44e-01 1.00e+0
0f 1
12 1.9065875e+03 1.53e-05 1.82e-01 -1.7 3.59e+01 - 5.24e-01 1.00e+0
0f 1
13 1.8169770e+03 5.15e-05 4.38e-02 -2.5 2.29e+01 - 1.00e+00 9.60e-0
1f 1
14 1.7914589e+03 1.64e-03 1.43e-03 -2.5 2.03e+01 - 1.00e+00 1.00e+0
0f 1
15 1.7621798e+03 1.03e-03 3.13e-02 -3.8 1.65e+01 - 8.09e-01 1.00e+0
0h 1
16 1.7588389e+03 3.18e-03 1.13e-03 -3.8 2.91e-01 - 1.00e+00 1.00e+0
0h 1
17 1.7592546e+03 3.93e-05 1.25e-04 -3.8 1.36e-02 - 1.00e+00 1.00e+0
0h 1
18 1.7572198e+03 1.01e-04 3.66e-04 -5.7 8.93e-01 - 9.51e-01 9.78e-0
1h 1
19 1.7571972e+03 2.20e-05 3.76e-03 -5.7 1.89e-02 - 1.00e+00 7.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7571971e+03 8.58e-09 1.19e-06 -5.7 4.11e-03 - 1.00e+00 1.00e+0
0f 1
21 1.7571733e+03 9.00e-09 1.93e-05 -8.6 1.11e-02 - 1.00e+00 9.83e-0
1h 1
22 1.7571729e+03 1.37e-12 6.49e-11 -8.6 1.84e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.7571729228586848e+00 1.7571729228586846e+0
3
Dual infeasibility......: 6.4889816468584187e-11 6.4889816468584187e-0
8
Constraint violation....: 1.3727907699490061e-12 1.3727907699490061e-1
2
Complementarity.........: 2.7048618330585373e-09 2.7048618330585372e-0
6
Overall NLP error.......: 2.7048618330585373e-09 2.7048618330585372e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.04e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.57e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235660171e+00 1.6104063235660171e+0
3
Dual infeasibility......: 2.4574009793760635e-12 2.4574009793760635e-0
9
Constraint violation....: 7.5703172614159067e-16 7.5703172614159067e-1
6
Complementarity.........: 2.5062163919681798e-09 2.5062163919681799e-0
6
Overall NLP error.......: 2.5062163919681798e-09 2.5062163919681799e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318724481455e-09 2.1031318724481455e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896894379e-09 2.8882108896894380e-0
6
Overall NLP error.......: 2.8882108896894379e-09 2.8882108896894380e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101521e-01 6.4890146112101525e+0
2
Dual infeasibility......: 4.9126605618489413e-09 4.9126605618489413e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984918224e-09 4.3646094984918221e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605618489413e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.04e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.57e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235660171e+00 1.6104063235660171e+0
3
Dual infeasibility......: 2.4574009793760635e-12 2.4574009793760635e-0
9
Constraint violation....: 7.5703172614159067e-16 7.5703172614159067e-1
6
Complementarity.........: 2.5062163919681798e-09 2.5062163919681799e-0
6
Overall NLP error.......: 2.5062163919681798e-09 2.5062163919681799e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2252293e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 3.31e-04 9.88e-0
3h 1
2 7.9742303e+02 9.17e+02 5.24e+01 -1.0 8.18e+02 - 9.71e-05 9.16e-0
4h 1
3 2.4312288e+02 8.97e+02 5.26e+01 -1.0 9.17e+02 - 9.08e-04 2.09e-0
2h 1
4 1.2260850e+04 5.54e-02 8.24e+01 -1.0 8.98e+02 - 3.89e-02 1.00e+0
0h 1
5 3.8743081e+03 5.28e-02 5.49e+01 -1.0 7.96e+01 - 3.31e-01 5.07e-0
2f 1
6 1.9080741e+03 3.72e-02 2.92e+01 -1.0 3.93e+01 - 4.71e-01 5.03e-0
1f 1
7 4.6563841e+03 1.22e-02 2.61e+01 -1.0 2.04e+01 - 4.03e-01 1.00e+0
0h 1
8 1.8744334e+03 1.17e-02 9.66e-01 -1.0 2.51e+01 - 9.88e-01 8.98e-0
1f 1
9 1.6954233e+03 5.10e-04 6.26e-02 -1.7 6.76e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5627878e+03 1.96e-03 2.19e-01 -2.5 1.25e+01 - 7.43e-01 1.00e+0
0f 1
11 1.5309769e+03 3.67e-03 1.04e-01 -2.5 2.12e+00 - 1.00e+00 9.19e-0
1h 1
12 1.5388648e+03 1.31e-04 3.49e-03 -2.5 1.16e+00 - 1.00e+00 1.00e+0
0h 1
13 1.5037418e+03 1.63e-04 2.17e-02 -3.8 1.88e+01 - 9.93e-01 9.32e-0
1h 1
14 1.5022722e+03 7.65e-07 7.15e-05 -3.8 1.24e+00 - 1.00e+00 1.00e+0
0f 1
15 1.5003196e+03 3.77e-07 1.78e-04 -5.7 1.04e+00 - 1.00e+00 9.96e-0
1h 1
16 1.5003172e+03 3.80e-11 2.94e-09 -5.7 1.11e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.29e-02 - 1.00e+00 1.00e+0
0h 1
1 8.6513592e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 4.97e-04 9.88e-0
3h 1
2 8.3600930e+02 9.17e+02 5.24e+01 -1.0 8.33e+02 - 9.54e-05 1.08e-0
3h 1
3 2.6322504e+02 8.96e+02 5.25e+01 -1.0 9.17e+02 - 1.07e-03 2.19e-0
2h 1
4 1.2573574e+04 6.02e-02 8.02e+01 -1.0 8.97e+02 - 5.13e-02 1.00e+0
0h 1
5 4.2599275e+03 5.61e-02 5.27e+01 -1.0 7.19e+01 - 3.32e-01 6.13e-0
2f 1
6 2.6731519e+03 3.02e-02 2.71e+01 -1.0 3.87e+01 - 4.79e-01 4.34e-0
1f 1
90 1.856489e+04 1.632511e+04 6.735193e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 40
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 20
inequality constraints with only lower bounds: 11
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1149117e+02 1.57e+04 5.50e+01 -1.0 1.59e+04 - 1.75e-04 9.81e-0
3h 1
2 7.0801705e+02 1.57e+04 5.50e+01 -1.0 1.02e+04 - 1.61e-05 1.53e-0
4h 1
3 7.0346476e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 5.90e-05 3.68e-0
4h 1
4 6.7504027e+02 1.57e+04 5.49e+01 -1.0 1.57e+04 - 4.23e-04 2.42e-0
3h 1
5 5.2731816e+02 1.54e+04 5.38e+01 -1.0 1.57e+04 - 3.03e-03 1.90e-0
2f 1
6 2.5077242e+04 7.58e-02 8.66e+01 -1.0 1.54e+04 - 2.71e-02 1.00e+0
0h 1
7 1.7876339e+04 7.27e-02 6.70e+01 -1.0 6.21e+01 - 2.35e-01 4.29e-0
2f 1
8 1.6631925e+04 4.74e-02 3.04e+01 -1.0 2.06e+01 - 5.40e-01 3.79e-0
1f 1
9 1.7123904e+04 3.49e-02 2.18e+01 -1.0 1.32e+01 - 5.66e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6802677e+04 7.02e-03 2.91e+00 -1.0 2.33e+00 - 7.76e-01 1.00e+0
0f 1
11 1.6815882e+04 2.20e-04 1.60e+00 -1.0 3.17e+00 - 3.94e-01 1.00e+0
0f 1
12 1.6822854e+04 6.47e-06 6.92e-01 -1.0 3.01e+00 - 5.92e-01 1.00e+0
0f 1
13 1.6830490e+04 2.31e-07 2.70e-01 -1.0 6.91e+00 - 6.05e-01 1.00e+0
0f 1
14 1.6538658e+04 2.18e-04 2.96e-01 -1.7 4.70e+00 - 8.75e-01 7.83e-0
1f 1
15 1.6502921e+04 5.60e-04 2.88e-01 -1.7 2.18e+01 - 6.38e-01 1.00e+0
0f 1
16 1.6527505e+04 7.05e-05 4.95e-02 -1.7 3.75e+01 - 7.30e-01 1.00e+0
0h 1
17 1.6383556e+04 9.49e-04 4.67e-02 -2.5 4.85e+01 - 9.27e-01 1.00e+0
0f 1
18 1.6353897e+04 1.09e-03 1.17e-02 -2.5 1.06e+01 - 1.00e+00 1.00e+0
0h 1
19 1.6329095e+04 1.83e-04 8.32e-02 -3.8 1.46e+01 - 1.00e+00 8.56e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6326780e+04 6.19e-07 9.90e-05 -3.8 1.41e+00 - 1.00e+00 1.00e+0
0h 1
21 1.6325122e+04 3.99e-07 1.05e-04 -5.7 7.40e-01 - 1.00e+00 9.98e-0
1h 1
22 1.6325125e+04 3.81e-11 3.00e-09 -5.7 3.83e-03 - 1.00e+00 1.00e+0
0f 1
23 1.6325106e+04 5.59e-11 3.27e-05 -8.6 9.17e-03 - 1.00e+00 9.47e-0
1h 1
24 1.6325105e+04 1.80e-13 5.88e-12 -8.6 1.02e-04 - 1.00e+00 1.00e+0
0f 1
25 1.6325105e+04 7.11e-15 9.77e-15 -9.0 9.96e-06 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 25
(scaled) (unscaled)
Objective...............: 1.6325105264621573e+01 1.6325105264621572e+0
4
Dual infeasibility......: 9.7699626167013776e-15 9.7699626167013776e-1
2
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 1.1997039694837570e-09 1.1997039694837571e-0
6
Overall NLP error.......: 1.1997039694837570e-09 1.1997039694837571e-0
6
Number of objective function evaluations = 28
Number of objective gradient evaluations = 26
Number of equality constraint evaluations = 28
Number of inequality constraint evaluations = 28
Number of equality constraint Jacobian evaluations = 26
Number of inequality constraint Jacobian evaluations = 26
Number of Lagrangian Hessian evaluations = 25
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9876123e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.75e-04 9.80e-0
3h 1
2 7.9582752e+02 1.50e+04 5.25e+01 -1.0 1.37e+04 - 3.21e-05 1.08e-0
4h 1
3 7.2647337e+02 1.49e+04 5.25e+01 -1.0 1.50e+04 - 1.17e-05 5.21e-0
3h 1
4 5.9043951e+02 1.46e+04 5.25e+01 -1.0 1.49e+04 - 5.57e-03 1.96e-0
2h 1
5 2.4135353e+04 5.75e-02 8.38e+01 -1.0 1.46e+04 - 3.91e-02 1.00e+0
0h 1
6 1.7571470e+04 5.45e-02 4.04e+01 -1.0 6.33e+01 - 5.15e-01 5.44e-0
2f 1
7 1.5916707e+04 4.06e-02 1.87e+01 -1.0 3.49e+01 - 5.31e-01 4.60e-0
1f 1
8 1.6372183e+04 2.37e-02 4.90e+00 -1.0 1.25e+01 - 5.53e-01 2.50e-0
1f 3
9 1.6053532e+04 5.39e-03 9.59e-02 -1.0 5.28e+00 - 9.93e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5750510e+04 1.10e-03 2.78e-01 -1.7 1.51e+01 - 1.00e+00 8.62e-0
1f 1
11 1.5749990e+04 6.38e-04 1.36e-02 -1.7 4.60e+01 - 1.00e+00 1.00e+0
0f 1
12 1.5586933e+04 1.35e-03 9.18e-02 -3.8 5.96e+01 - 7.95e-01 9.32e-0
1f 1
13 1.5560718e+04 1.50e-03 6.42e-02 -3.8 4.00e+00 - 8.48e-01 7.72e-0
1h 1
14 1.5560472e+04 2.46e-06 7.46e-04 -3.8 9.10e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5559228e+04 3.19e-07 5.93e-04 -5.7 4.46e-01 - 1.00e+00 9.89e-0
1h 1
16 1.5559219e+04 3.92e-11 6.19e-09 -5.7 5.72e-02 - 1.00e+00 1.00e+0
0f 1
17 1.5559202e+04 6.30e-11 2.10e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5559202164414781e+01 1.5559202164414781e+0
4
Dual infeasibility......: 2.0959963720649724e-09 2.0959963720649724e-0
6
Constraint violation....: 6.2996136085402554e-11 6.2996136085402554e-1
1
Complementarity.........: 3.0423119898900739e-09 3.0423119898900739e-0
6
Overall NLP error.......: 3.0423119898900739e-09 3.0423119898900739e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4411492e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.92e-04 9.80e-0
3f 1
2 8.4131074e+02 1.39e+04 5.24e+01 -1.0 1.37e+04 - 9.29e-05 1.01e-0
4h 1
3 8.3226232e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 3.09e-06 6.42e-0
4f 1
4 5.3905558e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 6.89e-04 2.15e-0
2h 1
5 2.5524919e+04 5.72e-02 8.12e+01 -1.0 1.36e+04 - 4.53e-02 1.00e+0
0h 1
6 1.7022490e+04 5.37e-02 5.25e+01 -1.0 7.99e+01 - 3.46e-01 5.59e-0
2f 1
7 1.4909765e+04 3.42e-02 2.85e+01 -1.0 4.22e+01 - 4.65e-01 5.33e-0
1f 1
8 1.5382376e+04 1.84e-02 7.94e+00 -1.0 2.05e+01 - 5.94e-01 2.50e-0
1f 3
9 1.5063958e+04 5.26e-03 5.45e-01 -1.0 6.13e+00 - 9.52e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4709817e+04 1.46e-03 5.12e-01 -1.7 6.60e+00 - 1.00e+00 7.87e-0
1f 1
11 1.4650749e+04 7.04e-04 2.55e-02 -1.7 1.84e+01 - 1.00e+00 1.00e+0
0f 1
12 1.4510558e+04 1.45e-03 1.16e-01 -3.8 1.99e+01 - 7.66e-01 9.24e-0
1f 1
13 1.4479287e+04 2.49e-03 5.50e-02 -3.8 2.24e+00 - 8.16e-01 7.62e-0
1h 1
14 1.4480756e+04 1.90e-04 8.13e-02 -3.8 3.53e-01 - 1.00e+00 9.37e-0
1h 1
15 1.4481114e+04 4.07e-07 1.80e-05 -3.8 3.26e-02 - 1.00e+00 1.00e+0
0f 1
16 1.4480069e+04 4.15e-07 1.01e-03 -5.7 1.49e-01 - 1.00e+00 9.87e-0
1h 1
17 1.4480065e+04 4.53e-11 4.89e-09 -5.7 5.06e-03 - 1.00e+00 1.00e+0
0f 1
18 1.4480052e+04 6.30e-11 3.22e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.4480051786973899e+01 1.4480051786973898e+0
4
Dual infeasibility......: 3.2166427389255432e-09 3.2166427389255432e-0
6
Constraint violation....: 6.3006003192533910e-11 6.3006003192533910e-1
1
Complementarity.........: 2.9225064375599528e-09 2.9225064375599527e-0
6
Overall NLP error.......: 3.2166427389255432e-09 3.2166427389255432e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.7936002e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.86e-04 9.80e-0
3h 1
2 8.7652946e+02 1.27e+04 5.24e+01 -1.0 1.20e+04 - 4.36e-05 1.05e-0
4h 1
3 8.3442979e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 8.15e-06 2.81e-0
3h 1
4 5.5617250e+02 1.23e+04 5.24e+01 -1.0 1.26e+04 - 3.06e-03 2.14e-0
2h 1
5 2.3588216e+04 6.39e-02 7.96e+01 -1.0 1.23e+04 - 6.18e-02 1.00e+0
0h 1
6 1.6047023e+04 5.88e-02 4.85e+01 -1.0 6.02e+01 - 3.75e-01 7.21e-0
2f 1
7 1.4675147e+04 3.11e-02 2.21e+01 -1.0 3.18e+01 - 5.32e-01 4.33e-0
1f 1
8 1.4026379e+04 8.98e-03 1.62e+00 -1.0 1.07e+01 - 9.22e-01 8.90e-0
1f 1
9 1.4382360e+04 1.96e-04 6.31e-02 -1.0 4.55e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3744585e+04 1.20e-03 1.87e-01 -2.5 6.20e+00 - 8.77e-01 7.97e-0
1f 1
11 1.3713259e+04 2.36e-05 8.38e-02 -2.5 7.75e-01 - 9.84e-01 1.00e+0
0h 1
12 1.3692146e+04 5.48e-04 3.83e-03 -2.5 9.02e-01 - 1.00e+00 1.00e+0
0h 1
13 1.3676766e+04 1.93e-04 6.43e-02 -3.8 5.36e+00 - 8.35e-01 9.99e-0
1h 1
14 1.3674300e+04 1.38e-03 1.56e-03 -3.8 3.50e-02 - 1.00e+00 1.00e+0
0f 1
15 1.3674357e+04 4.19e-05 4.21e-05 -3.8 8.80e-03 - 1.00e+00 1.00e+0
0h 1
16 1.3672992e+04 1.28e-04 8.08e-04 -5.7 2.97e-01 - 9.28e-01 1.00e+0
0h 1
17 1.3672953e+04 2.93e-05 5.60e-06 -5.7 7.92e-03 - 1.00e+00 1.00e+0
0h 1
18 1.3672958e+04 1.03e-07 3.04e-06 -5.7 4.59e-04 - 1.00e+00 1.00e+0
0h 1
19 1.3672943e+04 2.44e-08 5.13e-05 -8.6 3.68e-03 - 1.00e+00 9.48e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.3672943e+04 6.90e-12 8.89e-11 -8.6 1.91e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.3672942532141681e+01 1.3672942532141680e+0
4
Dual infeasibility......: 8.8945273879856759e-11 8.8945273879856762e-0
8
Constraint violation....: 6.9036998340266109e-12 6.9036998340266109e-1
2
Complementarity.........: 3.8981427332717441e-09 3.8981427332717442e-0
6
Overall NLP error.......: 3.8981427332717441e-09 3.8981427332717442e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9481357e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 7.48e-04 9.80e-0
3h 1
2 8.9183826e+02 1.11e+04 5.24e+01 -1.0 9.65e+03 - 2.73e-05 1.14e-0
4h 1
3 7.2358263e+02 1.10e+04 5.24e+01 -1.0 1.11e+04 - 1.86e-05 1.03e-0
2h 1
4 6.2607038e+02 1.08e+04 5.20e+01 -1.0 1.10e+04 - 1.15e-02 2.10e-0
2h 1
5 1.9624054e+04 7.36e-02 7.76e+01 -1.0 1.08e+04 - 9.80e-02 1.00e+0
0h 1
6 1.4380395e+04 6.46e-02 2.08e+01 -1.0 3.73e+01 - 7.04e-01 1.14e-0
1f 1
7 1.2837848e+04 2.05e-02 1.65e+00 -1.0 1.97e+01 - 9.31e-01 7.25e-0
1f 1
8 1.3179866e+04 1.96e-03 6.24e-01 -1.0 4.05e+00 - 6.80e-01 1.00e+0
0f 1
9 1.2676958e+04 1.67e-03 4.02e-01 -1.7 4.05e+00 - 7.62e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2647354e+04 7.07e-04 3.77e-01 -1.7 8.13e+00 - 7.30e-01 1.00e+0
0h 1
11 1.2666208e+04 1.79e-05 2.05e-01 -1.7 1.81e+01 - 6.30e-01 1.00e+0
0h 1
12 1.2683013e+04 9.82e-09 3.14e-06 -1.7 1.75e+01 - 1.00e+00 1.00e+0
0h 1
13 1.2489769e+04 5.20e-04 2.56e-02 -3.8 4.99e+01 - 8.44e-01 8.28e-0
1f 1
14 1.2456804e+04 1.38e-04 7.46e-02 -3.8 8.54e+00 - 9.72e-01 8.79e-0
1h 1
15 1.2455202e+04 2.22e-07 8.34e-01 -3.8 1.04e+00 - 6.28e-01 1.00e+0
0h 1
16 1.2455102e+04 6.34e-09 1.81e-04 -3.8 1.35e-04 - 1.00e+00 1.00e+0
0h 1
17 1.2453702e+04 2.26e-08 2.70e-02 -5.7 4.46e-01 - 1.00e+00 9.07e-0
1f 1
18 1.2453581e+04 4.41e-11 2.94e-07 -5.7 4.14e-02 - 1.00e+00 1.00e+0
0f 1
19 1.2453562e+04 2.64e-12 3.14e-06 -8.6 5.53e-03 - 1.00e+00 9.99e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.2453562e+04 7.11e-15 4.80e-14 -8.6 2.83e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.2453562318093988e+01 1.2453562318093987e+0
4
Dual infeasibility......: 4.7986053674899941e-14 4.7986053674899941e-1
1
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.6493692192559653e-09 2.6493692192559651e-0
6
Overall NLP error.......: 2.6493692192559653e-09 2.6493692192559651e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8776327e+02 9.19e+03 5.24e+01 -1.0 9.28e+03 - 6.64e-04 9.80e-0
3h 1
2 8.8487848e+02 9.19e+03 5.24e+01 -1.0 8.49e+03 - 4.35e-05 1.07e-0
4h 1
3 8.1017702e+02 9.15e+03 5.24e+01 -1.0 9.19e+03 - 1.14e-05 4.07e-0
3h 1
4 4.8829986e+02 8.96e+03 5.23e+01 -1.0 9.15e+03 - 4.62e-03 2.12e-0
2h 1
5 1.9624072e+04 6.67e-02 7.88e+01 -1.0 8.96e+03 - 7.36e-02 1.00e+0
0h 1
6 1.2613352e+04 6.06e-02 4.34e+01 -1.0 5.13e+01 - 4.30e-01 8.42e-0
2f 1
7 1.1287964e+04 2.91e-02 1.67e+01 -1.0 2.55e+01 - 6.00e-01 4.84e-0
1f 1
8 1.0844638e+04 5.12e-03 9.75e-01 -1.0 9.16e+00 - 9.34e-01 7.59e-0
1f 1
9 1.1096445e+04 1.87e-04 6.09e-02 -1.0 4.66e+00 - 9.97e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.0465447e+04 2.23e-03 7.97e-02 -2.5 4.77e+00 - 8.70e-01 8.69e-0
1f 1
11 1.0359649e+04 1.08e-03 4.55e-01 -2.5 7.60e-01 - 1.00e+00 6.04e-0
1f 1
12 1.0359698e+04 2.49e-06 8.13e-03 -2.5 1.52e-01 - 1.00e+00 1.00e+0
0h 1
13 1.0339422e+04 6.16e-06 2.40e-02 -3.8 5.36e+00 - 9.14e-01 8.89e-0
1f 1
14 1.0335906e+04 4.60e-04 4.73e-04 -3.8 5.92e-01 - 1.00e+00 1.00e+0
0f 1
15 1.0334764e+04 6.26e-05 1.12e-02 -5.7 2.97e-01 - 8.14e-01 1.00e+0
0h 1
16 1.0334651e+04 3.51e-05 3.93e-05 -5.7 9.55e-03 - 1.00e+00 1.00e+0
0h 1
17 1.0334652e+04 1.18e-06 1.12e-05 -5.7 1.44e-03 - 1.00e+00 9.97e-0
1h 1
18 1.0334638e+04 2.43e-09 9.95e-08 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
19 1.0334638e+04 3.68e-15 3.66e-14 -8.6 6.30e-07 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.0334637968308325e+01 1.0334637968308325e+0
4
Dual infeasibility......: 3.6583517268328523e-14 3.6583517268328523e-1
1
Constraint violation....: 3.6787062165796625e-15 3.6787062165796625e-1
5
Complementarity.........: 2.6173609412657226e-09 2.6173609412657225e-0
6
Overall NLP error.......: 2.6173609412657226e-09 2.6173609412657225e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0889707e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0591739e+02 6.71e+03 5.23e+01 -1.0 5.95e+03 - 4.04e-05 1.12e-0
4h 1
3 7.6488260e+02 6.66e+03 5.24e+01 -1.0 6.70e+03 - 1.70e-05 6.81e-0
3h 1
4 4.6074215e+02 6.52e+03 5.21e+01 -1.0 6.66e+03 - 8.31e-03 2.09e-0
2h 1
5 1.6247932e+04 7.43e-02 7.77e+01 -1.0 6.52e+03 - 8.93e-02 1.00e+0
0h 1
6 1.0403223e+04 6.60e-02 2.72e+01 -1.0 2.46e+01 - 6.25e-01 1.03e-0
1f 1
7 8.8840635e+03 1.77e-02 6.66e+00 -1.0 1.48e+01 - 7.64e-01 8.19e-0
1f 1
8 9.0908605e+03 9.00e-03 6.82e-01 -1.0 4.18e+00 - 9.75e-01 4.95e-0
1f 2
9 8.8093829e+03 1.09e-02 9.75e-01 -1.7 5.58e+00 - 2.29e-01 8.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.8009373e+03 5.65e-04 8.20e-01 -1.7 6.14e+00 - 6.64e-01 1.00e+0
0f 1
11 8.7941798e+03 1.26e-04 1.75e-01 -1.7 1.12e+01 - 7.73e-01 1.00e+0
0h 1
12 8.6400743e+03 5.54e-04 2.35e-02 -2.5 1.25e+01 - 9.38e-01 9.46e-0
1f 1
13 8.6049699e+03 1.68e-04 6.91e-02 -3.8 1.02e+01 - 9.71e-01 8.52e-0
1h 1
14 8.6017649e+03 2.32e-07 1.41e-01 -3.8 1.73e+00 - 8.95e-01 1.00e+0
0h 1
15 8.6016821e+03 5.43e-09 3.68e-05 -3.8 1.07e-03 - 1.00e+00 1.00e+0
0h 1
16 8.6003683e+03 1.93e-08 3.87e-03 -5.7 2.97e-01 - 1.00e+00 9.68e-0
1f 1
17 8.6003325e+03 5.73e-12 2.62e-08 -5.7 9.58e-03 - 1.00e+00 1.00e+0
0f 1
18 8.6003159e+03 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 8.6003159311915987e+00 8.6003159311915988e+0
3
Dual infeasibility......: 4.4780409847796504e-09 4.4780409847796504e-0
6
Constraint violation....: 2.6339139203024331e-12 2.6339139203024331e-1
2
Complementarity.........: 3.8374887930401712e-09 3.8374887930401710e-0
6
Overall NLP error.......: 4.4780409847796504e-09 4.4780409847796504e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0887653e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0575715e+02 4.77e+03 5.23e+01 -1.0 4.05e+03 - 4.23e-05 1.17e-0
4h 1
3 6.7332381e+02 4.72e+03 5.24e+01 -1.0 4.77e+03 - 2.39e-05 1.03e-0
2f 1
4 4.3700859e+02 4.62e+03 5.18e+01 -1.0 4.72e+03 - 1.38e-02 2.11e-0
2h 1
5 1.3037784e+04 7.91e-02 7.80e+01 -1.0 4.62e+03 - 9.53e-02 1.00e+0
0h 1
6 8.3073573e+03 6.95e-02 2.11e+01 -1.0 2.25e+01 - 7.07e-01 1.14e-0
1f 1
7 6.9813416e+03 1.49e-02 1.23e+00 -1.0 1.41e+01 - 9.43e-01 7.79e-0
1f 1
8 7.2864193e+03 1.03e-02 5.55e-01 -1.0 4.36e+00 - 5.26e-01 9.21e-0
1f 1
9 6.8676500e+03 2.63e-03 2.98e-01 -1.7 2.82e+00 - 8.52e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.8382870e+03 8.11e-04 5.10e-01 -1.7 8.23e+00 - 6.46e-01 1.00e+0
0h 1
11 6.8633826e+03 5.65e-06 1.06e-01 -1.7 1.23e+01 - 8.35e-01 1.00e+0
0h 1
12 6.7032048e+03 4.78e-04 2.58e-02 -2.5 1.76e+01 - 9.73e-01 9.40e-0
1f 1
13 6.6706157e+03 1.36e-04 7.95e-02 -3.8 9.55e+00 - 9.82e-01 8.43e-0
1h 1
14 6.6673152e+03 1.82e-07 9.12e-02 -3.8 1.54e+00 - 9.28e-01 1.00e+0
0h 1
15 6.6672355e+03 4.89e-09 2.88e-05 -3.8 1.71e-04 - 1.00e+00 1.00e+0
0h 1
16 6.6659218e+03 1.93e-08 3.88e-03 -5.7 2.97e-01 - 1.00e+00 9.68e-0
1f 1
17 6.6658859e+03 5.75e-12 2.62e-08 -5.7 9.60e-03 - 1.00e+00 1.00e+0
0f 1
18 6.6658693e+03 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 6.6658693446739070e+00 6.6658693446739071e+0
3
Dual infeasibility......: 4.4780423670764339e-09 4.4780423670764339e-0
6
Constraint violation....: 2.6338722869390097e-12 2.6338722869390097e-1
2
Complementarity.........: 3.6085481784169220e-09 3.6085481784169218e-0
6
Overall NLP error.......: 4.4780423670764339e-09 4.4780423670764339e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2287642e+02 3.24e+03 5.23e+01 -1.0 3.27e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1570379e+02 3.24e+03 5.23e+01 -1.0 2.10e+03 - 2.38e-05 2.81e-0
4h 1
3 3.4600376e+02 3.17e+03 5.24e+01 -1.0 3.24e+03 - 1.97e-04 2.35e-0
2f 1
4 1.5844512e+04 6.83e-02 7.63e+01 -1.0 3.17e+03 - 7.93e-02 1.00e+0
0h 1
5 7.5150436e+03 6.18e-02 2.59e+01 -1.0 1.38e+01 - 6.27e-01 8.62e-0
2f 1
6 6.1543861e+03 2.18e-02 1.14e+01 -1.0 9.93e+00 - 6.43e-01 9.14e-0
1f 1
7 6.3961781e+03 2.56e-03 1.09e-01 -1.0 3.02e+00 - 9.91e-01 9.87e-0
1f 1
8 5.9622624e+03 2.64e-03 3.77e-01 -1.7 1.24e+01 - 8.01e-01 1.00e+0
0f 1
9 5.9216420e+03 6.54e-04 6.98e-01 -1.7 3.22e+01 - 4.57e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.9508862e+03 5.90e-06 5.27e-04 -1.7 2.20e+01 - 1.00e+00 1.00e+0
0h 1
11 5.7516225e+03 4.59e-04 2.10e-02 -3.8 6.72e+01 - 8.46e-01 8.40e-0
1f 1
12 5.7290091e+03 1.42e-04 2.09e-01 -3.8 1.04e+01 - 9.93e-01 7.21e-0
1h 1
13 5.7226543e+03 3.31e-07 2.96e-04 -3.8 2.90e+00 - 1.00e+00 1.00e+0
0h 1
14 5.7210186e+03 1.94e-08 4.46e-06 -5.7 5.94e-01 - 1.00e+00 1.00e+0
0h 1
15 5.7210000e+03 7.81e-13 4.76e-10 -8.6 7.35e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.7210000462742192e+00 5.7210000462742191e+0
3
Dual infeasibility......: 4.7627732243670615e-10 4.7627732243670615e-0
7
Constraint violation....: 7.8051454188710068e-13 7.8051454188710068e-1
3
Complementarity.........: 2.8989134252665901e-09 2.8989134252665898e-0
6
Overall NLP error.......: 2.8989134252665901e-09 2.8989134252665898e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1583257e+02 2.00e+03 5.23e+01 -1.0 2.01e+03 - 1.20e-03 9.81e-0
3h 1
2 9.1195716e+02 2.00e+03 5.23e+01 -1.0 1.37e+03 - 4.87e-05 1.44e-0
4h 1
3 3.1303385e+02 1.95e+03 5.24e+01 -1.0 2.00e+03 - 6.04e-05 2.36e-0
2f 1
4 1.4608110e+04 6.65e-02 7.72e+01 -1.0 1.95e+03 - 6.92e-02 1.00e+0
0h 1
5 6.1485043e+03 6.09e-02 3.60e+01 -1.0 2.22e+01 - 5.08e-01 7.70e-0
2f 1
6 4.6744427e+03 1.15e-02 1.62e+01 -1.0 1.30e+01 - 6.04e-01 8.35e-0
1f 1
7 4.8737737e+03 2.78e-03 1.38e-01 -1.0 3.28e+00 - 9.92e-01 1.00e+0
0f 1
8 4.4144513e+03 1.77e-03 1.46e-01 -1.7 7.21e+00 - 1.00e+00 1.00e+0
0f 1
9 4.2301393e+03 2.01e-03 3.83e-01 -2.5 2.12e+00 - 1.00e+00 7.84e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2032538e+03 1.87e-04 1.95e-02 -2.5 4.41e-01 - 1.00e+00 9.81e-0
1f 1
11 4.1817214e+03 1.90e-06 1.87e-02 -3.8 5.38e+00 - 9.84e-01 1.00e+0
0h 1
12 4.1818471e+03 1.75e-09 4.85e-06 -3.8 6.74e-03 - 1.00e+00 1.00e+0
0h 1
13 4.1805081e+03 1.80e-08 1.81e-04 -5.7 2.97e-01 - 1.00e+00 9.96e-0
1f 1
14 4.1805057e+03 1.80e-12 2.29e-09 -5.7 1.19e-03 - 1.00e+00 1.00e+0
0f 1
15 4.1804892e+03 2.63e-12 1.52e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 4.1804891637420116e+00 4.1804891637420114e+0
3
Dual infeasibility......: 1.5189630643221733e-09 1.5189630643221733e-0
6
Constraint violation....: 2.6290775112514098e-12 2.6290775112514098e-1
2
Complementarity.........: 4.5369528820450276e-09 4.5369528820450273e-0
6
Overall NLP error.......: 4.5369528820450276e-09 4.5369528820450273e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2252293e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 3.31e-04 9.88e-0
3h 1
2 7.9742303e+02 9.17e+02 5.24e+01 -1.0 8.18e+02 - 9.71e-05 9.16e-0
4h 1
3 2.4312288e+02 8.97e+02 5.26e+01 -1.0 9.17e+02 - 9.08e-04 2.09e-0
2h 1
4 1.2260850e+04 5.54e-02 8.24e+01 -1.0 8.98e+02 - 3.89e-02 1.00e+0
0h 1
5 3.8743081e+03 5.28e-02 5.49e+01 -1.0 7.96e+01 - 3.31e-01 5.07e-0
2f 1
6 1.9080741e+03 3.72e-02 2.92e+01 -1.0 3.93e+01 - 4.71e-01 5.03e-0
1f 1
7 4.6563841e+03 1.22e-02 2.61e+01 -1.0 2.04e+01 - 4.03e-01 1.00e+0
0h 1
8 1.8744334e+03 1.17e-02 9.66e-01 -1.0 2.51e+01 - 9.88e-01 8.98e-0
1f 1
9 1.6954233e+03 5.10e-04 6.26e-02 -1.7 6.76e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5627878e+03 1.96e-03 2.19e-01 -2.5 1.25e+01 - 7.43e-01 1.00e+0
0f 1
11 1.5309769e+03 3.67e-03 1.04e-01 -2.5 2.12e+00 - 1.00e+00 9.19e-0
1h 1
12 1.5388648e+03 1.31e-04 3.49e-03 -2.5 1.16e+00 - 1.00e+00 1.00e+0
0h 1
13 1.5037418e+03 1.63e-04 2.17e-02 -3.8 1.88e+01 - 9.93e-01 9.32e-0
1h 1
14 1.5022722e+03 7.65e-07 7.15e-05 -3.8 1.24e+00 - 1.00e+00 1.00e+0
0f 1
15 1.5003196e+03 3.77e-07 1.78e-04 -5.7 1.04e+00 - 1.00e+00 9.96e-0
1h 1
16 1.5003172e+03 3.80e-11 2.94e-09 -5.7 1.11e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.29e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5002932818497319e+00 1.5002932818497318e+0
3
Dual infeasibility......: 2.1737076377304436e-09 2.1737076377304436e-0
6
Constraint violation....: 6.2995567096102434e-11 6.2995567096102434e-1
1
Complementarity.........: 2.8882173926668989e-09 2.8882173926668988e-0
6
Overall NLP error.......: 2.8882173926668989e-09 2.8882173926668988e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.28e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9792022e+02 4.09e+01 5.94e+01 -1.0 1.43e+01 - 6.99e-04 4.23e-0
2f 1
2 1.2226208e+04 6.07e-02 7.87e+01 -1.0 1.80e+01 - 7.07e-02 1.00e+0
0h 1
3 3.6198120e+03 5.54e-02 5.15e+01 -1.0 5.46e+01 - 3.33e-01 7.86e-0
2f 1
4 2.3518136e+03 2.93e-02 2.28e+01 -1.0 2.71e+01 - 5.45e-01 4.46e-0
1f 1
5 1.7557842e+03 8.50e-03 1.17e+00 -1.0 9.97e+00 - 9.27e-01 7.68e-0
1f 1
6 2.0288429e+03 3.41e-04 8.15e-02 -1.0 3.36e+00 - 1.00e+00 1.00e+0
0h 1
7 1.4017677e+03 2.08e-03 8.13e-02 -2.5 4.88e+00 - 8.66e-01 8.50e-0
1f 1
8 1.2221186e+03 2.16e-03 2.04e-01 -2.5 1.05e+00 - 1.00e+00 8.34e-0
1f 1
9 1.2056881e+03 8.29e-05 3.94e-03 -2.5 1.47e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1964862e+03 4.50e-05 1.20e+00 -3.8 9.56e-02 - 1.00e+00 4.86e-0
1h 1
11 1.1944260e+03 3.81e-07 1.16e-01 -3.8 4.16e-02 - 9.65e-01 1.00e+0
0f 1
12 1.1933751e+03 2.37e-08 2.01e-03 -3.8 3.32e-02 - 1.00e+00 1.00e+0
0H 1
13 1.1935802e+03 1.35e-05 3.08e-04 -3.8 4.28e-03 - 1.00e+00 1.00e+0
0f 1
14 1.1929524e+03 2.10e-06 6.04e-02 -5.7 1.24e-02 - 7.79e-01 9.70e-0
1h 1
15 1.1927877e+03 1.23e-05 2.01e-04 -5.7 5.02e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1927934e+03 2.14e-08 1.78e-06 -5.7 2.27e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1927802e+03 2.61e-08 2.54e-06 -8.6 2.38e-04 - 9.83e-01 9.85e-0
1h 1
18 1.1927801e+03 4.57e-13 3.48e-11 -8.6 2.60e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1927800696975466e+00 1.1927800696975467e+0
3
Dual infeasibility......: 3.4834174646090423e-11 3.4834174646090423e-0
8
Constraint violation....: 4.5652370772586437e-13 4.5652370772586437e-1
3
Complementarity.........: 2.5123551813284829e-09 2.5123551813284830e-0
6
Overall NLP error.......: 2.5123551813284829e-09 2.5123551813284830e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1582576e+02 1.09e+02 1.13e+02 -1.0 3.76e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1398370e+04 5.38e-02 8.36e+01 -1.0 4.53e+01 - 3.10e-02 1.00e+0
0h 1
3 2.7845901e+03 5.17e-02 6.49e+01 -1.0 8.43e+01 - 2.27e-01 4.32e-0
2f 1
4 9.8152882e+02 4.24e-02 3.38e+01 -1.0 3.41e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5906778e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.22e-01 1.00e+0
0h 1
6 9.4490441e+02 1.01e-02 8.72e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6264654e+02 4.59e-04 6.60e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536437e+02 1.94e-03 1.94e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379715e+02 3.25e-03 6.12e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140238e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388159e+02 1.57e-04 1.69e-02 -3.8 7.57e-01 - 9.93e-01 9.41e-0
1h 1
12 5.8370191e+02 7.28e-07 6.65e-05 -3.8 8.62e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278679e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.06e-09 -5.7 3.40e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148938161e-01 5.8277753148938154e+0
2
Dual infeasibility......: 2.0880115077257087e-09 2.0880115077257087e-0
6
Constraint violation....: 6.2994151561746037e-11 6.2994151561746037e-1
1
Complementarity.........: 2.8882094420357224e-09 2.8882094420357222e-0
6
Overall NLP error.......: 2.8882094420357224e-09 2.8882094420357222e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.78e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5000575e+02 7.50e+01 9.04e+01 -1.0 2.59e+01 - 3.83e-04 3.52e-0
2f 1
2 1.1818546e+04 5.63e-02 8.12e+01 -1.0 2.87e+01 - 4.64e-02 1.00e+0
0h 1
3 3.1583161e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.65e-0
2f 1
4 1.0154149e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8164779e+03 7.28e-03 1.55e+01 -1.0 1.92e+01 - 6.10e-01 1.00e+0
0h 1
6 1.1189268e+03 5.40e-03 4.04e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8232674e+02 9.97e-04 2.09e-01 -1.7 5.71e+00 - 1.00e+00 8.88e-0
1h 1
8 7.2806667e+02 8.48e-04 1.34e-02 -1.7 3.45e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0978200e+02 1.50e-03 1.13e-01 -3.8 4.49e+00 - 7.71e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8216668e+02 2.17e-03 7.27e-02 -3.8 2.11e+00 - 8.07e-01 7.39e-0
1h 1
11 5.8336969e+02 9.23e-05 4.64e-02 -3.8 3.15e-02 - 1.00e+00 9.57e-0
1h 1
12 5.8368715e+02 2.81e-07 1.30e-05 -3.8 3.37e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278926e+02 4.12e-07 5.35e-04 -5.7 3.47e-02 - 1.00e+00 9.91e-0
1h 1
14 5.8278859e+02 4.35e-11 3.51e-09 -5.7 2.16e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.65e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753111869779e-01 5.8277753111869777e+0
2
Dual infeasibility......: 2.6458545603625698e-09 2.6458545603625698e-0
6
Constraint violation....: 6.3001923122918413e-11 6.3001923122918413e-1
1
Complementarity.........: 2.8882674693030711e-09 2.8882674693030709e-0
6
Overall NLP error.......: 2.8882674693030711e-09 2.8882674693030709e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.28e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9792022e+02 4.09e+01 5.94e+01 -1.0 1.43e+01 - 6.99e-04 4.23e-0
2f 1
2 1.2226208e+04 6.07e-02 7.87e+01 -1.0 1.80e+01 - 7.07e-02 1.00e+0
0h 1
3 3.6198120e+03 5.54e-02 5.15e+01 -1.0 5.46e+01 - 3.33e-01 7.86e-0
2f 1
4 2.3518136e+03 2.93e-02 2.28e+01 -1.0 2.71e+01 - 5.45e-01 4.46e-0
1f 1
5 1.7557842e+03 8.50e-03 1.17e+00 -1.0 9.97e+00 - 9.27e-01 7.68e-0
1f 1
6 2.0288429e+03 3.41e-04 8.15e-02 -1.0 3.36e+00 - 1.00e+00 1.00e+0
0h 1
7 1.4017677e+03 2.08e-03 8.13e-02 -2.5 4.88e+00 - 8.66e-01 8.50e-0
1f 1
8 1.2221186e+03 2.16e-03 2.04e-01 -2.5 1.05e+00 - 1.00e+00 8.34e-0
1f 1
9 1.2056881e+03 8.29e-05 3.94e-03 -2.5 1.47e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1964862e+03 4.50e-05 1.20e+00 -3.8 9.56e-02 - 1.00e+00 4.86e-0
1h 1
11 1.1944260e+03 3.81e-07 1.16e-01 -3.8 4.16e-02 - 9.65e-01 1.00e+0
0f 1
12 1.1933751e+03 2.37e-08 2.01e-03 -3.8 3.32e-02 - 1.00e+00 1.00e+0
0H 1
13 1.1935802e+03 1.35e-05 3.08e-04 -3.8 4.28e-03 - 1.00e+00 1.00e+0
0f 1
14 1.1929524e+03 2.10e-06 6.04e-02 -5.7 1.24e-02 - 7.79e-01 9.70e-0
1h 1
15 1.1927877e+03 1.23e-05 2.01e-04 -5.7 5.02e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1927934e+03 2.14e-08 1.78e-06 -5.7 2.27e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1927802e+03 2.61e-08 2.54e-06 -8.6 2.38e-04 - 9.83e-01 9.85e-0
1h 1
18 1.1927801e+03 4.57e-13 3.48e-11 -8.6 2.60e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1927800696975466e+00 1.1927800696975467e+0
3
Dual infeasibility......: 3.4834174646090423e-11 3.4834174646090423e-0
8
Constraint violation....: 4.5652370772586437e-13 4.5652370772586437e-1
3
Complementarity.........: 2.5123551813284829e-09 2.5123551813284830e-0
6
Overall NLP error.......: 2.5123551813284829e-09 2.5123551813284830e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 40
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 20
inequality constraints with only lower bounds: 11
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2226548e+02 9.17e+02 5.24e+01 -1.0 9.19e+02 - 3.31e-04 9.89e-0
3h 1
2 7.9567419e+02 9.17e+02 5.24e+01 -1.0 8.24e+02 - 1.08e-04 9.71e-0
4h 1
3 2.4325600e+02 8.97e+02 5.26e+01 -1.0 9.17e+02 - 9.56e-04 2.09e-0
2h 1
4 1.2231736e+04 5.55e-02 8.38e+01 -1.0 8.98e+02 - 2.32e-02 1.00e+0
0h 1
5 3.9591307e+03 5.36e-02 6.86e+01 -1.0 8.19e+01 - 1.86e-01 3.68e-0
2f 1
6 1.9812308e+03 4.37e-02 3.67e+01 -1.0 3.39e+01 - 4.72e-01 5.47e-0
1f 1
7 2.6523735e+03 1.86e-02 2.12e+01 -1.0 1.93e+01 - 3.72e-01 2.50e-0
1f 3
8 1.9462783e+03 7.68e-03 4.04e-01 -1.0 1.01e+01 - 9.83e-01 1.00e+0
0f 1
9 1.6820695e+03 1.34e-03 2.81e-01 -1.7 4.79e+00 - 1.00e+00 8.75e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7931170e+03 9.77e-04 1.28e-02 -1.7 1.58e+02 - 1.00e+00 1.00e+0
0f 1
11 1.5500476e+03 1.17e-03 4.79e-02 -2.5 1.43e+02 - 9.21e-01 1.00e+0
0f 1
12 1.5343737e+03 1.24e-03 1.48e-02 -2.5 1.18e+00 - 1.00e+00 1.00e+0
0h 1
13 1.5061814e+03 2.17e-04 1.03e-01 -3.8 1.94e+01 - 1.00e+00 8.36e-0
1h 1
14 1.5022692e+03 4.11e-07 1.29e-04 -3.8 2.88e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5003178e+03 4.02e-07 1.62e-04 -5.7 1.04e+00 - 1.00e+00 9.97e-0
1h 1
16 1.5003172e+03 3.88e-11 2.93e-09 -5.7 4.57e-02 - 1.00e+00 1.00e+0
0f 1
17 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.29e-02 - 1.00e+00 1.00e+0
0h 1
1 8.6492449e+02 9.17e+02 5.24e+01 -1.0 9.19e+02 - 4.97e-04 9.89e-0
3h 1
2 8.3429719e+02 9.16e+02 5.24e+01 -1.0 8.37e+02 - 1.07e-04 1.13e-0
3h 1
3 2.6334808e+02 8.96e+02 5.25e+01 -1.0 9.16e+02 - 1.12e-03 2.18e-0
2h 1
4 1.2547951e+04 6.03e-02 8.25e+01 -1.0 8.97e+02 - 2.44e-02 1.00e+0
0h 1
5 4.4093479e+03 5.78e-02 6.61e+01 -1.0 6.99e+01 - 2.02e-01 3.77e-0
2f 1
6 2.4528855e+03 3.38e-02 3.55e+01 -1.0 3.12e+01 - 4.78e-01 6.14e-0
1f 1
91 1.547423e+04 1.632511e+04 6.792056e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 42
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 21
inequality constraints with only lower bounds: 12
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1147831e+02 1.57e+04 5.50e+01 -1.0 1.59e+04 - 1.75e-04 9.81e-0
3h 1
2 7.0782044e+02 1.57e+04 5.50e+01 -1.0 9.32e+03 - 1.54e-05 1.67e-0
4h 1
3 7.0396222e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 7.42e-05 3.12e-0
4h 1
4 6.8783170e+02 1.57e+04 5.49e+01 -1.0 1.57e+04 - 3.83e-04 1.37e-0
3h 1
5 5.0888341e+02 1.54e+04 5.39e+01 -1.0 1.57e+04 - 1.88e-03 1.90e-0
2f 1
6 2.5589326e+04 7.60e-02 8.67e+01 -1.0 1.54e+04 - 2.62e-02 1.00e+0
0h 1
7 1.7881759e+04 7.30e-02 7.02e+01 -1.0 6.67e+01 - 1.99e-01 4.15e-0
2f 1
8 1.6632189e+04 4.67e-02 3.22e+01 -1.0 2.01e+01 - 5.35e-01 3.78e-0
1f 1
9 1.7128256e+04 3.51e-02 2.03e+01 -1.0 1.33e+01 - 5.65e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6801505e+04 7.27e-03 2.07e+00 -1.0 1.84e+00 - 8.51e-01 1.00e+0
0f 1
11 1.6815876e+04 2.06e-04 1.74e+00 -1.0 3.38e+00 - 3.14e-01 1.00e+0
0f 1
12 1.6823750e+04 5.88e-06 7.50e-01 -1.0 3.16e+00 - 5.92e-01 1.00e+0
0f 1
13 1.6526500e+04 2.30e-04 3.36e-01 -1.7 4.73e+00 - 8.92e-01 8.07e-0
1f 1
14 1.6483307e+04 5.98e-04 3.36e-01 -1.7 1.30e+01 - 5.18e-01 1.00e+0
0f 1
15 1.6496443e+04 5.10e-05 7.37e-02 -1.7 2.27e+01 - 7.01e-01 1.00e+0
0f 1
16 1.6385673e+04 9.37e-04 5.00e-02 -2.5 1.54e+01 - 9.25e-01 1.00e+0
0f 1
17 1.6354813e+04 1.11e-03 1.20e-02 -2.5 1.16e+01 - 1.00e+00 1.00e+0
0h 1
18 1.6329060e+04 1.87e-04 8.46e-02 -3.8 1.58e+01 - 1.00e+00 8.54e-0
1h 1
19 1.6326779e+04 6.55e-07 1.01e-04 -3.8 1.36e+00 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325121e+04 3.99e-07 1.05e-04 -5.7 7.40e-01 - 1.00e+00 9.98e-0
1h 1
21 1.6325125e+04 3.81e-11 3.01e-09 -5.7 7.98e-03 - 1.00e+00 1.00e+0
0f 1
22 1.6325106e+04 5.63e-11 3.10e-05 -8.6 9.17e-03 - 1.00e+00 9.49e-0
1h 1
23 1.6325105e+04 1.61e-13 5.27e-12 -8.6 1.96e-04 - 1.00e+00 1.00e+0
0f 1
24 1.6325105e+04 1.42e-14 9.33e-15 -9.0 9.58e-06 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 24
(scaled) (unscaled)
Objective...............: 1.6325105264603092e+01 1.6325105264603091e+0
4
Dual infeasibility......: 9.3258734068513149e-15 9.3258734068513149e-1
2
Constraint violation....: 1.4210854715202004e-14 1.4210854715202004e-1
4
Complementarity.........: 1.1813085980192789e-09 1.1813085980192790e-0
6
Overall NLP error.......: 1.1813085980192789e-09 1.1813085980192790e-0
6
Number of objective function evaluations = 27
Number of objective gradient evaluations = 25
Number of equality constraint evaluations = 27
Number of inequality constraint evaluations = 27
Number of equality constraint Jacobian evaluations = 25
Number of inequality constraint Jacobian evaluations = 25
Number of Lagrangian Hessian evaluations = 24
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4809939e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 4.08e-04 9.80e-0
3h 1
2 8.4510420e+02 1.50e+04 5.24e+01 -1.0 1.28e+04 - 2.32e-05 1.16e-0
4h 1
3 8.4212613e+02 1.50e+04 5.24e+01 -1.0 1.49e+04 - 1.99e-05 2.28e-0
4h 1
4 8.1283141e+02 1.49e+04 5.24e+01 -1.0 1.50e+04 - 2.45e-04 2.28e-0
3h 1
5 5.8709389e+02 1.46e+04 5.25e+01 -1.0 1.49e+04 - 2.59e-03 2.10e-0
2f 1
6 2.5677060e+04 5.97e-02 8.13e+01 -1.0 1.46e+04 - 5.04e-02 1.00e+0
0h 1
7 1.8038996e+04 5.56e-02 4.85e+01 -1.0 7.27e+01 - 3.92e-01 6.19e-0
2f 1
8 1.5996844e+04 3.61e-02 2.50e+01 -1.0 4.16e+01 - 4.90e-01 5.30e-0
1f 1
9 1.6639169e+04 1.29e-02 2.92e+00 -1.0 1.77e+01 - 8.30e-01 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6156634e+04 4.32e-03 1.34e-01 -1.0 8.48e+00 - 9.59e-01 1.00e+0
0f 1
11 1.5786489e+04 1.12e-03 9.04e-01 -1.7 5.41e+00 - 4.16e-01 8.15e-0
1f 1
12 1.5766015e+04 1.19e-04 7.11e-01 -1.7 8.10e+00 - 6.48e-01 1.00e+0
0f 1
13 1.5753654e+04 8.54e-05 1.79e-01 -1.7 1.57e+01 - 6.72e-01 1.00e+0
0f 1
14 1.5631187e+04 7.74e-04 9.62e-02 -2.5 1.29e+01 - 8.92e-01 1.00e+0
0f 1
15 1.5595737e+04 1.63e-03 7.63e-03 -2.5 7.65e+00 - 1.00e+00 1.00e+0
0h 1
16 1.5579684e+04 5.90e-04 3.48e-01 -3.8 8.68e+00 - 1.00e+00 6.54e-0
1h 1
17 1.5575105e+04 2.50e-05 1.92e-01 -3.8 2.94e+00 - 8.12e-01 1.00e+0
0h 1
18 1.5574259e+04 6.99e-05 8.99e-04 -3.8 8.23e-03 - 1.00e+00 1.00e+0
0h 1
19 1.5572902e+04 1.37e-05 7.28e-03 -5.7 4.46e-01 - 9.16e-01 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5572847e+04 4.56e-07 1.57e-06 -5.7 7.26e-03 - 1.00e+00 1.00e+0
0f 1
21 1.5572829e+04 4.62e-09 3.82e-07 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0h 1
22 1.5572829e+04 1.42e-14 3.67e-14 -8.6 2.60e-07 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.5572828789763150e+01 1.5572828789763151e+0
4
Dual infeasibility......: 3.6700958578371234e-14 3.6700958578371234e-1
1
Constraint violation....: 1.4210854715202004e-14 1.4210854715202004e-1
4
Complementarity.........: 2.5276307271401575e-09 2.5276307271401576e-0
6
Overall NLP error.......: 2.5276307271401575e-09 2.5276307271401576e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0892329e+02 1.39e+04 5.23e+01 -1.0 1.40e+04 - 1.00e-03 9.80e-0
3h 1
2 9.0612191e+02 1.39e+04 5.23e+01 -1.0 1.31e+04 - 3.81e-05 1.05e-0
4h 1
3 8.9502977e+02 1.39e+04 5.23e+01 -1.0 1.39e+04 - 8.20e-06 8.19e-0
4f 1
4 8.7642566e+02 1.39e+04 5.23e+01 -1.0 1.39e+04 - 8.29e-04 1.42e-0
3h 1
5 6.1005619e+02 1.36e+04 5.23e+01 -1.0 1.39e+04 - 3.03e-03 2.26e-0
2f 1
6 2.4877986e+04 6.98e-02 7.72e+01 -1.0 1.36e+04 - 8.49e-02 1.00e+0
0h 1
7 1.7737001e+04 6.26e-02 3.38e+01 -1.0 2.70e+01 - 5.36e-01 9.41e-0
2f 1
8 1.6223334e+04 1.99e-02 1.23e+01 -1.0 1.51e+01 - 6.57e-01 7.72e-0
1f 1
9 1.6348138e+04 6.45e-03 9.96e-01 -1.0 2.81e+00 - 9.83e-01 5.00e-0
1f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6007477e+04 1.14e-02 2.39e-01 -1.7 4.61e+00 - 9.85e-01 8.28e-0
1f 1
11 1.5981815e+04 3.62e-03 9.94e-01 -1.7 1.87e+01 - 1.00e+00 4.68e-0
1h 2
12 1.5996235e+04 2.53e-04 2.12e-02 -1.7 2.35e+01 - 1.00e+00 1.00e+0
0h 1
13 1.5822611e+04 5.38e-04 2.72e-02 -3.8 3.84e+01 - 8.42e-01 8.23e-0
1f 1
14 1.5795467e+04 1.41e-04 7.70e-02 -3.8 4.94e+00 - 9.80e-01 8.41e-0
1h 1
15 1.5793410e+04 1.95e-07 9.41e-02 -3.8 3.82e-01 - 9.25e-01 1.00e+0
0h 1
16 1.5793339e+04 4.75e-09 2.88e-05 -3.8 6.88e-03 - 1.00e+00 1.00e+0
0h 1
17 1.5792167e+04 1.92e-08 3.89e-03 -5.7 1.50e-01 - 1.00e+00 9.68e-0
1f 1
18 1.5792137e+04 5.76e-12 2.63e-08 -5.7 3.97e-03 - 1.00e+00 1.00e+0
0f 1
19 1.5792122e+04 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.5792122218123614e+01 1.5792122218123613e+0
4
Dual infeasibility......: 4.4780430493627435e-09 4.4780430493627435e-0
6
Constraint violation....: 2.6337265701670276e-12 2.6337265701670276e-1
2
Complementarity.........: 3.6085483054799361e-09 3.6085483054799361e-0
6
Overall NLP error.......: 4.4780430493627435e-09 4.4780430493627435e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8072599e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.97e-04 9.80e-0
3h 1
2 8.7789674e+02 1.27e+04 5.24e+01 -1.0 1.20e+04 - 4.34e-05 1.05e-0
4h 1
3 8.3561363e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 8.17e-06 2.82e-0
3h 1
4 5.5734101e+02 1.23e+04 5.24e+01 -1.0 1.26e+04 - 3.08e-03 2.14e-0
2h 1
5 2.3596821e+04 6.41e-02 7.95e+01 -1.0 1.23e+04 - 6.27e-02 1.00e+0
0h 1
6 1.6062798e+04 5.90e-02 4.83e+01 -1.0 5.93e+01 - 3.77e-01 7.30e-0
2f 1
7 1.4705084e+04 3.09e-02 2.18e+01 -1.0 3.10e+01 - 5.36e-01 4.36e-0
1f 1
8 1.4067839e+04 7.81e-03 1.50e+00 -1.0 1.07e+01 - 9.23e-01 8.67e-0
1f 1
9 1.4407710e+04 1.93e-04 5.57e-02 -1.0 4.34e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3755607e+04 1.35e-03 1.22e-01 -2.5 5.99e+00 - 8.78e-01 8.25e-0
1f 1
11 1.3730291e+04 1.47e-05 1.77e-02 -2.5 6.44e-01 - 1.00e+00 1.00e+0
0h 1
12 1.3696042e+04 1.20e-03 3.58e-02 -3.8 5.36e+00 - 6.98e-01 1.00e+0
0f 1
13 1.3694116e+04 9.36e-04 1.70e-03 -3.8 3.36e-02 - 9.46e-01 1.00e+0
0h 1
14 1.3694240e+04 1.23e-04 1.25e-04 -3.8 1.60e-02 - 1.00e+00 1.00e+0
0h 1
15 1.3692881e+04 1.40e-04 1.17e-03 -5.7 2.97e-01 - 9.15e-01 1.00e+0
0h 1
16 1.3692836e+04 3.59e-05 7.65e-06 -5.7 8.83e-03 - 1.00e+00 1.00e+0
0h 1
17 1.3692841e+04 4.56e-07 4.84e-06 -5.7 9.77e-04 - 1.00e+00 1.00e+0
0h 1
18 1.3692826e+04 3.72e-08 4.96e-05 -8.6 3.68e-03 - 1.00e+00 9.48e-0
1h 1
19 1.3692826e+04 6.76e-12 6.77e-11 -8.6 1.92e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.3692825544493509e+01 1.3692825544493509e+0
4
Dual infeasibility......: 6.7734068567660118e-11 6.7734068567660118e-0
8
Constraint violation....: 6.7641447998312287e-12 6.7641447998312287e-1
2
Complementarity.........: 3.8646061181759460e-09 3.8646061181759463e-0
6
Overall NLP error.......: 3.8646061181759460e-09 3.8646061181759463e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2301164e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.51e-03 9.80e-0
3h 1
2 9.1989531e+02 1.11e+04 5.23e+01 -1.0 9.02e+03 - 1.92e-05 1.22e-0
4h 1
3 5.4989535e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 2.65e-05 2.25e-0
2h 1
4 2.1102391e+04 7.45e-02 7.98e+01 -1.0 1.09e+04 - 2.67e-02 1.00e+0
0h 1
5 1.5432119e+04 7.15e-02 5.55e+01 -1.0 2.13e+01 - 2.97e-01 3.84e-0
2f 1
6 1.4303809e+04 1.35e-02 2.41e+01 -1.0 1.11e+01 - 5.91e-01 7.46e-0
1f 1
7 1.4153596e+04 8.15e-03 2.49e-01 -1.0 1.97e+00 - 9.90e-01 1.00e+0
0f 1
8 1.3803442e+04 1.55e-03 5.75e-01 -1.7 4.96e+00 - 6.80e-01 1.00e+0
0f 1
9 1.3792211e+04 4.61e-04 7.72e-01 -1.7 1.21e+01 - 6.04e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3796327e+04 2.62e-05 1.87e-01 -1.7 1.78e+01 - 6.61e-01 1.00e+0
0h 1
11 1.3642462e+04 4.22e-04 2.05e-02 -2.5 1.82e+01 - 9.63e-01 9.36e-0
1f 1
12 1.3611258e+04 1.43e-04 1.99e-01 -3.8 1.75e+01 - 9.85e-01 7.17e-0
1h 1
13 1.3601755e+04 4.33e-07 3.35e-04 -3.8 5.25e+00 - 1.00e+00 1.00e+0
0h 1
14 1.3600269e+04 2.02e-08 4.25e-06 -5.7 4.47e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3600252e+04 8.38e-13 4.97e-10 -8.6 5.52e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.3600252152783153e+01 1.3600252152783152e+0
4
Dual infeasibility......: 4.9694383517688096e-10 4.9694383517688096e-0
7
Constraint violation....: 8.3813511686514630e-13 8.3813511686514630e-1
3
Complementarity.........: 3.6365834430978570e-09 3.6365834430978571e-0
6
Overall NLP error.......: 3.6365834430978570e-09 3.6365834430978571e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8775333e+02 9.19e+03 5.24e+01 -1.0 9.28e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8469544e+02 9.19e+03 5.24e+01 -1.0 7.80e+03 - 2.91e-05 1.17e-0
4h 1
3 6.6462207e+02 9.08e+03 5.24e+01 -1.0 9.19e+03 - 2.18e-05 1.20e-0
2h 1
4 5.9228739e+02 8.88e+03 5.19e+01 -1.0 9.08e+03 - 1.38e-02 2.17e-0
2h 1
5 1.7105310e+04 7.36e-02 7.74e+01 -1.0 8.88e+03 - 1.04e-01 1.00e+0
0h 1
6 1.2211573e+04 6.40e-02 2.02e+01 -1.0 4.24e+01 - 7.12e-01 1.21e-0
1f 1
7 1.0749761e+04 2.49e-02 1.83e+00 -1.0 2.14e+01 - 9.33e-01 6.71e-0
1f 1
8 1.0985588e+04 3.01e-03 1.48e+00 -1.0 4.35e+00 - 3.17e-01 1.00e+0
0f 1
9 1.1157030e+04 5.41e-04 9.72e-01 -1.0 6.23e+00 - 6.03e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.0496146e+04 1.73e-03 1.63e-01 -1.7 3.52e+00 - 9.08e-01 1.00e+0
0f 1
11 1.0362380e+04 1.13e-03 1.55e-01 -2.5 1.82e+00 - 8.75e-01 6.82e-0
1f 1
12 1.0363199e+04 1.27e-06 7.56e-03 -2.5 3.03e+00 - 1.00e+00 1.00e+0
0h 1
13 1.0339413e+04 3.93e-06 5.20e-02 -3.8 8.68e+00 - 9.52e-01 8.95e-0
1f 1
14 1.0335990e+04 5.64e-04 6.44e-04 -3.8 9.11e-01 - 1.00e+00 1.00e+0
0f 1
15 1.0334763e+04 4.93e-05 1.04e-02 -5.7 4.46e-01 - 8.36e-01 1.00e+0
0h 1
16 1.0334652e+04 3.29e-05 3.59e-05 -5.7 9.25e-03 - 1.00e+00 1.00e+0
0h 1
17 1.0334655e+04 5.88e-07 6.21e-06 -5.7 1.16e-03 - 1.00e+00 1.00e+0
0h 1
18 1.0334639e+04 4.06e-08 8.23e-05 -8.6 5.53e-03 - 1.00e+00 9.43e-0
1h 1
19 1.0334638e+04 7.68e-12 7.01e-11 -8.6 3.17e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.0334637968329469e+01 1.0334637968329469e+0
4
Dual infeasibility......: 7.0084807793306656e-11 7.0084807793306650e-0
8
Constraint violation....: 7.6793016390297453e-12 7.6793016390297453e-1
2
Complementarity.........: 3.7638594207063206e-09 3.7638594207063207e-0
6
Overall NLP error.......: 3.7638594207063206e-09 3.7638594207063207e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2299660e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1994562e+02 6.71e+03 5.23e+01 -1.0 5.82e+03 - 3.44e-05 1.14e-0
4h 1
3 7.2851012e+02 6.64e+03 5.23e+01 -1.0 6.70e+03 - 1.95e-05 9.17e-0
3f 1
4 4.9339535e+02 6.50e+03 5.19e+01 -1.0 6.64e+03 - 1.16e-02 2.10e-0
2h 1
5 1.5628524e+04 8.10e-02 7.81e+01 -1.0 6.50e+03 - 8.90e-02 1.00e+0
0h 1
6 1.0636045e+04 7.19e-02 2.13e+01 -1.0 1.24e+01 - 7.05e-01 1.06e-0
1f 1
7 9.4596868e+03 2.23e-02 3.10e+00 -1.0 9.08e+00 - 8.57e-01 8.74e-0
1f 1
8 9.7561578e+03 1.77e-02 4.67e-01 -1.0 2.44e+00 - 8.53e-01 9.15e-0
1f 1
9 9.3826748e+03 3.12e-03 6.31e-01 -1.7 2.16e+00 - 6.51e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.3481497e+03 4.55e-04 6.16e-01 -1.7 5.27e+00 - 6.35e-01 1.00e+0
0h 1
11 9.3655222e+03 4.05e-05 2.10e-01 -1.7 9.83e+00 - 7.32e-01 1.00e+0
0h 1
12 9.3762714e+03 1.96e-07 3.95e-03 -1.7 1.33e+01 - 9.74e-01 1.00e+0
0h 1
13 9.2105120e+03 4.47e-04 2.16e-02 -2.5 2.65e+01 - 9.76e-01 9.62e-0
1f 1
14 9.1895649e+03 1.38e-04 1.97e-01 -3.8 6.71e+00 - 9.91e-01 7.27e-0
1h 1
15 9.1841539e+03 3.47e-07 2.87e-04 -3.8 1.83e+00 - 1.00e+00 1.00e+0
0h 1
16 9.1828157e+03 1.96e-08 4.45e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
17 9.1828008e+03 7.82e-13 4.77e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 9.1828007851167257e+00 9.1828007851167258e+0
3
Dual infeasibility......: 4.7672848330398076e-10 4.7672848330398076e-0
7
Constraint violation....: 7.8156925376049458e-13 7.8156925376049458e-1
3
Complementarity.........: 3.5992257450745734e-09 3.5992257450745735e-0
6
Overall NLP error.......: 3.5992257450745734e-09 3.5992257450745735e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3000909e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 2.02e-03 9.81e-0
3h 1
2 9.2540939e+02 4.77e+03 5.23e+01 -1.0 2.66e+03 - 1.91e-05 1.78e-0
4h 1
3 3.8379504e+02 4.66e+03 5.24e+01 -1.0 4.77e+03 - 8.68e-05 2.34e-0
2f 1
4 1.7424477e+04 7.01e-02 7.87e+01 -1.0 4.66e+03 - 5.08e-02 1.00e+0
0h 1
5 9.2441130e+03 6.55e-02 5.13e+01 -1.0 1.16e+01 - 3.39e-01 6.13e-0
2f 1
6 7.9204820e+03 2.27e-02 2.21e+01 -1.0 7.02e+00 - 6.27e-01 9.88e-0
1f 1
7 8.2927286e+03 2.17e-03 1.90e-01 -1.0 2.55e+00 - 9.91e-01 1.00e+0
0f 1
8 7.7707445e+03 1.76e-03 6.99e-02 -1.7 6.35e+00 - 1.00e+00 9.92e-0
1f 1
9 7.5980722e+03 1.95e-03 3.69e-01 -2.5 1.67e+00 - 1.00e+00 7.91e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.5727496e+03 1.82e-04 4.79e-02 -2.5 3.44e-01 - 1.00e+00 9.36e-0
1h 1
11 7.5754877e+03 7.05e-06 1.34e-03 -2.5 2.21e-02 - 1.00e+00 1.00e+0
0f 1
12 7.5482488e+03 7.66e-06 4.23e-03 -3.8 8.04e+00 - 1.00e+00 9.79e-0
1f 1
13 7.5480543e+03 1.37e-08 6.27e-06 -3.8 1.66e-01 - 1.00e+00 1.00e+0
0f 1
14 7.5465649e+03 1.73e-08 3.04e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0f 1
15 7.5465477e+03 1.28e-12 4.22e-10 -8.6 5.52e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 7.5465477417982454e+00 7.5465477417982456e+0
3
Dual infeasibility......: 4.2179949817735982e-10 4.2179949817735982e-0
7
Constraint violation....: 1.2798095916366492e-12 1.2798095916366492e-1
2
Complementarity.........: 3.0351238856025936e-09 3.0351238856025937e-0
6
Overall NLP error.......: 3.0351238856025936e-09 3.0351238856025937e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2291184e+02 3.24e+03 5.23e+01 -1.0 3.27e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1824882e+02 3.24e+03 5.23e+01 -1.0 1.80e+03 - 2.80e-05 1.78e-0
4h 1
3 3.4580800e+02 3.17e+03 5.24e+01 -1.0 3.24e+03 - 9.12e-05 2.35e-0
2f 1
4 1.5889383e+04 6.81e-02 7.83e+01 -1.0 3.17e+03 - 5.42e-02 1.00e+0
0h 1
5 7.5694720e+03 6.34e-02 4.88e+01 -1.0 1.73e+01 - 3.65e-01 6.40e-0
2f 1
6 6.2120976e+03 1.27e-02 2.15e+01 -1.0 9.82e+00 - 6.05e-01 8.68e-0
1f 1
7 6.3908340e+03 3.81e-03 1.94e-01 -1.0 2.40e+00 - 9.91e-01 1.00e+0
0f 1
8 5.9352879e+03 1.50e-03 8.74e-02 -1.7 6.25e+00 - 1.00e+00 1.00e+0
0f 1
9 5.7758915e+03 1.91e-03 4.70e-01 -2.5 1.74e+00 - 1.00e+00 7.62e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.7472957e+03 2.95e-04 8.78e-02 -2.5 4.06e-01 - 1.00e+00 9.05e-0
1h 1
11 5.7505454e+03 1.10e-05 3.63e-03 -2.5 3.87e-02 - 1.00e+00 1.00e+0
0f 1
12 5.7231763e+03 1.03e-05 8.91e-03 -3.8 8.05e+00 - 1.00e+00 9.59e-0
1f 1
13 5.7225084e+03 1.56e-08 1.41e-05 -3.8 3.28e-01 - 1.00e+00 1.00e+0
0f 1
14 5.7210166e+03 1.79e-08 5.06e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0f 1
15 5.7210000e+03 6.40e-13 4.11e-10 -8.6 5.51e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.7210000437925084e+00 5.7210000437925082e+0
3
Dual infeasibility......: 4.1136442791232290e-10 4.1136442791232290e-0
7
Constraint violation....: 6.4037664060379029e-13 6.4037664060379029e-1
3
Complementarity.........: 3.7083905490831034e-09 3.7083905490831035e-0
6
Overall NLP error.......: 3.7083905490831034e-09 3.7083905490831035e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8055761e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.81e-0
3f 1
2 8.7686982e+02 2.00e+03 5.24e+01 -1.0 1.46e+03 - 5.63e-05 1.36e-0
4h 1
3 2.9368501e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 5.20e-05 2.28e-0
2f 1
4 1.4297701e+04 6.09e-02 7.94e+01 -1.0 1.95e+03 - 5.25e-02 1.00e+0
0h 1
5 5.5715643e+03 5.67e-02 5.36e+01 -1.0 6.49e+01 - 3.13e-01 6.17e-0
2f 1
6 4.1854190e+03 3.04e-02 2.68e+01 -1.0 3.22e+01 - 4.92e-01 4.30e-0
1f 1
7 3.3694030e+03 1.34e-02 2.18e+00 -1.0 1.10e+01 - 9.20e-01 9.27e-0
1f 1
8 3.8356226e+03 4.21e-04 1.06e-01 -1.0 4.99e+00 - 9.97e-01 1.00e+0
0f 1
9 3.1447999e+03 1.17e-03 1.26e+00 -1.7 3.04e+01 - 3.11e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.1748466e+03 5.76e-06 1.09e-02 -1.7 6.18e+00 - 1.00e+00 1.00e+0
0h 1
11 3.0759625e+03 2.23e-05 6.49e-01 -3.8 3.94e+01 - 9.61e-01 6.88e-0
1f 1
12 3.0448515e+03 3.85e-04 1.56e-01 -3.8 1.20e+01 - 7.02e-01 1.00e+0
0f 1
13 3.0404029e+03 2.51e-03 5.41e-03 -3.8 6.46e-02 - 1.00e+00 1.00e+0
0h 1
14 3.0406402e+03 2.47e-05 9.80e-05 -3.8 7.49e-03 - 1.00e+00 1.00e+0
0h 1
15 3.0392709e+03 1.33e-04 1.15e-03 -5.7 2.97e-01 - 9.17e-01 1.00e+0
0h 1
16 3.0392294e+03 3.22e-05 7.02e-06 -5.7 8.37e-03 - 1.00e+00 1.00e+0
0h 1
17 3.0392340e+03 2.82e-07 3.66e-06 -5.7 7.66e-04 - 1.00e+00 1.00e+0
0h 1
18 3.0392190e+03 3.09e-08 3.60e-05 -8.6 3.68e-03 - 1.00e+00 9.55e-0
1h 1
19 3.0392184e+03 4.84e-12 5.59e-11 -8.6 1.65e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 3.0392183954990024e+00 3.0392183954990023e+0
3
Dual infeasibility......: 5.5911620842890681e-11 5.5911620842890681e-0
8
Constraint violation....: 4.8357984283597943e-12 4.8357984283597943e-1
2
Complementarity.........: 4.0173300482050923e-09 4.0173300482050923e-0
6
Overall NLP error.......: 4.0173300482050923e-09 4.0173300482050923e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 40
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 20
inequality constraints with only lower bounds: 11
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0758349e+02 9.17e+02 5.23e+01 -1.0 9.19e+02 - 1.00e-03 9.89e-0
3h 1
2 8.4617295e+02 9.15e+02 5.23e+01 -1.0 8.78e+02 - 1.02e-04 2.31e-0
3h 1
3 2.8751312e+02 8.95e+02 5.24e+01 -1.0 9.15e+02 - 2.28e-03 2.22e-0
2h 1
4 1.2486634e+04 6.79e-02 8.17e+01 -1.0 8.95e+02 - 2.60e-02 1.00e+0
0h 1
5 4.9765295e+03 6.50e-02 6.33e+01 -1.0 3.72e+01 - 2.27e-01 4.01e-0
2f 1
6 3.7336080e+03 2.08e-02 2.89e+01 -1.0 1.61e+01 - 5.52e-01 6.24e-0
1f 1
7 3.3250774e+03 5.40e-03 9.21e-01 -1.0 5.10e+00 - 9.59e-01 7.92e-0
1f 1
8 3.5944327e+03 1.44e-04 6.23e-02 -1.0 5.57e+00 - 9.89e-01 1.00e+0
0f 1
9 3.0318490e+03 2.13e-03 8.15e-02 -2.5 8.71e+00 - 8.55e-01 8.49e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8754356e+03 2.16e-03 4.17e-01 -2.5 6.13e+00 - 1.00e+00 7.62e-0
1f 1
11 2.8519379e+03 1.25e-04 4.71e-03 -2.5 2.22e+00 - 1.00e+00 1.00e+0
0h 1
12 2.8223386e+03 3.34e-05 1.46e-01 -3.8 1.94e+01 - 1.00e+00 7.61e-0
1h 1
13 2.8145156e+03 1.25e-07 3.39e-04 -3.8 4.33e+00 - 1.00e+00 1.00e+0
0f 1
14 2.8124145e+03 2.85e-08 9.86e-04 -5.7 1.03e+00 - 1.00e+00 9.85e-0
1f 1
15 2.8123895e+03 1.91e-12 1.39e-08 -5.7 1.43e-02 - 1.00e+00 1.00e+0
0f 1
16 2.8123637e+03 2.63e-12 4.48e-09 -8.6 1.29e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 2.8123637143774340e+00 2.8123637143774340e+0
3
Dual infeasibility......: 4.4776951829775404e-09 4.4776951829775404e-0
6
Constraint violation....: 2.6309024403481374e-12 2.6309024403481374e-1
2
Complementarity.........: 3.6084979195493859e-09 3.6084979195493856e-0
6
Overall NLP error.......: 4.4776951829775404e-09 4.4776951829775404e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.03e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 6.36e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643333e+00 1.6104063281643332e+0
3
Dual infeasibility......: 2.4574921368567062e-12 2.4574921368567062e-0
9
Constraint violation....: 6.3603173025546602e-15 6.3603173025546602e-1
5
Complementarity.........: 2.5062163910047551e-09 2.5062163910047549e-0
6
Overall NLP error.......: 2.5062163910047551e-09 2.5062163910047549e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031320943025915e-09 2.1031320943025915e-0
6
Constraint violation....: 6.2994179317321652e-11 6.2994179317321652e-1
1
Complementarity.........: 2.8882108896920311e-09 2.8882108896920312e-0
6
Overall NLP error.......: 2.8882108896920311e-09 2.8882108896920312e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254210146e-01 6.4890146254210140e+0
2
Dual infeasibility......: 4.9126604805803652e-09 4.9126604805803652e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646095252488380e-09 4.3646095252488382e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126604805803652e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.03e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 6.36e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643333e+00 1.6104063281643332e+0
3
Dual infeasibility......: 2.4574921368567062e-12 2.4574921368567062e-0
9
Constraint violation....: 6.3603173025546602e-15 6.3603173025546602e-1
5
Complementarity.........: 2.5062163910047551e-09 2.5062163910047549e-0
6
Overall NLP error.......: 2.5062163910047551e-09 2.5062163910047549e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2329662e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 3.31e-04 9.85e-0
3h 1
2 8.1338739e+02 9.17e+02 5.24e+01 -1.0 6.65e+02 - 7.53e-05 3.59e-0
4h 1
3 2.4215012e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 3.16e-04 2.12e-0
2f 1
4 1.2572829e+04 5.49e-02 8.23e+01 -1.0 8.98e+02 - 3.81e-02 1.00e+0
0h 1
5 3.9012337e+03 5.24e-02 5.73e+01 -1.0 8.21e+01 - 3.02e-01 4.95e-0
2f 1
6 1.9122630e+03 3.74e-02 3.08e+01 -1.0 3.92e+01 - 4.67e-01 5.07e-0
1f 1
7 4.6985285e+03 1.23e-02 2.74e+01 -1.0 2.08e+01 - 3.98e-01 1.00e+0
0h 1
8 1.8769618e+03 1.22e-02 1.07e+00 -1.0 2.57e+01 - 9.87e-01 8.88e-0
1f 1
9 1.9956227e+03 2.03e-04 4.84e-02 -1.0 2.76e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7291248e+03 2.21e-04 1.23e+00 -2.5 1.88e+01 - 9.37e-01 5.95e-0
1f 1
11 1.5409848e+03 3.77e-03 1.32e-01 -2.5 7.58e+00 - 7.96e-01 1.00e+0
0f 1
12 1.5181170e+03 5.06e-03 3.08e-01 -2.5 1.81e+00 - 1.00e+00 7.68e-0
1h 1
13 1.5303991e+03 2.38e-04 4.69e-03 -2.5 7.19e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5028095e+03 1.70e-04 2.15e-02 -3.8 1.08e+01 - 9.90e-01 9.29e-0
1h 1
15 1.5018205e+03 7.26e-07 6.85e-05 -3.8 7.35e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003124e+03 3.77e-07 1.78e-04 -5.7 5.94e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003117e+03 3.79e-11 2.92e-09 -5.7 4.21e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0h 1
1 8.6577131e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 4.97e-04 9.85e-0
3h 1
2 8.5529111e+02 9.17e+02 5.24e+01 -1.0 6.82e+02 - 7.34e-05 3.86e-0
4h 1
3 2.6219590e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 3.43e-04 2.22e-0
2f 1
4 1.2935511e+04 5.94e-02 8.01e+01 -1.0 8.97e+02 - 4.97e-02 1.00e+0
0h 1
5 4.2970559e+03 5.55e-02 5.39e+01 -1.0 7.40e+01 - 3.17e-01 5.94e-0
2f 1
92 2.001809e+04 1.632511e+04 6.848040e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 44
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 22
inequality constraints with only lower bounds: 13
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2429861e+02 1.57e+04 5.24e+01 -1.0 1.59e+04 - 3.31e-04 9.81e-0
3h 1
2 8.2016552e+02 1.57e+04 5.24e+01 -1.0 8.17e+03 - 1.33e-05 2.06e-0
4h 1
3 8.1638683e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 1.13e-04 3.05e-0
4h 1
4 7.9905848e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 4.14e-04 1.44e-0
3h 1
5 5.8196706e+02 1.54e+04 5.26e+01 -1.0 1.57e+04 - 2.01e-03 2.09e-0
2f 1
6 2.6354660e+04 5.69e-02 8.26e+01 -1.0 1.54e+04 - 4.12e-02 1.00e+0
0h 1
7 1.8632204e+04 5.37e-02 4.83e+01 -1.0 7.40e+01 - 4.10e-01 5.37e-0
2f 1
8 1.6720958e+04 3.66e-02 2.49e+01 -1.0 3.95e+01 - 4.86e-01 4.96e-0
1f 1
9 1.7302973e+04 2.05e-02 1.68e+01 -1.0 1.69e+01 - 4.59e-01 2.50e-0
1f 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6832322e+04 6.23e-03 1.12e+00 -1.0 6.13e+00 - 9.18e-01 1.00e+0
0f 1
11 1.6852516e+04 1.20e-04 1.75e+00 -1.0 3.61e+00 - 2.18e-01 1.00e+0
0f 1
12 1.6858914e+04 4.04e-06 7.12e-01 -1.0 4.71e+00 - 6.00e-01 1.00e+0
0f 1
13 1.6550594e+04 2.51e-04 4.23e-01 -1.7 5.29e+00 - 8.95e-01 7.67e-0
1f 1
14 1.6501113e+04 6.33e-04 3.79e-01 -1.7 1.96e+01 - 5.18e-01 1.00e+0
0f 1
15 1.6521482e+04 6.68e-05 7.52e-02 -1.7 3.18e+01 - 7.43e-01 1.00e+0
0h 1
16 1.6384400e+04 1.06e-03 6.47e-02 -2.5 3.55e+01 - 9.09e-01 1.00e+0
0f 1
17 1.6354000e+04 1.32e-03 1.49e-02 -2.5 1.14e+01 - 1.00e+00 1.00e+0
0h 1
18 1.6329261e+04 2.37e-04 1.07e-01 -3.8 1.55e+01 - 1.00e+00 8.33e-0
1h 1
19 1.6326776e+04 5.29e-07 1.27e-04 -3.8 1.44e+00 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325122e+04 4.01e-07 1.61e-04 -5.7 7.39e-01 - 1.00e+00 9.97e-0
1h 1
21 1.6325125e+04 3.87e-11 2.92e-09 -5.7 2.83e-03 - 1.00e+00 1.00e+0
0f 1
22 1.6325106e+04 5.63e-11 3.29e-05 -8.6 9.17e-03 - 1.00e+00 9.49e-0
1h 1
23 1.6325105e+04 1.62e-13 5.62e-12 -8.6 4.90e-04 - 1.00e+00 1.00e+0
0f 1
24 1.6325105e+04 1.42e-14 9.33e-15 -9.0 9.60e-06 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 24
(scaled) (unscaled)
Objective...............: 1.6325105264604236e+01 1.6325105264604235e+0
4
Dual infeasibility......: 9.3258734068513149e-15 9.3258734068513149e-1
2
Constraint violation....: 1.4210854715202004e-14 1.4210854715202004e-1
4
Complementarity.........: 1.1824471027244766e-09 1.1824471027244767e-0
6
Overall NLP error.......: 1.1824471027244766e-09 1.1824471027244767e-0
6
Number of objective function evaluations = 27
Number of objective gradient evaluations = 25
Number of equality constraint evaluations = 27
Number of inequality constraint evaluations = 27
Number of equality constraint Jacobian evaluations = 25
Number of inequality constraint Jacobian evaluations = 25
Number of Lagrangian Hessian evaluations = 24
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9224816e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.64e-04 9.80e-0
3f 1
2 7.8937410e+02 1.50e+04 5.25e+01 -1.0 1.43e+04 - 4.77e-05 1.03e-0
4h 1
3 7.6212825e+02 1.49e+04 5.25e+01 -1.0 1.50e+04 - 6.41e-06 2.04e-0
3h 1
4 5.3984722e+02 1.46e+04 5.26e+01 -1.0 1.49e+04 - 2.18e-03 1.99e-0
2h 1
5 2.5455608e+04 5.52e-02 8.40e+01 -1.0 1.46e+04 - 3.38e-02 1.00e+0
0h 1
6 1.7638238e+04 5.28e-02 5.91e+01 -1.0 7.41e+01 - 2.99e-01 4.73e-0
2f 1
7 1.5941286e+04 4.32e-02 2.96e+01 -1.0 3.32e+01 - 4.96e-01 4.58e-0
1f 1
8 1.6249196e+04 2.75e-02 1.22e+01 -1.0 1.73e+01 - 4.44e-01 1.25e-0
1f 4
9 1.6019715e+04 5.99e-03 1.39e-01 -1.0 4.73e+00 - 9.92e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5736488e+04 1.19e-03 2.79e-01 -1.7 6.95e+00 - 1.00e+00 8.67e-0
1f 1
11 1.5729153e+04 7.31e-04 1.17e-02 -1.7 3.35e+01 - 1.00e+00 1.00e+0
0f 1
12 1.5585647e+04 1.33e-03 8.98e-02 -3.8 3.98e+01 - 7.98e-01 9.32e-0
1f 1
13 1.5560356e+04 1.48e-03 6.31e-02 -3.8 2.68e+00 - 8.48e-01 7.73e-0
1h 1
14 1.5560317e+04 2.66e-06 7.39e-04 -3.8 6.07e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5559225e+04 3.17e-07 6.04e-04 -5.7 2.97e-01 - 1.00e+00 9.89e-0
1h 1
16 1.5559217e+04 3.94e-11 6.15e-09 -5.7 2.32e-02 - 1.00e+00 1.00e+0
0f 1
17 1.5559202e+04 6.30e-11 2.09e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5559202162890337e+01 1.5559202162890337e+0
4
Dual infeasibility......: 2.0878360549464707e-09 2.0878360549464707e-0
6
Constraint violation....: 6.2996274863280632e-11 6.2996274863280632e-1
1
Complementarity.........: 2.9281216516978917e-09 2.9281216516978919e-0
6
Overall NLP error.......: 2.9281216516978917e-09 2.9281216516978919e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4131463e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.82e-04 9.80e-0
3f 1
2 8.3850785e+02 1.39e+04 5.24e+01 -1.0 1.37e+04 - 9.31e-05 1.01e-0
4h 1
3 8.2946357e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 3.09e-06 6.40e-0
4f 1
4 5.3685000e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 6.88e-04 2.14e-0
2h 1
5 2.5500267e+04 5.69e-02 8.14e+01 -1.0 1.36e+04 - 4.41e-02 1.00e+0
0h 1
6 1.7000455e+04 5.35e-02 5.24e+01 -1.0 8.00e+01 - 3.49e-01 5.49e-0
2f 1
7 1.4904715e+04 3.41e-02 2.85e+01 -1.0 4.20e+01 - 4.65e-01 5.29e-0
1f 1
8 1.5414569e+04 1.86e-02 1.01e+01 -1.0 1.88e+01 - 5.31e-01 2.50e-0
1f 3
9 1.5062439e+04 5.22e-03 5.79e-01 -1.0 5.33e+00 - 9.56e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4707716e+04 1.45e-03 5.03e-01 -1.7 6.89e+00 - 1.00e+00 7.90e-0
1f 1
11 1.4643191e+04 8.54e-04 2.32e-02 -1.7 1.85e+01 - 1.00e+00 1.00e+0
0f 1
12 1.4507924e+04 1.50e-03 1.05e-01 -3.8 1.99e+01 - 7.70e-01 9.15e-0
1f 1
13 1.4479921e+04 2.20e-03 1.07e-01 -3.8 2.07e+00 - 8.23e-01 7.29e-0
1h 1
14 1.4480893e+04 2.86e-05 8.99e-03 -3.8 4.50e-01 - 1.00e+00 9.92e-0
1h 1
15 1.4481112e+04 2.92e-07 3.33e-06 -3.8 4.43e-02 - 1.00e+00 1.00e+0
0f 1
16 1.4480067e+04 4.13e-07 5.17e-04 -5.7 1.49e-01 - 1.00e+00 9.92e-0
1h 1
17 1.4480065e+04 4.35e-11 3.44e-09 -5.7 4.65e-03 - 1.00e+00 1.00e+0
0f 1
18 1.4480052e+04 6.30e-11 2.62e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.4480051788929215e+01 1.4480051788929215e+0
4
Dual infeasibility......: 2.6181243457040869e-09 2.6181243457040869e-0
6
Constraint violation....: 6.3001728833889103e-11 6.3001728833889103e-1
1
Complementarity.........: 2.8882631020385278e-09 2.8882631020385279e-0
6
Overall NLP error.......: 2.8882631020385278e-09 2.8882631020385279e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4271671e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.87e-04 9.80e-0
3h 1
2 8.3976037e+02 1.27e+04 5.24e+01 -1.0 1.14e+04 - 3.12e-05 1.10e-0
4h 1
3 7.3611973e+02 1.26e+04 5.25e+01 -1.0 1.26e+04 - 1.43e-05 6.74e-0
3h 1
4 5.8054338e+02 1.23e+04 5.23e+01 -1.0 1.26e+04 - 7.35e-03 2.01e-0
2h 1
5 2.1632573e+04 6.27e-02 8.14e+01 -1.0 1.23e+04 - 6.00e-02 1.00e+0
0h 1
6 1.5457998e+04 5.77e-02 3.39e+01 -1.0 6.34e+01 - 5.66e-01 7.44e-0
2f 1
7 1.3638656e+04 3.62e-02 1.32e+01 -1.0 3.97e+01 - 5.99e-01 5.07e-0
1f 1
8 1.4320350e+04 4.35e-03 6.60e-01 -1.0 8.15e+00 - 9.67e-01 1.00e+0
0f 1
9 1.3445101e+04 1.84e-03 1.03e-01 -1.7 1.16e+01 - 9.58e-01 9.32e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3305160e+04 1.34e-03 3.65e-01 -2.5 6.03e+00 - 7.74e-01 1.00e+0
0h 1
11 1.3247431e+04 1.41e-02 8.56e-02 -2.5 3.80e+00 - 9.36e-01 8.67e-0
1h 1
12 1.3260577e+04 4.37e-04 1.27e-02 -2.5 7.17e-01 - 1.00e+00 1.00e+0
0h 1
13 1.3235786e+04 2.49e-04 4.42e-02 -3.8 8.03e+00 - 9.97e-01 8.95e-0
1h 1
14 1.3234428e+04 7.49e-07 7.88e-05 -3.8 8.44e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3233072e+04 3.64e-07 5.62e-04 -5.7 4.46e-01 - 1.00e+00 9.91e-0
1h 1
16 1.3233068e+04 3.86e-11 3.78e-09 -5.7 3.67e-02 - 1.00e+00 1.00e+0
0f 1
17 1.3233051e+04 6.30e-11 2.82e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.3233050940096650e+01 1.3233050940096649e+0
4
Dual infeasibility......: 2.8205504027756061e-09 2.8205504027756061e-0
6
Constraint violation....: 6.3006058703685142e-11 6.3006058703685142e-1
1
Complementarity.........: 3.5073685724379661e-09 3.5073685724379660e-0
6
Overall NLP error.......: 3.5073685724379661e-09 3.5073685724379660e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2100405e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.40e-03 9.80e-0
3h 1
2 9.1812992e+02 1.11e+04 5.23e+01 -1.0 1.02e+04 - 3.38e-05 1.08e-0
4h 1
3 8.3752269e+02 1.11e+04 5.23e+01 -1.0 1.11e+04 - 1.14e-05 4.91e-0
3h 1
4 5.6835928e+02 1.08e+04 5.22e+01 -1.0 1.11e+04 - 5.58e-03 2.14e-0
2h 1
5 2.1633052e+04 7.44e-02 7.75e+01 -1.0 1.08e+04 - 8.37e-02 1.00e+0
0h 1
6 1.5181467e+04 6.67e-02 2.24e+01 -1.0 1.46e+01 - 6.82e-01 9.51e-0
2f 1
7 1.3897731e+04 1.74e-02 7.25e+00 -1.0 1.05e+01 - 7.11e-01 8.47e-0
1f 1
8 1.4018238e+04 9.35e-03 7.06e-01 -1.0 2.72e+00 - 9.91e-01 4.69e-0
1f 2
9 1.3721877e+04 1.14e-02 1.04e+00 -1.7 1.17e+01 - 2.25e-01 8.16e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3717171e+04 6.03e-04 6.70e-01 -1.7 1.05e+01 - 7.41e-01 1.00e+0
0f 1
11 1.3712992e+04 1.38e-04 2.85e-03 -1.7 1.31e+01 - 1.00e+00 1.00e+0
0h 1
12 1.3541670e+04 5.80e-04 2.39e-02 -2.5 2.82e+01 - 9.70e-01 9.75e-0
1f 1
13 1.3522646e+04 1.91e-04 2.27e-01 -3.8 6.03e+00 - 9.89e-01 6.99e-0
1h 1
14 1.3517407e+04 4.03e-07 4.93e-04 -3.8 1.82e+00 - 1.00e+00 1.00e+0
0h 1
15 1.3516066e+04 2.07e-08 4.22e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
16 1.3516051e+04 8.38e-13 5.77e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.3516051278023959e+01 1.3516051278023959e+0
4
Dual infeasibility......: 5.7680979365387172e-10 5.7680979365387172e-0
7
Constraint violation....: 8.3791307226022127e-13 8.3791307226022127e-1
3
Complementarity.........: 4.4983147392923226e-09 4.4983147392923221e-0
6
Overall NLP error.......: 4.4983147392923226e-09 4.4983147392923221e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8775333e+02 9.19e+03 5.24e+01 -1.0 9.28e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8469544e+02 9.19e+03 5.24e+01 -1.0 7.80e+03 - 2.91e-05 1.17e-0
4h 1
3 6.6462197e+02 9.08e+03 5.24e+01 -1.0 9.19e+03 - 2.18e-05 1.20e-0
2h 1
4 5.9228749e+02 8.88e+03 5.19e+01 -1.0 9.08e+03 - 1.38e-02 2.17e-0
2h 1
5 1.7105309e+04 7.36e-02 7.74e+01 -1.0 8.88e+03 - 1.04e-01 1.00e+0
0h 1
6 1.2211573e+04 6.40e-02 2.02e+01 -1.0 4.24e+01 - 7.12e-01 1.21e-0
1f 1
7 1.0749761e+04 2.49e-02 1.83e+00 -1.0 2.14e+01 - 9.33e-01 6.71e-0
1f 1
8 1.0985588e+04 3.01e-03 1.40e+00 -1.0 4.35e+00 - 3.52e-01 1.00e+0
0f 1
9 1.1156531e+04 5.30e-04 1.01e+00 -1.0 6.57e+00 - 5.79e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1145369e+04 1.29e-04 1.54e-01 -1.0 1.48e+01 - 6.18e-01 1.00e+0
0f 1
11 1.0525509e+04 1.84e-03 8.87e-02 -1.7 4.22e+00 - 9.71e-01 1.00e+0
0f 1
12 1.0369580e+04 1.17e-03 1.79e-01 -2.5 1.81e+01 - 9.06e-01 6.81e-0
1f 1
13 1.0363282e+04 1.78e-06 7.68e-03 -2.5 9.25e+00 - 1.00e+00 1.00e+0
0h 1
14 1.0339611e+04 3.81e-06 5.42e-02 -3.8 8.21e+00 - 9.47e-01 8.90e-0
1f 1
15 1.0336009e+04 5.33e-04 6.17e-04 -3.8 9.03e-01 - 1.00e+00 1.00e+0
0f 1
16 1.0334761e+04 5.23e-05 1.04e-02 -5.7 4.46e-01 - 8.31e-01 1.00e+0
0h 1
17 1.0334652e+04 3.22e-05 3.54e-05 -5.7 9.14e-03 - 1.00e+00 1.00e+0
0h 1
18 1.0334655e+04 5.67e-07 6.00e-06 -5.7 1.14e-03 - 1.00e+00 1.00e+0
0h 1
19 1.0334639e+04 3.96e-08 8.04e-05 -8.6 5.53e-03 - 1.00e+00 9.42e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.0334638e+04 7.75e-12 6.99e-11 -8.6 3.18e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.0334637968646557e+01 1.0334637968646557e+0
4
Dual infeasibility......: 6.9868333652718425e-11 6.9868333652718419e-0
8
Constraint violation....: 7.7459150205072547e-12 7.7459150205072547e-1
2
Complementarity.........: 3.5532935963365901e-09 3.5532935963365901e-0
6
Overall NLP error.......: 3.5532935963365901e-09 3.5532935963365901e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0888295e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0557265e+02 6.71e+03 5.23e+01 -1.0 5.21e+03 - 2.69e-05 1.27e-0
4h 1
3 4.1986899e+02 6.55e+03 5.24e+01 -1.0 6.70e+03 - 3.43e-05 2.35e-0
2f 1
4 1.9285646e+04 6.51e-02 8.06e+01 -1.0 6.55e+03 - 2.96e-02 1.00e+0
0h 1
5 1.0827936e+04 6.21e-02 6.35e+01 -1.0 3.91e+01 - 2.12e-01 4.20e-0
2f 1
6 9.5566169e+03 2.07e-02 3.00e+01 -1.0 1.63e+01 - 5.39e-01 6.15e-0
1f 1
7 9.1167531e+03 6.69e-03 9.63e-01 -1.0 5.59e+00 - 9.55e-01 7.70e-0
1f 1
8 9.3796749e+03 2.25e-04 7.32e-02 -1.0 4.69e+00 - 9.79e-01 1.00e+0
0f 1
9 8.8173181e+03 2.07e-03 8.47e-02 -2.5 3.16e+00 - 8.56e-01 8.39e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.6550026e+03 2.15e-03 4.35e-01 -2.5 1.87e+00 - 1.00e+00 7.56e-0
1f 1
11 8.6280921e+03 1.35e-04 4.75e-03 -2.5 8.09e-01 - 1.00e+00 1.00e+0
0h 1
12 8.6073646e+03 3.61e-05 1.51e-01 -3.8 8.04e+00 - 1.00e+00 7.57e-0
1h 1
13 8.6018717e+03 1.31e-07 3.46e-04 -3.8 1.95e+00 - 1.00e+00 1.00e+0
0f 1
14 8.6003514e+03 2.83e-08 9.57e-04 -5.7 4.46e-01 - 1.00e+00 9.85e-0
1h 1
15 8.6003344e+03 1.87e-12 1.36e-08 -5.7 6.55e-03 - 1.00e+00 1.00e+0
0f 1
16 8.6003159e+03 2.63e-12 4.48e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 8.6003159333451080e+00 8.6003159333451076e+0
3
Dual infeasibility......: 4.4776943513080768e-09 4.4776943513080768e-0
6
Constraint violation....: 2.6309024403481374e-12 2.6309024403481374e-1
2
Complementarity.........: 3.6084986867929693e-09 3.6084986867929693e-0
6
Overall NLP error.......: 4.4776943513080768e-09 4.4776943513080768e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0887653e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0575715e+02 4.77e+03 5.23e+01 -1.0 4.05e+03 - 4.23e-05 1.17e-0
4h 1
3 6.7332378e+02 4.72e+03 5.24e+01 -1.0 4.77e+03 - 2.39e-05 1.03e-0
2f 1
4 4.3700861e+02 4.62e+03 5.18e+01 -1.0 4.72e+03 - 1.38e-02 2.11e-0
2h 1
5 1.3037784e+04 7.91e-02 7.80e+01 -1.0 4.62e+03 - 9.53e-02 1.00e+0
0h 1
6 8.3073573e+03 6.95e-02 2.11e+01 -1.0 2.25e+01 - 7.07e-01 1.14e-0
1f 1
7 6.9813416e+03 1.49e-02 1.23e+00 -1.0 1.41e+01 - 9.43e-01 7.79e-0
1f 1
8 7.2864192e+03 1.03e-02 5.24e-01 -1.0 4.36e+00 - 5.50e-01 9.21e-0
1f 1
9 6.8688623e+03 2.62e-03 3.07e-01 -1.7 2.81e+00 - 8.46e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.8387954e+03 8.01e-04 5.09e-01 -1.7 8.29e+00 - 6.48e-01 1.00e+0
0h 1
11 6.8635713e+03 5.44e-06 1.04e-01 -1.7 1.23e+01 - 8.38e-01 1.00e+0
0h 1
12 6.7031034e+03 4.78e-04 2.54e-02 -2.5 1.78e+01 - 9.72e-01 9.40e-0
1f 1
13 6.6706022e+03 1.36e-04 7.94e-02 -3.8 9.48e+00 - 9.82e-01 8.43e-0
1h 1
14 6.6673152e+03 1.82e-07 9.12e-02 -3.8 1.53e+00 - 9.28e-01 1.00e+0
0h 1
15 6.6672355e+03 4.88e-09 2.88e-05 -3.8 1.71e-04 - 1.00e+00 1.00e+0
0h 1
16 6.6659218e+03 1.93e-08 3.88e-03 -5.7 2.97e-01 - 1.00e+00 9.68e-0
1f 1
17 6.6658859e+03 5.75e-12 2.62e-08 -5.7 9.60e-03 - 1.00e+00 1.00e+0
0f 1
18 6.6658693e+03 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 6.6658693447398933e+00 6.6658693447398928e+0
3
Dual infeasibility......: 4.4780423764043843e-09 4.4780423764043843e-0
6
Constraint violation....: 2.6340110648170878e-12 2.6340110648170878e-1
2
Complementarity.........: 3.6085481823537888e-09 3.6085481823537886e-0
6
Overall NLP error.......: 4.4780423764043843e-09 4.4780423764043843e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6642462e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 4.97e-04 9.81e-0
3h 1
2 8.6166973e+02 3.24e+03 5.24e+01 -1.0 1.78e+03 - 3.43e-05 1.80e-0
4h 1
3 3.1407266e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 9.62e-05 2.24e-0
2f 1
4 1.5404000e+04 5.91e-02 8.11e+01 -1.0 3.17e+03 - 3.62e-02 1.00e+0
0h 1
5 6.7204816e+03 5.60e-02 5.89e+01 -1.0 7.11e+01 - 2.71e-01 4.74e-0
2f 1
6 4.9268594e+03 2.53e-02 3.18e+01 -1.0 3.51e+01 - 4.68e-01 5.22e-0
1f 1
7 4.4315069e+03 1.19e-02 2.56e+00 -1.0 9.58e+00 - 9.27e-01 1.00e+0
0f 1
8 4.7750401e+03 6.02e-04 6.72e-02 -1.0 2.91e+00 - 9.97e-01 1.00e+0
0f 1
9 4.1957294e+03 6.59e-04 3.54e-01 -2.5 7.48e+00 - 8.90e-01 7.46e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.1311670e+03 2.03e-04 2.33e-01 -2.5 3.71e+00 - 9.11e-01 1.00e+0
0h 1
11 4.1149238e+03 1.80e-04 1.07e-01 -2.5 9.31e-01 - 1.00e+00 7.31e-0
1H 1
12 4.1119664e+03 3.45e-04 2.18e-03 -2.5 1.46e-01 - 1.00e+00 1.00e+0
0f 1
13 4.0880964e+03 1.22e-03 3.17e-02 -3.8 1.07e+01 - 7.97e-01 1.00e+0
0h 1
14 4.0847468e+03 2.76e-03 1.10e-03 -3.8 4.88e-02 - 1.00e+00 1.00e+0
0h 1
15 4.0851060e+03 3.91e-05 1.31e-04 -3.8 1.37e-02 - 1.00e+00 1.00e+0
0h 1
16 4.0833633e+03 1.01e-04 3.57e-04 -5.7 5.94e-01 - 9.51e-01 9.77e-0
1h 1
17 4.0833439e+03 2.19e-05 3.67e-03 -5.7 1.35e-02 - 1.00e+00 7.84e-0
1h 1
18 4.0833449e+03 8.57e-09 1.20e-06 -5.7 2.92e-03 - 1.00e+00 1.00e+0
0f 1
19 4.0833247e+03 9.02e-09 1.93e-05 -8.6 7.37e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 4.0833244e+03 1.37e-12 6.48e-11 -8.6 1.22e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 4.0833244008446670e+00 4.0833244008446668e+0
3
Dual infeasibility......: 6.4815378540008316e-11 6.4815378540008316e-0
8
Constraint violation....: 1.3690160116652805e-12 1.3690160116652805e-1
2
Complementarity.........: 3.2334829563542732e-09 3.2334829563542733e-0
6
Overall NLP error.......: 3.2334829563542732e-09 3.2334829563542733e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1576532e+02 2.00e+03 5.23e+01 -1.0 2.01e+03 - 1.20e-03 9.82e-0
3h 1
2 9.1032142e+02 2.00e+03 5.23e+01 -1.0 1.04e+03 - 3.89e-05 2.06e-0
4h 1
3 3.1311212e+02 1.95e+03 5.24e+01 -1.0 2.00e+03 - 1.27e-04 2.35e-0
2f 1
4 1.4582884e+04 6.66e-02 7.62e+01 -1.0 1.95e+03 - 8.09e-02 1.00e+0
0h 1
5 6.1165383e+03 6.02e-02 3.22e+01 -1.0 2.09e+01 - 5.47e-01 8.74e-0
2f 1
6 4.5880149e+03 1.60e-02 1.42e+01 -1.0 1.27e+01 - 6.20e-01 8.67e-0
1f 1
7 4.8954300e+03 1.60e-03 1.26e-01 -1.0 3.70e+00 - 9.91e-01 1.00e+0
0f 1
8 4.4214607e+03 1.88e-03 2.66e-01 -1.7 9.16e+00 - 8.50e-01 1.00e+0
0f 1
9 4.3803011e+03 7.87e-04 6.78e-01 -1.7 2.77e+01 - 4.92e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.4001356e+03 2.53e-06 1.21e-04 -1.7 1.62e+01 - 1.00e+00 1.00e+0
0h 1
11 4.2116871e+03 4.92e-04 2.26e-02 -3.8 5.38e+01 - 8.44e-01 8.35e-0
1f 1
12 4.1874888e+03 1.62e-04 1.54e-01 -3.8 8.44e+00 - 9.88e-01 7.32e-0
1h 1
13 4.1820160e+03 3.74e-07 6.52e-04 -3.8 2.25e+00 - 1.00e+00 1.00e+0
0h 1
14 4.1805062e+03 2.55e-08 3.16e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0h 1
15 4.1804892e+03 1.16e-12 1.09e-09 -8.6 5.50e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 4.1804891610021073e+00 4.1804891610021068e+0
3
Dual infeasibility......: 1.0867180694873780e-09 1.0867180694873780e-0
6
Constraint violation....: 1.1646170139378853e-12 1.1646170139378853e-1
2
Complementarity.........: 3.2096233813201398e-09 3.2096233813201396e-0
6
Overall NLP error.......: 3.2096233813201398e-09 3.2096233813201396e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6577131e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 4.97e-04 9.85e-0
3h 1
2 8.5529111e+02 9.17e+02 5.24e+01 -1.0 6.82e+02 - 7.34e-05 3.86e-0
4h 1
3 2.6219590e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 3.43e-04 2.22e-0
2f 1
4 1.2935511e+04 5.94e-02 8.01e+01 -1.0 8.97e+02 - 4.97e-02 1.00e+0
0h 1
5 4.2970559e+03 5.55e-02 5.39e+01 -1.0 7.40e+01 - 3.17e-01 5.94e-0
2f 1
6 2.7073797e+03 3.01e-02 2.82e+01 -1.0 3.90e+01 - 4.71e-01 4.32e-0
1f 1
7 2.1347600e+03 1.48e-02 2.63e+00 -1.0 1.10e+01 - 9.18e-01 1.00e+0
0f 1
8 2.4862941e+03 4.51e-04 9.25e-02 -1.0 4.08e+00 - 9.96e-01 1.00e+0
0f 1
9 1.8832651e+03 7.45e-04 3.24e-01 -2.5 8.10e+00 - 8.79e-01 7.42e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8122233e+03 2.44e-04 3.40e-01 -2.5 3.71e+00 - 8.83e-01 1.00e+0
0h 1
11 1.8056720e+03 7.22e-04 4.32e-01 -2.5 1.37e+00 - 1.00e+00 1.89e-0
1h 2
12 1.7859099e+03 1.05e-03 1.21e-02 -2.5 9.14e-01 - 1.00e+00 1.00e+0
0h 1
13 1.7616665e+03 1.22e-03 3.34e-02 -3.8 1.08e+01 - 7.93e-01 1.00e+0
0h 1
14 1.7586347e+03 2.33e-03 9.24e-04 -3.8 3.94e-02 - 1.00e+00 1.00e+0
0h 1
15 1.7589630e+03 4.74e-05 1.26e-04 -3.8 1.52e-02 - 1.00e+00 1.00e+0
0h 1
16 1.7572116e+03 1.04e-04 3.70e-04 -5.7 5.95e-01 - 9.51e-01 9.78e-0
1h 1
17 1.7571923e+03 2.28e-05 3.67e-03 -5.7 1.32e-02 - 1.00e+00 7.82e-0
1h 1
18 1.7571934e+03 8.72e-09 1.22e-06 -5.7 2.88e-03 - 1.00e+00 1.00e+0
0f 1
19 1.7571732e+03 9.04e-09 1.92e-05 -8.6 7.37e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7571729e+03 1.37e-12 6.49e-11 -8.6 1.22e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.7571729200798878e+00 1.7571729200798877e+0
3
Dual infeasibility......: 6.4906233547721703e-11 6.4906233547721703e-0
8
Constraint violation....: 1.3684609001529680e-12 1.3684609001529680e-1
2
Complementarity.........: 2.5092399786575051e-09 2.5092399786575051e-0
6
Overall NLP error.......: 2.5092399786575051e-09 2.5092399786575051e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101521e-01 6.4890146112101525e+0
2
Dual infeasibility......: 4.9126605618489413e-09 4.9126605618489413e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984918224e-09 4.3646094984918221e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605618489413e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318724481455e-09 2.1031318724481455e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896894379e-09 2.8882108896894380e-0
6
Overall NLP error.......: 2.8882108896894379e-09 2.8882108896894380e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146112101521e-01 6.4890146112101525e+0
2
Dual infeasibility......: 4.9126605618489413e-09 4.9126605618489413e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984918224e-09 4.3646094984918221e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605618489413e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.04e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.57e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235660171e+00 1.6104063235660171e+0
3
Dual infeasibility......: 2.4574009793760635e-12 2.4574009793760635e-0
9
Constraint violation....: 7.5703172614159067e-16 7.5703172614159067e-1
6
Complementarity.........: 2.5062163919681798e-09 2.5062163919681799e-0
6
Overall NLP error.......: 2.5062163919681798e-09 2.5062163919681799e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2303872e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 3.31e-04 9.86e-0
3h 1
2 8.0919006e+02 9.17e+02 5.24e+01 -1.0 7.37e+02 - 8.12e-05 5.04e-0
4h 1
3 2.4239398e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 4.72e-04 2.11e-0
2f 1
4 1.2489447e+04 5.50e-02 8.23e+01 -1.0 8.98e+02 - 3.83e-02 1.00e+0
0h 1
5 3.8941148e+03 5.25e-02 5.67e+01 -1.0 8.14e+01 - 3.09e-01 4.98e-0
2f 1
6 1.9112633e+03 3.73e-02 3.04e+01 -1.0 3.92e+01 - 4.68e-01 5.06e-0
1f 1
7 4.6876227e+03 1.23e-02 2.71e+01 -1.0 2.07e+01 - 3.99e-01 1.00e+0
0h 1
8 1.8763004e+03 1.20e-02 1.04e+00 -1.0 2.56e+01 - 9.88e-01 8.91e-0
1f 1
9 1.9981274e+03 1.95e-04 4.76e-02 -1.0 2.98e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7321093e+03 2.19e-04 1.23e+00 -2.5 1.80e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5439398e+03 3.77e-03 1.33e-01 -2.5 7.59e+00 - 7.95e-01 1.00e+0
0f 1
12 1.5209204e+03 5.17e-03 3.09e-01 -2.5 1.82e+00 - 1.00e+00 7.67e-0
1h 1
13 1.5332321e+03 2.41e-04 4.72e-03 -2.5 7.16e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5031438e+03 1.70e-04 2.15e-02 -3.8 1.35e+01 - 9.90e-01 9.29e-0
1h 1
15 1.5019709e+03 7.24e-07 6.84e-05 -3.8 9.19e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003148e+03 3.77e-07 1.78e-04 -5.7 7.43e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.79e-11 2.92e-09 -5.7 4.20e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
1 8.6555952e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 4.97e-04 9.86e-0
3h 1
2 8.5049278e+02 9.17e+02 5.24e+01 -1.0 7.54e+02 - 7.94e-05 5.56e-0
4h 1
3 2.6243053e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 5.25e-04 2.21e-0
2h 1
4 1.2843590e+04 5.96e-02 8.01e+01 -1.0 8.97e+02 - 5.01e-02 1.00e+0
0h 1
5 4.2877637e+03 5.57e-02 5.36e+01 -1.0 7.35e+01 - 3.21e-01 5.99e-0
2f 1
93 1.417215e+04 1.632511e+04 6.903808e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1158125e+02 1.57e+04 5.50e+01 -1.0 1.59e+04 - 1.75e-04 9.80e-0
3f 1
2 7.0876261e+02 1.57e+04 5.50e+01 -1.0 1.55e+04 - 9.69e-05 1.00e-0
4h 1
3 7.0208873e+02 1.57e+04 5.50e+01 -1.0 1.57e+04 - 2.67e-06 5.41e-0
4f 1
4 4.8477463e+02 1.54e+04 5.40e+01 -1.0 1.57e+04 - 5.75e-04 1.88e-0
2h 1
5 2.6430672e+04 7.61e-02 8.69e+01 -1.0 1.54e+04 - 2.52e-02 1.00e+0
0h 1
6 1.7889005e+04 7.33e-02 7.38e+01 -1.0 7.46e+01 - 1.59e-01 3.97e-0
2f 1
7 1.6627388e+04 4.64e-02 3.43e+01 -1.0 1.95e+01 - 5.30e-01 3.77e-0
1f 1
8 1.6878391e+04 4.07e-02 1.02e+01 -1.0 1.34e+01 - 5.66e-01 1.25e-0
1f 4
9 1.6797292e+04 6.81e-03 1.94e-01 -1.0 8.86e-01 - 9.93e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6502007e+04 7.54e-04 2.01e-01 -1.7 5.86e+00 - 1.00e+00 8.96e-0
1f 1
11 1.6471171e+04 7.90e-04 1.14e-02 -1.7 1.44e+01 - 1.00e+00 1.00e+0
0f 1
12 1.6349749e+04 1.26e-03 8.16e-02 -3.8 1.99e+01 - 8.09e-01 9.34e-0
1f 1
13 1.6325868e+04 1.39e-03 6.58e-02 -3.8 1.67e+00 - 8.57e-01 7.76e-0
1h 1
14 1.6326081e+04 2.49e-06 7.03e-04 -3.8 2.89e-01 - 1.00e+00 1.00e+0
0h 1
15 1.6325124e+04 3.28e-07 5.56e-04 -5.7 1.49e-01 - 1.00e+00 9.89e-0
1h 1
16 1.6325118e+04 4.02e-11 5.92e-09 -5.7 3.79e-01 - 1.00e+00 1.00e+0
0f 1
17 1.6325105e+04 6.30e-11 2.05e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.6325105278554524e+01 1.6325105278554523e+0
4
Dual infeasibility......: 2.0519882203266702e-09 2.0519882203266702e-0
6
Constraint violation....: 6.2995011984590121e-11 6.2995011984590121e-1
1
Complementarity.........: 2.8881132355456264e-09 2.8881132355456262e-0
6
Overall NLP error.......: 2.8881132355456264e-09 2.8881132355456262e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9877176e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.75e-04 9.80e-0
3h 1
2 7.9583817e+02 1.50e+04 5.25e+01 -1.0 1.37e+04 - 3.21e-05 1.08e-0
4h 1
3 7.9390288e+02 1.50e+04 5.25e+01 -1.0 1.49e+04 - 1.17e-05 1.44e-0
4h 1
4 7.8756785e+02 1.50e+04 5.25e+01 -1.0 1.50e+04 - 1.53e-04 4.81e-0
4h 1
5 5.2914533e+02 1.47e+04 5.27e+01 -1.0 1.50e+04 - 6.45e-04 2.05e-0
2f 1
6 2.6187452e+04 5.41e-02 8.35e+01 -1.0 1.47e+04 - 3.35e-02 1.00e+0
0h 1
7 1.7735988e+04 5.19e-02 6.22e+01 -1.0 8.02e+01 - 2.58e-01 4.60e-0
2f 1
8 1.5953085e+04 4.22e-02 3.20e+01 -1.0 3.43e+01 - 4.84e-01 4.72e-0
1f 1
9 1.6275176e+04 2.59e-02 1.42e+01 -1.0 1.83e+01 - 4.27e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6018542e+04 6.13e-03 1.74e-01 -1.0 5.17e+00 - 9.91e-01 1.00e+0
0h 1
11 1.5735292e+04 1.24e-03 2.90e-01 -1.7 4.67e+00 - 1.00e+00 8.63e-0
1f 1
12 1.5731572e+04 7.76e-04 1.14e-02 -1.7 3.79e+01 - 9.63e-01 1.00e+0
0f 1
13 1.5594486e+04 1.13e-03 4.36e-02 -2.5 3.81e+01 - 9.26e-01 1.00e+0
0f 1
14 1.5578973e+04 1.13e-03 1.31e-02 -2.5 1.51e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5562199e+04 1.91e-04 9.11e-02 -3.8 5.45e+00 - 1.00e+00 8.48e-0
1h 1
16 1.5560430e+04 5.39e-07 1.15e-04 -3.8 7.91e-01 - 1.00e+00 1.00e+0
0h 1
17 1.5559215e+04 4.01e-07 1.25e-04 -5.7 2.97e-01 - 1.00e+00 9.97e-0
1h 1
18 1.5559217e+04 3.85e-11 3.01e-09 -5.7 1.57e-02 - 1.00e+00 1.00e+0
0f 1
19 1.5559202e+04 6.30e-11 2.10e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.5559202162856822e+01 1.5559202162856822e+0
4
Dual infeasibility......: 2.0962302984719989e-09 2.0962302984719989e-0
6
Constraint violation....: 6.2993624205809340e-11 6.2993624205809340e-1
1
Complementarity.........: 2.9464027171795190e-09 2.9464027171795192e-0
6
Overall NLP error.......: 2.9464027171795190e-09 2.9464027171795192e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8639743e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 6.50e-04 9.80e-0
3h 1
2 8.8358795e+02 1.39e+04 5.24e+01 -1.0 1.32e+04 - 4.25e-05 1.04e-0
4h 1
3 8.7731957e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 7.54e-06 4.57e-0
4f 1
4 8.6900739e+02 1.39e+04 5.23e+01 -1.0 1.39e+04 - 4.64e-04 6.18e-0
4h 1
5 5.7974227e+02 1.36e+04 5.24e+01 -1.0 1.39e+04 - 1.24e-03 2.25e-0
2f 1
6 2.5487721e+04 6.35e-02 7.89e+01 -1.0 1.36e+04 - 6.30e-02 1.00e+0
0h 1
7 1.7446152e+04 5.85e-02 4.98e+01 -1.0 5.72e+01 - 3.54e-01 7.22e-0
2f 1
8 1.6132181e+04 3.00e-02 2.26e+01 -1.0 2.80e+01 - 5.33e-01 4.46e-0
1f 1
9 1.5490585e+04 8.07e-03 1.31e+00 -1.0 1.04e+01 - 9.25e-01 8.05e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5799816e+04 2.14e-04 7.18e-02 -1.0 3.79e+00 - 9.76e-01 1.00e+0
0f 1
11 1.5113096e+04 2.16e-03 9.82e-02 -2.5 5.44e+00 - 8.71e-01 8.96e-0
1f 1
12 1.5048948e+04 1.04e-03 1.10e+00 -2.5 6.83e-01 - 1.00e+00 4.79e-0
1h 1
13 1.5044425e+04 4.42e-06 8.92e-03 -2.5 2.46e-01 - 1.00e+00 1.00e+0
0h 1
14 1.5027143e+04 2.98e-05 6.39e-02 -3.8 2.98e+00 - 8.42e-01 9.26e-0
1f 1
15 1.5024205e+04 6.08e-04 1.04e-03 -3.8 7.90e-02 - 1.00e+00 1.00e+0
0f 1
16 1.5023109e+04 1.21e-04 7.61e-03 -5.7 1.49e-01 - 8.18e-01 1.00e+0
0h 1
17 1.5023010e+04 5.09e-05 2.33e-05 -5.7 1.12e-02 - 1.00e+00 1.00e+0
0h 1
18 1.5023007e+04 5.71e-06 8.62e-05 -5.7 2.72e-03 - 1.00e+00 9.65e-0
1h 1
19 1.5023011e+04 5.31e-08 8.47e-07 -5.7 3.54e-04 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.5022996e+04 5.58e-08 4.11e-06 -8.6 1.84e-03 - 9.98e-01 9.85e-0
1h 1
21 1.5022996e+04 2.38e-13 2.61e-11 -8.6 2.72e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.5022996118083094e+01 1.5022996118083094e+0
4
Dual infeasibility......: 2.6078938068243974e-11 2.6078938068243974e-0
8
Constraint violation....: 2.3775426072347727e-13 2.3775426072347727e-1
3
Complementarity.........: 2.5095731452685205e-09 2.5095731452685204e-0
6
Overall NLP error.......: 2.5095731452685205e-09 2.5095731452685204e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8071586e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.97e-04 9.81e-0
3h 1
2 8.7764117e+02 1.26e+04 5.24e+01 -1.0 1.03e+04 - 2.17e-05 1.21e-0
4h 1
3 8.6561154e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 2.59e-05 8.02e-0
4h 1
4 5.4124062e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 8.21e-04 2.23e-0
2h 1
5 2.4588739e+04 6.17e-02 8.18e+01 -1.0 1.24e+04 - 2.64e-02 1.00e+0
0h 1
6 1.6329207e+04 5.91e-02 6.48e+01 -1.0 6.24e+01 - 2.09e-01 3.94e-0
2f 1
7 1.4701550e+04 2.42e-02 3.37e+01 -1.0 2.76e+01 - 4.90e-01 5.62e-0
1f 1
8 1.4028481e+04 1.26e-02 2.57e+00 -1.0 9.45e+00 - 9.29e-01 1.00e+0
0f 1
9 1.4510164e+04 4.98e-04 1.27e-01 -1.0 4.21e+00 - 9.85e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3744944e+04 1.56e-03 9.06e-02 -2.5 6.45e+00 - 8.58e-01 8.73e-0
1f 1
11 1.3729716e+04 5.31e-06 1.59e-02 -2.5 2.77e+00 - 1.00e+00 1.00e+0
0h 1
12 1.3697749e+04 6.08e-04 1.04e-01 -3.8 8.08e+00 - 6.28e-01 9.87e-0
1f 1
13 1.3694569e+04 1.55e-03 7.08e-03 -3.8 1.15e-01 - 8.47e-01 1.00e+0
0h 1
14 1.3694408e+04 1.44e-04 1.47e-04 -3.8 1.68e-02 - 1.00e+00 1.00e+0
0h 1
15 1.3692888e+04 1.56e-04 1.25e-03 -5.7 4.48e-01 - 9.12e-01 1.00e+0
0h 1
16 1.3692839e+04 4.35e-05 1.30e-05 -5.7 9.71e-03 - 1.00e+00 1.00e+0
0h 1
17 1.3692842e+04 1.15e-06 6.85e-06 -5.7 1.55e-03 - 1.00e+00 1.00e+0
0h 1
18 1.3692827e+04 8.67e-08 7.48e-05 -8.6 5.53e-03 - 1.00e+00 9.40e-0
1h 1
19 1.3692826e+04 8.45e-12 1.01e-10 -8.6 3.30e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.3692825543890478e+01 1.3692825543890478e+0
4
Dual infeasibility......: 1.0091560206972329e-10 1.0091560206972329e-0
7
Constraint violation....: 8.4466877936506535e-12 8.4466877936506535e-1
2
Complementarity.........: 3.4942147139294729e-09 3.4942147139294728e-0
6
Overall NLP error.......: 3.4942147139294729e-09 3.4942147139294728e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2301496e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.51e-03 9.80e-0
3h 1
2 9.2012933e+02 1.11e+04 5.23e+01 -1.0 1.02e+04 - 3.26e-05 1.08e-0
4h 1
3 8.3424142e+02 1.11e+04 5.23e+01 -1.0 1.11e+04 - 1.17e-05 5.22e-0
3h 1
4 5.7283735e+02 1.08e+04 5.22e+01 -1.0 1.11e+04 - 5.95e-03 2.13e-0
2h 1
5 2.1532475e+04 7.53e-02 7.76e+01 -1.0 1.08e+04 - 8.36e-02 1.00e+0
0h 1
6 1.5215064e+04 6.76e-02 2.23e+01 -1.0 1.30e+01 - 6.84e-01 9.54e-0
2f 1
7 1.3955436e+04 2.05e-02 7.03e+00 -1.0 9.59e+00 - 7.22e-01 8.73e-0
1f 1
8 1.4214931e+04 1.09e-02 1.48e-01 -1.0 2.63e+00 - 9.91e-01 9.34e-0
1f 1
9 1.3824892e+04 2.88e-03 1.27e+00 -1.7 1.20e+01 - 3.21e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3790640e+04 2.44e-04 3.54e-01 -1.7 1.07e+01 - 8.21e-01 1.00e+0
0h 1
11 1.3800440e+04 1.31e-04 2.83e-03 -1.7 1.28e+01 - 1.00e+00 1.00e+0
0h 1
12 1.3625820e+04 5.08e-04 2.07e-02 -3.8 3.63e+01 - 8.40e-01 8.41e-0
1f 1
13 1.3606786e+04 1.62e-04 2.23e-01 -3.8 5.73e+00 - 9.93e-01 7.10e-0
1h 1
14 1.3601605e+04 3.45e-07 3.52e-04 -3.8 1.66e+00 - 1.00e+00 1.00e+0
0h 1
15 1.3600267e+04 1.96e-08 4.29e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
16 1.3600252e+04 8.29e-13 4.94e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.3600252151325778e+01 1.3600252151325778e+0
4
Dual infeasibility......: 4.9393672855279475e-10 4.9393672855279475e-0
7
Constraint violation....: 8.2905904363883565e-13 8.2905904363883565e-1
3
Complementarity.........: 4.2725255692483288e-09 4.2725255692483290e-0
6
Overall NLP error.......: 4.2725255692483288e-09 4.2725255692483290e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3005293e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 2.02e-03 9.81e-0
3h 1
2 9.2651210e+02 9.19e+03 5.23e+01 -1.0 6.50e+03 - 1.50e-05 1.40e-0
4h 1
3 4.8735725e+02 8.97e+03 5.24e+01 -1.0 9.19e+03 - 4.50e-05 2.34e-0
2f 1
4 2.1862187e+04 7.01e-02 8.02e+01 -1.0 8.97e+03 - 3.23e-02 1.00e+0
0h 1
5 1.3691797e+04 6.67e-02 6.19e+01 -1.0 1.57e+01 - 2.28e-01 4.50e-0
2f 1
6 1.2506350e+04 1.60e-02 2.67e+01 -1.0 7.64e+00 - 6.04e-01 8.60e-0
1f 1
7 1.2596694e+04 5.65e-03 2.44e-01 -1.0 2.19e+00 - 9.91e-01 1.00e+0
0f 1
8 1.2196507e+04 1.61e-03 1.40e-01 -1.7 5.04e+00 - 1.00e+00 9.30e-0
1f 1
9 1.2024810e+04 1.68e-03 5.13e-01 -2.5 3.38e+00 - 1.00e+00 7.47e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1991288e+04 2.90e-04 1.15e-01 -2.5 8.50e-01 - 1.00e+00 8.88e-0
1h 1
11 1.1993022e+04 8.46e-06 2.09e-03 -2.5 9.55e-02 - 1.00e+00 1.00e+0
0f 1
12 1.1965653e+04 8.02e-06 3.85e-03 -3.8 8.04e+00 - 1.00e+00 9.81e-0
1f 1
13 1.1965506e+04 1.39e-08 6.12e-06 -3.8 1.52e-01 - 1.00e+00 1.00e+0
0f 1
14 1.1964016e+04 1.73e-08 3.04e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0f 1
15 1.1963999e+04 1.28e-12 4.22e-10 -8.6 5.52e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.1963999154895715e+01 1.1963999154895715e+0
4
Dual infeasibility......: 4.2180023691672125e-10 4.2180023691672125e-0
7
Constraint violation....: 1.2796569359707632e-12 1.2796569359707632e-1
2
Complementarity.........: 3.2688701243253587e-09 3.2688701243253587e-0
6
Overall NLP error.......: 3.2688701243253587e-09 3.2688701243253587e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0886883e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0500382e+02 6.71e+03 5.23e+01 -1.0 4.31e+03 - 2.09e-05 1.54e-0
4h 1
3 4.1993273e+02 6.55e+03 5.24e+01 -1.0 6.71e+03 - 6.23e-05 2.34e-0
2f 1
4 1.9275723e+04 6.51e-02 8.04e+01 -1.0 6.55e+03 - 3.10e-02 1.00e+0
0h 1
5 1.0823593e+04 6.21e-02 6.27e+01 -1.0 3.84e+01 - 2.20e-01 4.32e-0
2f 1
6 9.5475188e+03 2.05e-02 2.95e+01 -1.0 1.63e+01 - 5.40e-01 6.17e-0
1f 1
7 9.1168163e+03 6.34e-03 9.31e-01 -1.0 5.47e+00 - 9.56e-01 7.74e-0
1f 1
8 9.3808628e+03 2.02e-04 6.95e-02 -1.0 5.18e+00 - 1.00e+00 1.00e+0
0f 1
9 8.8194741e+03 2.09e-03 8.24e-02 -2.5 5.74e+00 - 8.56e-01 8.44e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.6573252e+03 2.16e-03 4.23e-01 -2.5 9.76e-01 - 1.00e+00 7.60e-0
1f 1
11 8.6309951e+03 1.27e-04 4.69e-03 -2.5 2.32e-01 - 1.00e+00 1.00e+0
0h 1
12 8.6080888e+03 3.40e-05 1.47e-01 -3.8 1.07e+01 - 1.00e+00 7.60e-0
1h 1
13 8.6020228e+03 1.26e-07 3.40e-04 -3.8 2.57e+00 - 1.00e+00 1.00e+0
0f 1
14 8.6003558e+03 2.84e-08 9.83e-04 -5.7 5.94e-01 - 1.00e+00 9.85e-0
1f 1
15 8.6003362e+03 1.91e-12 1.38e-08 -5.7 8.88e-03 - 1.00e+00 1.00e+0
0f 1
16 8.6003159e+03 2.63e-12 4.48e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 8.6003159393306632e+00 8.6003159393306632e+0
3
Dual infeasibility......: 4.4776949567985677e-09 4.4776949567985677e-0
6
Constraint violation....: 2.6305763123346537e-12 2.6305763123346537e-1
2
Complementarity.........: 3.6084980475141679e-09 3.6084980475141677e-0
6
Overall NLP error.......: 4.4776949567985677e-09 4.4776949567985677e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0890039e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0606063e+02 4.77e+03 5.23e+01 -1.0 4.53e+03 - 8.51e-05 1.04e-0
4h 1
3 8.5674884e+02 4.76e+03 5.23e+01 -1.0 4.77e+03 - 9.62e-06 2.18e-0
3f 1
4 3.8122229e+02 4.65e+03 5.23e+01 -1.0 4.76e+03 - 2.82e-03 2.23e-0
2h 1
5 1.6129511e+04 6.86e-02 7.70e+01 -1.0 4.65e+03 - 8.42e-02 1.00e+0
0h 1
6 8.6428592e+03 6.17e-02 3.53e+01 -1.0 2.77e+01 - 5.15e-01 9.25e-0
2f 1
7 7.1353041e+03 1.99e-02 1.35e+01 -1.0 1.52e+01 - 6.41e-01 7.60e-0
1f 1
8 7.2345504e+03 6.03e-03 1.10e+00 -1.0 2.38e+00 - 9.93e-01 5.00e-0
1f 2
9 7.4467494e+03 2.48e-04 6.11e-02 -1.0 3.13e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.8841153e+03 2.26e-03 8.91e-02 -2.5 2.93e+01 - 8.55e-01 8.27e-0
1f 1
11 6.7163515e+03 2.12e-03 4.49e-01 -2.5 4.53e+00 - 1.00e+00 7.51e-0
1f 1
12 6.6879049e+03 1.53e-04 4.78e-03 -2.5 1.12e+00 - 1.00e+00 1.00e+0
0h 1
13 6.6714077e+03 4.08e-05 1.58e-01 -3.8 2.68e+00 - 1.00e+00 7.53e-0
1h 1
14 6.6671226e+03 1.41e-07 3.55e-04 -3.8 6.62e-01 - 1.00e+00 1.00e+0
0f 1
15 6.6658964e+03 2.80e-08 9.30e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
16 6.6658841e+03 1.87e-12 1.34e-08 -5.7 2.14e-03 - 1.00e+00 1.00e+0
0f 1
17 6.6658693e+03 2.63e-12 4.48e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 6.6658693431984286e+00 6.6658693431984284e+0
3
Dual infeasibility......: 4.4776949139149836e-09 4.4776949139149836e-0
6
Constraint violation....: 2.6304930456078068e-12 2.6304930456078068e-1
2
Complementarity.........: 3.6084999014031685e-09 3.6084999014031684e-0
6
Overall NLP error.......: 4.4776949139149836e-09 4.4776949139149836e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2284101e+02 3.24e+03 5.23e+01 -1.0 3.27e+03 - 1.51e-03 9.82e-0
3h 1
2 9.0926076e+02 3.24e+03 5.23e+01 -1.0 2.65e+03 - 2.26e-05 5.44e-0
4h 1
3 3.4654879e+02 3.17e+03 5.24e+01 -1.0 3.24e+03 - 4.65e-04 2.33e-0
2h 1
4 1.5727761e+04 6.86e-02 7.64e+01 -1.0 3.17e+03 - 7.94e-02 1.00e+0
0h 1
5 7.5065615e+03 6.21e-02 2.55e+01 -1.0 1.38e+01 - 6.32e-01 8.66e-0
2f 1
6 6.1545521e+03 2.15e-02 1.11e+01 -1.0 9.93e+00 - 6.46e-01 9.10e-0
1f 1
7 6.3910865e+03 3.11e-03 1.12e-01 -1.0 2.98e+00 - 9.91e-01 9.82e-0
1f 1
8 5.9617482e+03 2.66e-03 4.59e-01 -1.7 1.31e+01 - 7.57e-01 1.00e+0
0f 1
9 5.9253940e+03 5.84e-04 7.45e-01 -1.7 3.32e+01 - 4.46e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.9591894e+03 1.28e-05 8.29e-04 -1.7 2.82e+01 - 1.00e+00 1.00e+0
0h 1
11 5.7578260e+03 4.58e-04 2.04e-02 -2.5 6.15e+01 - 9.76e-01 9.63e-0
1f 1
12 5.7307599e+03 1.43e-04 2.08e-01 -3.8 1.54e+01 - 9.94e-01 7.21e-0
1h 1
13 5.7228044e+03 3.40e-07 3.02e-04 -3.8 4.29e+00 - 1.00e+00 1.00e+0
0h 1
14 5.7210205e+03 1.95e-08 4.42e-06 -5.7 7.43e-01 - 1.00e+00 1.00e+0
0h 1
15 5.7210000e+03 7.90e-13 4.80e-10 -8.6 9.18e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.7210000481588921e+00 5.7210000481588922e+0
3
Dual infeasibility......: 4.7998695968183471e-10 4.7998695968183471e-0
7
Constraint violation....: 7.9029838229160987e-13 7.9029838229160987e-1
3
Complementarity.........: 3.0351181774698422e-09 3.0351181774698421e-0
6
Overall NLP error.......: 3.0351181774698422e-09 3.0351181774698421e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1576532e+02 2.00e+03 5.23e+01 -1.0 2.01e+03 - 1.20e-03 9.82e-0
3h 1
2 9.1032142e+02 2.00e+03 5.23e+01 -1.0 1.04e+03 - 3.89e-05 2.06e-0
4h 1
3 3.1311212e+02 1.95e+03 5.24e+01 -1.0 2.00e+03 - 1.27e-04 2.35e-0
2f 1
4 1.4582884e+04 6.66e-02 7.62e+01 -1.0 1.95e+03 - 8.09e-02 1.00e+0
0h 1
5 6.1165383e+03 6.02e-02 3.22e+01 -1.0 2.09e+01 - 5.47e-01 8.74e-0
2f 1
6 4.5880149e+03 1.60e-02 1.42e+01 -1.0 1.27e+01 - 6.20e-01 8.67e-0
1f 1
7 4.8954300e+03 1.60e-03 1.26e-01 -1.0 3.70e+00 - 9.91e-01 1.00e+0
0f 1
8 4.4215064e+03 1.88e-03 1.38e-01 -1.7 9.20e+00 - 9.38e-01 1.00e+0
0f 1
9 4.2430171e+03 1.68e-03 7.11e-02 -2.5 1.19e+00 - 8.17e-01 7.73e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2058660e+03 3.35e-04 2.51e-02 -2.5 5.61e-01 - 1.00e+00 9.77e-0
1f 1
11 4.1818538e+03 2.02e-06 7.33e-02 -3.8 8.10e+00 - 9.42e-01 1.00e+0
0h 1
12 4.1819973e+03 1.24e-09 7.38e-06 -3.8 9.91e-03 - 1.00e+00 1.00e+0
0h 1
13 4.1805106e+03 1.79e-08 1.81e-04 -5.7 4.46e-01 - 1.00e+00 9.96e-0
1f 1
14 4.1805076e+03 1.80e-12 2.29e-09 -5.7 1.79e-03 - 1.00e+00 1.00e+0
0f 1
15 4.1804892e+03 2.63e-12 1.52e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 4.1804891646634896e+00 4.1804891646634896e+0
3
Dual infeasibility......: 1.5189629865175384e-09 1.5189629865175384e-0
6
Constraint violation....: 2.6286819942988870e-12 2.6286819942988870e-1
2
Complementarity.........: 4.1874275716750408e-09 4.1874275716750405e-0
6
Overall NLP error.......: 4.1874275716750408e-09 4.1874275716750405e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0808031e+02 9.17e+02 5.23e+01 -1.0 9.22e+02 - 1.00e-03 9.86e-0
3h 1
2 8.8617108e+02 9.17e+02 5.23e+01 -1.0 8.07e+02 - 7.42e-05 8.22e-0
4h 1
3 2.8484271e+02 8.96e+02 5.24e+01 -1.0 9.17e+02 - 7.98e-04 2.30e-0
2h 1
4 1.3130925e+04 6.61e-02 7.64e+01 -1.0 8.96e+02 - 8.29e-02 1.00e+0
0h 1
5 4.8553004e+03 5.96e-02 3.83e+01 -1.0 2.93e+01 - 4.73e-01 8.96e-0
2f 1
6 3.3594619e+03 1.92e-02 1.58e+01 -1.0 1.54e+01 - 6.12e-01 7.37e-0
1f 1
7 3.4484569e+03 4.84e-03 1.76e-01 -1.0 2.12e+00 - 9.90e-01 1.00e+0
0f 1
8 3.0256349e+03 1.47e-03 1.26e-01 -1.7 7.99e+00 - 1.00e+00 1.00e+0
0f 1
9 2.8699577e+03 2.01e-03 4.20e-01 -2.5 5.63e+00 - 1.00e+00 7.84e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8453385e+03 1.62e-04 5.44e-03 -2.5 1.12e+00 - 1.00e+00 1.00e+0
0h 1
11 2.8215934e+03 4.47e-05 1.85e-01 -3.8 1.35e+01 - 1.00e+00 7.36e-0
1h 1
12 2.8142143e+03 1.62e-07 3.67e-04 -3.8 3.52e+00 - 1.00e+00 1.00e+0
0f 1
13 2.8124069e+03 2.71e-08 9.51e-04 -5.7 7.43e-01 - 1.00e+00 9.85e-0
1f 1
14 2.8123858e+03 1.86e-12 1.33e-08 -5.7 1.07e-02 - 1.00e+00 1.00e+0
0f 1
15 2.8123637e+03 2.63e-12 4.48e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 2.8123637144967888e+00 2.8123637144967888e+0
3
Dual infeasibility......: 4.4777028542737288e-09 4.4777028542737288e-0
6
Constraint violation....: 2.6308469291969061e-12 2.6308469291969061e-1
2
Complementarity.........: 3.6085022356320241e-09 3.6085022356320242e-0
6
Overall NLP error.......: 4.4777028542737288e-09 4.4777028542737288e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933498e-01 5.8277753147933493e+0
2
Dual infeasibility......: 2.1031320946147231e-09 2.1031320946147231e-0
6
Constraint violation....: 6.2994318095199731e-11 6.2994318095199731e-1
1
Complementarity.........: 2.8882108896903808e-09 2.8882108896903807e-0
6
Overall NLP error.......: 2.8882108896903808e-09 2.8882108896903807e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933498e-01 5.8277753147933493e+0
2
Dual infeasibility......: 2.1031320946147231e-09 2.1031320946147231e-0
6
Constraint violation....: 6.2994318095199731e-11 6.2994318095199731e-1
1
Complementarity.........: 2.8882108896903808e-09 2.8882108896903807e-0
6
Overall NLP error.......: 2.8882108896903808e-09 2.8882108896903807e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.028
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254210179e-01 6.4890146254210174e+0
2
Dual infeasibility......: 4.9126604805649068e-09 4.9126604805649068e-0
6
Constraint violation....: 6.2123811650494076e-09 6.2123811650494076e-0
9
Complementarity.........: 4.3646095252531724e-09 4.3646095252531725e-0
6
Overall NLP error.......: 6.2123811650494076e-09 4.9126604805649068e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.03e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 6.36e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643335e+00 1.6104063281643334e+0
3
Dual infeasibility......: 2.4573533589687019e-12 2.4573533589687019e-0
9
Constraint violation....: 6.3603173554942194e-15 6.3603173554942194e-1
5
Complementarity.........: 2.5062163910047530e-09 2.5062163910047528e-0
6
Overall NLP error.......: 2.5062163910047530e-09 2.5062163910047528e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2329662e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 3.31e-04 9.85e-0
3h 1
2 8.1338739e+02 9.17e+02 5.24e+01 -1.0 6.65e+02 - 7.53e-05 3.59e-0
4h 1
3 2.4215012e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 3.16e-04 2.12e-0
2f 1
4 1.2572829e+04 5.49e-02 8.23e+01 -1.0 8.98e+02 - 3.81e-02 1.00e+0
0h 1
5 3.9012337e+03 5.24e-02 5.73e+01 -1.0 8.21e+01 - 3.02e-01 4.95e-0
2f 1
6 1.9122630e+03 3.74e-02 3.08e+01 -1.0 3.92e+01 - 4.67e-01 5.07e-0
1f 1
7 4.6985285e+03 1.23e-02 2.74e+01 -1.0 2.08e+01 - 3.98e-01 1.00e+0
0h 1
8 1.8769618e+03 1.22e-02 1.07e+00 -1.0 2.57e+01 - 9.87e-01 8.88e-0
1f 1
9 1.9956227e+03 2.03e-04 4.84e-02 -1.0 2.76e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7291248e+03 2.21e-04 1.23e+00 -2.5 1.88e+01 - 9.37e-01 5.95e-0
1f 1
11 1.5409848e+03 3.77e-03 1.32e-01 -2.5 7.58e+00 - 7.96e-01 1.00e+0
0f 1
12 1.5181170e+03 5.06e-03 3.08e-01 -2.5 1.81e+00 - 1.00e+00 7.68e-0
1h 1
13 1.5303991e+03 2.38e-04 4.69e-03 -2.5 7.19e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5028095e+03 1.70e-04 2.15e-02 -3.8 1.08e+01 - 9.90e-01 9.29e-0
1h 1
15 1.5018205e+03 7.26e-07 6.85e-05 -3.8 7.35e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003124e+03 3.77e-07 1.78e-04 -5.7 5.94e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003117e+03 3.79e-11 2.92e-09 -5.7 4.21e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932751767062e+00 1.5002932751767062e+0
3
Dual infeasibility......: 2.1737234189016573e-09 2.1737234189016573e-0
6
Constraint violation....: 6.2995705873980512e-11 6.2995705873980512e-1
1
Complementarity.........: 2.8882174480559516e-09 2.8882174480559515e-0
6
Overall NLP error.......: 2.8882174480559516e-09 2.8882174480559515e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
1 8.6577131e+02 9.17e+02 5.24e+01 -1.0 9.23e+02 - 4.97e-04 9.85e-0
3h 1
2 8.5529111e+02 9.17e+02 5.24e+01 -1.0 6.82e+02 - 7.34e-05 3.86e-0
4h 1
3 2.6219590e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 3.43e-04 2.22e-0
2f 1
4 1.2935511e+04 5.94e-02 8.01e+01 -1.0 8.97e+02 - 4.97e-02 1.00e+0
0h 1
5 4.2970559e+03 5.55e-02 5.39e+01 -1.0 7.40e+01 - 3.17e-01 5.94e-0
2f 1
94 1.951518e+04 1.632511e+04 6.958559e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6795632e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.80e-0
3f 1
2 7.6508437e+02 1.57e+04 5.25e+01 -1.0 1.51e+04 - 4.81e-05 1.03e-0
4h 1
3 7.6301737e+02 1.57e+04 5.25e+01 -1.0 1.56e+04 - 6.09e-06 1.63e-0
4h 1
4 7.6061473e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 1.68e-04 1.94e-0
4h 1
5 5.2040647e+02 1.54e+04 5.27e+01 -1.0 1.57e+04 - 3.72e-04 2.00e-0
2f 1
6 2.6849293e+04 6.07e-02 8.48e+01 -1.0 1.54e+04 - 2.94e-02 1.00e+0
0h 1
7 1.8276442e+04 5.84e-02 6.78e+01 -1.0 8.01e+01 - 2.06e-01 4.26e-0
2f 1
8 1.6691858e+04 4.48e-02 3.36e+01 -1.0 2.87e+01 - 4.99e-01 4.37e-0
1f 1
9 1.6988570e+04 3.06e-02 1.36e+01 -1.0 1.62e+01 - 4.66e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6780308e+04 5.30e-03 1.70e-01 -1.0 3.72e+00 - 9.91e-01 1.00e+0
0h 1
11 1.6496133e+04 1.03e-03 2.43e-01 -1.7 4.59e+00 - 1.00e+00 8.81e-0
1f 1
12 1.6475862e+04 7.58e-04 9.93e-03 -1.7 1.92e+01 - 1.00e+00 1.00e+0
0f 1
13 1.6350292e+04 1.27e-03 7.63e-02 -3.8 2.43e+01 - 8.03e-01 9.18e-0
1f 1
14 1.6325699e+04 1.46e-03 5.83e-02 -3.8 1.75e+00 - 8.51e-01 7.80e-0
1h 1
15 1.6326063e+04 2.67e-06 7.33e-04 -3.8 2.91e-02 - 1.00e+00 1.00e+0
0h 1
16 1.6325124e+04 3.14e-07 6.12e-04 -5.7 1.49e-01 - 1.00e+00 9.88e-0
1h 1
17 1.6325118e+04 3.94e-11 6.10e-09 -5.7 1.23e-01 - 1.00e+00 1.00e+0
0f 1
18 1.6325105e+04 6.30e-11 2.07e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.6325105278524092e+01 1.6325105278524092e+0
4
Dual infeasibility......: 2.0693016546140312e-09 2.0693016546140312e-0
6
Constraint violation....: 6.2995622607253665e-11 6.2995622607253665e-1
1
Complementarity.........: 2.8881085199202613e-09 2.8881085199202611e-0
6
Overall NLP error.......: 2.8881085199202613e-09 2.8881085199202611e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.1743313e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 3.14e-04 9.80e-0
3h 1
2 8.1450820e+02 1.50e+04 5.24e+01 -1.0 1.37e+04 - 3.17e-05 1.08e-0
4h 1
3 8.1252048e+02 1.50e+04 5.24e+01 -1.0 1.49e+04 - 1.19e-05 1.49e-0
4h 1
4 8.0600747e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 1.58e-04 4.97e-0
4h 1
5 5.4314885e+02 1.47e+04 5.26e+01 -1.0 1.50e+04 - 6.68e-04 2.09e-0
2f 1
6 2.6326585e+04 5.50e-02 8.27e+01 -1.0 1.47e+04 - 3.71e-02 1.00e+0
0h 1
7 1.7882873e+04 5.25e-02 5.76e+01 -1.0 8.02e+01 - 3.03e-01 4.90e-0
2f 1
8 1.5964760e+04 3.89e-02 3.04e+01 -1.0 3.79e+01 - 4.74e-01 4.95e-0
1f 1
9 1.6303223e+04 2.34e-02 1.40e+01 -1.0 1.99e+01 - 4.08e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6040241e+04 6.19e-03 3.00e-01 -1.0 5.29e+00 - 9.84e-01 1.00e+0
0h 1
11 1.5744322e+04 1.38e-03 3.59e-01 -1.7 5.09e+00 - 1.00e+00 8.40e-0
1f 1
12 1.5733003e+04 8.52e-04 1.32e-02 -1.7 3.98e+01 - 1.00e+00 1.00e+0
0f 1
13 1.5594003e+04 1.18e-03 4.63e-02 -2.5 3.83e+01 - 9.21e-01 1.00e+0
0f 1
14 1.5578849e+04 1.21e-03 1.43e-02 -2.5 1.55e+00 - 1.00e+00 1.00e+0
0h 1
15 1.5562293e+04 2.09e-04 9.92e-02 -3.8 5.46e+00 - 1.00e+00 8.40e-0
1h 1
16 1.5560430e+04 4.73e-07 1.27e-04 -3.8 8.33e-01 - 1.00e+00 1.00e+0
0h 1
17 1.5559216e+04 4.02e-07 1.46e-04 -5.7 2.97e-01 - 1.00e+00 9.97e-0
1h 1
18 1.5559217e+04 3.87e-11 2.98e-09 -5.7 4.17e-02 - 1.00e+00 1.00e+0
0f 1
19 1.5559202e+04 6.30e-11 2.14e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.5559202162835492e+01 1.5559202162835491e+0
4
Dual infeasibility......: 2.1395455652129445e-09 2.1395455652129445e-0
6
Constraint violation....: 6.2995081373529160e-11 6.2995081373529160e-1
1
Complementarity.........: 2.9185760440170366e-09 2.9185760440170366e-0
6
Overall NLP error.......: 2.9185760440170366e-09 2.9185760440170366e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9474675e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 7.47e-04 9.80e-0
3h 1
2 8.9194369e+02 1.39e+04 5.24e+01 -1.0 1.32e+04 - 4.13e-05 1.05e-0
4h 1
3 8.5454686e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 7.70e-06 2.75e-0
3h 1
4 5.9776529e+02 1.36e+04 5.24e+01 -1.0 1.39e+04 - 2.98e-03 2.17e-0
2h 1
5 2.5045472e+04 6.61e-02 7.79e+01 -1.0 1.36e+04 - 7.67e-02 1.00e+0
0h 1
6 1.7489149e+04 5.99e-02 4.43e+01 -1.0 4.65e+01 - 4.12e-01 8.56e-0
2f 1
7 1.6157046e+04 2.72e-02 1.74e+01 -1.0 2.18e+01 - 5.97e-01 5.29e-0
1f 1
8 1.5789844e+04 4.82e-03 1.02e+00 -1.0 7.50e+00 - 9.44e-01 7.47e-0
1f 1
9 1.6035054e+04 1.92e-04 6.56e-02 -1.0 5.32e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5449275e+04 2.15e-03 8.63e-02 -2.5 4.06e+00 - 8.61e-01 8.38e-0
1f 1
11 1.5276831e+04 2.15e-03 3.51e-01 -2.5 9.32e-01 - 1.00e+00 7.78e-0
1f 1
12 1.5250445e+04 1.60e-04 4.87e-03 -2.5 1.88e-01 - 1.00e+00 1.00e+0
0h 1
13 1.5228081e+04 2.38e-05 4.29e-02 -3.8 5.36e+00 - 1.00e+00 8.81e-0
1h 1
14 1.5226265e+04 5.81e-08 6.03e-04 -3.8 6.36e-01 - 1.00e+00 1.00e+0
0f 1
15 1.5224812e+04 4.22e-08 4.26e-05 -5.7 2.97e-01 - 1.00e+00 9.98e-0
1f 1
16 1.5224814e+04 1.88e-12 1.17e-08 -5.7 5.07e-04 - 1.00e+00 1.00e+0
0f 1
17 1.5224797e+04 2.57e-12 2.87e-06 -8.6 3.68e-03 - 1.00e+00 9.99e-0
1f 1
18 1.5224797e+04 2.27e-15 4.51e-14 -8.6 1.82e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5224797160378893e+01 1.5224797160378892e+0
4
Dual infeasibility......: 4.5060448734865289e-14 4.5060448734865289e-1
1
Constraint violation....: 2.2700326020622211e-15 2.2700326020622211e-1
5
Complementarity.........: 2.6244938743860499e-09 2.6244938743860497e-0
6
Overall NLP error.......: 2.6244938743860499e-09 2.6244938743860497e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4547453e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.98e-04 9.80e-0
3h 1
2 8.4252030e+02 1.27e+04 5.24e+01 -1.0 1.14e+04 - 3.11e-05 1.10e-0
4h 1
3 7.3828800e+02 1.26e+04 5.25e+01 -1.0 1.26e+04 - 1.44e-05 6.79e-0
3h 1
4 5.8291340e+02 1.23e+04 5.23e+01 -1.0 1.26e+04 - 7.40e-03 2.02e-0
2h 1
5 2.1644343e+04 6.31e-02 8.13e+01 -1.0 1.23e+04 - 6.10e-02 1.00e+0
0h 1
6 1.5478392e+04 5.79e-02 3.40e+01 -1.0 6.33e+01 - 5.63e-01 7.54e-0
2f 1
7 1.3645356e+04 3.62e-02 1.31e+01 -1.0 3.98e+01 - 6.02e-01 5.11e-0
1f 1
8 1.4328739e+04 4.32e-03 7.49e-01 -1.0 9.09e+00 - 9.62e-01 1.00e+0
0f 1
9 1.3456165e+04 1.83e-03 1.05e-01 -1.7 1.17e+01 - 9.71e-01 9.22e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3313584e+04 1.21e-03 3.78e-01 -2.5 6.14e+00 - 7.74e-01 1.00e+0
0h 1
11 1.3249534e+04 1.73e-02 6.44e-02 -2.5 3.91e+00 - 9.60e-01 9.24e-0
1h 1
12 1.3261115e+04 5.79e-04 1.29e-02 -2.5 4.91e-01 - 1.00e+00 1.00e+0
0h 1
13 1.3236166e+04 2.82e-04 5.49e-02 -3.8 8.03e+00 - 9.92e-01 8.75e-0
1h 1
14 1.3234423e+04 1.24e-06 1.23e-04 -3.8 1.01e+00 - 1.00e+00 1.00e+0
0h 1
15 1.3233083e+04 3.40e-07 2.11e-03 -5.7 4.46e-01 - 1.00e+00 9.78e-0
1h 1
16 1.3233068e+04 3.84e-11 2.13e-08 -5.7 9.87e-03 - 1.00e+00 1.00e+0
0f 1
17 1.3233051e+04 6.30e-11 4.40e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.3233050939206567e+01 1.3233050939206567e+0
4
Dual infeasibility......: 4.3997098033163224e-09 4.3997098033163224e-0
6
Constraint violation....: 6.3005961559170487e-11 6.3005961559170487e-1
1
Complementarity.........: 3.4018953916751974e-09 3.4018953916751974e-0
6
Overall NLP error.......: 4.3997098033163224e-09 4.3997098033163224e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9414028e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 7.39e-04 9.80e-0
3h 1
2 8.9129876e+02 1.11e+04 5.24e+01 -1.0 1.04e+04 - 4.19e-05 1.06e-0
4h 1
3 8.3481754e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 9.61e-06 3.45e-0
3h 1
4 5.3561338e+02 1.08e+04 5.24e+01 -1.0 1.11e+04 - 3.83e-03 2.15e-0
2h 1
5 2.1931573e+04 6.69e-02 7.80e+01 -1.0 1.08e+04 - 7.89e-02 1.00e+0
0h 1
6 1.4666151e+04 6.05e-02 4.27e+01 -1.0 4.61e+01 - 4.32e-01 8.84e-0
2f 1
7 1.3326375e+04 2.85e-02 1.59e+01 -1.0 2.18e+01 - 6.16e-01 5.35e-0
1f 1
8 1.2993975e+04 4.54e-03 9.33e-01 -1.0 7.21e+00 - 9.46e-01 7.56e-0
1f 1
9 1.3239265e+04 1.46e-04 5.99e-02 -1.0 6.01e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2648113e+04 2.19e-03 8.36e-02 -2.5 4.04e+00 - 8.62e-01 8.44e-0
1f 1
11 1.2477652e+04 2.15e-03 3.32e-01 -2.5 8.80e-01 - 1.00e+00 7.84e-0
1f 1
12 1.2452607e+04 1.55e-04 4.70e-03 -2.5 1.75e-01 - 1.00e+00 1.00e+0
0h 1
13 1.2430772e+04 2.76e-05 5.76e-02 -3.8 5.36e+00 - 1.00e+00 8.52e-0
1h 1
14 1.2428318e+04 7.15e-08 5.86e-04 -3.8 7.94e-01 - 1.00e+00 1.00e+0
0f 1
15 1.2426884e+04 3.97e-08 2.07e-04 -5.7 2.97e-01 - 1.00e+00 9.94e-0
1f 1
16 1.2426881e+04 1.89e-12 1.57e-08 -5.7 1.66e-03 - 1.00e+00 1.00e+0
0f 1
17 1.2426865e+04 2.56e-12 6.94e-07 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
18 1.2426865e+04 5.19e-15 2.51e-14 -8.6 3.74e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.2426864795328788e+01 1.2426864795328787e+0
4
Dual infeasibility......: 2.5091040356528538e-14 2.5091040356528538e-1
1
Constraint violation....: 5.1908169667518470e-15 5.1908169667518470e-1
5
Complementarity.........: 2.5416241306658326e-09 2.5416241306658327e-0
6
Overall NLP error.......: 2.5416241306658326e-09 2.5416241306658327e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0891076e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.80e-0
3h 1
2 9.0602418e+02 9.19e+03 5.23e+01 -1.0 8.41e+03 - 3.92e-05 1.08e-0
4h 1
3 8.1828313e+02 9.14e+03 5.24e+01 -1.0 9.19e+03 - 1.24e-05 4.81e-0
3h 1
4 5.0911018e+02 8.95e+03 5.22e+01 -1.0 9.14e+03 - 5.53e-03 2.13e-0
2h 1
5 1.9574027e+04 7.15e-02 7.74e+01 -1.0 8.95e+03 - 8.67e-02 1.00e+0
0h 1
6 1.2972291e+04 6.39e-02 3.14e+01 -1.0 2.60e+01 - 5.69e-01 9.74e-0
2f 1
7 1.1456842e+04 1.98e-02 1.02e+01 -1.0 1.50e+01 - 6.92e-01 7.89e-0
1f 1
8 1.1617387e+04 7.35e-03 8.73e-01 -1.0 3.38e+00 - 9.93e-01 5.00e-0
1f 2
9 1.1302834e+04 1.11e-02 2.44e-01 -1.7 1.08e+01 - 9.89e-01 8.28e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1283652e+04 3.23e-03 2.73e-01 -1.7 2.97e+01 - 5.77e-01 4.83e-0
1f 2
11 1.1287941e+04 2.49e-04 2.17e-02 -1.7 1.60e+01 - 1.00e+00 1.00e+0
0h 1
12 1.1117887e+04 4.76e-04 2.47e-02 -2.5 3.42e+01 - 9.72e-01 9.46e-0
1f 1
13 1.1087696e+04 1.32e-04 7.36e-02 -3.8 7.16e+00 - 9.83e-01 8.43e-0
1h 1
14 1.1084764e+04 1.83e-07 8.11e-02 -3.8 1.12e+00 - 9.34e-01 1.00e+0
0h 1
15 1.1084687e+04 4.63e-09 2.68e-05 -3.8 1.63e-04 - 1.00e+00 1.00e+0
0h 1
16 1.1083373e+04 1.92e-08 3.89e-03 -5.7 2.97e-01 - 1.00e+00 9.68e-0
1f 1
17 1.1083337e+04 5.76e-12 2.63e-08 -5.7 9.61e-03 - 1.00e+00 1.00e+0
0f 1
18 1.1083321e+04 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1083320759637038e+01 1.1083320759637038e+0
4
Dual infeasibility......: 4.4780431432669336e-09 4.4780431432669336e-0
6
Constraint violation....: 2.6338028979999706e-12 2.6338028979999706e-1
2
Complementarity.........: 3.6085483292902998e-09 3.6085483292902999e-0
6
Overall NLP error.......: 4.4780431432669336e-09 4.4780431432669336e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2297256e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1839350e+02 6.70e+03 5.23e+01 -1.0 3.55e+03 - 1.59e-05 1.87e-0
4h 1
3 4.2760061e+02 6.55e+03 5.24e+01 -1.0 6.70e+03 - 9.50e-05 2.35e-0
2f 1
4 1.9355175e+04 6.81e-02 7.97e+01 -1.0 6.55e+03 - 3.79e-02 1.00e+0
0h 1
5 1.1061879e+04 6.45e-02 5.90e+01 -1.0 2.11e+01 - 2.57e-01 4.96e-0
2f 1
6 9.8072523e+03 1.56e-02 2.61e+01 -1.0 1.02e+01 - 5.86e-01 7.85e-0
1f 1
7 9.7742726e+03 7.07e-03 2.93e-01 -1.0 1.99e+00 - 9.89e-01 1.00e+0
0f 1
8 9.3946958e+03 1.63e-03 9.33e-02 -1.7 4.64e+00 - 1.00e+00 9.64e-0
1f 1
9 9.2433018e+03 1.79e-03 5.23e-01 -2.5 6.41e+00 - 1.00e+00 7.49e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.2120625e+03 3.25e-04 1.02e-01 -2.5 1.60e+00 - 1.00e+00 8.95e-0
1h 1
11 9.2152286e+03 1.17e-05 4.05e-03 -2.5 1.68e-01 - 1.00e+00 1.00e+0
0f 1
12 9.1851601e+03 1.05e-05 7.92e-03 -3.8 1.07e+01 - 1.00e+00 9.61e-0
1f 1
13 9.1844595e+03 1.57e-08 1.35e-05 -3.8 4.10e-01 - 1.00e+00 1.00e+0
0f 1
14 9.1828192e+03 1.79e-08 5.06e-06 -5.7 5.94e-01 - 1.00e+00 1.00e+0
0f 1
15 9.1828008e+03 6.40e-13 4.11e-10 -8.6 7.36e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 9.1828007915962306e+00 9.1828007915962298e+0
3
Dual infeasibility......: 4.1142332553177047e-10 4.1142332553177047e-0
7
Constraint violation....: 6.4021010715009652e-13 6.4021010715009652e-1
3
Complementarity.........: 3.0323561543237261e-09 3.0323561543237262e-0
6
Overall NLP error.......: 3.0323561543237261e-09 3.0323561543237262e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0887653e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0575715e+02 4.77e+03 5.23e+01 -1.0 4.05e+03 - 4.23e-05 1.17e-0
4h 1
3 6.7332429e+02 4.72e+03 5.24e+01 -1.0 4.77e+03 - 2.39e-05 1.03e-0
2f 1
4 4.3700838e+02 4.62e+03 5.18e+01 -1.0 4.72e+03 - 1.38e-02 2.11e-0
2h 1
5 1.3037790e+04 7.91e-02 7.80e+01 -1.0 4.62e+03 - 9.53e-02 1.00e+0
0h 1
6 8.3073582e+03 6.95e-02 2.11e+01 -1.0 2.25e+01 - 7.07e-01 1.14e-0
1f 1
7 6.9813418e+03 1.49e-02 1.23e+00 -1.0 1.41e+01 - 9.43e-01 7.79e-0
1f 1
8 7.2864194e+03 1.03e-02 7.99e-01 -1.0 4.36e+00 - 3.34e-01 9.21e-0
1f 1
9 7.5270952e+03 2.60e-03 1.31e+00 -1.0 6.35e+00 - 5.76e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.4990656e+03 8.53e-04 1.26e-01 -1.0 1.39e+01 - 6.18e-01 1.00e+0
0f 1
11 6.9215707e+03 2.17e-03 8.36e-02 -1.7 2.67e+00 - 1.00e+00 1.00e+0
0f 1
12 6.7204016e+03 2.03e-03 1.57e-01 -2.5 2.16e+01 - 8.84e-01 7.87e-0
1f 1
13 6.6907278e+03 1.84e-04 5.56e-03 -2.5 4.54e+00 - 1.00e+00 1.00e+0
0h 1
14 6.6726009e+03 5.06e-05 1.82e-01 -3.8 5.36e+00 - 1.00e+00 7.38e-0
1h 1
15 6.6672678e+03 1.79e-07 3.70e-04 -3.8 1.40e+00 - 1.00e+00 1.00e+0
0f 1
16 6.6659003e+03 2.69e-08 9.29e-04 -5.7 2.97e-01 - 1.00e+00 9.86e-0
1h 1
17 6.6658859e+03 1.86e-12 1.31e-08 -5.7 4.25e-03 - 1.00e+00 1.00e+0
0f 1
18 6.6658693e+03 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 6.6658693440029593e+00 6.6658693440029592e+0
3
Dual infeasibility......: 4.4777019822168871e-09 4.4777019822168871e-0
6
Constraint violation....: 2.6305346789712303e-12 2.6305346789712303e-1
2
Complementarity.........: 3.6085027507459268e-09 3.6085027507459267e-0
6
Overall NLP error.......: 4.4777019822168871e-09 4.4777019822168871e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9469463e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3h 1
2 8.9070845e+02 3.24e+03 5.24e+01 -1.0 2.13e+03 - 3.61e-05 1.51e-0
4h 1
3 3.3042115e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 6.40e-05 2.31e-0
2f 1
4 1.5680539e+04 6.28e-02 8.02e+01 -1.0 3.17e+03 - 3.82e-02 1.00e+0
0h 1
5 7.1096018e+03 5.94e-02 5.80e+01 -1.0 5.03e+01 - 2.72e-01 4.93e-0
2f 1
6 5.7281758e+03 2.48e-02 2.85e+01 -1.0 2.32e+01 - 5.13e-01 5.39e-0
1f 1
7 5.1166765e+03 1.01e-02 1.45e+00 -1.0 8.86e+00 - 9.34e-01 7.73e-0
1f 1
8 5.4253179e+03 3.01e-04 8.56e-02 -1.0 3.30e+00 - 9.98e-01 1.00e+0
0f 1
9 4.7994319e+03 2.08e-03 7.85e-02 -2.5 4.57e+00 - 8.62e-01 8.55e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.6288662e+03 2.21e-03 3.37e-01 -2.5 1.17e+00 - 1.00e+00 7.83e-0
1f 1
11 4.6027978e+03 1.46e-04 4.56e-03 -2.5 2.76e-01 - 1.00e+00 1.00e+0
0h 1
12 4.5779309e+03 2.16e-05 4.20e-02 -3.8 8.05e+00 - 1.00e+00 8.86e-0
1h 1
13 4.5759312e+03 5.62e-08 5.97e-04 -3.8 9.13e-01 - 1.00e+00 1.00e+0
0f 1
14 4.5743283e+03 4.27e-08 6.33e-05 -5.7 4.46e-01 - 1.00e+00 9.98e-0
1f 1
15 4.5743286e+03 1.89e-12 1.37e-08 -5.7 1.04e-03 - 1.00e+00 1.00e+0
0f 1
16 4.5743102e+03 2.57e-12 3.30e-06 -8.6 5.53e-03 - 1.00e+00 9.99e-0
1f 1
17 4.5743102e+03 1.64e-15 4.87e-14 -8.6 2.57e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 4.5743102087116956e+00 4.5743102087116959e+0
3
Dual infeasibility......: 4.8650230472989963e-14 4.8650230472989963e-1
1
Constraint violation....: 1.6377202834753994e-15 1.6377202834753994e-1
5
Complementarity.........: 2.7395766325327458e-09 2.7395766325327460e-0
6
Overall NLP error.......: 2.7395766325327458e-09 2.7395766325327460e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4507754e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 3.98e-04 9.82e-0
3h 1
2 8.3905718e+02 2.00e+03 5.24e+01 -1.0 1.11e+03 - 4.51e-05 2.23e-0
4h 1
3 2.7524753e+02 1.95e+03 5.26e+01 -1.0 2.00e+03 - 1.49e-04 2.18e-0
2f 1
4 1.3935346e+04 5.68e-02 8.10e+01 -1.0 1.95e+03 - 4.47e-02 1.00e+0
0h 1
5 5.1622871e+03 5.33e-02 5.36e+01 -1.0 8.19e+01 - 3.31e-01 5.50e-0
2f 1
6 3.0125711e+03 3.35e-02 2.96e+01 -1.0 4.24e+01 - 4.60e-01 5.40e-0
1f 1
7 4.0558493e+03 1.30e-02 1.19e+01 -1.0 2.42e+01 - 5.72e-01 5.00e-0
1f 2
8 3.1610499e+03 5.79e-03 5.49e-01 -1.0 1.08e+01 - 9.57e-01 1.00e+0
0f 1
9 2.8018544e+03 1.34e-03 3.59e-01 -1.7 6.29e+00 - 1.00e+00 8.29e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8142575e+03 6.86e-04 7.57e-02 -1.7 7.79e+01 - 7.94e-01 1.00e+0
0f 1
11 2.6306893e+03 1.16e-03 7.95e-02 -2.5 6.99e+01 - 8.89e-01 1.00e+0
0f 1
12 2.6070223e+03 2.06e-03 2.03e-02 -2.5 1.52e+00 - 1.00e+00 1.00e+0
0h 1
13 2.5850072e+03 5.47e-04 1.84e-01 -3.8 1.07e+01 - 1.00e+00 7.52e-0
1h 1
14 2.5809385e+03 1.37e-06 4.00e-04 -3.8 2.65e+00 - 1.00e+00 1.00e+0
0h 1
15 2.5794809e+03 2.90e-07 2.31e-03 -5.7 5.94e-01 - 1.00e+00 9.77e-0
1h 1
16 2.5794622e+03 3.57e-11 2.24e-08 -5.7 1.38e-02 - 1.00e+00 1.00e+0
0f 1
17 2.5794438e+03 6.30e-11 4.40e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 2.5794437897572529e+00 2.5794437897572529e+0
3
Dual infeasibility......: 4.3996860703505718e-09 4.3996860703505718e-0
6
Constraint violation....: 6.3014635176550371e-11 6.3014635176550371e-1
1
Complementarity.........: 3.8087728869322594e-09 3.8087728869322593e-0
6
Overall NLP error.......: 4.3996860703505718e-09 4.3996860703505718e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0755134e+02 9.17e+02 5.23e+01 -1.0 9.23e+02 - 9.83e-04 9.85e-0
3h 1
2 8.9427727e+02 9.17e+02 5.23e+01 -1.0 7.35e+02 - 6.82e-05 4.96e-0
4h 1
3 2.8404934e+02 8.96e+02 5.24e+01 -1.0 9.17e+02 - 4.56e-04 2.32e-0
2f 1
4 1.3280110e+04 6.56e-02 7.63e+01 -1.0 8.96e+02 - 8.29e-02 1.00e+0
0h 1
5 4.8509883e+03 5.91e-02 3.94e+01 -1.0 3.06e+01 - 4.58e-01 8.92e-0
2f 1
6 3.3653772e+03 1.99e-02 1.64e+01 -1.0 1.57e+01 - 6.06e-01 7.19e-0
1f 1
7 3.4007513e+03 5.46e-03 2.54e-01 -1.0 2.17e+00 - 9.86e-01 1.00e+0
0f 1
8 2.9900457e+03 1.47e-03 1.25e-01 -1.7 5.37e+00 - 1.00e+00 1.00e+0
0f 1
9 2.8401078e+03 1.97e-03 4.40e-01 -2.5 5.46e+00 - 1.00e+00 7.77e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8144788e+03 1.74e-04 5.27e-03 -2.5 1.12e+00 - 1.00e+00 1.00e+0
0h 1
11 2.7920556e+03 4.42e-05 1.53e-01 -3.8 1.08e+01 - 1.00e+00 7.56e-0
1h 1
12 2.7859604e+03 1.45e-07 4.11e-04 -3.8 2.60e+00 - 1.00e+00 1.00e+0
0f 1
13 2.7842874e+03 2.93e-08 8.23e-04 -5.7 5.94e-01 - 1.00e+00 9.87e-0
1f 1
14 2.7842702e+03 1.88e-12 1.45e-08 -5.7 7.91e-03 - 1.00e+00 1.00e+0
0f 1
15 2.7842499e+03 2.63e-12 5.21e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 2.7842498860217395e+00 2.7842498860217393e+0
3
Dual infeasibility......: 5.2114019158803460e-09 5.2114019158803460e-0
6
Constraint violation....: 2.6305208011834225e-12 2.6305208011834225e-1
2
Complementarity.........: 3.7936514034693581e-09 3.7936514034693581e-0
6
Overall NLP error.......: 5.2114019158803460e-09 5.2114019158803460e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254149628e-01 6.4890146254149624e+0
2
Dual infeasibility......: 4.9126604771011773e-09 4.9126604771011773e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646095252178684e-09 4.3646095252178681e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126604771011773e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933498e-01 5.8277753147933493e+0
2
Dual infeasibility......: 2.1031320943161440e-09 2.1031320943161440e-0
6
Constraint violation....: 6.2994567895380271e-11 6.2994567895380271e-1
1
Complementarity.........: 2.8882108896910881e-09 2.8882108896910880e-0
6
Overall NLP error.......: 2.8882108896910881e-09 2.8882108896910880e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254149628e-01 6.4890146254149624e+0
2
Dual infeasibility......: 4.9126604771011773e-09 4.9126604771011773e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646095252178684e-09 4.3646095252178681e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126604771011773e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.05e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.11e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281623748e+00 1.6104063281623748e+0
3
Dual infeasibility......: 2.4577558291915276e-12 2.4577558291915276e-0
9
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5062163910051650e-09 2.5062163910051649e-0
6
Overall NLP error.......: 2.5062163910051650e-09 2.5062163910051649e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2234330e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 3.29e-04 9.86e-0
3h 1
2 8.0850622e+02 9.17e+02 5.24e+01 -1.0 7.37e+02 - 8.13e-05 5.03e-0
4h 1
3 2.4208547e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 4.72e-04 2.11e-0
2f 1
4 1.2483864e+04 5.50e-02 8.24e+01 -1.0 8.98e+02 - 3.81e-02 1.00e+0
0h 1
5 3.8884938e+03 5.25e-02 5.69e+01 -1.0 8.15e+01 - 3.07e-01 4.97e-0
2f 1
6 1.9109572e+03 3.75e-02 3.05e+01 -1.0 3.91e+01 - 4.68e-01 5.05e-0
1f 1
7 4.6824055e+03 1.22e-02 2.71e+01 -1.0 2.06e+01 - 4.00e-01 1.00e+0
0h 1
8 1.8756795e+03 1.20e-02 1.03e+00 -1.0 2.55e+01 - 9.88e-01 8.91e-0
1f 1
9 1.9982547e+03 1.92e-04 4.73e-02 -1.0 3.03e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7319189e+03 2.18e-04 1.23e+00 -2.5 1.85e+01 - 9.37e-01 5.95e-0
1f 1
11 1.5438679e+03 3.77e-03 1.33e-01 -2.5 7.58e+00 - 7.97e-01 1.00e+0
0f 1
12 1.5209377e+03 5.20e-03 3.06e-01 -2.5 1.81e+00 - 1.00e+00 7.69e-0
1h 1
13 1.5332266e+03 2.42e-04 4.66e-03 -2.5 7.13e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5031328e+03 1.70e-04 2.13e-02 -3.8 1.35e+01 - 9.90e-01 9.30e-0
1h 1
15 1.5019710e+03 7.23e-07 6.84e-05 -3.8 9.12e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003147e+03 3.77e-07 1.76e-04 -5.7 7.43e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.79e-11 2.93e-09 -5.7 3.98e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932776819680e+00 1.5002932776819680e+0
3
Dual infeasibility......: 2.1693828544646626e-09 2.1693828544646626e-0
6
Constraint violation....: 6.2995775262919551e-11 6.2995775262919551e-1
1
Complementarity.........: 2.8882170436097991e-09 2.8882170436097992e-0
6
Overall NLP error.......: 2.8882170436097991e-09 2.8882170436097992e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
1 8.6486409e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 4.93e-04 9.86e-0
3h 1
2 8.4983133e+02 9.17e+02 5.24e+01 -1.0 7.54e+02 - 7.95e-05 5.55e-0
4h 1
3 2.6208314e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 5.24e-04 2.21e-0
2h 1
4 1.2837699e+04 5.95e-02 8.02e+01 -1.0 8.97e+02 - 4.99e-02 1.00e+0
0h 1
5 4.2800722e+03 5.56e-02 5.36e+01 -1.0 7.38e+01 - 3.21e-01 5.97e-0
2f 1
95 1.507590e+04 1.632511e+04 7.017756e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2434425e+02 1.57e+04 5.24e+01 -1.0 1.59e+04 - 3.31e-04 9.80e-0
3h 1
2 8.2149281e+02 1.57e+04 5.24e+01 -1.0 1.51e+04 - 4.66e-05 1.03e-0
4h 1
3 8.1824283e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 6.21e-06 2.61e-0
4h 1
4 8.1442198e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 2.65e-04 3.13e-0
4h 1
5 5.6538018e+02 1.54e+04 5.26e+01 -1.0 1.57e+04 - 6.12e-04 2.12e-0
2f 1
6 2.7118666e+04 5.53e-02 8.24e+01 -1.0 1.54e+04 - 3.88e-02 1.00e+0
0h 1
7 1.8701849e+04 5.28e-02 5.52e+01 -1.0 7.99e+01 - 3.27e-01 5.05e-0
2f 1
8 1.6733309e+04 3.72e-02 2.94e+01 -1.0 3.93e+01 - 4.71e-01 5.03e-0
1f 1
9 1.7077363e+04 2.28e-02 1.35e+01 -1.0 2.05e+01 - 4.02e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6824142e+04 6.01e-03 3.85e-01 -1.0 4.88e+00 - 9.79e-01 1.00e+0
0h 1
11 1.6517738e+04 1.43e-03 4.05e-01 -1.7 5.53e+00 - 1.00e+00 8.25e-0
1f 1
12 1.6481357e+04 9.08e-04 1.46e-02 -1.7 2.28e+01 - 1.00e+00 1.00e+0
0f 1
13 1.6352940e+04 1.35e-03 6.65e-02 -3.8 2.74e+01 - 7.88e-01 8.84e-0
1f 1
14 1.6325796e+04 1.70e-03 6.96e-02 -3.8 1.90e+00 - 8.40e-01 7.64e-0
1h 1
15 1.6326013e+04 3.82e-06 9.25e-04 -3.8 3.67e-02 - 1.00e+00 1.00e+0
0h 1
16 1.6325125e+04 2.36e-07 7.86e-04 -5.7 1.49e-01 - 1.00e+00 9.86e-0
1h 1
17 1.6325118e+04 3.40e-11 7.11e-09 -5.7 2.73e-01 - 1.00e+00 1.00e+0
0f 1
18 1.6325105e+04 6.30e-11 2.17e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.6325105278441647e+01 1.6325105278441646e+0
4
Dual infeasibility......: 2.1734365776751423e-09 2.1734365776751423e-0
6
Constraint violation....: 6.2999383487749583e-11 6.2999383487749583e-1
1
Complementarity.........: 2.8880911774208306e-09 2.8880911774208305e-0
6
Overall NLP error.......: 2.8880911774208306e-09 2.8880911774208305e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9087372e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 6.99e-04 9.80e-0
3h 1
2 8.8800474e+02 1.50e+04 5.24e+01 -1.0 1.35e+04 - 2.70e-05 1.10e-0
4h 1
3 8.8550432e+02 1.50e+04 5.24e+01 -1.0 1.49e+04 - 1.36e-05 1.98e-0
4h 1
4 8.7705060e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 2.09e-04 6.78e-0
4h 1
5 6.0560174e+02 1.46e+04 5.24e+01 -1.0 1.50e+04 - 9.11e-04 2.26e-0
2f 1
6 2.6880401e+04 6.35e-02 7.84e+01 -1.0 1.46e+04 - 6.55e-02 1.00e+0
0h 1
7 1.8609944e+04 5.83e-02 4.96e+01 -1.0 5.38e+01 - 3.51e-01 7.39e-0
2f 1
8 1.7311492e+04 2.87e-02 2.22e+01 -1.0 2.54e+01 - 5.41e-01 4.67e-0
1f 1
9 1.6727527e+04 8.13e-03 1.17e+00 -1.0 9.72e+00 - 9.29e-01 7.61e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7003288e+04 3.18e-04 1.31e-01 -1.0 3.27e+00 - 9.30e-01 1.00e+0
0f 1
11 1.6402248e+04 1.50e-03 8.74e-01 -1.7 6.16e+00 - 5.05e-01 1.00e+0
0f 1
12 1.6374706e+04 3.54e-04 3.40e-01 -1.7 9.12e+00 - 7.24e-01 1.00e+0
0h 1
13 1.6373655e+04 8.19e-05 3.32e-02 -1.7 1.42e+01 - 9.04e-01 1.00e+0
0h 1
14 1.6187058e+04 5.66e-04 2.18e-02 -2.5 2.61e+01 - 9.70e-01 9.98e-0
1f 1
15 1.6176560e+04 3.52e-04 1.27e+00 -3.8 5.99e+00 - 9.84e-01 3.92e-0
1h 1
16 1.6170876e+04 1.95e-07 2.05e-03 -3.8 3.55e+00 - 1.00e+00 1.00e+0
0h 1
17 1.6169965e+04 1.47e-05 1.32e-04 -3.8 3.34e-02 - 1.00e+00 1.00e+0
0f 1
18 1.6169049e+04 2.20e-06 6.99e-02 -5.7 2.98e-01 - 7.47e-01 9.71e-0
1h 1
19 1.6168853e+04 1.61e-05 2.81e-04 -5.7 8.57e-03 - 9.90e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6168857e+04 3.95e-09 6.58e-07 -5.7 1.02e-04 - 1.00e+00 1.00e+0
0h 1
21 1.6168841e+04 1.76e-08 2.38e-05 -8.6 3.68e-03 - 9.87e-01 9.67e-0
1h 1
22 1.6168840e+04 2.67e-12 4.93e-11 -8.6 1.20e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.6168840140309474e+01 1.6168840140309474e+0
4
Dual infeasibility......: 4.9300564090219364e-11 4.9300564090219364e-0
8
Constraint violation....: 2.6656454821250009e-12 2.6656454821250009e-1
2
Complementarity.........: 2.8590081942951354e-09 2.8590081942951354e-0
6
Overall NLP error.......: 2.8590081942951354e-09 2.8590081942951354e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0892329e+02 1.39e+04 5.23e+01 -1.0 1.40e+04 - 1.00e-03 9.80e-0
3h 1
2 9.0612191e+02 1.39e+04 5.23e+01 -1.0 1.31e+04 - 3.81e-05 1.05e-0
4h 1
3 8.6393760e+02 1.39e+04 5.23e+01 -1.0 1.39e+04 - 8.19e-06 3.12e-0
3h 1
4 6.1233665e+02 1.36e+04 5.23e+01 -1.0 1.39e+04 - 3.40e-03 2.18e-0
2h 1
5 2.5045205e+04 6.92e-02 7.70e+01 -1.0 1.36e+04 - 8.48e-02 1.00e+0
0h 1
6 1.7749628e+04 6.21e-02 3.45e+01 -1.0 2.73e+01 - 5.26e-01 9.36e-0
2f 1
7 1.6240639e+04 2.01e-02 1.28e+01 -1.0 1.51e+01 - 6.50e-01 7.66e-0
1f 1
8 1.6353998e+04 6.29e-03 1.05e+00 -1.0 2.61e+00 - 9.92e-01 5.00e-0
1f 2
9 1.6587974e+04 2.25e-04 5.80e-02 -1.0 4.40e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6014315e+04 2.28e-03 8.80e-02 -2.5 3.89e+01 - 8.55e-01 8.30e-0
1f 1
11 1.5845609e+04 2.12e-03 4.46e-01 -2.5 6.47e+00 - 1.00e+00 7.52e-0
1f 1
12 1.5817010e+04 1.51e-04 4.78e-03 -2.5 1.60e+00 - 1.00e+00 1.00e+0
0h 1
13 1.5798456e+04 4.03e-05 1.57e-01 -3.8 5.36e+00 - 1.00e+00 7.54e-0
1h 1
14 1.5793526e+04 1.40e-07 3.53e-04 -3.8 1.32e+00 - 1.00e+00 1.00e+0
0f 1
15 1.5792153e+04 2.80e-08 9.33e-04 -5.7 2.97e-01 - 1.00e+00 9.86e-0
1h 1
16 1.5792139e+04 1.87e-12 1.34e-08 -5.7 4.29e-03 - 1.00e+00 1.00e+0
0f 1
17 1.5792122e+04 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5792122224548999e+01 1.5792122224548999e+0
4
Dual infeasibility......: 4.4776945338127602e-09 4.4776945338127602e-0
6
Constraint violation....: 2.6306110068041733e-12 2.6306110068041733e-1
2
Complementarity.........: 3.6084997590012909e-09 3.6084997590012908e-0
6
Overall NLP error.......: 4.4776945338127602e-09 4.4776945338127602e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8071586e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.97e-04 9.81e-0
3h 1
2 8.7764109e+02 1.26e+04 5.24e+01 -1.0 1.03e+04 - 2.17e-05 1.21e-0
4h 1
3 8.4646661e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 2.59e-05 2.08e-0
3h 1
4 5.5082515e+02 1.23e+04 5.24e+01 -1.0 1.26e+04 - 2.09e-03 2.17e-0
2h 1
5 2.4013571e+04 6.31e-02 8.13e+01 -1.0 1.23e+04 - 3.75e-02 1.00e+0
0h 1
6 1.6233900e+04 5.96e-02 5.43e+01 -1.0 5.76e+01 - 3.27e-01 4.99e-0
2f 1
7 1.4693951e+04 2.64e-02 2.72e+01 -1.0 2.97e+01 - 5.01e-01 5.17e-0
1f 1
8 1.4015195e+04 9.97e-03 1.97e+00 -1.0 9.94e+00 - 9.27e-01 9.15e-0
1f 1
9 1.4473705e+04 3.11e-04 1.18e-01 -1.0 4.42e+00 - 9.63e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3746549e+04 1.49e-03 7.42e-02 -2.5 6.40e+00 - 8.67e-01 8.67e-0
1f 1
11 1.3728804e+04 8.54e-06 1.38e-02 -2.5 2.44e+00 - 1.00e+00 1.00e+0
0h 1
12 1.3696813e+04 6.70e-04 7.96e-02 -3.8 8.02e+00 - 6.70e-01 9.95e-0
1f 1
13 1.3694433e+04 1.36e-03 4.26e-03 -3.8 4.39e-01 - 8.90e-01 1.00e+0
0h 1
14 1.3694403e+04 1.43e-04 1.48e-04 -3.8 1.75e-02 - 1.00e+00 1.00e+0
0h 1
15 1.3692884e+04 1.49e-04 1.22e-03 -5.7 4.52e-01 - 9.13e-01 1.00e+0
0h 1
16 1.3692839e+04 4.03e-05 9.76e-06 -5.7 9.35e-03 - 1.00e+00 1.00e+0
0h 1
17 1.3692842e+04 8.14e-07 6.08e-06 -5.7 1.31e-03 - 1.00e+00 1.00e+0
0h 1
18 1.3692827e+04 6.30e-08 6.70e-05 -8.6 5.53e-03 - 1.00e+00 9.41e-0
1h 1
19 1.3692826e+04 8.72e-12 8.93e-11 -8.6 3.28e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.3692825545622133e+01 1.3692825545622132e+0
4
Dual infeasibility......: 8.9311135518789652e-11 8.9311135518789652e-0
8
Constraint violation....: 8.7153617656099414e-12 8.7153617656099414e-1
2
Complementarity.........: 3.3937807906028329e-09 3.3937807906028329e-0
6
Overall NLP error.......: 3.3937807906028329e-09 3.3937807906028329e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9481942e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 7.48e-04 9.80e-0
3h 1
2 8.9197823e+02 1.11e+04 5.24e+01 -1.0 1.04e+04 - 4.18e-05 1.06e-0
4h 1
3 8.3527076e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 9.63e-06 3.46e-0
3h 1
4 5.3623938e+02 1.08e+04 5.23e+01 -1.0 1.11e+04 - 3.85e-03 2.15e-0
2h 1
5 2.1933098e+04 6.71e-02 7.79e+01 -1.0 1.08e+04 - 8.01e-02 1.00e+0
0h 1
6 1.4673675e+04 6.05e-02 4.23e+01 -1.0 4.53e+01 - 4.37e-01 8.94e-0
2f 1
7 1.3327687e+04 2.86e-02 1.56e+01 -1.0 2.13e+01 - 6.21e-01 5.45e-0
1f 1
8 1.3017486e+04 4.21e-03 8.87e-01 -1.0 6.85e+00 - 9.49e-01 7.63e-0
1f 1
9 1.3264412e+04 1.26e-04 5.69e-02 -1.0 6.42e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2672550e+04 2.20e-03 8.22e-02 -2.5 3.95e+00 - 8.61e-01 8.47e-0
1f 1
11 1.2504071e+04 2.15e-03 3.45e-01 -2.5 8.59e-01 - 1.00e+00 7.80e-0
1f 1
12 1.2479357e+04 1.51e-04 4.63e-03 -2.5 1.73e-01 - 1.00e+00 1.00e+0
0h 1
13 1.2456714e+04 2.21e-05 3.94e-02 -3.8 5.36e+00 - 1.00e+00 8.88e-0
1h 1
14 1.2455033e+04 5.68e-08 6.01e-04 -3.8 5.99e-01 - 1.00e+00 1.00e+0
0f 1
15 1.2453577e+04 4.28e-08 3.91e-05 -5.7 2.97e-01 - 1.00e+00 9.98e-0
1f 1
16 1.2453579e+04 1.88e-12 1.19e-08 -5.7 4.73e-04 - 1.00e+00 1.00e+0
0f 1
17 1.2453562e+04 2.57e-12 3.30e-06 -8.6 3.68e-03 - 1.00e+00 9.99e-0
1f 1
18 1.2453562e+04 1.65e-15 4.85e-14 -8.6 2.15e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.2453562317485407e+01 1.2453562317485406e+0
4
Dual infeasibility......: 4.8547993354719631e-14 4.8547993354719631e-1
1
Constraint violation....: 1.6506470121021248e-15 1.6506470121021248e-1
5
Complementarity.........: 2.5383626084279790e-09 2.5383626084279791e-0
6
Overall NLP error.......: 2.5383626084279790e-09 2.5383626084279791e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0890313e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0580412e+02 9.19e+03 5.23e+01 -1.0 7.60e+03 - 2.53e-05 1.20e-0
4h 1
3 6.0977209e+02 9.04e+03 5.24e+01 -1.0 9.19e+03 - 2.50e-05 1.62e-0
2h 1
4 7.3775705e+02 8.79e+03 5.16e+01 -1.0 9.04e+03 - 1.91e-02 2.80e-0
2h 1
5 1.6473461e+04 8.05e-02 7.71e+01 -1.0 8.79e+03 - 1.08e-01 1.00e+0
0h 1
6 1.2523401e+04 6.93e-02 1.94e+01 -1.0 2.11e+01 - 7.28e-01 1.32e-0
1f 1
7 1.1378990e+04 1.42e-02 9.47e-01 -1.0 1.26e+01 - 9.48e-01 8.00e-0
1f 1
8 1.1688198e+04 1.32e-02 5.55e-01 -1.0 5.96e+00 - 4.04e-01 9.06e-0
1f 1
9 1.1282650e+04 2.81e-03 2.59e-01 -1.7 2.71e+00 - 8.78e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1258167e+04 8.32e-04 5.65e-01 -1.7 1.14e+01 - 6.03e-01 1.00e+0
0h 1
11 1.1290596e+04 7.37e-06 5.83e-02 -1.7 1.69e+01 - 9.18e-01 1.00e+0
0h 1
12 1.1122766e+04 4.83e-04 2.22e-02 -2.5 2.46e+01 - 9.73e-01 9.46e-0
1f 1
13 1.1088583e+04 1.35e-04 7.84e-02 -3.8 1.21e+01 - 9.84e-01 8.43e-0
1h 1
14 1.1084917e+04 1.75e-07 8.80e-02 -3.8 1.95e+00 - 9.30e-01 1.00e+0
0h 1
15 1.1084837e+04 4.76e-09 2.81e-05 -3.8 1.66e-04 - 1.00e+00 1.00e+0
0h 1
16 1.1083380e+04 1.92e-08 3.89e-03 -5.7 4.46e-01 - 1.00e+00 9.68e-0
1f 1
17 1.1083339e+04 5.75e-12 2.63e-08 -5.7 1.44e-02 - 1.00e+00 1.00e+0
0f 1
18 1.1083321e+04 2.63e-12 4.48e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1083320761523694e+01 1.1083320761523693e+0
4
Dual infeasibility......: 4.4780427850943932e-09 4.4780427850943932e-0
6
Constraint violation....: 2.6337196312731237e-12 2.6337196312731237e-1
2
Complementarity.........: 3.6085482512515455e-09 3.6085482512515456e-0
6
Overall NLP error.......: 4.4780427850943932e-09 4.4780427850943932e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0888295e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0557265e+02 6.71e+03 5.23e+01 -1.0 5.21e+03 - 2.69e-05 1.27e-0
4h 1
3 4.1986899e+02 6.55e+03 5.24e+01 -1.0 6.70e+03 - 3.43e-05 2.35e-0
2f 1
4 1.9285646e+04 6.51e-02 8.06e+01 -1.0 6.55e+03 - 2.96e-02 1.00e+0
0h 1
5 1.0827936e+04 6.21e-02 6.35e+01 -1.0 3.91e+01 - 2.12e-01 4.20e-0
2f 1
6 9.5566169e+03 2.07e-02 3.00e+01 -1.0 1.63e+01 - 5.39e-01 6.15e-0
1f 1
7 9.1167531e+03 6.69e-03 9.63e-01 -1.0 5.59e+00 - 9.55e-01 7.70e-0
1f 1
8 9.3796749e+03 2.25e-04 7.32e-02 -1.0 4.69e+00 - 9.80e-01 1.00e+0
0f 1
9 8.8173187e+03 2.07e-03 8.47e-02 -2.5 3.16e+00 - 8.56e-01 8.39e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.6549969e+03 2.15e-03 4.35e-01 -2.5 1.86e+00 - 1.00e+00 7.56e-0
1f 1
11 8.6280942e+03 1.35e-04 4.75e-03 -2.5 7.91e-01 - 1.00e+00 1.00e+0
0h 1
12 8.6073626e+03 3.61e-05 1.51e-01 -3.8 8.04e+00 - 1.00e+00 7.57e-0
1h 1
13 8.6018717e+03 1.31e-07 3.46e-04 -3.8 1.95e+00 - 1.00e+00 1.00e+0
0f 1
14 8.6003514e+03 2.83e-08 9.58e-04 -5.7 4.46e-01 - 1.00e+00 9.85e-0
1h 1
15 8.6003344e+03 1.87e-12 1.36e-08 -5.7 6.56e-03 - 1.00e+00 1.00e+0
0f 1
16 8.6003159e+03 2.63e-12 4.48e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 8.6003159378132619e+00 8.6003159378132623e+0
3
Dual infeasibility......: 4.4776944233926982e-09 4.4776944233926982e-0
6
Constraint violation....: 2.6307497846822514e-12 2.6307497846822514e-1
2
Complementarity.........: 3.6084986431125862e-09 3.6084986431125860e-0
6
Overall NLP error.......: 4.4776944233926982e-09 4.4776944233926982e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8772454e+02 4.77e+03 5.24e+01 -1.0 4.82e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8463069e+02 4.77e+03 5.24e+01 -1.0 4.12e+03 - 4.65e-05 1.15e-0
4h 1
3 6.9026545e+02 4.73e+03 5.24e+01 -1.0 4.77e+03 - 2.20e-05 8.53e-0
3f 1
4 4.0829907e+02 4.63e+03 5.20e+01 -1.0 4.73e+03 - 1.12e-02 2.07e-0
2h 1
5 1.3286162e+04 7.24e-02 7.77e+01 -1.0 4.63e+03 - 9.89e-02 1.00e+0
0h 1
6 7.8843055e+03 6.35e-02 2.09e+01 -1.0 4.48e+01 - 7.03e-01 1.14e-0
1f 1
7 6.3730704e+03 2.46e-02 2.05e+00 -1.0 2.21e+01 - 9.31e-01 6.56e-0
1f 1
8 6.5551438e+03 3.66e-03 8.87e-01 -1.0 3.60e+00 - 6.21e-01 1.00e+0
0f 1
9 6.0476453e+03 1.22e-03 2.73e-01 -1.7 3.63e+00 - 8.31e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0519098e+03 6.54e-04 3.87e-01 -1.7 7.69e+00 - 6.40e-01 1.00e+0
0h 1
11 6.0603102e+03 8.44e-06 5.55e-02 -1.7 1.19e+01 - 8.13e-01 1.00e+0
0h 1
12 5.9510721e+03 1.65e-04 3.95e-01 -2.5 1.58e+01 - 1.00e+00 6.78e-0
1f 1
13 5.9402765e+03 6.32e-06 9.40e-03 -2.5 8.76e+00 - 1.00e+00 1.00e+0
0f 1
14 5.9216845e+03 9.10e-06 3.91e-02 -3.8 5.36e+00 - 8.64e-01 9.09e-0
1f 1
15 5.9184407e+03 5.07e-04 9.84e-04 -3.8 4.87e-01 - 1.00e+00 1.00e+0
0f 1
16 5.9173040e+03 5.44e-05 1.03e-02 -5.7 2.97e-01 - 8.32e-01 1.00e+0
0h 1
17 5.9171980e+03 3.17e-05 3.48e-05 -5.7 9.03e-03 - 1.00e+00 1.00e+0
0h 1
18 5.9172014e+03 4.81e-07 6.10e-06 -5.7 1.05e-03 - 1.00e+00 1.00e+0
0h 1
19 5.9171874e+03 3.25e-08 7.71e-05 -8.6 3.68e-03 - 1.00e+00 9.44e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 5.9171866e+03 7.33e-12 6.33e-11 -8.6 2.05e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 5.9171865545871078e+00 5.9171865545871078e+0
3
Dual infeasibility......: 6.3286593867785707e-11 6.3286593867785713e-0
8
Constraint violation....: 7.3292483193654334e-12 7.3292483193654334e-1
2
Complementarity.........: 2.8526907860232676e-09 2.8526907860232676e-0
6
Overall NLP error.......: 2.8526907860232676e-09 2.8526907860232676e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9465052e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 7.48e-04 9.81e-0
3h 1
2 8.8961066e+02 3.24e+03 5.24e+01 -1.0 1.65e+03 - 3.15e-05 1.94e-0
4h 1
3 3.3049321e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 1.10e-04 2.31e-0
2f 1
4 1.5661028e+04 6.29e-02 8.00e+01 -1.0 3.17e+03 - 4.12e-02 1.00e+0
0h 1
5 7.0966213e+03 5.93e-02 5.59e+01 -1.0 4.98e+01 - 2.95e-01 5.19e-0
2f 1
6 5.7201217e+03 2.49e-02 2.72e+01 -1.0 2.33e+01 - 5.16e-01 5.36e-0
1f 1
7 5.1215761e+03 9.32e-03 1.31e+00 -1.0 8.82e+00 - 9.35e-01 7.62e-0
1f 1
8 5.4190355e+03 3.08e-04 8.42e-02 -1.0 3.70e+00 - 9.97e-01 1.00e+0
0f 1
9 4.8029760e+03 2.09e-03 8.12e-02 -2.5 5.42e+00 - 8.62e-01 8.49e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.6318935e+03 2.20e-03 3.44e-01 -2.5 2.56e+00 - 1.00e+00 7.80e-0
1f 1
11 4.6055420e+03 1.53e-04 4.73e-03 -2.5 6.84e-01 - 1.00e+00 1.00e+0
0h 1
12 4.5784285e+03 2.25e-05 4.27e-02 -3.8 1.07e+01 - 1.00e+00 8.84e-0
1h 1
13 4.5760808e+03 5.70e-08 6.00e-04 -3.8 1.24e+00 - 1.00e+00 1.00e+0
0f 1
14 4.5743300e+03 4.25e-08 5.32e-05 -5.7 5.94e-01 - 1.00e+00 9.98e-0
1f 1
15 4.5743305e+03 1.88e-12 1.30e-08 -5.7 1.20e-03 - 1.00e+00 1.00e+0
0f 1
16 4.5743102e+03 2.57e-12 3.30e-06 -8.6 7.37e-03 - 1.00e+00 9.99e-0
1f 1
17 4.5743102e+03 5.46e-15 4.86e-14 -8.6 3.73e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 4.5743102060293861e+00 4.5743102060293859e+0
3
Dual infeasibility......: 4.8598002829262305e-14 4.8598002829262305e-1
1
Constraint violation....: 5.4552513090524402e-15 5.4552513090524402e-1
5
Complementarity.........: 2.6813477423767880e-09 2.6813477423767880e-0
6
Overall NLP error.......: 2.6813477423767880e-09 2.6813477423767880e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4497499e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 3.98e-04 9.83e-0
3h 1
2 8.3712376e+02 2.00e+03 5.24e+01 -1.0 1.32e+03 - 4.53e-05 2.94e-0
4h 1
3 7.9125923e+02 1.99e+03 5.24e+01 -1.0 2.00e+03 - 2.24e-04 1.77e-0
3h 1
4 2.7985115e+02 1.95e+03 5.25e+01 -1.0 1.99e+03 - 1.99e-03 2.11e-0
2f 1
5 1.2939934e+04 5.88e-02 8.13e+01 -1.0 1.95e+03 - 4.87e-02 1.00e+0
0h 1
6 5.0621633e+03 5.49e-02 4.96e+01 -1.0 7.49e+01 - 3.80e-01 5.99e-0
2f 1
7 3.0108375e+03 3.56e-02 2.59e+01 -1.0 4.18e+01 - 4.83e-01 5.27e-0
1f 1
8 3.7148862e+03 1.31e-02 4.22e+00 -1.0 1.73e+01 - 7.52e-01 5.00e-0
1f 2
9 3.1765208e+03 4.43e-03 2.51e-01 -1.0 8.16e+00 - 9.57e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8037444e+03 1.15e-03 7.53e-02 -1.7 5.83e+00 - 8.04e-01 8.17e-0
1f 1
11 2.6733636e+03 8.08e-04 3.85e-01 -2.5 5.20e+00 - 7.98e-01 1.00e+0
0f 1
12 2.5997631e+03 1.15e-02 5.45e-02 -2.5 4.19e+00 - 1.00e+00 9.88e-0
1h 1
13 2.6127925e+03 4.05e-04 9.45e-03 -2.5 2.54e+00 - 1.00e+00 1.00e+0
0f 1
14 2.5829630e+03 1.87e-04 5.59e-02 -3.8 1.28e+01 - 9.83e-01 8.64e-0
1h 1
15 2.5809108e+03 2.29e-06 1.59e-04 -3.8 1.14e+00 - 1.00e+00 1.00e+0
0h 1
16 2.5794717e+03 3.07e-07 2.18e-03 -5.7 5.57e-01 - 1.00e+00 9.77e-0
1h 1
17 2.5794622e+03 3.56e-11 2.17e-08 -5.7 4.23e-03 - 1.00e+00 1.00e+0
0f 1
18 2.5794438e+03 6.30e-11 4.40e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 2.5794437885913974e+00 2.5794437885913976e+0
3
Dual infeasibility......: 4.3996332555385692e-09 4.3996332555385692e-0
6
Constraint violation....: 6.3012525752803583e-11 6.3012525752803583e-1
1
Complementarity.........: 3.6037401267879875e-09 3.6037401267879875e-0
6
Overall NLP error.......: 4.3996332555385692e-09 4.3996332555385692e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6487057e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 4.93e-04 9.86e-0
3h 1
2 8.4983749e+02 9.17e+02 5.24e+01 -1.0 7.54e+02 - 7.95e-05 5.55e-0
4h 1
3 2.6208637e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 5.24e-04 2.21e-0
2h 1
4 1.2837754e+04 5.95e-02 8.02e+01 -1.0 8.97e+02 - 4.99e-02 1.00e+0
0h 1
5 4.2801437e+03 5.56e-02 5.36e+01 -1.0 7.38e+01 - 3.21e-01 5.97e-0
2f 1
6 2.6766787e+03 3.00e-02 2.80e+01 -1.0 3.91e+01 - 4.72e-01 4.34e-0
1f 1
7 2.1363177e+03 1.45e-02 2.60e+00 -1.0 1.10e+01 - 9.18e-01 1.00e+0
0f 1
8 2.4587380e+03 4.43e-04 8.58e-02 -1.0 4.21e+00 - 9.95e-01 1.00e+0
0f 1
9 1.8798625e+03 6.89e-04 3.75e-01 -2.5 8.00e+00 - 8.82e-01 7.24e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8063361e+03 2.67e-04 3.48e-01 -2.5 5.70e+00 - 8.80e-01 1.00e+0
0h 1
11 1.8007699e+03 6.84e-04 4.79e-01 -2.5 1.46e+00 - 1.00e+00 1.48e-0
1h 2
12 1.7791712e+03 1.36e-03 1.37e-02 -2.5 1.01e+00 - 1.00e+00 1.00e+0
0h 1
13 1.7519746e+03 1.27e-03 3.44e-02 -3.8 1.35e+01 - 7.93e-01 1.00e+0
0h 1
14 1.7490171e+03 2.26e-03 8.91e-04 -3.8 3.96e-02 - 1.00e+00 1.00e+0
0h 1
15 1.7493790e+03 4.34e-05 1.61e-04 -3.8 1.59e-02 - 1.00e+00 1.00e+0
0h 1
16 1.7474641e+03 1.06e-04 3.72e-04 -5.7 7.43e-01 - 9.51e-01 9.77e-0
1h 1
17 1.7474439e+03 2.26e-05 3.99e-03 -5.7 1.68e-02 - 1.00e+00 7.87e-0
1h 1
18 1.7474441e+03 8.06e-09 1.16e-06 -5.7 3.57e-03 - 1.00e+00 1.00e+0
0f 1
19 1.7474222e+03 8.84e-09 2.07e-05 -8.6 9.21e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7474219e+03 1.47e-12 7.01e-11 -8.6 1.54e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.7474218530383270e+00 1.7474218530383268e+0
3
Dual infeasibility......: 7.0118319666365100e-11 7.0118319666365093e-0
8
Constraint violation....: 1.4727108421652702e-12 1.4727108421652702e-1
2
Complementarity.........: 2.5093372857307054e-09 2.5093372857307056e-0
6
Overall NLP error.......: 2.5093372857307054e-09 2.5093372857307056e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146111910985e-01 6.4890146111910985e+0
2
Dual infeasibility......: 4.9126605652925537e-09 4.9126605652925537e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984670012e-09 4.3646094984670015e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605652925537e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933498e-01 5.8277753147933493e+0
2
Dual infeasibility......: 2.1031318724752505e-09 2.1031318724752505e-0
6
Constraint violation....: 6.2994637284319310e-11 6.2994637284319310e-1
1
Complementarity.........: 2.8882108897035822e-09 2.8882108897035821e-0
6
Overall NLP error.......: 2.8882108897035822e-09 2.8882108897035821e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146111910985e-01 6.4890146111910985e+0
2
Dual infeasibility......: 4.9126605652925537e-09 4.9126605652925537e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984670012e-09 4.3646094984670015e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605652925537e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.06e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.57e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235598509e+00 1.6104063235598510e+0
3
Dual infeasibility......: 2.4574634746630151e-12 2.4574634746630151e-0
9
Constraint violation....: 7.5704760800935169e-16 7.5704760800935169e-1
6
Complementarity.........: 2.5062163919694723e-09 2.5062163919694721e-0
6
Overall NLP error.......: 2.5062163919694723e-09 2.5062163919694721e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2209113e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 3.29e-04 9.87e-0
3h 1
2 8.0324625e+02 9.17e+02 5.24e+01 -1.0 7.85e+02 - 8.88e-05 6.87e-0
4h 1
3 2.4240725e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 6.67e-04 2.10e-0
2h 1
4 1.2380514e+04 5.52e-02 8.24e+01 -1.0 8.98e+02 - 3.84e-02 1.00e+0
0h 1
5 3.8796789e+03 5.26e-02 5.61e+01 -1.0 8.06e+01 - 3.16e-01 5.00e-0
2f 1
6 1.9096207e+03 3.75e-02 3.00e+01 -1.0 3.91e+01 - 4.70e-01 5.04e-0
1f 1
7 4.6686937e+03 1.22e-02 2.67e+01 -1.0 2.05e+01 - 4.02e-01 1.00e+0
0h 1
8 1.8748493e+03 1.18e-02 1.00e+00 -1.0 2.53e+01 - 9.88e-01 8.94e-0
1f 1
9 2.0007622e+03 1.82e-04 4.63e-02 -1.0 3.23e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7349609e+03 2.15e-04 1.23e+00 -2.5 1.77e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5468553e+03 3.76e-03 1.33e-01 -2.5 7.59e+00 - 7.96e-01 1.00e+0
0f 1
12 1.5237335e+03 5.33e-03 3.08e-01 -2.5 1.83e+00 - 1.00e+00 7.68e-0
1h 1
13 1.5360586e+03 2.45e-04 4.69e-03 -2.5 7.08e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5034660e+03 1.70e-04 2.13e-02 -3.8 1.62e+01 - 9.91e-01 9.30e-0
1h 1
15 1.5021214e+03 7.20e-07 6.83e-05 -3.8 1.09e+00 - 1.00e+00 1.00e+0
0h 1
16 1.5003171e+03 3.77e-07 1.76e-04 -5.7 8.92e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003154e+03 3.79e-11 2.93e-09 -5.7 3.96e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.11e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932798595749e+00 1.5002932798595750e+0
3
Dual infeasibility......: 2.1694220898515543e-09 2.1694220898515543e-0
6
Constraint violation....: 6.2995997307524476e-11 6.2995997307524476e-1
1
Complementarity.........: 2.8882170428856951e-09 2.8882170428856948e-0
6
Overall NLP error.......: 2.8882170428856951e-09 2.8882170428856948e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
1 8.6465802e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 4.93e-04 9.87e-0
3h 1
2 8.4355561e+02 9.17e+02 5.24e+01 -1.0 8.01e+02 - 8.70e-05 7.80e-0
4h 1
3 2.6241585e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 7.62e-04 2.20e-0
2h 1
4 1.2719146e+04 5.98e-02 8.02e+01 -1.0 8.97e+02 - 5.04e-02 1.00e+0
0h 1
5 4.2680308e+03 5.58e-02 5.32e+01 -1.0 7.31e+01 - 3.26e-01 6.03e-0
2f 1
96 1.437134e+04 1.632511e+04 7.074140e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1156838e+02 1.57e+04 5.50e+01 -1.0 1.59e+04 - 1.75e-04 9.80e-0
3f 1
2 7.0871565e+02 1.57e+04 5.50e+01 -1.0 1.51e+04 - 4.88e-05 1.03e-0
4h 1
3 6.8590194e+02 1.57e+04 5.49e+01 -1.0 1.57e+04 - 5.99e-06 1.84e-0
3h 1
4 5.0412115e+02 1.54e+04 5.39e+01 -1.0 1.57e+04 - 1.96e-03 1.86e-0
2h 1
5 2.5746395e+04 7.61e-02 8.68e+01 -1.0 1.54e+04 - 2.60e-02 1.00e+0
0h 1
6 1.7881609e+04 7.32e-02 7.10e+01 -1.0 6.82e+01 - 1.90e-01 4.11e-0
2f 1
7 1.6631490e+04 4.65e-02 3.27e+01 -1.0 2.00e+01 - 5.34e-01 3.77e-0
1f 1
8 1.7128230e+04 3.51e-02 1.08e+01 -1.0 1.33e+01 - 5.66e-01 2.50e-0
1f 3
9 1.6801621e+04 7.33e-03 3.21e-01 -1.0 1.68e+00 - 9.77e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6496947e+04 7.25e-04 1.19e+00 -1.7 5.92e+00 - 3.68e-01 9.14e-0
1f 1
11 1.6483868e+04 1.79e-04 6.52e-01 -1.7 4.80e+00 - 6.02e-01 1.00e+0
0f 1
12 1.6473288e+04 1.07e-04 1.49e-01 -1.7 8.38e+00 - 7.25e-01 1.00e+0
0h 1
13 1.6372025e+04 8.97e-04 6.63e-02 -2.5 6.24e+00 - 9.11e-01 1.00e+0
0f 1
14 1.6344407e+04 1.48e-03 1.52e-02 -2.5 4.38e+00 - 1.00e+00 1.00e+0
0h 1
15 1.6328101e+04 2.57e-04 1.02e-01 -3.8 5.65e+00 - 1.00e+00 8.38e-0
1h 1
16 1.6326206e+04 6.13e-07 1.22e-04 -3.8 1.33e+00 - 1.00e+00 1.00e+0
0h 1
17 1.6325394e+04 3.81e-07 1.34e-02 -5.7 2.48e-01 - 1.00e+00 6.94e-0
1h 1
18 1.6325119e+04 3.78e-08 1.24e-06 -5.7 1.01e-01 - 1.00e+00 1.00e+0
0f 1
19 1.6325105e+04 1.70e-10 1.77e-06 -8.6 2.80e-03 - 1.00e+00 9.97e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325105e+04 3.19e-16 2.53e-14 -8.6 2.17e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.6325105279259084e+01 1.6325105279259084e+0
4
Dual infeasibility......: 2.5313084961453569e-14 2.5313084961453569e-1
1
Constraint violation....: 3.1918911957973251e-16 3.1918911957973251e-1
6
Complementarity.........: 2.5060167327794238e-09 2.5060167327794236e-0
6
Overall NLP error.......: 2.5060167327794238e-09 2.5060167327794236e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.9876944e+02 1.50e+04 5.25e+01 -1.0 1.51e+04 - 2.75e-04 9.80e-0
3f 1
2 7.9589770e+02 1.50e+04 5.25e+01 -1.0 1.43e+04 - 4.75e-05 1.03e-0
4h 1
3 7.6855772e+02 1.49e+04 5.25e+01 -1.0 1.50e+04 - 6.43e-06 2.05e-0
3h 1
4 5.4431267e+02 1.46e+04 5.26e+01 -1.0 1.49e+04 - 2.19e-03 2.00e-0
2h 1
5 2.5504371e+04 5.52e-02 8.37e+01 -1.0 1.46e+04 - 3.49e-02 1.00e+0
0h 1
6 1.7685869e+04 5.28e-02 5.75e+01 -1.0 7.44e+01 - 3.15e-01 4.82e-0
2f 1
7 1.5945344e+04 4.23e-02 2.90e+01 -1.0 3.45e+01 - 4.93e-01 4.66e-0
1f 1
8 1.6258514e+04 2.65e-02 1.21e+01 -1.0 1.78e+01 - 4.37e-01 1.25e-0
1f 4
9 1.6022809e+04 6.10e-03 1.38e-01 -1.0 4.87e+00 - 9.92e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5738177e+04 1.23e-03 2.92e-01 -1.7 6.98e+00 - 1.00e+00 8.62e-0
1f 1
11 1.5729527e+04 7.40e-04 1.21e-02 -1.7 3.35e+01 - 1.00e+00 1.00e+0
0f 1
12 1.5585586e+04 1.34e-03 9.10e-02 -3.8 3.98e+01 - 7.97e-01 9.32e-0
1f 1
13 1.5560342e+04 1.49e-03 6.43e-02 -3.8 2.69e+00 - 8.47e-01 7.71e-0
1h 1
14 1.5560316e+04 2.72e-06 7.50e-04 -3.8 6.15e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5559225e+04 3.13e-07 6.12e-04 -5.7 2.97e-01 - 1.00e+00 9.88e-0
1h 1
16 1.5559217e+04 3.91e-11 6.21e-09 -5.7 1.04e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5559202e+04 6.30e-11 2.10e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5559202163493806e+01 1.5559202163493806e+0
4
Dual infeasibility......: 2.0959924783345585e-09 2.0959924783345585e-0
6
Constraint violation....: 6.2996330374431864e-11 6.2996330374431864e-1
1
Complementarity.........: 2.8881084978706785e-09 2.8881084978706784e-0
6
Overall NLP error.......: 2.8881084978706785e-09 2.8881084978706784e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4409921e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 3.92e-04 9.80e-0
3f 1
2 8.4129502e+02 1.39e+04 5.24e+01 -1.0 1.37e+04 - 9.29e-05 1.01e-0
4h 1
3 8.3224662e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 3.09e-06 6.42e-0
4f 1
4 5.3904316e+02 1.36e+04 5.26e+01 -1.0 1.39e+04 - 6.89e-04 2.15e-0
2h 1
5 2.5524780e+04 5.72e-02 8.12e+01 -1.0 1.36e+04 - 4.53e-02 1.00e+0
0h 1
6 1.7022368e+04 5.37e-02 5.25e+01 -1.0 7.99e+01 - 3.46e-01 5.59e-0
2f 1
7 1.4909735e+04 3.42e-02 2.85e+01 -1.0 4.22e+01 - 4.65e-01 5.33e-0
1f 1
8 1.5382509e+04 1.84e-02 7.95e+00 -1.0 2.05e+01 - 5.93e-01 2.50e-0
1f 3
9 1.5063993e+04 5.25e-03 5.45e-01 -1.0 6.13e+00 - 9.52e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4709825e+04 1.46e-03 5.12e-01 -1.7 6.60e+00 - 1.00e+00 7.86e-0
1f 1
11 1.4650699e+04 7.05e-04 2.55e-02 -1.7 1.84e+01 - 1.00e+00 1.00e+0
0f 1
12 1.4510525e+04 1.45e-03 1.16e-01 -3.8 1.99e+01 - 7.66e-01 9.24e-0
1f 1
13 1.4479291e+04 2.48e-03 5.55e-02 -3.8 2.23e+00 - 8.16e-01 7.61e-0
1h 1
14 1.4480758e+04 1.88e-04 8.04e-02 -3.8 3.54e-01 - 1.00e+00 9.38e-0
1h 1
15 1.4481114e+04 4.06e-07 1.78e-05 -3.8 3.25e-02 - 1.00e+00 1.00e+0
0f 1
16 1.4480069e+04 4.15e-07 1.00e-03 -5.7 1.49e-01 - 1.00e+00 9.87e-0
1h 1
17 1.4480065e+04 4.53e-11 4.87e-09 -5.7 5.05e-03 - 1.00e+00 1.00e+0
0f 1
18 1.4480052e+04 6.30e-11 3.21e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.4480051788713109e+01 1.4480051788713108e+0
4
Dual infeasibility......: 3.2099182495558188e-09 3.2099182495558188e-0
6
Constraint violation....: 6.3005572981111868e-11 6.3005572981111868e-1
1
Complementarity.........: 2.9199720443633883e-09 2.9199720443633884e-0
6
Overall NLP error.......: 3.2099182495558188e-09 3.2099182495558188e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4410057e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.92e-04 9.80e-0
3h 1
2 8.4114528e+02 1.27e+04 5.24e+01 -1.0 1.14e+04 - 3.11e-05 1.10e-0
4h 1
3 7.3721269e+02 1.26e+04 5.25e+01 -1.0 1.26e+04 - 1.44e-05 6.77e-0
3h 1
4 5.8172523e+02 1.23e+04 5.23e+01 -1.0 1.26e+04 - 7.38e-03 2.01e-0
2h 1
5 2.1638551e+04 6.29e-02 8.13e+01 -1.0 1.23e+04 - 6.06e-02 1.00e+0
0h 1
6 1.5467214e+04 5.78e-02 3.38e+01 -1.0 6.34e+01 - 5.66e-01 7.50e-0
2f 1
7 1.3641633e+04 3.61e-02 1.30e+01 -1.0 3.98e+01 - 6.02e-01 5.09e-0
1f 1
8 1.4321924e+04 4.35e-03 7.06e-01 -1.0 8.65e+00 - 9.64e-01 1.00e+0
0f 1
9 1.3450766e+04 1.83e-03 1.04e-01 -1.7 1.16e+01 - 9.64e-01 9.26e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3309054e+04 1.28e-03 3.73e-01 -2.5 6.10e+00 - 7.74e-01 1.00e+0
0h 1
11 1.3247229e+04 1.70e-02 6.11e-02 -2.5 3.89e+00 - 9.41e-01 9.01e-0
1h 1
12 1.3260842e+04 5.52e-04 1.46e-02 -2.5 6.03e-01 - 1.00e+00 1.00e+0
0f 1
13 1.3235820e+04 2.77e-04 4.47e-02 -3.8 8.03e+00 - 9.96e-01 8.93e-0
1h 1
14 1.3234428e+04 8.05e-07 8.94e-05 -3.8 8.58e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3233075e+04 3.54e-07 8.65e-04 -5.7 4.46e-01 - 1.00e+00 9.88e-0
1h 1
16 1.3233068e+04 3.89e-11 4.82e-09 -5.7 1.74e-02 - 1.00e+00 1.00e+0
0f 1
17 1.3233051e+04 6.30e-11 3.22e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.3233050940010148e+01 1.3233050940010147e+0
4
Dual infeasibility......: 3.2181515291945421e-09 3.2181515291945421e-0
6
Constraint violation....: 6.3009750195242020e-11 6.3009750195242020e-1
1
Complementarity.........: 3.3897067951132602e-09 3.3897067951132603e-0
6
Overall NLP error.......: 3.3897067951132602e-09 3.3897067951132603e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2167912e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.44e-03 9.80e-0
3h 1
2 9.1890618e+02 1.11e+04 5.23e+01 -1.0 1.09e+04 - 7.57e-05 1.01e-0
4h 1
3 9.0224926e+02 1.11e+04 5.23e+01 -1.0 1.11e+04 - 4.33e-06 1.01e-0
3f 1
4 5.3633661e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 1.13e-03 2.30e-0
2h 1
5 2.3290320e+04 6.93e-02 7.66e+01 -1.0 1.09e+04 - 8.01e-02 1.00e+0
0h 1
6 1.5334159e+04 6.26e-02 2.41e+01 -1.0 1.49e+01 - 6.50e-01 8.78e-0
2f 1
7 1.3998157e+04 1.84e-02 1.01e+01 -1.0 1.05e+01 - 6.49e-01 8.74e-0
1f 1
8 1.4098708e+04 9.67e-03 6.81e-01 -1.0 2.91e+00 - 9.94e-01 4.83e-0
1f 2
9 1.3761551e+04 9.02e-03 2.68e-01 -1.7 8.67e+00 - 1.00e+00 8.35e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3730775e+04 2.14e-03 9.35e-01 -1.7 1.24e+01 - 1.00e+00 4.90e-0
1h 2
11 1.3724594e+04 2.11e-04 1.67e-02 -1.7 6.31e+00 - 1.00e+00 1.00e+0
0h 1
12 1.3568655e+04 4.89e-04 2.45e-02 -3.8 1.99e+01 - 8.45e-01 8.30e-0
1f 1
13 1.3550049e+04 1.57e-04 2.07e-01 -3.8 3.36e+00 - 9.88e-01 7.14e-0
1h 1
14 1.3545335e+04 4.19e-07 3.68e-04 -3.8 9.60e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3544145e+04 2.02e-08 4.56e-06 -5.7 1.49e-01 - 1.00e+00 1.00e+0
0h 1
16 1.3544132e+04 7.43e-13 5.08e-10 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.3544132006860043e+01 1.3544132006860042e+0
4
Dual infeasibility......: 5.0779230676921462e-10 5.0779230676921462e-0
7
Constraint violation....: 7.4271144789861410e-13 7.4271144789861410e-1
3
Complementarity.........: 2.6201625022360658e-09 2.6201625022360656e-0
6
Overall NLP error.......: 2.6201625022360658e-09 2.6201625022360656e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3004760e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 2.02e-03 9.81e-0
3h 1
2 9.2458171e+02 9.19e+03 5.23e+01 -1.0 5.43e+03 - 9.22e-06 2.42e-0
4h 1
3 4.8777176e+02 8.97e+03 5.24e+01 -1.0 9.19e+03 - 1.48e-04 2.34e-0
2h 1
4 2.1819681e+04 7.02e-02 7.81e+01 -1.0 8.97e+03 - 5.74e-02 1.00e+0
0h 1
5 1.3648766e+04 6.51e-02 4.65e+01 -1.0 1.06e+01 - 3.92e-01 6.72e-0
2f 1
6 1.2329076e+04 2.50e-02 1.99e+01 -1.0 6.90e+00 - 6.37e-01 1.00e+0
0f 1
7 1.2710449e+04 1.46e-03 1.70e-01 -1.0 2.42e+00 - 9.91e-01 1.00e+0
0f 1
8 1.2188895e+04 1.73e-03 6.89e-02 -1.7 7.63e+00 - 1.00e+00 1.00e+0
0f 1
9 1.2015268e+04 1.99e-03 3.42e-01 -2.5 3.07e+00 - 1.00e+00 7.99e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1992853e+04 1.62e-04 4.13e-02 -2.5 6.14e-01 - 1.00e+00 9.45e-0
1h 1
11 1.1995752e+04 6.80e-06 1.22e-03 -2.5 3.35e-02 - 1.00e+00 1.00e+0
0f 1
12 1.1965916e+04 7.60e-06 4.28e-03 -3.8 1.07e+01 - 1.00e+00 9.79e-0
1f 1
13 1.1965656e+04 1.37e-08 6.29e-06 -3.8 2.27e-01 - 1.00e+00 1.00e+0
0f 1
14 1.1964018e+04 1.73e-08 3.04e-06 -5.7 5.94e-01 - 1.00e+00 1.00e+0
0f 1
15 1.1963999e+04 1.28e-12 4.22e-10 -8.6 7.36e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.1963999158992959e+01 1.1963999158992958e+0
4
Dual infeasibility......: 4.2179926656255314e-10 4.2179926656255314e-0
7
Constraint violation....: 1.2798789805756883e-12 1.2798789805756883e-1
2
Complementarity.........: 2.9164966487321743e-09 2.9164966487321741e-0
6
Overall NLP error.......: 2.9164966487321743e-09 2.9164966487321741e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3709613e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 3.06e-03 9.81e-0
3h 1
2 9.3353198e+02 6.71e+03 5.23e+01 -1.0 5.10e+03 - 1.89e-05 1.30e-0
4h 1
3 4.2613385e+02 6.55e+03 5.24e+01 -1.0 6.71e+03 - 3.56e-05 2.29e-0
2f 1
4 1.9281092e+04 7.30e-02 8.02e+01 -1.0 6.55e+03 - 3.74e-02 1.00e+0
0h 1
5 1.1339331e+04 6.91e-02 5.90e+01 -1.0 8.02e+00 - 2.64e-01 5.00e-0
2f 1
6 1.0190236e+04 2.14e-02 2.42e+01 -1.0 5.08e+00 - 6.39e-01 1.00e+0
0f 1
7 1.0517954e+04 2.95e-03 2.01e-01 -1.0 2.03e+00 - 9.91e-01 1.00e+0
0f 1
8 1.0004054e+04 1.59e-03 6.62e-02 -1.7 5.15e+00 - 1.00e+00 9.87e-0
1f 1
9 9.8321708e+03 1.66e-03 3.42e-01 -2.5 1.25e+00 - 1.00e+00 8.01e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.8071756e+03 3.62e-05 7.24e-03 -2.5 2.80e-01 - 1.00e+00 1.00e+0
0h 1
11 9.7854015e+03 2.15e-06 7.23e-04 -3.8 5.36e+00 - 1.00e+00 1.00e+0
0h 1
12 9.7842083e+03 1.50e-08 3.75e-06 -5.7 2.95e-01 - 1.00e+00 1.00e+0
0h 1
13 9.7841926e+03 1.71e-12 4.05e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 13
(scaled) (unscaled)
Objective...............: 9.7841925946363002e+00 9.7841925946363008e+0
3
Dual infeasibility......: 4.0517096219633151e-10 4.0517096219633151e-0
7
Constraint violation....: 1.7060935997292859e-12 1.7060935997292859e-1
2
Complementarity.........: 3.3672979407004244e-09 3.3672979407004243e-0
6
Overall NLP error.......: 3.3672979407004244e-09 3.3672979407004243e-0
6
Number of objective function evaluations = 14
Number of objective gradient evaluations = 14
Number of equality constraint evaluations = 14
Number of inequality constraint evaluations = 14
Number of equality constraint Jacobian evaluations = 14
Number of inequality constraint Jacobian evaluations = 14
Number of Lagrangian Hessian evaluations = 13
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0885267e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0522538e+02 4.77e+03 5.23e+01 -1.0 3.40e+03 - 2.93e-05 1.39e-0
4h 1
3 3.7446895e+02 4.66e+03 5.24e+01 -1.0 4.77e+03 - 4.82e-05 2.34e-0
2f 1
4 1.7343624e+04 6.51e-02 8.03e+01 -1.0 4.66e+03 - 3.33e-02 1.00e+0
0h 1
5 8.8835455e+03 6.19e-02 6.15e+01 -1.0 3.76e+01 - 2.33e-01 4.52e-0
2f 1
6 7.5996542e+03 2.03e-02 2.88e+01 -1.0 1.63e+01 - 5.42e-01 6.20e-0
1f 1
7 7.1823993e+03 5.79e-03 8.85e-01 -1.0 5.30e+00 - 9.57e-01 7.82e-0
1f 1
8 7.4476292e+03 1.69e-04 6.59e-02 -1.0 5.07e+00 - 1.00e+00 1.00e+0
0f 1
9 6.8807542e+03 2.12e-03 8.08e-02 -2.5 3.15e+00 - 8.55e-01 8.48e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.7194703e+03 2.16e-03 4.17e-01 -2.5 9.54e-01 - 1.00e+00 7.62e-0
1f 1
11 6.6937548e+03 1.24e-04 4.69e-03 -2.5 2.10e-01 - 1.00e+00 1.00e+0
0h 1
12 6.6728222e+03 3.31e-05 1.45e-01 -3.8 8.04e+00 - 1.00e+00 7.62e-0
1h 1
13 6.6674261e+03 1.25e-07 3.38e-04 -3.8 1.91e+00 - 1.00e+00 1.00e+0
0f 1
14 6.6659052e+03 2.85e-08 9.91e-04 -5.7 4.46e-01 - 1.00e+00 9.85e-0
1h 1
15 6.6658878e+03 1.92e-12 1.39e-08 -5.7 6.69e-03 - 1.00e+00 1.00e+0
0f 1
16 6.6658693e+03 2.63e-12 4.48e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.6658693468530501e+00 6.6658693468530500e+0
3
Dual infeasibility......: 4.4776954564823615e-09 4.4776954564823615e-0
6
Constraint violation....: 2.6312077516799093e-12 2.6312077516799093e-1
2
Complementarity.........: 3.6084978097413949e-09 3.6084978097413946e-0
6
Overall NLP error.......: 4.4776954564823615e-09 4.4776954564823615e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6637182e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 4.97e-04 9.82e-0
3h 1
2 8.6042939e+02 3.24e+03 5.24e+01 -1.0 1.84e+03 - 3.26e-05 2.28e-0
4h 1
3 3.1417401e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 1.47e-04 2.23e-0
2f 1
4 1.5379505e+04 5.92e-02 8.10e+01 -1.0 3.17e+03 - 3.78e-02 1.00e+0
0h 1
5 6.7093918e+03 5.60e-02 5.74e+01 -1.0 7.11e+01 - 2.87e-01 4.89e-0
2f 1
6 4.9418778e+03 2.59e-02 3.09e+01 -1.0 3.57e+01 - 4.68e-01 5.10e-0
1f 1
7 4.4134385e+03 1.24e-02 2.54e+00 -1.0 9.80e+00 - 9.26e-01 1.00e+0
0f 1
8 4.8172359e+03 7.35e-04 6.11e-02 -1.0 3.06e+00 - 9.95e-01 1.00e+0
0f 1
9 4.2445786e+03 7.96e-04 2.08e-01 -1.7 5.61e+01 - 1.00e+00 8.91e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.2840533e+03 9.46e-05 1.59e-01 -1.7 4.71e+01 - 8.98e-01 1.00e+0
0f 1
11 4.1233008e+03 6.55e-05 3.98e-02 -2.5 8.66e+01 - 1.00e+00 9.58e-0
1f 1
12 4.1145664e+03 1.68e-03 1.39e-03 -2.5 3.32e+00 - 1.00e+00 1.00e+0
0f 1
13 4.0884530e+03 1.02e-03 3.14e-02 -3.8 1.34e+01 - 8.10e-01 1.00e+0
0h 1
14 4.0848433e+03 3.15e-03 1.12e-03 -3.8 4.69e-02 - 1.00e+00 1.00e+0
0h 1
15 4.0852545e+03 3.81e-05 1.25e-04 -3.8 1.35e-02 - 1.00e+00 1.00e+0
0h 1
16 4.0833673e+03 1.01e-04 3.65e-04 -5.7 7.43e-01 - 9.51e-01 9.78e-0
1h 1
17 4.0833464e+03 2.21e-05 3.79e-03 -5.7 1.66e-02 - 1.00e+00 7.81e-0
1h 1
18 4.0833467e+03 8.62e-09 1.20e-06 -5.7 3.64e-03 - 1.00e+00 1.00e+0
0f 1
19 4.0833247e+03 9.01e-09 1.93e-05 -8.6 9.21e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 4.0833244e+03 1.37e-12 6.50e-11 -8.6 1.53e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 4.0833244032064409e+00 4.0833244032064408e+0
3
Dual infeasibility......: 6.4953187038146859e-11 6.4953187038146859e-0
8
Constraint violation....: 1.3733458814613186e-12 1.3733458814613186e-1
2
Complementarity.........: 2.8977660763781131e-09 2.8977660763781132e-0
6
Overall NLP error.......: 2.8977660763781131e-09 2.8977660763781132e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4497499e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 3.98e-04 9.83e-0
3h 1
2 8.3712363e+02 2.00e+03 5.24e+01 -1.0 1.32e+03 - 4.53e-05 2.94e-0
4h 1
3 7.9103943e+02 1.99e+03 5.24e+01 -1.0 2.00e+03 - 2.24e-04 1.78e-0
3h 1
4 2.7987420e+02 1.95e+03 5.25e+01 -1.0 1.99e+03 - 2.00e-03 2.11e-0
2f 1
5 1.2936117e+04 5.88e-02 8.13e+01 -1.0 1.95e+03 - 4.87e-02 1.00e+0
0h 1
6 5.0617582e+03 5.49e-02 4.96e+01 -1.0 7.49e+01 - 3.80e-01 6.00e-0
2f 1
7 3.0108244e+03 3.56e-02 2.59e+01 -1.0 4.18e+01 - 4.83e-01 5.27e-0
1f 1
8 3.7138544e+03 1.31e-02 4.19e+00 -1.0 1.73e+01 - 7.52e-01 5.00e-0
1f 2
9 3.1764868e+03 4.42e-03 2.49e-01 -1.0 8.16e+00 - 9.57e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8037810e+03 1.15e-03 8.65e-02 -1.7 5.89e+00 - 7.99e-01 8.17e-0
1f 1
11 2.6737448e+03 7.98e-04 3.87e-01 -2.5 5.18e+00 - 7.99e-01 1.00e+0
0f 1
12 2.5998192e+03 1.15e-02 5.46e-02 -2.5 4.21e+00 - 1.00e+00 9.87e-0
1h 1
13 2.6127837e+03 4.05e-04 9.60e-03 -2.5 2.56e+00 - 1.00e+00 1.00e+0
0f 1
14 2.5829854e+03 1.87e-04 5.64e-02 -3.8 1.28e+01 - 9.83e-01 8.63e-0
1h 1
15 2.5809094e+03 2.32e-06 1.60e-04 -3.8 1.16e+00 - 1.00e+00 1.00e+0
0h 1
16 2.5794716e+03 3.06e-07 2.18e-03 -5.7 5.56e-01 - 1.00e+00 9.77e-0
1h 1
17 2.5794622e+03 3.55e-11 2.17e-08 -5.7 4.12e-03 - 1.00e+00 1.00e+0
0f 1
18 2.5794438e+03 6.30e-11 4.40e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 2.5794437885800954e+00 2.5794437885800953e+0
3
Dual infeasibility......: 4.3996323767630622e-09 4.3996323767630622e-0
6
Constraint violation....: 6.3012373097137697e-11 6.3012373097137697e-1
1
Complementarity.........: 3.6140320449082070e-09 3.6140320449082068e-0
6
Overall NLP error.......: 4.3996323767630622e-09 4.3996323767630622e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6465817e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 4.93e-04 9.87e-0
3h 1
2 8.4355574e+02 9.17e+02 5.24e+01 -1.0 8.01e+02 - 8.70e-05 7.80e-0
4h 1
3 2.6241592e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 7.62e-04 2.20e-0
2h 1
4 1.2719147e+04 5.98e-02 8.02e+01 -1.0 8.97e+02 - 5.04e-02 1.00e+0
0h 1
5 4.2680324e+03 5.58e-02 5.32e+01 -1.0 7.31e+01 - 3.26e-01 6.03e-0
2f 1
6 2.6655011e+03 3.01e-02 2.77e+01 -1.0 3.90e+01 - 4.75e-01 4.35e-0
1f 1
7 2.1352340e+03 1.43e-02 2.56e+00 -1.0 1.09e+01 - 9.19e-01 1.00e+0
0f 1
8 2.4491811e+03 4.32e-04 8.25e-02 -1.0 4.24e+00 - 9.95e-01 1.00e+0
0f 1
9 1.8815812e+03 6.60e-04 4.05e-01 -2.5 7.90e+00 - 8.84e-01 7.14e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8093842e+03 2.66e-04 3.52e-01 -2.5 7.70e+00 - 8.81e-01 1.00e+0
0h 1
11 1.8034521e+03 6.93e-04 4.71e-01 -2.5 1.49e+00 - 1.00e+00 1.59e-0
1h 2
12 1.7820269e+03 1.27e-03 1.31e-02 -2.5 1.02e+00 - 1.00e+00 1.00e+0
0h 1
13 1.7521790e+03 1.27e-03 3.45e-02 -3.8 1.62e+01 - 7.93e-01 1.00e+0
0h 1
14 1.7491703e+03 2.34e-03 9.04e-04 -3.8 4.24e-02 - 1.00e+00 1.00e+0
0h 1
15 1.7495279e+03 4.25e-05 1.59e-04 -3.8 1.55e-02 - 1.00e+00 1.00e+0
0h 1
16 1.7474739e+03 1.05e-04 3.51e-04 -5.7 8.92e-01 - 9.51e-01 9.76e-0
1h 1
17 1.7474491e+03 2.27e-05 4.03e-03 -5.7 2.13e-02 - 1.00e+00 7.84e-0
1h 1
18 1.7474480e+03 8.07e-09 1.18e-06 -5.7 4.60e-03 - 1.00e+00 1.00e+0
0f 1
19 1.7474243e+03 8.85e-09 2.07e-05 -8.6 1.11e-02 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7474239e+03 1.47e-12 7.01e-11 -8.6 1.85e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.7474239077364846e+00 1.7474239077364846e+0
3
Dual infeasibility......: 7.0143569281553839e-11 7.0143569281553839e-0
8
Constraint violation....: 1.4712675522332574e-12 1.4712675522332574e-1
2
Complementarity.........: 2.7541614874033834e-09 2.7541614874033833e-0
6
Overall NLP error.......: 2.7541614874033834e-09 2.7541614874033833e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.06e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.11e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235598542e+00 1.6104063235598542e+0
3
Dual infeasibility......: 2.4575259246965697e-12 2.4575259246965697e-0
9
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5062163919694731e-09 2.5062163919694729e-0
6
Overall NLP error.......: 2.5062163919694731e-09 2.5062163919694729e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933520e-01 5.8277753147933515e+0
2
Dual infeasibility......: 2.1031318724752505e-09 2.1031318724752505e-0
6
Constraint violation....: 6.2994401361926577e-11 6.2994401361926577e-1
1
Complementarity.........: 2.8882108897061754e-09 2.8882108897061753e-0
6
Overall NLP error.......: 2.8882108897061754e-09 2.8882108897061753e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146111911018e-01 6.4890146111911019e+0
2
Dual infeasibility......: 4.9126605652972124e-09 4.9126605652972124e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984372136e-09 4.3646094984372139e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605652972124e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.06e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.11e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235598542e+00 1.6104063235598542e+0
3
Dual infeasibility......: 2.4575259246965697e-12 2.4575259246965697e-0
9
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5062163919694731e-09 2.5062163919694729e-0
6
Overall NLP error.......: 2.5062163919694731e-09 2.5062163919694729e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2209128e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 3.29e-04 9.87e-0
3h 1
2 8.0324639e+02 9.17e+02 5.24e+01 -1.0 7.85e+02 - 8.88e-05 6.87e-0
4h 1
3 2.4240731e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 6.67e-04 2.10e-0
2h 1
4 1.2380515e+04 5.52e-02 8.24e+01 -1.0 8.98e+02 - 3.84e-02 1.00e+0
0h 1
5 3.8796801e+03 5.26e-02 5.61e+01 -1.0 8.06e+01 - 3.16e-01 5.00e-0
2f 1
6 1.9096207e+03 3.75e-02 3.00e+01 -1.0 3.91e+01 - 4.70e-01 5.04e-0
1f 1
7 4.6686948e+03 1.22e-02 2.67e+01 -1.0 2.05e+01 - 4.02e-01 1.00e+0
0h 1
8 1.8748494e+03 1.18e-02 1.00e+00 -1.0 2.53e+01 - 9.88e-01 8.94e-0
1f 1
9 2.0007622e+03 1.82e-04 4.63e-02 -1.0 3.23e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7349610e+03 2.15e-04 1.23e+00 -2.5 1.77e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5468553e+03 3.76e-03 1.33e-01 -2.5 7.59e+00 - 7.96e-01 1.00e+0
0f 1
12 1.5237335e+03 5.33e-03 3.08e-01 -2.5 1.83e+00 - 1.00e+00 7.68e-0
1h 1
13 1.5360586e+03 2.45e-04 4.69e-03 -2.5 7.08e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5034660e+03 1.70e-04 2.13e-02 -3.8 1.62e+01 - 9.91e-01 9.30e-0
1h 1
15 1.5021214e+03 7.20e-07 6.83e-05 -3.8 1.09e+00 - 1.00e+00 1.00e+0
0h 1
16 1.5003171e+03 3.77e-07 1.76e-04 -5.7 8.92e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003154e+03 3.79e-11 2.93e-09 -5.7 3.96e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.11e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932798595747e+00 1.5002932798595748e+0
3
Dual infeasibility......: 2.1694229810962333e-09 2.1694229810962333e-0
6
Constraint violation....: 6.2995997307524476e-11 6.2995997307524476e-1
1
Complementarity.........: 2.8882170429837073e-09 2.8882170429837071e-0
6
Overall NLP error.......: 2.8882170429837073e-09 2.8882170429837071e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6465817e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 4.93e-04 9.87e-0
3h 1
2 8.4355574e+02 9.17e+02 5.24e+01 -1.0 8.01e+02 - 8.70e-05 7.80e-0
4h 1
3 2.6241592e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 7.62e-04 2.20e-0
2h 1
4 1.2719147e+04 5.98e-02 8.02e+01 -1.0 8.97e+02 - 5.04e-02 1.00e+0
0h 1
5 4.2680324e+03 5.58e-02 5.32e+01 -1.0 7.31e+01 - 3.26e-01 6.03e-0
2f 1
97 1.636418e+04 1.632511e+04 7.130416e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2433855e+02 1.57e+04 5.24e+01 -1.0 1.59e+04 - 3.31e-04 9.80e-0
3h 1
2 8.2143050e+02 1.57e+04 5.24e+01 -1.0 1.45e+04 - 3.13e-05 1.08e-0
4h 1
3 8.1812190e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 1.13e-05 2.65e-0
4h 1
4 8.1216956e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 2.74e-04 4.88e-0
4h 1
5 5.6726297e+02 1.54e+04 5.26e+01 -1.0 1.57e+04 - 7.91e-04 2.11e-0
2f 1
6 2.7031162e+04 5.55e-02 8.24e+01 -1.0 1.54e+04 - 3.91e-02 1.00e+0
0h 1
7 1.8693980e+04 5.29e-02 5.44e+01 -1.0 7.92e+01 - 3.36e-01 5.08e-0
2f 1
8 1.6731921e+04 3.71e-02 2.89e+01 -1.0 3.93e+01 - 4.72e-01 5.02e-0
1f 1
9 1.7074569e+04 2.29e-02 1.32e+01 -1.0 2.04e+01 - 4.04e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6824557e+04 6.00e-03 3.27e+00 -1.0 4.83e+00 - 8.15e-01 1.00e+0
0h 1
11 1.6853096e+04 2.03e-04 1.79e+00 -1.0 3.75e+00 - 3.12e-01 1.00e+0
0f 1
12 1.6854018e+04 1.07e-05 5.26e-01 -1.0 1.85e+00 - 7.05e-01 1.00e+0
0f 1
13 1.6547590e+04 2.43e-04 3.97e-01 -1.7 5.30e+00 - 8.76e-01 7.50e-0
1f 1
14 1.6486160e+04 5.96e-04 3.58e-01 -1.7 7.64e+00 - 6.18e-01 1.00e+0
0f 1
15 1.6484535e+04 8.55e-05 6.37e-02 -1.7 1.26e+01 - 7.68e-01 1.00e+0
0h 1
16 1.6367423e+04 1.07e-03 6.19e-02 -2.5 1.54e+01 - 9.11e-01 1.00e+0
0f 1
17 1.6344650e+04 1.30e-03 1.47e-02 -2.5 3.93e+00 - 1.00e+00 1.00e+0
0h 1
18 1.6328141e+04 2.33e-04 1.06e-01 -3.8 5.59e+00 - 1.00e+00 8.34e-0
1h 1
19 1.6326255e+04 4.97e-07 1.25e-04 -3.8 8.49e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325260e+04 3.63e-07 7.58e-03 -5.7 2.65e-01 - 1.00e+00 8.38e-0
1h 1
21 1.6325119e+04 1.04e-08 3.71e-07 -5.7 5.46e-03 - 1.00e+00 1.00e+0
0f 1
22 1.6325105e+04 1.12e-10 3.12e-06 -8.6 2.31e-03 - 1.00e+00 9.95e-0
1h 1
23 1.6325105e+04 1.07e-14 5.03e-14 -8.6 3.85e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 23
(scaled) (unscaled)
Objective...............: 1.6325105279259116e+01 1.6325105279259116e+0
4
Dual infeasibility......: 5.0267639537529012e-14 5.0267639537529012e-1
1
Constraint violation....: 1.0658141036401503e-14 1.0658141036401503e-1
4
Complementarity.........: 2.5060476205984947e-09 2.5060476205984946e-0
6
Overall NLP error.......: 2.5060476205984947e-09 2.5060476205984946e-0
6
Number of objective function evaluations = 27
Number of objective gradient evaluations = 24
Number of equality constraint evaluations = 27
Number of inequality constraint evaluations = 27
Number of equality constraint Jacobian evaluations = 24
Number of inequality constraint Jacobian evaluations = 24
Number of Lagrangian Hessian evaluations = 23
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9092566e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 6.99e-04 9.80e-0
3h 1
2 8.8805674e+02 1.50e+04 5.24e+01 -1.0 1.35e+04 - 2.70e-05 1.10e-0
4h 1
3 8.8611431e+02 1.50e+04 5.24e+01 -1.0 1.49e+04 - 1.36e-05 1.54e-0
4h 1
4 8.7936965e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 1.65e-04 5.40e-0
4h 1
5 6.0403601e+02 1.46e+04 5.25e+01 -1.0 1.50e+04 - 7.18e-04 2.27e-0
2f 1
6 2.6989312e+04 6.32e-02 7.84e+01 -1.0 1.46e+04 - 6.48e-02 1.00e+0
0h 1
7 1.8622184e+04 5.81e-02 5.00e+01 -1.0 5.42e+01 - 3.46e-01 7.32e-0
2f 1
8 1.7325675e+04 2.87e-02 2.26e+01 -1.0 2.55e+01 - 5.37e-01 4.65e-0
1f 1
9 1.6728079e+04 8.53e-03 1.18e+00 -1.0 9.79e+00 - 9.29e-01 7.63e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7007157e+04 3.25e-04 8.11e-02 -1.0 3.30e+00 - 9.88e-01 1.00e+0
0f 1
11 1.6383815e+04 2.09e-03 8.21e-02 -2.5 4.86e+00 - 8.66e-01 8.48e-0
1f 1
12 1.6205143e+04 2.16e-03 2.05e-01 -2.5 1.35e+00 - 1.00e+00 8.33e-0
1f 1
13 1.6188535e+04 8.88e-05 3.86e-03 -2.5 3.47e-01 - 1.00e+00 1.00e+0
0h 1
14 1.6176230e+04 4.73e-05 1.11e+00 -3.8 5.45e+00 - 1.00e+00 4.96e-0
1h 1
15 1.6171557e+04 3.46e-07 1.11e-01 -3.8 2.70e+00 - 9.68e-01 1.00e+0
0f 1
16 1.6170523e+04 1.48e-08 1.76e-03 -3.8 3.30e-02 - 1.00e+00 1.00e+0
0H 1
17 1.6170720e+04 1.12e-05 2.72e-04 -3.8 3.71e-03 - 1.00e+00 1.00e+0
0f 1
18 1.6169809e+04 1.86e-06 6.33e-02 -5.7 2.97e-01 - 7.76e-01 9.69e-0
1h 1
19 1.6169632e+04 1.25e-05 2.14e-04 -5.7 9.23e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6169638e+04 2.74e-08 2.16e-06 -5.7 2.59e-04 - 1.00e+00 1.00e+0
0h 1
21 1.6169621e+04 2.74e-08 8.15e-06 -8.6 3.68e-03 - 9.82e-01 9.88e-0
1h 1
22 1.6169621e+04 2.76e-13 3.30e-11 -8.6 4.32e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.6169621322404140e+01 1.6169621322404140e+0
4
Dual infeasibility......: 3.2985719815463726e-11 3.2985719815463726e-0
8
Constraint violation....: 2.7633451082920146e-13 2.7633451082920146e-1
3
Complementarity.........: 2.5702483461530698e-09 2.5702483461530697e-0
6
Overall NLP error.......: 2.5702483461530698e-09 2.5702483461530697e-0
6
Number of objective function evaluations = 25
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 25
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6663159e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 4.97e-04 9.80e-0
3h 1
2 8.6380228e+02 1.39e+04 5.24e+01 -1.0 1.32e+04 - 4.46e-05 1.04e-0
4h 1
3 8.5322572e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 7.28e-06 7.61e-0
4f 1
4 8.3643615e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 7.70e-04 1.25e-0
3h 1
5 5.7478913e+02 1.36e+04 5.24e+01 -1.0 1.39e+04 - 2.72e-03 2.18e-0
2f 1
6 2.4518571e+04 6.26e-02 8.04e+01 -1.0 1.36e+04 - 5.68e-02 1.00e+0
0h 1
7 1.7124457e+04 5.80e-02 4.82e+01 -1.0 6.63e+01 - 3.87e-01 6.80e-0
2f 1
8 1.5551277e+04 3.04e-02 2.32e+01 -1.0 3.78e+01 - 5.11e-01 4.42e-0
1f 1
9 1.5105747e+04 1.27e-02 2.08e+00 -1.0 1.05e+01 - 9.22e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5362043e+04 3.97e-04 1.52e-01 -1.0 4.28e+00 - 9.49e-01 1.00e+0
0f 1
11 1.4872226e+04 5.09e-04 6.64e-01 -2.5 7.20e+00 - 8.92e-01 6.33e-0
1f 1
12 1.4789714e+04 2.37e-04 3.83e-01 -2.5 2.45e+00 - 8.90e-01 1.00e+0
0h 1
13 1.4765634e+04 5.98e-03 2.04e-01 -2.5 1.69e+00 - 1.00e+00 6.28e-0
1h 1
14 1.4757039e+04 6.54e-04 5.06e-03 -2.5 4.33e-01 - 1.00e+00 1.00e+0
0f 1
15 1.4741293e+04 1.07e-03 2.36e-02 -3.8 3.27e+00 - 8.08e-01 9.62e-0
1h 1
16 1.4737901e+04 2.43e-03 9.32e-04 -3.8 1.55e-01 - 1.00e+00 1.00e+0
0h 1
17 1.4738272e+04 4.31e-05 1.44e-04 -3.8 1.49e-02 - 1.00e+00 1.00e+0
0h 1
18 1.4736949e+04 1.04e-04 4.12e-04 -5.7 1.50e-01 - 9.51e-01 9.81e-0
1h 1
19 1.4736942e+04 2.18e-05 3.57e-03 -5.7 1.97e-03 - 1.00e+00 7.92e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.4736946e+04 8.55e-09 1.13e-06 -5.7 4.11e-04 - 1.00e+00 1.00e+0
0f 1
21 1.4736932e+04 8.98e-09 1.93e-05 -8.6 1.84e-03 - 1.00e+00 9.83e-0
1h 1
22 1.4736931e+04 1.37e-12 6.48e-11 -8.6 3.05e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 22
(scaled) (unscaled)
Objective...............: 1.4736931432778640e+01 1.4736931432778640e+0
4
Dual infeasibility......: 6.4773513119199342e-11 6.4773513119199349e-0
8
Constraint violation....: 1.3747891713933313e-12 1.3747891713933313e-1
2
Complementarity.........: 2.5092085628912184e-09 2.5092085628912184e-0
6
Overall NLP error.......: 2.5092085628912184e-09 2.5092085628912184e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 23
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 23
Number of inequality constraint Jacobian evaluations = 23
Number of Lagrangian Hessian evaluations = 22
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.008
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4546668e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 3.98e-04 9.81e-0
3h 1
2 8.4238408e+02 1.26e+04 5.24e+01 -1.0 1.06e+04 - 2.39e-05 1.19e-0
4h 1
3 8.2513847e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 2.34e-05 1.12e-0
3h 1
4 5.1611231e+02 1.24e+04 5.26e+01 -1.0 1.26e+04 - 1.14e-03 2.13e-0
2h 1
5 2.4096136e+04 5.78e-02 8.28e+01 -1.0 1.24e+04 - 2.75e-02 1.00e+0
0h 1
6 1.5883207e+04 5.52e-02 6.45e+01 -1.0 7.62e+01 - 2.23e-01 4.05e-0
2f 1
7 1.3744033e+04 4.08e-02 3.52e+01 -1.0 3.55e+01 - 4.68e-01 5.98e-0
1f 1
8 1.4079761e+04 1.87e-02 2.00e+01 -1.0 1.83e+01 - 3.38e-01 1.25e-0
1f 4
9 1.3834740e+04 5.26e-03 9.97e-01 -1.0 4.95e+00 - 9.57e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3784109e+04 3.04e-04 7.67e-02 -1.0 5.40e+00 - 9.71e-01 1.00e+0
0f 1
11 1.3474343e+04 3.20e-04 1.12e+00 -2.5 6.30e+00 - 9.26e-01 5.96e-0
1f 1
12 1.3303297e+04 2.12e-03 3.08e-01 -2.5 6.98e+00 - 7.31e-01 1.00e+0
0f 1
13 1.3252127e+04 7.55e-03 1.34e-01 -2.5 3.36e+00 - 1.00e+00 8.51e-0
1h 1
14 1.3262263e+04 3.31e-04 1.08e-02 -2.5 4.88e-01 - 1.00e+00 1.00e+0
0f 1
15 1.3235793e+04 2.93e-04 4.93e-02 -3.8 8.89e+00 - 9.88e-01 8.78e-0
1h 1
16 1.3234420e+04 1.44e-06 1.45e-04 -3.8 7.14e-01 - 1.00e+00 1.00e+0
0h 1
17 1.3233081e+04 3.36e-07 2.12e-03 -5.7 4.43e-01 - 1.00e+00 9.78e-0
1h 1
18 1.3233068e+04 3.83e-11 2.11e-08 -5.7 8.32e-03 - 1.00e+00 1.00e+0
0f 1
19 1.3233051e+04 6.30e-11 4.40e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.3233050938978838e+01 1.3233050938978839e+0
4
Dual infeasibility......: 4.3996417241256950e-09 4.3996417241256950e-0
6
Constraint violation....: 6.3006710959712109e-11 6.3006710959712109e-1
1
Complementarity.........: 3.3210184547820967e-09 3.3210184547820967e-0
6
Overall NLP error.......: 4.3996417241256950e-09 4.3996417241256950e-0
6
Number of objective function evaluations = 23
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6593386e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 4.93e-04 9.80e-0
3h 1
2 8.6306830e+02 1.11e+04 5.24e+01 -1.0 1.04e+04 - 4.52e-05 1.05e-0
4h 1
3 8.1186040e+02 1.11e+04 5.24e+01 -1.0 1.11e+04 - 9.08e-06 3.07e-0
3h 1
4 5.1218453e+02 1.09e+04 5.24e+01 -1.0 1.11e+04 - 3.39e-03 2.10e-0
2h 1
5 2.1776331e+04 6.24e-02 8.05e+01 -1.0 1.09e+04 - 5.63e-02 1.00e+0
0h 1
6 1.4348122e+04 5.78e-02 4.85e+01 -1.0 6.67e+01 - 3.84e-01 6.75e-0
2f 1
7 1.2758891e+04 3.03e-02 2.35e+01 -1.0 3.82e+01 - 5.08e-01 4.44e-0
1f 1
8 1.2336264e+04 1.25e-02 2.11e+00 -1.0 1.05e+01 - 9.22e-01 1.00e+0
0f 1
9 1.2573901e+04 3.94e-04 6.99e-02 -1.0 4.38e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2093155e+04 4.79e-04 6.64e-01 -2.5 7.11e+00 - 8.96e-01 6.35e-0
1f 1
11 1.2008387e+04 2.61e-04 3.79e-01 -2.5 2.60e+00 - 8.85e-01 1.00e+0
0h 1
12 1.1988420e+04 6.03e-03 2.77e-01 -2.5 1.72e+00 - 1.00e+00 5.05e-0
1h 1
13 1.1975442e+04 9.44e-04 7.59e-03 -2.5 6.29e-01 - 1.00e+00 1.00e+0
0f 1
14 1.1956824e+04 1.18e-03 2.98e-02 -3.8 5.36e+00 - 8.12e-01 1.00e+0
0h 1
15 1.1953859e+04 2.21e-03 1.03e-03 -3.8 4.85e-02 - 1.00e+00 1.00e+0
0h 1
16 1.1954263e+04 4.74e-05 1.76e-04 -3.8 1.51e-02 - 1.00e+00 1.00e+0
0h 1
17 1.1952779e+04 1.06e-04 4.11e-04 -5.7 2.97e-01 - 9.51e-01 9.80e-0
1h 1
18 1.1952772e+04 2.07e-05 3.75e-03 -5.7 5.86e-03 - 1.00e+00 8.05e-0
1h 1
19 1.1952774e+04 7.70e-09 1.06e-06 -5.7 1.14e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.1952758e+04 8.78e-09 2.07e-05 -8.6 3.68e-03 - 1.00e+00 9.83e-0
1h 1
21 1.1952758e+04 1.48e-12 6.98e-11 -8.6 6.18e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.1952757680848579e+01 1.1952757680848579e+0
4
Dual infeasibility......: 6.9764805607440265e-11 6.9764805607440265e-0
8
Constraint violation....: 1.4770407119613083e-12 1.4770407119613083e-1
2
Complementarity.........: 2.8956558891278874e-09 2.8956558891278872e-0
6
Overall NLP error.......: 2.8956558891278874e-09 2.8956558891278872e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8775333e+02 9.19e+03 5.24e+01 -1.0 9.28e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8469544e+02 9.19e+03 5.24e+01 -1.0 7.80e+03 - 2.91e-05 1.17e-0
4h 1
3 6.6462117e+02 9.08e+03 5.24e+01 -1.0 9.19e+03 - 2.18e-05 1.20e-0
2h 1
4 5.9228837e+02 8.88e+03 5.19e+01 -1.0 9.08e+03 - 1.38e-02 2.17e-0
2h 1
5 1.7105298e+04 7.36e-02 7.74e+01 -1.0 8.88e+03 - 1.04e-01 1.00e+0
0h 1
6 1.2211572e+04 6.40e-02 2.02e+01 -1.0 4.24e+01 - 7.12e-01 1.21e-0
1f 1
7 1.0749760e+04 2.49e-02 1.83e+00 -1.0 2.14e+01 - 9.33e-01 6.71e-0
1f 1
8 1.0985588e+04 3.01e-03 8.10e-01 -1.0 4.35e+00 - 6.25e-01 1.00e+0
0f 1
9 1.0470719e+04 1.25e-03 2.30e-01 -1.7 3.88e+00 - 8.58e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.0472600e+04 6.73e-04 4.64e-01 -1.7 1.16e+01 - 5.20e-01 1.00e+0
0f 1
11 1.0486301e+04 4.63e-06 4.05e-02 -1.7 1.53e+01 - 9.00e-01 1.00e+0
0h 1
12 1.0373095e+04 1.66e-04 3.97e-01 -2.5 2.14e+01 - 1.00e+00 6.79e-0
1f 1
13 1.0360512e+04 6.35e-06 9.35e-03 -2.5 1.05e+01 - 1.00e+00 1.00e+0
0f 1
14 1.0339536e+04 9.05e-06 3.87e-02 -3.8 8.04e+00 - 8.64e-01 9.08e-0
1f 1
15 1.0336043e+04 5.06e-04 9.76e-04 -3.8 7.35e-01 - 1.00e+00 1.00e+0
0f 1
16 1.0334757e+04 5.44e-05 1.03e-02 -5.7 4.46e-01 - 8.32e-01 1.00e+0
0h 1
17 1.0334651e+04 3.17e-05 3.48e-05 -5.7 9.03e-03 - 1.00e+00 1.00e+0
0h 1
18 1.0334655e+04 4.76e-07 6.08e-06 -5.7 1.04e-03 - 1.00e+00 1.00e+0
0h 1
19 1.0334639e+04 3.22e-08 7.69e-05 -8.6 5.53e-03 - 1.00e+00 9.44e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.0334638e+04 7.33e-12 6.32e-11 -8.6 3.08e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.0334637969652007e+01 1.0334637969652007e+0
4
Dual infeasibility......: 6.3155602905236425e-11 6.3155602905236418e-0
8
Constraint violation....: 7.3338002337663966e-12 7.3338002337663966e-1
2
Complementarity.........: 2.8203477392668367e-09 2.8203477392668365e-0
6
Overall NLP error.......: 2.8203477392668367e-09 2.8203477392668365e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0888295e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0557265e+02 6.71e+03 5.23e+01 -1.0 5.21e+03 - 2.69e-05 1.27e-0
4h 1
3 4.1986899e+02 6.55e+03 5.24e+01 -1.0 6.70e+03 - 3.43e-05 2.35e-0
2f 1
4 1.9285646e+04 6.51e-02 8.06e+01 -1.0 6.55e+03 - 2.96e-02 1.00e+0
0h 1
5 1.0827936e+04 6.21e-02 6.35e+01 -1.0 3.91e+01 - 2.12e-01 4.20e-0
2f 1
6 9.5566169e+03 2.07e-02 3.00e+01 -1.0 1.63e+01 - 5.39e-01 6.15e-0
1f 1
7 9.1167531e+03 6.69e-03 9.63e-01 -1.0 5.59e+00 - 9.55e-01 7.70e-0
1f 1
8 9.3796749e+03 2.25e-04 7.30e-02 -1.0 4.69e+00 - 9.83e-01 1.00e+0
0f 1
9 8.8173316e+03 2.07e-03 8.45e-02 -2.5 3.16e+00 - 8.56e-01 8.39e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 8.6549791e+03 2.15e-03 4.33e-01 -2.5 1.80e+00 - 1.00e+00 7.56e-0
1f 1
11 8.6281015e+03 1.34e-04 4.74e-03 -2.5 7.20e-01 - 1.00e+00 1.00e+0
0h 1
12 8.6073555e+03 3.58e-05 1.51e-01 -3.8 8.04e+00 - 1.00e+00 7.58e-0
1h 1
13 8.6018718e+03 1.30e-07 3.45e-04 -3.8 1.95e+00 - 1.00e+00 1.00e+0
0f 1
14 8.6003514e+03 2.83e-08 9.61e-04 -5.7 4.46e-01 - 1.00e+00 9.85e-0
1h 1
15 8.6003344e+03 1.87e-12 1.37e-08 -5.7 6.57e-03 - 1.00e+00 1.00e+0
0f 1
16 8.6003159e+03 2.63e-12 4.48e-09 -8.6 5.53e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 8.6003159337616637e+00 8.6003159337616635e+0
3
Dual infeasibility......: 4.4776945845271638e-09 4.4776945845271638e-0
6
Constraint violation....: 2.6308885625603295e-12 2.6308885625603295e-1
2
Complementarity.........: 3.6084986030476292e-09 3.6084986030476290e-0
6
Overall NLP error.......: 4.4776945845271638e-09 4.4776945845271638e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8775283e+02 4.77e+03 5.24e+01 -1.0 4.82e+03 - 6.64e-04 9.80e-0
3f 1
2 8.8490545e+02 4.77e+03 5.24e+01 -1.0 4.54e+03 - 9.09e-05 1.04e-0
4h 1
3 8.3891577e+02 4.76e+03 5.24e+01 -1.0 4.77e+03 - 9.27e-06 2.02e-0
3f 1
4 3.6771363e+02 4.66e+03 5.24e+01 -1.0 4.76e+03 - 2.59e-03 2.19e-0
2h 1
5 1.5982222e+04 6.47e-02 7.88e+01 -1.0 4.66e+03 - 6.69e-02 1.00e+0
0h 1
6 8.2942245e+03 5.93e-02 4.78e+01 -1.0 5.43e+01 - 3.77e-01 7.64e-0
2f 1
7 6.9811110e+03 2.94e-02 2.07e+01 -1.0 2.67e+01 - 5.54e-01 4.62e-0
1f 1
8 6.4193393e+03 6.17e-03 1.02e+00 -1.0 9.91e+00 - 9.28e-01 7.77e-0
1f 1
9 6.6977348e+03 2.38e-04 6.93e-02 -1.0 3.42e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0467842e+03 2.17e-03 8.37e-02 -2.5 5.05e+00 - 8.70e-01 8.75e-0
1f 1
11 5.9396938e+03 1.10e-03 4.47e-01 -2.5 8.28e-01 - 1.00e+00 6.10e-0
1f 1
12 5.9395944e+03 2.61e-06 8.30e-03 -2.5 1.67e-01 - 1.00e+00 1.00e+0
0h 1
13 5.9215589e+03 6.87e-06 1.24e-02 -3.8 2.68e+00 - 9.05e-01 8.92e-0
1f 1
14 5.9183066e+03 4.65e-04 4.13e-04 -3.8 2.89e-01 - 1.00e+00 1.00e+0
0f 1
15 5.9173128e+03 6.28e-05 1.14e-02 -5.7 1.49e-01 - 8.14e-01 1.00e+0
0h 1
16 5.9171977e+03 3.58e-05 4.03e-05 -5.7 9.65e-03 - 1.00e+00 1.00e+0
0h 1
17 5.9171990e+03 1.44e-06 2.56e-05 -5.7 1.50e-03 - 1.00e+00 9.93e-0
1h 1
18 5.9172015e+03 3.51e-08 4.96e-07 -5.7 2.91e-04 - 1.00e+00 1.00e+0
0f 1
19 5.9171868e+03 3.95e-08 7.31e-06 -8.6 1.84e-03 - 9.97e-01 9.81e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 5.9171866e+03 5.37e-13 2.98e-11 -8.6 3.55e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 5.9171865553151646e+00 5.9171865553151647e+0
3
Dual infeasibility......: 2.9758893790270944e-11 2.9758893790270944e-0
8
Constraint violation....: 5.3690385470872570e-13 5.3690385470872570e-1
3
Complementarity.........: 2.5100799351768482e-09 2.5100799351768483e-0
6
Overall NLP error.......: 2.5100799351768482e-09 2.5100799351768483e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2280559e+02 3.24e+03 5.23e+01 -1.0 3.27e+03 - 1.51e-03 9.82e-0
3h 1
2 8.7858780e+02 3.24e+03 5.23e+01 -1.0 3.07e+03 - 2.27e-05 1.80e-0
3h 1
3 3.4987166e+02 3.16e+03 5.24e+01 -1.0 3.24e+03 - 1.77e-03 2.26e-0
2h 1
4 1.5175450e+04 7.03e-02 7.68e+01 -1.0 3.17e+03 - 8.03e-02 1.00e+0
0h 1
5 7.4650659e+03 6.35e-02 2.37e+01 -1.0 1.36e+01 - 6.58e-01 8.85e-0
2f 1
6 6.1538524e+03 2.02e-02 9.68e+00 -1.0 9.91e+00 - 6.60e-01 8.87e-0
1f 1
7 6.3688205e+03 5.76e-03 1.23e-01 -1.0 2.80e+00 - 9.90e-01 9.60e-0
1f 1
8 5.9574396e+03 2.74e-03 6.53e-01 -1.7 1.47e+01 - 6.53e-01 1.00e+0
0f 1
9 5.9275388e+03 4.56e-04 7.78e-01 -1.7 3.01e+01 - 4.88e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.9637141e+03 3.40e-05 1.47e-02 -1.7 3.29e+01 - 9.85e-01 1.00e+0
0h 1
11 5.7623684e+03 4.75e-04 1.99e-02 -2.5 6.09e+01 - 9.74e-01 9.60e-0
1f 1
12 5.7322219e+03 1.51e-04 2.12e-01 -3.8 1.94e+01 - 9.94e-01 7.17e-0
1h 1
13 5.7229545e+03 3.52e-07 3.27e-04 -3.8 5.49e+00 - 1.00e+00 1.00e+0
0h 1
14 5.7210223e+03 1.96e-08 4.34e-06 -5.7 8.91e-01 - 1.00e+00 1.00e+0
0h 1
15 5.7210000e+03 8.14e-13 4.89e-10 -8.6 1.10e-02 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.7210000462789106e+00 5.7210000462789103e+0
3
Dual infeasibility......: 4.8859996588699559e-10 4.8859996588699559e-0
7
Constraint violation....: 8.1405715501858822e-13 8.1405715501858822e-1
3
Complementarity.........: 3.6292396731887723e-09 3.6292396731887725e-0
6
Overall NLP error.......: 3.6292396731887723e-09 3.6292396731887725e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4497499e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 3.98e-04 9.83e-0
3h 1
2 8.3712362e+02 2.00e+03 5.24e+01 -1.0 1.32e+03 - 4.53e-05 2.94e-0
4h 1
3 7.9103445e+02 1.99e+03 5.24e+01 -1.0 2.00e+03 - 2.24e-04 1.78e-0
3h 1
4 2.7987473e+02 1.95e+03 5.25e+01 -1.0 1.99e+03 - 2.00e-03 2.11e-0
2f 1
5 1.2936030e+04 5.88e-02 8.13e+01 -1.0 1.95e+03 - 4.87e-02 1.00e+0
0h 1
6 5.0617491e+03 5.49e-02 4.96e+01 -1.0 7.49e+01 - 3.80e-01 6.00e-0
2f 1
7 3.0108241e+03 3.56e-02 2.59e+01 -1.0 4.18e+01 - 4.83e-01 5.27e-0
1f 1
8 3.7138311e+03 1.31e-02 4.19e+00 -1.0 1.73e+01 - 7.52e-01 5.00e-0
1f 2
9 3.1764860e+03 4.42e-03 2.49e-01 -1.0 8.16e+00 - 9.57e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8037819e+03 1.15e-03 8.67e-02 -1.7 5.89e+00 - 7.99e-01 8.17e-0
1f 1
11 2.6737534e+03 7.98e-04 3.87e-01 -2.5 5.18e+00 - 7.99e-01 1.00e+0
0f 1
12 2.5998205e+03 1.15e-02 5.46e-02 -2.5 4.21e+00 - 1.00e+00 9.87e-0
1h 1
13 2.6127835e+03 4.05e-04 9.61e-03 -2.5 2.56e+00 - 1.00e+00 1.00e+0
0f 1
14 2.5829859e+03 1.87e-04 5.65e-02 -3.8 1.28e+01 - 9.83e-01 8.63e-0
1h 1
15 2.5809094e+03 2.32e-06 1.60e-04 -3.8 1.16e+00 - 1.00e+00 1.00e+0
0h 1
16 2.5794716e+03 3.06e-07 2.18e-03 -5.7 5.56e-01 - 1.00e+00 9.77e-0
1h 1
17 2.5794622e+03 3.55e-11 2.17e-08 -5.7 4.12e-03 - 1.00e+00 1.00e+0
0f 1
18 2.5794438e+03 6.30e-11 4.40e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 2.5794437885798409e+00 2.5794437885798407e+0
3
Dual infeasibility......: 4.3996326085345700e-09 4.3996326085345700e-0
6
Constraint violation....: 6.3012581263954814e-11 6.3012581263954814e-1
1
Complementarity.........: 3.6142649353734481e-09 3.6142649353734482e-0
6
Overall NLP error.......: 4.3996326085345700e-09 4.3996326085345700e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6465817e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 4.93e-04 9.87e-0
3h 1
2 8.4355575e+02 9.17e+02 5.24e+01 -1.0 8.01e+02 - 8.70e-05 7.80e-0
4h 1
3 2.6241592e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 7.62e-04 2.20e-0
2h 1
4 1.2719147e+04 5.98e-02 8.02e+01 -1.0 8.97e+02 - 5.04e-02 1.00e+0
0h 1
5 4.2680324e+03 5.58e-02 5.32e+01 -1.0 7.31e+01 - 3.26e-01 6.03e-0
2f 1
6 2.6655013e+03 3.01e-02 2.77e+01 -1.0 3.90e+01 - 4.75e-01 4.35e-0
1f 1
7 2.1352340e+03 1.43e-02 2.56e+00 -1.0 1.09e+01 - 9.19e-01 1.00e+0
0f 1
8 2.4491812e+03 4.32e-04 8.25e-02 -1.0 4.24e+00 - 9.95e-01 1.00e+0
0f 1
9 1.8815813e+03 6.60e-04 4.05e-01 -2.5 7.90e+00 - 8.84e-01 7.14e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.8093843e+03 2.66e-04 3.52e-01 -2.5 7.70e+00 - 8.81e-01 1.00e+0
0h 1
11 1.8034522e+03 6.93e-04 4.71e-01 -2.5 1.49e+00 - 1.00e+00 1.59e-0
1h 2
12 1.7820269e+03 1.27e-03 1.31e-02 -2.5 1.02e+00 - 1.00e+00 1.00e+0
0h 1
13 1.7521790e+03 1.27e-03 3.45e-02 -3.8 1.62e+01 - 7.93e-01 1.00e+0
0h 1
14 1.7491703e+03 2.34e-03 9.04e-04 -3.8 4.24e-02 - 1.00e+00 1.00e+0
0h 1
15 1.7495279e+03 4.25e-05 1.59e-04 -3.8 1.55e-02 - 1.00e+00 1.00e+0
0h 1
16 1.7474740e+03 1.05e-04 3.51e-04 -5.7 8.92e-01 - 9.51e-01 9.76e-0
1h 1
17 1.7474491e+03 2.27e-05 4.03e-03 -5.7 2.13e-02 - 1.00e+00 7.84e-0
1h 1
18 1.7474481e+03 8.07e-09 1.18e-06 -5.7 4.60e-03 - 1.00e+00 1.00e+0
0f 1
19 1.7474243e+03 8.85e-09 2.07e-05 -8.6 1.11e-02 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7474240e+03 1.47e-12 7.01e-11 -8.6 1.85e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 1.7474239546989001e+00 1.7474239546989002e+0
3
Dual infeasibility......: 7.0143530730950283e-11 7.0143530730950283e-0
8
Constraint violation....: 1.4709344853258699e-12 1.4709344853258699e-1
2
Complementarity.........: 2.7541613468304581e-09 2.7541613468304582e-0
6
Overall NLP error.......: 2.7541613468304581e-09 2.7541613468304582e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146111911018e-01 6.4890146111911019e+0
2
Dual infeasibility......: 4.9126605652972124e-09 4.9126605652972124e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984372136e-09 4.3646094984372139e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605652972124e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933520e-01 5.8277753147933515e+0
2
Dual infeasibility......: 2.1031318724752505e-09 2.1031318724752505e-0
6
Constraint violation....: 6.2994401361926577e-11 6.2994401361926577e-1
1
Complementarity.........: 2.8882108897061754e-09 2.8882108897061753e-0
6
Overall NLP error.......: 2.8882108897061754e-09 2.8882108897061753e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977648e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995181e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146111911018e-01 6.4890146111911019e+0
2
Dual infeasibility......: 4.9126605652972124e-09 4.9126605652972124e-0
6
Constraint violation....: 6.2123812760717101e-09 6.2123812760717101e-0
9
Complementarity.........: 4.3646094984372136e-09 4.3646094984372139e-0
6
Overall NLP error.......: 6.2123812760717101e-09 4.9126605652972124e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104192e+03 9.06e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.11e-15 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063235598542e+00 1.6104063235598542e+0
3
Dual infeasibility......: 2.4574357190741646e-12 2.4574357190741646e-0
9
Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-1
5
Complementarity.........: 2.5062163919694727e-09 2.5062163919694725e-0
6
Overall NLP error.......: 2.5062163919694727e-09 2.5062163919694725e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2183264e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 3.29e-04 9.88e-0
3h 1
2 7.9676884e+02 9.17e+02 5.24e+01 -1.0 8.18e+02 - 9.72e-05 9.15e-0
4h 1
3 2.4281736e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 9.07e-04 2.09e-0
2h 1
4 1.2255659e+04 5.54e-02 8.24e+01 -1.0 8.98e+02 - 3.87e-02 1.00e+0
0h 1
5 3.8688605e+03 5.28e-02 5.51e+01 -1.0 7.96e+01 - 3.29e-01 5.05e-0
2f 1
6 1.9078251e+03 3.74e-02 2.93e+01 -1.0 3.92e+01 - 4.72e-01 5.02e-0
1f 1
7 4.6515332e+03 1.22e-02 2.62e+01 -1.0 2.04e+01 - 4.04e-01 1.00e+0
0h 1
8 1.8738275e+03 1.17e-02 9.61e-01 -1.0 2.50e+01 - 9.88e-01 8.98e-0
1f 1
9 1.6952060e+03 5.07e-04 6.26e-02 -1.7 6.87e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5627586e+03 1.96e-03 2.18e-01 -2.5 1.24e+01 - 7.44e-01 1.00e+0
0f 1
11 1.5309890e+03 3.66e-03 1.02e-01 -2.5 2.11e+00 - 1.00e+00 9.20e-0
1h 1
12 1.5388593e+03 1.30e-04 3.48e-03 -2.5 1.17e+00 - 1.00e+00 1.00e+0
0h 1
13 1.5037282e+03 1.63e-04 2.14e-02 -3.8 1.88e+01 - 9.93e-01 9.32e-0
1h 1
14 1.5022722e+03 7.63e-07 7.14e-05 -3.8 1.23e+00 - 1.00e+00 1.00e+0
0f 1
15 1.5003195e+03 3.78e-07 1.76e-04 -5.7 1.04e+00 - 1.00e+00 9.96e-0
1h 1
16 1.5003172e+03 3.80e-11 2.94e-09 -5.7 1.08e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5002933e+03 6.30e-11 2.17e-09 -8.6 1.29e-02 - 1.00e+00 1.00e+0
0h 1
1 8.6444562e+02 9.17e+02 5.24e+01 -1.0 9.20e+02 - 4.93e-04 9.88e-0
3h 1
2 8.3543511e+02 9.17e+02 5.24e+01 -1.0 8.33e+02 - 9.54e-05 1.07e-0
3h 1
3 2.6287765e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 1.07e-03 2.19e-0
2h 1
4 1.2569001e+04 6.01e-02 8.03e+01 -1.0 8.97e+02 - 5.11e-02 1.00e+0
0h 1
5 4.2524765e+03 5.61e-02 5.27e+01 -1.0 7.22e+01 - 3.33e-01 6.11e-0
2f 1
6 2.6512403e+03 3.01e-02 2.72e+01 -1.0 3.89e+01 - 4.78e-01 4.36e-0
1f 1
98 1.275436e+04 1.632511e+04 7.186166e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2434996e+02 1.57e+04 5.24e+01 -1.0 1.59e+04 - 3.31e-04 9.80e-0
3f 1
2 8.2153457e+02 1.57e+04 5.24e+01 -1.0 1.55e+04 - 9.39e-05 1.00e-0
4h 1
3 8.1459817e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 2.71e-06 5.59e-0
4f 1
4 5.6303935e+02 1.54e+04 5.26e+01 -1.0 1.57e+04 - 5.94e-04 2.11e-0
2h 1
5 2.7243420e+04 5.51e-02 8.23e+01 -1.0 1.54e+04 - 3.85e-02 1.00e+0
0h 1
6 1.8712670e+04 5.26e-02 5.62e+01 -1.0 8.09e+01 - 3.15e-01 5.01e-0
2f 1
7 1.6735095e+04 3.73e-02 3.01e+01 -1.0 3.93e+01 - 4.69e-01 5.05e-0
1f 1
8 1.7081057e+04 2.27e-02 1.40e+01 -1.0 2.06e+01 - 4.01e-01 1.25e-0
1f 4
9 1.6823825e+04 6.02e-03 3.99e-01 -1.0 4.95e+00 - 9.78e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6518223e+04 1.44e-03 4.07e-01 -1.7 5.54e+00 - 1.00e+00 8.24e-0
1f 1
11 1.6477062e+04 9.19e-04 1.44e-02 -1.7 1.81e+01 - 1.00e+00 1.00e+0
0f 1
12 1.6349132e+04 1.44e-03 9.77e-02 -3.8 1.99e+01 - 7.88e-01 9.29e-0
1f 1
13 1.6325614e+04 1.62e-03 8.54e-02 -3.8 1.71e+00 - 8.43e-01 7.51e-0
1h 1
14 1.6326057e+04 3.34e-06 8.55e-04 -3.8 3.46e-01 - 1.00e+00 1.00e+0
0h 1
15 1.6325125e+04 2.80e-07 6.76e-04 -5.7 1.49e-01 - 1.00e+00 9.87e-0
1h 1
16 1.6325118e+04 3.64e-11 6.71e-09 -5.7 2.77e-01 - 1.00e+00 1.00e+0
0f 1
17 1.6325105e+04 6.30e-11 2.17e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.6325105286210633e+01 1.6325105286210632e+0
4
Dual infeasibility......: 2.1734474279872021e-09 2.1734474279872021e-0
6
Constraint violation....: 6.2998620209420153e-11 6.2998620209420153e-1
1
Complementarity.........: 2.8881015128875890e-09 2.8881015128875888e-0
6
Overall NLP error.......: 2.8881015128875890e-09 2.8881015128875888e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9087270e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 6.98e-04 9.80e-0
3h 1
2 8.8812171e+02 1.50e+04 5.24e+01 -1.0 1.47e+04 - 8.73e-05 1.01e-0
4h 1
3 8.8013904e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 2.96e-06 6.36e-0
4f 1
4 6.0276902e+02 1.46e+04 5.25e+01 -1.0 1.50e+04 - 6.80e-04 2.27e-0
2h 1
5 2.7060725e+04 6.30e-02 7.84e+01 -1.0 1.46e+04 - 6.43e-02 1.00e+0
0h 1
6 1.8629294e+04 5.80e-02 5.03e+01 -1.0 5.46e+01 - 3.42e-01 7.25e-0
2f 1
7 1.7334040e+04 2.88e-02 2.29e+01 -1.0 2.56e+01 - 5.35e-01 4.62e-0
1f 1
8 1.6724972e+04 8.85e-03 1.18e+00 -1.0 9.86e+00 - 9.28e-01 7.65e-0
1f 1
9 1.7007224e+04 3.28e-04 8.10e-02 -1.0 3.34e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6379980e+04 2.09e-03 8.09e-02 -2.5 4.88e+00 - 8.66e-01 8.51e-0
1f 1
11 1.6200023e+04 2.17e-03 1.98e-01 -2.5 1.04e+00 - 1.00e+00 8.36e-0
1f 1
12 1.6184235e+04 8.01e-05 4.04e-03 -2.5 1.43e-01 - 1.00e+00 1.00e+0
0h 1
13 1.6174090e+04 4.39e-05 1.29e+00 -3.8 2.68e+00 - 1.00e+00 4.80e-0
1h 1
14 1.6170560e+04 4.24e-07 1.15e-01 -3.8 1.39e+00 - 9.63e-01 1.00e+0
0f 1
15 1.6169508e+04 3.28e-08 2.14e-03 -3.8 3.29e-02 - 1.00e+00 1.00e+0
0H 1
16 1.6169717e+04 1.51e-05 3.29e-04 -3.8 4.69e-03 - 1.00e+00 1.00e+0
0f 1
17 1.6168939e+04 2.35e-06 5.82e-02 -5.7 1.49e-01 - 7.79e-01 9.72e-0
1h 1
18 1.6168773e+04 1.23e-05 1.93e-04 -5.7 5.05e-03 - 1.00e+00 1.00e+0
0f 1
19 1.6168778e+04 1.58e-08 1.42e-06 -5.7 1.91e-04 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6168763e+04 2.49e-08 2.40e-06 -8.6 1.84e-03 - 9.84e-01 9.83e-0
1h 1
21 1.6168763e+04 6.68e-13 3.66e-11 -8.6 3.21e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.6168762773817868e+01 1.6168762773817867e+0
4
Dual infeasibility......: 3.6567366474601391e-11 3.6567366474601391e-0
8
Constraint violation....: 6.6846528312680675e-13 6.6846528312680675e-1
3
Complementarity.........: 2.5125405464080288e-09 2.5125405464080289e-0
6
Overall NLP error.......: 2.5125405464080288e-09 2.5125405464080289e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0892329e+02 1.39e+04 5.23e+01 -1.0 1.40e+04 - 1.00e-03 9.80e-0
3h 1
2 9.0612191e+02 1.39e+04 5.23e+01 -1.0 1.31e+04 - 3.81e-05 1.05e-0
4h 1
3 8.6393761e+02 1.39e+04 5.23e+01 -1.0 1.39e+04 - 8.19e-06 3.12e-0
3h 1
4 6.1233664e+02 1.36e+04 5.23e+01 -1.0 1.39e+04 - 3.40e-03 2.18e-0
2h 1
5 2.5045206e+04 6.92e-02 7.70e+01 -1.0 1.36e+04 - 8.48e-02 1.00e+0
0h 1
6 1.7749628e+04 6.21e-02 3.45e+01 -1.0 2.73e+01 - 5.26e-01 9.36e-0
2f 1
7 1.6240639e+04 2.01e-02 1.28e+01 -1.0 1.51e+01 - 6.50e-01 7.66e-0
1f 1
8 1.6353998e+04 6.29e-03 1.05e+00 -1.0 2.61e+00 - 9.92e-01 5.00e-0
1f 2
9 1.6587894e+04 2.25e-04 5.80e-02 -1.0 4.39e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6014302e+04 2.28e-03 8.80e-02 -2.5 3.88e+01 - 8.55e-01 8.30e-0
1f 1
11 1.5845606e+04 2.12e-03 4.46e-01 -2.5 6.46e+00 - 1.00e+00 7.52e-0
1f 1
12 1.5817010e+04 1.51e-04 4.78e-03 -2.5 1.60e+00 - 1.00e+00 1.00e+0
0h 1
13 1.5798456e+04 4.03e-05 1.57e-01 -3.8 5.36e+00 - 1.00e+00 7.54e-0
1h 1
14 1.5793526e+04 1.40e-07 3.53e-04 -3.8 1.32e+00 - 1.00e+00 1.00e+0
0f 1
15 1.5792153e+04 2.80e-08 9.33e-04 -5.7 2.97e-01 - 1.00e+00 9.86e-0
1h 1
16 1.5792139e+04 1.87e-12 1.34e-08 -5.7 4.29e-03 - 1.00e+00 1.00e+0
0f 1
17 1.5792122e+04 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5792122223581192e+01 1.5792122223581191e+0
4
Dual infeasibility......: 4.4776947863158229e-09 4.4776947863158229e-0
6
Constraint violation....: 2.6307428457883475e-12 2.6307428457883475e-1
2
Complementarity.........: 3.6084997590675489e-09 3.6084997590675487e-0
6
Overall NLP error.......: 4.4776947863158229e-09 4.4776947863158229e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8071586e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.97e-04 9.81e-0
3h 1
2 8.7764109e+02 1.26e+04 5.24e+01 -1.0 1.03e+04 - 2.17e-05 1.21e-0
4h 1
3 8.4689144e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 2.59e-05 2.05e-0
3h 1
4 5.5058580e+02 1.23e+04 5.24e+01 -1.0 1.26e+04 - 2.06e-03 2.17e-0
2h 1
5 2.4025897e+04 6.30e-02 8.13e+01 -1.0 1.23e+04 - 3.72e-02 1.00e+0
0h 1
6 1.6236585e+04 5.96e-02 5.47e+01 -1.0 5.77e+01 - 3.22e-01 4.96e-0
2f 1
7 1.4694539e+04 2.64e-02 2.75e+01 -1.0 2.96e+01 - 5.00e-01 5.18e-0
1f 1
8 1.4014506e+04 1.01e-02 1.99e+00 -1.0 9.93e+00 - 9.27e-01 9.19e-0
1f 1
9 1.4475817e+04 3.16e-04 1.16e-01 -1.0 4.44e+00 - 9.63e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3746492e+04 1.50e-03 7.51e-02 -2.5 6.42e+00 - 8.67e-01 8.67e-0
1f 1
11 1.3728836e+04 8.41e-06 1.39e-02 -2.5 2.45e+00 - 1.00e+00 1.00e+0
0h 1
12 1.3696832e+04 6.71e-04 8.02e-02 -3.8 8.02e+00 - 6.69e-01 9.95e-0
1f 1
13 1.3694437e+04 1.36e-03 4.30e-03 -3.8 4.32e-01 - 8.90e-01 1.00e+0
0h 1
14 1.3694403e+04 1.43e-04 1.49e-04 -3.8 1.69e-02 - 1.00e+00 1.00e+0
0h 1
15 1.3692884e+04 1.49e-04 1.22e-03 -5.7 4.52e-01 - 9.13e-01 1.00e+0
0h 1
16 1.3692839e+04 4.04e-05 9.84e-06 -5.7 9.36e-03 - 1.00e+00 1.00e+0
0h 1
17 1.3692842e+04 8.22e-07 6.10e-06 -5.7 1.31e-03 - 1.00e+00 1.00e+0
0h 1
18 1.3692827e+04 6.37e-08 6.73e-05 -8.6 5.53e-03 - 1.00e+00 9.40e-0
1h 1
19 1.3692826e+04 8.74e-12 8.98e-11 -8.6 3.29e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.3692825545643373e+01 1.3692825545643373e+0
4
Dual infeasibility......: 8.9750330751306279e-11 8.9750330751306285e-0
8
Constraint violation....: 8.7388984937319947e-12 8.7388984937319947e-1
2
Complementarity.........: 3.3798596390012216e-09 3.3798596390012217e-0
6
Overall NLP error.......: 3.3798596390012216e-09 3.3798596390012217e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9481357e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 7.48e-04 9.80e-0
3h 1
2 8.9183826e+02 1.11e+04 5.24e+01 -1.0 9.65e+03 - 2.73e-05 1.14e-0
4h 1
3 7.2358255e+02 1.10e+04 5.24e+01 -1.0 1.11e+04 - 1.86e-05 1.03e-0
2h 1
4 6.2607046e+02 1.08e+04 5.20e+01 -1.0 1.10e+04 - 1.15e-02 2.10e-0
2h 1
5 1.9624053e+04 7.36e-02 7.76e+01 -1.0 1.08e+04 - 9.80e-02 1.00e+0
0h 1
6 1.4380395e+04 6.46e-02 2.08e+01 -1.0 3.73e+01 - 7.04e-01 1.14e-0
1f 1
7 1.2837848e+04 2.05e-02 1.65e+00 -1.0 1.97e+01 - 9.31e-01 7.25e-0
1f 1
8 1.3179866e+04 1.96e-03 7.58e-01 -1.0 4.05e+00 - 6.11e-01 1.00e+0
0f 1
9 1.2670455e+04 1.70e-03 2.84e-01 -1.7 4.14e+00 - 8.35e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2645066e+04 8.45e-04 5.34e-01 -1.7 9.46e+00 - 5.92e-01 1.00e+0
0h 1
11 1.2664337e+04 3.87e-06 1.54e-01 -1.7 1.52e+01 - 7.82e-01 1.00e+0
0h 1
12 1.2499809e+04 4.87e-04 2.91e-02 -2.5 1.58e+01 - 9.73e-01 9.34e-0
1f 1
13 1.2484360e+04 3.25e-05 1.91e-03 -2.5 7.55e+00 - 1.00e+00 1.00e+0
0f 1
14 1.2456132e+04 1.44e-05 2.24e-02 -3.8 8.12e+00 - 1.00e+00 9.33e-0
1f 1
15 1.2455186e+04 4.74e-08 5.38e-04 -3.8 5.42e-01 - 1.00e+00 1.00e+0
0f 1
16 1.2453590e+04 4.26e-08 4.67e-04 -5.7 4.46e-01 - 1.00e+00 9.90e-0
1f 1
17 1.2453581e+04 1.95e-12 3.19e-08 -5.7 4.34e-03 - 1.00e+00 1.00e+0
0f 1
18 1.2453562e+04 2.58e-12 3.28e-06 -8.6 5.53e-03 - 1.00e+00 9.99e-0
1f 1
19 1.2453562e+04 1.65e-15 4.86e-14 -8.6 2.89e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.2453562320049166e+01 1.2453562320049165e+0
4
Dual infeasibility......: 4.8629897126972227e-14 4.8629897126972227e-1
1
Constraint violation....: 1.6485948034721604e-15 1.6485948034721604e-1
5
Complementarity.........: 2.7443037927563605e-09 2.7443037927563605e-0
6
Overall NLP error.......: 2.7443037927563605e-09 2.7443037927563605e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0889550e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0544003e+02 9.19e+03 5.23e+01 -1.0 6.53e+03 - 1.88e-05 1.39e-0
4h 1
3 4.7820593e+02 8.97e+03 5.24e+01 -1.0 9.19e+03 - 4.54e-05 2.34e-0
2f 1
4 2.1767436e+04 6.51e-02 8.07e+01 -1.0 8.97e+03 - 2.85e-02 1.00e+0
0h 1
5 1.3313724e+04 6.22e-02 6.41e+01 -1.0 3.95e+01 - 2.06e-01 4.10e-0
2f 1
6 1.2046235e+04 2.08e-02 3.03e+01 -1.0 1.63e+01 - 5.38e-01 6.14e-0
1f 1
7 1.1599697e+04 6.95e-03 9.87e-01 -1.0 5.66e+00 - 9.55e-01 7.67e-0
1f 1
8 1.1862526e+04 2.40e-04 7.34e-02 -1.0 4.91e+00 - 1.00e+00 1.00e+0
0f 1
9 1.1304536e+04 2.07e-03 8.43e-02 -2.5 6.12e+00 - 8.56e-01 8.40e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1141064e+04 2.16e-03 4.29e-01 -2.5 1.00e+00 - 1.00e+00 7.59e-0
1f 1
11 1.1113966e+04 1.30e-04 4.69e-03 -2.5 2.27e-01 - 1.00e+00 1.00e+0
0h 1
12 1.1091123e+04 3.47e-05 1.49e-01 -3.8 1.07e+01 - 1.00e+00 7.59e-0
1h 1
13 1.1085027e+04 1.28e-07 3.42e-04 -3.8 2.58e+00 - 1.00e+00 1.00e+0
0f 1
14 1.1083360e+04 2.84e-08 9.75e-04 -5.7 5.94e-01 - 1.00e+00 9.85e-0
1f 1
15 1.1083341e+04 1.90e-12 1.38e-08 -5.7 8.84e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1083321e+04 2.63e-12 4.48e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.1083320763231466e+01 1.1083320763231466e+0
4
Dual infeasibility......: 4.4776948393748137e-09 4.4776948393748137e-0
6
Constraint violation....: 2.6307914180456748e-12 2.6307914180456748e-1
2
Complementarity.........: 3.6084982702003159e-09 3.6084982702003158e-0
6
Overall NLP error.......: 4.4776948393748137e-09 4.4776948393748137e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3707629e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 2.45e-03 9.81e-0
3h 1
2 8.5523139e+02 6.68e+03 5.23e+01 -1.0 6.53e+03 - 7.68e-06 3.82e-0
3h 1
3 4.5403987e+02 6.54e+03 5.23e+01 -1.0 6.68e+03 - 4.34e-03 2.17e-0
2h 1
4 1.7781600e+04 7.81e-02 8.07e+01 -1.0 6.54e+03 - 4.36e-02 1.00e+0
0h 1
5 1.1209962e+04 7.33e-02 5.55e+01 -1.0 1.53e+01 - 3.07e-01 5.81e-0
2f 1
6 1.0338040e+04 1.80e-02 1.97e+01 -1.0 7.87e+00 - 6.50e-01 6.82e-0
1f 1
7 1.0329594e+04 8.92e-03 1.89e-01 -1.0 2.93e+00 - 9.91e-01 1.00e+0
0f 1
8 9.9909810e+03 1.40e-03 1.12e-01 -1.7 6.88e+00 - 9.68e-01 1.00e+0
0f 1
9 9.8391511e+03 1.26e-03 1.77e-01 -2.5 2.92e+00 - 8.78e-01 7.86e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.8125230e+03 6.43e-05 8.27e-03 -2.5 1.55e+00 - 1.00e+00 9.89e-0
1f 1
11 9.7857397e+03 2.38e-06 7.13e-04 -3.8 1.06e+01 - 1.00e+00 1.00e+0
0f 1
12 9.7842120e+03 2.13e-08 3.77e-06 -5.7 5.92e-01 - 1.00e+00 1.00e+0
0h 1
13 9.7841926e+03 1.77e-12 4.08e-10 -8.6 7.36e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 13
(scaled) (unscaled)
Objective...............: 9.7841925980690174e+00 9.7841925980690175e+0
3
Dual infeasibility......: 4.0756740642001722e-10 4.0756740642001722e-0
7
Constraint violation....: 1.7682522113204868e-12 1.7682522113204868e-1
2
Complementarity.........: 2.9595069546611289e-09 2.9595069546611289e-0
6
Overall NLP error.......: 2.9595069546611289e-09 2.9595069546611289e-0
6
Number of objective function evaluations = 14
Number of objective gradient evaluations = 14
Number of equality constraint evaluations = 14
Number of inequality constraint evaluations = 14
Number of equality constraint Jacobian evaluations = 14
Number of inequality constraint Jacobian evaluations = 14
Number of Lagrangian Hessian evaluations = 13
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0887653e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 1.00e-03 9.81e-0
3h 1
2 9.0575715e+02 4.77e+03 5.23e+01 -1.0 4.05e+03 - 4.23e-05 1.17e-0
4h 1
3 6.7332535e+02 4.72e+03 5.24e+01 -1.0 4.77e+03 - 2.39e-05 1.03e-0
2f 1
4 4.3700790e+02 4.62e+03 5.18e+01 -1.0 4.72e+03 - 1.38e-02 2.11e-0
2h 1
5 1.3037802e+04 7.91e-02 7.80e+01 -1.0 4.62e+03 - 9.53e-02 1.00e+0
0h 1
6 8.3073600e+03 6.95e-02 2.11e+01 -1.0 2.25e+01 - 7.07e-01 1.14e-0
1f 1
7 6.9813423e+03 1.49e-02 1.23e+00 -1.0 1.41e+01 - 9.43e-01 7.79e-0
1f 1
8 7.2864197e+03 1.03e-02 9.66e-01 -1.0 4.36e+00 - 2.02e-01 9.21e-0
1f 1
9 7.5321027e+03 3.05e-03 1.30e+00 -1.0 5.33e+00 - 6.18e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.4995049e+03 1.06e-03 1.61e-01 -1.0 1.30e+01 - 6.09e-01 1.00e+0
0f 1
11 6.9205792e+03 2.15e-03 8.40e-02 -1.7 2.76e+00 - 1.00e+00 1.00e+0
0f 1
12 6.7187697e+03 2.05e-03 1.40e-01 -2.5 1.98e+01 - 8.82e-01 7.95e-0
1f 1
13 6.6908328e+03 1.73e-04 5.45e-03 -2.5 4.00e+00 - 1.00e+00 1.00e+0
0h 1
14 6.6725597e+03 4.73e-05 1.78e-01 -3.8 5.36e+00 - 1.00e+00 7.41e-0
1h 1
15 6.6672687e+03 1.73e-07 3.62e-04 -3.8 1.39e+00 - 1.00e+00 1.00e+0
0f 1
16 6.6659007e+03 2.71e-08 9.59e-04 -5.7 2.97e-01 - 1.00e+00 9.85e-0
1h 1
17 6.6658859e+03 1.86e-12 1.34e-08 -5.7 4.34e-03 - 1.00e+00 1.00e+0
0f 1
18 6.6658693e+03 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 6.6658693442553929e+00 6.6658693442553931e+0
3
Dual infeasibility......: 4.4777032296579787e-09 4.4777032296579787e-0
6
Constraint violation....: 2.6305416178651342e-12 2.6305416178651342e-1
2
Complementarity.........: 4.5999244693486658e-09 4.5999244693486654e-0
6
Overall NLP error.......: 4.5999244693486658e-09 4.5999244693486654e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6642462e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 4.97e-04 9.81e-0
3h 1
2 8.6166973e+02 3.24e+03 5.24e+01 -1.0 1.78e+03 - 3.43e-05 1.80e-0
4h 1
3 3.1407266e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 9.62e-05 2.24e-0
2f 1
4 1.5404000e+04 5.91e-02 8.11e+01 -1.0 3.17e+03 - 3.62e-02 1.00e+0
0h 1
5 6.7204816e+03 5.60e-02 5.89e+01 -1.0 7.11e+01 - 2.71e-01 4.74e-0
2f 1
6 4.9268594e+03 2.53e-02 3.18e+01 -1.0 3.51e+01 - 4.68e-01 5.22e-0
1f 1
7 4.4315069e+03 1.19e-02 2.56e+00 -1.0 9.58e+00 - 9.27e-01 1.00e+0
0f 1
8 4.7750401e+03 6.02e-04 6.73e-02 -1.0 2.91e+00 - 9.97e-01 1.00e+0
0f 1
9 4.1957480e+03 6.59e-04 3.54e-01 -2.5 7.48e+00 - 8.90e-01 7.46e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.1311700e+03 2.03e-04 2.33e-01 -2.5 3.69e+00 - 9.11e-01 1.00e+0
0h 1
11 4.1149248e+03 1.80e-04 1.07e-01 -2.5 9.31e-01 - 1.00e+00 7.31e-0
1H 1
12 4.1119664e+03 3.45e-04 2.18e-03 -2.5 1.46e-01 - 1.00e+00 1.00e+0
0f 1
13 4.0880964e+03 1.22e-03 3.17e-02 -3.8 1.07e+01 - 7.97e-01 1.00e+0
0h 1
14 4.0847468e+03 2.76e-03 1.10e-03 -3.8 4.88e-02 - 1.00e+00 1.00e+0
0h 1
15 4.0851060e+03 3.91e-05 1.31e-04 -3.8 1.37e-02 - 1.00e+00 1.00e+0
0h 1
16 4.0833633e+03 1.01e-04 3.57e-04 -5.7 5.94e-01 - 9.51e-01 9.77e-0
1h 1
17 4.0833439e+03 2.19e-05 3.67e-03 -5.7 1.35e-02 - 1.00e+00 7.84e-0
1h 1
18 4.0833449e+03 8.57e-09 1.20e-06 -5.7 2.92e-03 - 1.00e+00 1.00e+0
0f 1
19 4.0833247e+03 9.02e-09 1.93e-05 -8.6 7.37e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 4.0833244e+03 1.37e-12 6.48e-11 -8.6 1.22e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 4.0833244012576770e+00 4.0833244012576770e+0
3
Dual infeasibility......: 6.4815378382208725e-11 6.4815378382208725e-0
8
Constraint violation....: 1.3691270339677430e-12 1.3691270339677430e-1
2
Complementarity.........: 3.1011957610617001e-09 3.1011957610617002e-0
6
Overall NLP error.......: 3.1011957610617001e-09 3.1011957610617002e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1563082e+02 2.00e+03 5.23e+01 -1.0 2.01e+03 - 1.20e-03 9.83e-0
3h 1
2 9.0208071e+02 2.00e+03 5.23e+01 -1.0 1.62e+03 - 3.70e-05 5.24e-0
4h 1
3 8.2895266e+02 1.99e+03 5.23e+01 -1.0 2.00e+03 - 4.56e-04 2.89e-0
3h 1
4 3.2183134e+02 1.95e+03 5.23e+01 -1.0 1.99e+03 - 3.37e-03 2.20e-0
2f 1
5 1.3065597e+04 7.11e-02 7.72e+01 -1.0 1.95e+03 - 8.36e-02 1.00e+0
0h 1
6 5.9952141e+03 6.39e-02 2.80e+01 -1.0 1.95e+01 - 6.08e-01 9.31e-0
2f 1
7 4.5197595e+03 1.71e-02 1.04e+01 -1.0 1.25e+01 - 6.70e-01 8.61e-0
1f 1
8 4.8785100e+03 8.86e-04 3.59e-01 -1.0 3.83e+00 - 9.67e-01 9.98e-0
1f 1
9 4.4206793e+03 2.16e-03 1.28e+00 -1.7 4.62e+00 - 2.85e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.3668306e+03 2.47e-04 5.25e-01 -1.7 5.64e+00 - 7.28e-01 1.00e+0
0h 1
11 4.3771247e+03 1.27e-04 3.41e-01 -1.7 1.56e+01 - 5.75e-01 1.00e+0
0f 1
12 4.3970581e+03 3.23e-06 4.52e-02 -1.7 2.42e+01 - 8.44e-01 1.00e+0
0f 1
13 4.2269806e+03 4.77e-04 2.21e-02 -2.5 2.98e+01 - 9.68e-01 9.54e-0
1f 1
14 4.1905296e+03 1.60e-04 1.43e-01 -3.8 2.29e+01 - 9.85e-01 7.39e-0
1h 1
15 4.1818138e+03 3.87e-07 6.64e-04 -3.8 5.33e+00 - 1.00e+00 1.00e+0
0h 1
16 4.1805123e+03 2.56e-08 1.35e-04 -5.7 2.51e-01 - 1.00e+00 9.89e-0
1h 1
17 4.1805064e+03 1.60e-12 3.01e-01 -5.7 4.33e-03 - 1.52e-03 1.00e+0
0f 1
18 4.1805094e+03 1.07e-15 1.84e-11 -5.7 3.04e-03 - 1.00e+00 1.00e+0
0h 1
19 4.1804892e+03 2.63e-12 1.52e-09 -8.6 7.37e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 4.1804891608115051e+00 4.1804891608115049e+0
3
Dual infeasibility......: 1.5189365398733711e-09 1.5189365398733711e-0
6
Constraint violation....: 2.6280783105292471e-12 2.6280783105292471e-1
2
Complementarity.........: 3.7822180843775754e-09 3.7822180843775755e-0
6
Overall NLP error.......: 3.7822180843775754e-09 3.7822180843775755e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 38
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 19
inequality constraints with only lower bounds: 10
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0774891e+02 9.17e+02 5.23e+01 -1.0 9.20e+02 - 1.00e-03 9.88e-0
3h 1
2 8.4540605e+02 9.15e+02 5.23e+01 -1.0 8.79e+02 - 9.05e-05 2.34e-0
3h 1
3 2.8754281e+02 8.95e+02 5.24e+01 -1.0 9.15e+02 - 2.40e-03 2.22e-0
2h 1
4 1.2444230e+04 6.81e-02 7.68e+01 -1.0 8.95e+02 - 8.41e-02 1.00e+0
0h 1
5 4.8011316e+03 6.12e-02 3.59e+01 -1.0 2.80e+01 - 5.07e-01 9.21e-0
2f 1
6 3.2963791e+03 1.99e-02 1.39e+01 -1.0 1.52e+01 - 6.35e-01 7.55e-0
1f 1
7 3.4752862e+03 3.85e-03 1.40e-01 -1.0 2.22e+00 - 9.91e-01 1.00e+0
0f 1
8 3.0360691e+03 1.49e-03 1.32e-01 -1.7 1.06e+01 - 1.00e+00 1.00e+0
0f 1
9 2.8726135e+03 2.09e-03 3.80e-01 -2.5 8.64e+00 - 1.00e+00 7.98e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 2.8512491e+03 1.42e-04 5.20e-03 -2.5 1.61e+00 - 1.00e+00 1.00e+0
0h 1
11 2.8231372e+03 3.90e-05 1.76e-01 -3.8 1.88e+01 - 1.00e+00 7.42e-0
1h 1
12 2.8145167e+03 1.54e-07 3.47e-04 -3.8 4.81e+00 - 1.00e+00 1.00e+0
0f 1
13 2.8124164e+03 2.74e-08 1.03e-03 -5.7 1.04e+00 - 1.00e+00 9.85e-0
1f 1
14 2.8123895e+03 1.97e-12 1.40e-08 -5.7 1.58e-02 - 1.00e+00 1.00e+0
0f 1
15 2.8123637e+03 2.63e-12 4.48e-09 -8.6 1.29e-02 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 2.8123637193399502e+00 2.8123637193399500e+0
3
Dual infeasibility......: 4.4777069727219836e-09 4.4777069727219836e-0
6
Constraint violation....: 2.6309857070749842e-12 2.6309857070749842e-1
2
Complementarity.........: 3.6085007503538331e-09 3.6085007503538330e-0
6
Overall NLP error.......: 4.4777069727219836e-09 4.4777069727219836e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254210124e-01 6.4890146254210117e+0
2
Dual infeasibility......: 4.9126604805733771e-09 4.9126604805733771e-0
6
Constraint violation....: 6.2123813870940126e-09 6.2123813870940126e-0
9
Complementarity.........: 4.3646095252459305e-09 4.3646095252459303e-0
6
Overall NLP error.......: 6.2123813870940126e-09 4.9126604805733771e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031320943025915e-09 2.1031320943025915e-0
6
Constraint violation....: 6.2994179317321652e-11 6.2994179317321652e-1
1
Complementarity.........: 2.8882108896920311e-09 2.8882108896920312e-0
6
Overall NLP error.......: 2.8882108896920311e-09 2.8882108896920312e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.00e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5922495e+02 6.74e+01 8.45e+01 -1.0 2.33e+01 - 4.26e-04 3.65e-0
2f 1
2 1.1912053e+04 5.72e-02 8.08e+01 -1.0 2.64e+01 - 4.94e-02 1.00e+0
0h 1
3 3.2555102e+03 5.35e-02 5.42e+01 -1.0 7.80e+01 - 3.21e-01 5.92e-0
2f 1
4 1.2886041e+03 2.96e-02 2.93e+01 -1.0 4.32e+01 - 4.63e-01 4.98e-0
1f 1
5 1.5535829e+03 7.08e-03 2.68e+00 -1.0 1.58e+01 - 9.21e-01 1.00e+0
0h 1
6 1.1398698e+03 1.82e-03 1.48e-01 -1.0 1.06e+01 - 1.00e+00 1.00e+0
0f 1
7 8.6120890e+02 9.38e-04 1.37e+00 -2.5 5.80e+00 - 9.32e-01 5.49e-0
1f 1
8 6.9838759e+02 9.94e-04 3.07e-01 -2.5 6.20e+00 - 7.78e-01 1.00e+0
0f 1
9 6.6230912e+02 1.64e-03 8.95e-02 -2.5 2.33e+00 - 1.00e+00 8.20e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.6664677e+02 3.57e-04 2.20e-03 -2.5 2.44e-01 - 1.00e+00 1.00e+0
0h 1
11 6.5279802e+02 4.58e-04 6.15e-02 -3.8 4.09e-01 - 7.96e-01 9.25e-0
1h 1
12 6.4977649e+02 1.35e-03 1.53e-03 -3.8 3.27e-02 - 1.00e+00 1.00e+0
0h 1
13 6.4995182e+02 7.49e-06 4.25e-05 -3.8 5.27e-03 - 1.00e+00 1.00e+0
0h 1
14 6.4891725e+02 3.68e-05 1.38e-04 -5.7 1.71e-02 - 9.71e-01 9.99e-0
1h 1
15 6.4891432e+02 7.26e-08 1.54e-07 -5.7 5.01e-04 - 1.00e+00 1.00e+0
0h 1
16 6.4890146e+02 6.21e-09 4.91e-09 -8.6 2.11e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 6.4890146254210124e-01 6.4890146254210117e+0
2
Dual infeasibility......: 4.9126604805733771e-09 4.9126604805733771e-0
6
Constraint violation....: 6.2123813870940126e-09 6.2123813870940126e-0
9
Complementarity.........: 4.3646095252459305e-09 4.3646095252459303e-0
6
Overall NLP error.......: 6.2123813870940126e-09 4.9126604805733771e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 3.50e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 3.1132018e+02 3.34e+01 5.17e+01 -1.0 1.17e+01 - 8.56e-04 4.42e-0
2f 1
2 1.2304487e+04 6.18e-02 7.72e+01 -1.0 1.54e+01 - 8.86e-02 1.00e+0
0h 1
3 3.7206945e+03 5.52e-02 4.61e+01 -1.0 4.16e+01 - 3.86e-01 9.51e-0
2f 1
4 2.4294275e+03 2.65e-02 1.75e+01 -1.0 1.92e+01 - 6.14e-01 5.60e-0
1f 1
5 2.1515622e+03 3.92e-03 7.30e-01 -1.0 5.41e+00 - 9.58e-01 8.00e-0
1h 1
6 1.8312920e+03 9.35e-03 3.16e-01 -1.7 1.76e+00 - 1.00e+00 7.96e-0
1f 1
7 1.7576684e+03 1.23e-03 1.40e-01 -1.7 3.83e-01 - 1.00e+00 9.36e-0
1h 1
8 1.6495294e+03 4.90e-04 1.60e-01 -2.5 6.47e-01 - 9.46e-01 8.43e-0
1h 1
9 1.6324243e+03 5.10e-05 2.54e-03 -2.5 9.66e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6111012e+03 1.40e-05 1.07e-03 -3.8 9.52e-02 - 1.00e+00 1.00e+0
0h 1
11 1.6106323e+03 4.93e-06 2.99e-01 -5.7 4.90e-03 - 1.00e+00 6.47e-0
1h 1
12 1.6104196e+03 5.66e-10 1.80e-02 -5.7 1.72e-03 - 9.69e-01 1.00e+0
0f 1
13 1.6104193e+03 9.03e-14 2.94e-08 -5.7 1.38e-06 - 1.00e+00 1.00e+0
0h 1
14 1.6104064e+03 2.64e-12 2.95e-04 -8.6 6.53e-05 - 1.00e+00 9.90e-0
1f 1
15 1.6104063e+03 7.45e-16 2.46e-12 -8.6 6.22e-07 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.6104063281643326e+00 1.6104063281643325e+0
3
Dual infeasibility......: 2.4577488759278421e-12 2.4577488759278421e-0
9
Constraint violation....: 7.4511016092546002e-16 7.4511016092546002e-1
6
Complementarity.........: 2.5062163910047563e-09 2.5062163910047562e-0
6
Overall NLP error.......: 2.5062163910047563e-09 2.5062163910047562e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2303872e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 3.31e-04 9.86e-0
3h 1
2 8.0919006e+02 9.17e+02 5.24e+01 -1.0 7.37e+02 - 8.12e-05 5.04e-0
4h 1
3 2.4239398e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 4.72e-04 2.11e-0
2f 1
4 1.2489447e+04 5.50e-02 8.23e+01 -1.0 8.98e+02 - 3.83e-02 1.00e+0
0h 1
5 3.8941148e+03 5.25e-02 5.67e+01 -1.0 8.14e+01 - 3.09e-01 4.98e-0
2f 1
6 1.9112633e+03 3.73e-02 3.04e+01 -1.0 3.92e+01 - 4.68e-01 5.06e-0
1f 1
7 4.6876227e+03 1.23e-02 2.71e+01 -1.0 2.07e+01 - 3.99e-01 1.00e+0
0h 1
8 1.8763004e+03 1.20e-02 1.04e+00 -1.0 2.56e+01 - 9.88e-01 8.91e-0
1f 1
9 1.9981274e+03 1.95e-04 4.76e-02 -1.0 2.98e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7321093e+03 2.19e-04 1.23e+00 -2.5 1.80e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5439398e+03 3.77e-03 1.33e-01 -2.5 7.59e+00 - 7.95e-01 1.00e+0
0f 1
12 1.5209204e+03 5.17e-03 3.09e-01 -2.5 1.82e+00 - 1.00e+00 7.67e-0
1h 1
13 1.5332321e+03 2.41e-04 4.72e-03 -2.5 7.16e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5031438e+03 1.70e-04 2.15e-02 -3.8 1.35e+01 - 9.90e-01 9.29e-0
1h 1
15 1.5019709e+03 7.24e-07 6.84e-05 -3.8 9.19e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003148e+03 3.77e-07 1.78e-04 -5.7 7.43e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.79e-11 2.92e-09 -5.7 4.20e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932776792490e+00 1.5002932776792491e+0
3
Dual infeasibility......: 2.1737235072361823e-09 2.1737235072361823e-0
6
Constraint violation....: 6.2995358929285317e-11 6.2995358929285317e-1
1
Complementarity.........: 2.8882174443499186e-09 2.8882174443499185e-0
6
Overall NLP error.......: 2.8882174443499186e-09 2.8882174443499185e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
1 8.6555952e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 4.97e-04 9.86e-0
3h 1
2 8.5049278e+02 9.17e+02 5.24e+01 -1.0 7.54e+02 - 7.94e-05 5.56e-0
4h 1
3 2.6243053e+02 8.97e+02 5.25e+01 -1.0 9.17e+02 - 5.25e-04 2.21e-0
2h 1
4 1.2843590e+04 5.96e-02 8.01e+01 -1.0 8.97e+02 - 5.01e-02 1.00e+0
0h 1
5 4.2877638e+03 5.57e-02 5.36e+01 -1.0 7.35e+01 - 3.21e-01 5.99e-0
2f 1
99 1.847882e+04 1.632511e+04 7.241908e+01
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.1156838e+02 1.57e+04 5.50e+01 -1.0 1.59e+04 - 1.75e-04 9.80e-0
3f 1
2 7.0871565e+02 1.57e+04 5.50e+01 -1.0 1.51e+04 - 4.88e-05 1.03e-0
4h 1
3 6.8593328e+02 1.57e+04 5.49e+01 -1.0 1.57e+04 - 5.99e-06 1.84e-0
3h 1
4 5.0408067e+02 1.54e+04 5.39e+01 -1.0 1.57e+04 - 1.96e-03 1.86e-0
2h 1
5 2.5747679e+04 7.61e-02 8.68e+01 -1.0 1.54e+04 - 2.60e-02 1.00e+0
0h 1
6 1.7881623e+04 7.32e-02 7.10e+01 -1.0 6.82e+01 - 1.90e-01 4.11e-0
2f 1
7 1.6631485e+04 4.65e-02 3.27e+01 -1.0 2.00e+01 - 5.34e-01 3.77e-0
1f 1
8 1.7128234e+04 3.51e-02 1.08e+01 -1.0 1.33e+01 - 5.66e-01 2.50e-0
1f 3
9 1.6801609e+04 7.33e-03 8.80e-01 -1.0 1.68e+00 - 9.37e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6821746e+04 2.03e-04 2.03e+00 -1.0 7.77e+00 - 1.50e-01 1.00e+0
0f 1
11 1.6833545e+04 6.15e-06 6.24e-01 -1.0 7.14e+00 - 7.07e-01 1.00e+0
0f 1
12 1.6538649e+04 2.27e-04 4.94e-01 -1.7 4.72e+00 - 9.61e-01 8.02e-0
1f 1
13 1.6493577e+04 7.43e-04 3.36e-02 -1.7 1.70e+01 - 9.63e-01 1.00e+0
0f 1
14 1.6362797e+04 1.22e-03 4.47e-02 -2.5 2.91e+01 - 9.17e-01 1.00e+0
0f 1
15 1.6344447e+04 1.20e-03 1.34e-02 -2.5 1.16e+00 - 1.00e+00 1.00e+0
0h 1
16 1.6327945e+04 1.98e-04 8.85e-02 -3.8 5.35e+00 - 1.00e+00 8.50e-0
1h 1
17 1.6326221e+04 4.31e-07 1.13e-04 -3.8 7.87e-01 - 1.00e+00 1.00e+0
0h 1
18 1.6325334e+04 3.36e-07 1.06e-02 -5.7 2.49e-01 - 1.00e+00 7.59e-0
1h 1
19 1.6325119e+04 2.34e-08 7.68e-07 -5.7 1.49e-02 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325105e+04 1.49e-10 2.31e-06 -8.6 2.46e-03 - 1.00e+00 9.96e-0
1h 1
21 1.6325105e+04 1.42e-14 2.93e-14 -8.6 2.34e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.6325105286995917e+01 1.6325105286995917e+0
4
Dual infeasibility......: 2.9272695559832482e-14 2.9272695559832482e-1
1
Constraint violation....: 1.4210854715202004e-14 1.4210854715202004e-1
4
Complementarity.........: 2.5060173293284314e-09 2.5060173293284314e-0
6
Overall NLP error.......: 2.5060173293284314e-09 2.5060173293284314e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4811413e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 4.08e-04 9.80e-0
3f 1
2 8.4531706e+02 1.50e+04 5.24e+01 -1.0 1.48e+04 - 9.25e-05 1.00e-0
4h 1
3 8.3755891e+02 1.50e+04 5.24e+01 -1.0 1.50e+04 - 2.87e-06 5.97e-0
4f 1
4 5.6582851e+02 1.46e+04 5.26e+01 -1.0 1.50e+04 - 6.38e-04 2.16e-0
2h 1
5 2.6666283e+04 5.76e-02 8.10e+01 -1.0 1.46e+04 - 4.61e-02 1.00e+0
0h 1
6 1.8142400e+04 5.40e-02 5.28e+01 -1.0 7.94e+01 - 3.40e-01 5.65e-0
2f 1
7 1.6073711e+04 3.26e-02 2.87e+01 -1.0 4.22e+01 - 4.65e-01 5.24e-0
1f 1
8 1.6589657e+04 1.26e-02 2.77e+00 -1.0 2.02e+01 - 8.55e-01 5.00e-0
1f 2
9 1.6078242e+04 5.03e-03 1.89e-01 -1.0 1.04e+01 - 9.55e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5781764e+04 1.28e-03 4.95e-01 -1.7 4.22e+00 - 1.00e+00 7.91e-0
1f 1
11 1.5747649e+04 3.75e-04 2.61e-02 -1.7 1.61e+01 - 1.00e+00 1.00e+0
0f 1
12 1.5604589e+04 1.15e-03 1.16e-01 -3.8 1.99e+01 - 7.67e-01 9.21e-0
1f 1
13 1.5574499e+04 1.46e-03 3.31e-02 -3.8 2.12e+00 - 8.20e-01 7.40e-0
1h 1
14 1.5574865e+04 3.39e-06 3.13e-02 -3.8 4.04e-01 - 9.82e-01 1.00e+0
0h 1
15 1.5573967e+04 8.57e-05 3.39e-04 -3.8 1.23e-02 - 1.00e+00 1.00e+0
0h 1
16 1.5572894e+04 1.51e-05 7.65e-03 -5.7 1.49e-01 - 9.11e-01 9.84e-0
1h 1
17 1.5572844e+04 4.79e-07 1.69e-06 -5.7 2.42e-03 - 1.00e+00 1.00e+0
0h 1
18 1.5572829e+04 4.63e-09 3.82e-07 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
19 1.5572829e+04 9.66e-15 3.68e-14 -8.6 1.46e-07 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.5572828789807399e+01 1.5572828789807400e+0
4
Dual infeasibility......: 3.6761779980153718e-14 3.6761779980153718e-1
1
Constraint violation....: 9.6589403142388619e-15 9.6589403142388619e-1
5
Complementarity.........: 2.5059091804034683e-09 2.5059091804034683e-0
6
Overall NLP error.......: 2.5059091804034683e-09 2.5059091804034683e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.0892329e+02 1.39e+04 5.23e+01 -1.0 1.40e+04 - 1.00e-03 9.80e-0
3h 1
2 9.0612191e+02 1.39e+04 5.23e+01 -1.0 1.31e+04 - 3.81e-05 1.05e-0
4h 1
3 8.6393760e+02 1.39e+04 5.23e+01 -1.0 1.39e+04 - 8.19e-06 3.12e-0
3h 1
4 6.1233665e+02 1.36e+04 5.23e+01 -1.0 1.39e+04 - 3.40e-03 2.18e-0
2h 1
5 2.5045205e+04 6.92e-02 7.70e+01 -1.0 1.36e+04 - 8.48e-02 1.00e+0
0h 1
6 1.7749628e+04 6.21e-02 3.45e+01 -1.0 2.73e+01 - 5.26e-01 9.36e-0
2f 1
7 1.6240639e+04 2.01e-02 1.28e+01 -1.0 1.51e+01 - 6.50e-01 7.66e-0
1f 1
8 1.6353998e+04 6.29e-03 1.05e+00 -1.0 2.61e+00 - 9.92e-01 5.00e-0
1f 2
9 1.6587951e+04 2.25e-04 5.80e-02 -1.0 4.40e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6014311e+04 2.28e-03 8.80e-02 -2.5 3.89e+01 - 8.55e-01 8.30e-0
1f 1
11 1.5845608e+04 2.12e-03 4.46e-01 -2.5 6.47e+00 - 1.00e+00 7.52e-0
1f 1
12 1.5817010e+04 1.51e-04 4.78e-03 -2.5 1.60e+00 - 1.00e+00 1.00e+0
0h 1
13 1.5798456e+04 4.03e-05 1.57e-01 -3.8 5.36e+00 - 1.00e+00 7.54e-0
1h 1
14 1.5793526e+04 1.40e-07 3.53e-04 -3.8 1.32e+00 - 1.00e+00 1.00e+0
0f 1
15 1.5792153e+04 2.80e-08 9.33e-04 -5.7 2.97e-01 - 1.00e+00 9.86e-0
1h 1
16 1.5792139e+04 1.87e-12 1.34e-08 -5.7 4.29e-03 - 1.00e+00 1.00e+0
0f 1
17 1.5792122e+04 2.63e-12 4.48e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5792122222107553e+01 1.5792122222107553e+0
4
Dual infeasibility......: 4.4776949541024618e-09 4.4776949541024618e-0
6
Constraint violation....: 2.6306734568493084e-12 2.6306734568493084e-1
2
Complementarity.........: 3.6084997724421355e-09 3.6084997724421354e-0
6
Overall NLP error.......: 4.4776949541024618e-09 4.4776949541024618e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1596960e+02 1.27e+04 5.23e+01 -1.0 1.28e+04 - 1.20e-03 9.80e-0
3h 1
2 9.1314143e+02 1.27e+04 5.23e+01 -1.0 1.18e+04 - 3.58e-05 1.06e-0
4h 1
3 8.5649605e+02 1.26e+04 5.23e+01 -1.0 1.26e+04 - 9.49e-06 3.83e-0
3h 1
4 5.9316553e+02 1.23e+04 5.23e+01 -1.0 1.26e+04 - 4.24e-03 2.17e-0
2h 1
5 2.3565113e+04 7.16e-02 7.72e+01 -1.0 1.23e+04 - 8.38e-02 1.00e+0
0h 1
6 1.6636753e+04 6.43e-02 2.76e+01 -1.0 1.93e+01 - 6.15e-01 9.37e-0
2f 1
7 1.5174707e+04 1.67e-02 1.00e+01 -1.0 1.25e+01 - 6.76e-01 8.56e-0
1f 1
8 1.5349422e+04 8.66e-03 6.64e-01 -1.0 3.75e+00 - 9.92e-01 4.95e-0
1f 2
9 1.5052622e+04 9.42e-03 5.41e-01 -1.7 1.09e+01 - 5.29e-01 8.32e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5031916e+04 6.43e-04 6.70e-01 -1.7 1.36e+01 - 6.69e-01 1.00e+0
0f 1
11 1.5035180e+04 8.11e-05 1.83e-03 -1.7 1.20e+01 - 1.00e+00 1.00e+0
0h 1
12 1.4862773e+04 5.50e-04 2.38e-02 -3.8 3.49e+01 - 8.35e-01 8.34e-0
1f 1
13 1.4840200e+04 1.81e-04 1.55e-01 -3.8 5.75e+00 - 9.91e-01 7.31e-0
1h 1
14 1.4835475e+04 3.67e-07 7.47e-04 -3.8 1.55e+00 - 1.00e+00 1.00e+0
0h 1
15 1.4834112e+04 2.60e-08 2.82e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
16 1.4834096e+04 1.71e-12 1.25e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 1.4834096313254225e+01 1.4834096313254224e+0
4
Dual infeasibility......: 1.2467461618578745e-09 1.2467461618578745e-0
6
Constraint violation....: 1.7146423170188996e-12 1.7146423170188996e-1
2
Complementarity.........: 4.6155102111602439e-09 4.6155102111602434e-0
6
Overall NLP error.......: 4.6155102111602439e-09 4.6155102111602434e-0
6
Number of objective function evaluations = 18
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 18
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2301496e+02 1.11e+04 5.23e+01 -1.0 1.12e+04 - 1.51e-03 9.80e-0
3h 1
2 9.2012933e+02 1.11e+04 5.23e+01 -1.0 1.02e+04 - 3.26e-05 1.08e-0
4h 1
3 8.3424137e+02 1.11e+04 5.23e+01 -1.0 1.11e+04 - 1.17e-05 5.22e-0
3h 1
4 5.7283739e+02 1.08e+04 5.22e+01 -1.0 1.11e+04 - 5.95e-03 2.13e-0
2h 1
5 2.1532474e+04 7.53e-02 7.76e+01 -1.0 1.08e+04 - 8.36e-02 1.00e+0
0h 1
6 1.5215064e+04 6.76e-02 2.23e+01 -1.0 1.30e+01 - 6.84e-01 9.54e-0
2f 1
7 1.3955436e+04 2.05e-02 7.03e+00 -1.0 9.59e+00 - 7.22e-01 8.73e-0
1f 1
8 1.4214931e+04 1.09e-02 1.48e-01 -1.0 2.63e+00 - 9.94e-01 9.34e-0
1f 1
9 1.3829262e+04 2.88e-03 2.36e-01 -1.7 1.62e+01 - 8.99e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3785731e+04 8.54e-04 1.60e-02 -1.7 2.00e+01 - 1.00e+00 1.00e+0
0h 1
11 1.3627936e+04 5.64e-04 3.34e-02 -3.8 3.69e+01 - 8.47e-01 8.18e-0
1f 1
12 1.3607652e+04 1.81e-04 2.27e-01 -3.8 6.68e+00 - 9.83e-01 7.03e-0
1h 1
13 1.3601600e+04 5.08e-07 3.83e-04 -3.8 1.98e+00 - 1.00e+00 1.00e+0
0h 1
14 1.3600267e+04 1.95e-08 4.21e-06 -5.7 2.97e-01 - 1.00e+00 1.00e+0
0h 1
15 1.3600252e+04 8.53e-13 5.02e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.3600252159461153e+01 1.3600252159461153e+0
4
Dual infeasibility......: 5.0195343489935405e-10 5.0195343489935405e-0
7
Constraint violation....: 8.5291496088046870e-13 8.5291496088046870e-1
3
Complementarity.........: 2.6175825269357324e-09 2.6175825269357322e-0
6
Overall NLP error.......: 2.6175825269357324e-09 2.6175825269357322e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3004760e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 2.02e-03 9.81e-0
3h 1
2 9.2458171e+02 9.19e+03 5.23e+01 -1.0 5.43e+03 - 9.22e-06 2.42e-0
4h 1
3 4.8777176e+02 8.97e+03 5.24e+01 -1.0 9.19e+03 - 1.48e-04 2.34e-0
2h 1
4 2.1819681e+04 7.02e-02 7.81e+01 -1.0 8.97e+03 - 5.74e-02 1.00e+0
0h 1
5 1.3648766e+04 6.51e-02 4.65e+01 -1.0 1.06e+01 - 3.92e-01 6.72e-0
2f 1
6 1.2329076e+04 2.50e-02 1.99e+01 -1.0 6.90e+00 - 6.37e-01 1.00e+0
0f 1
7 1.2710449e+04 1.46e-03 1.70e-01 -1.0 2.42e+00 - 9.91e-01 1.00e+0
0f 1
8 1.2188893e+04 1.73e-03 6.89e-02 -1.7 7.63e+00 - 1.00e+00 1.00e+0
0f 1
9 1.2015267e+04 1.99e-03 3.42e-01 -2.5 3.07e+00 - 1.00e+00 7.99e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1992853e+04 1.62e-04 4.13e-02 -2.5 6.14e-01 - 1.00e+00 9.45e-0
1h 1
11 1.1995752e+04 6.80e-06 1.22e-03 -2.5 3.36e-02 - 1.00e+00 1.00e+0
0f 1
12 1.1965916e+04 7.60e-06 4.28e-03 -3.8 1.07e+01 - 1.00e+00 9.79e-0
1f 1
13 1.1965656e+04 1.37e-08 6.29e-06 -3.8 2.27e-01 - 1.00e+00 1.00e+0
0f 1
14 1.1964018e+04 1.73e-08 3.04e-06 -5.7 5.94e-01 - 1.00e+00 1.00e+0
0f 1
15 1.1963999e+04 1.28e-12 4.22e-10 -8.6 7.36e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.1963999158993726e+01 1.1963999158993725e+0
4
Dual infeasibility......: 4.2179926656509424e-10 4.2179926656509424e-0
7
Constraint violation....: 1.2796569359707632e-12 1.2796569359707632e-1
2
Complementarity.........: 3.0240472813773136e-09 3.0240472813773134e-0
6
Overall NLP error.......: 3.0240472813773136e-09 3.0240472813773134e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2299660e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1994562e+02 6.71e+03 5.23e+01 -1.0 5.82e+03 - 3.44e-05 1.14e-0
4h 1
3 7.2850998e+02 6.64e+03 5.23e+01 -1.0 6.70e+03 - 1.95e-05 9.17e-0
3f 1
4 4.9339543e+02 6.50e+03 5.19e+01 -1.0 6.64e+03 - 1.16e-02 2.10e-0
2h 1
5 1.5628522e+04 8.10e-02 7.81e+01 -1.0 6.50e+03 - 8.90e-02 1.00e+0
0h 1
6 1.0636045e+04 7.19e-02 2.13e+01 -1.0 1.24e+01 - 7.05e-01 1.06e-0
1f 1
7 9.4596867e+03 2.23e-02 3.10e+00 -1.0 9.08e+00 - 8.57e-01 8.74e-0
1f 1
8 9.7561577e+03 1.77e-02 3.51e-01 -1.0 2.44e+00 - 8.88e-01 9.15e-0
1f 1
9 9.3848113e+03 3.10e-03 7.43e-01 -1.7 2.79e+00 - 5.94e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.3511140e+03 4.03e-04 6.09e-01 -1.7 5.76e+00 - 6.52e-01 1.00e+0
0h 1
11 9.3678042e+03 5.50e-05 1.96e-01 -1.7 1.06e+01 - 7.53e-01 1.00e+0
0h 1
12 9.2189154e+03 4.26e-04 1.79e-02 -2.5 1.07e+01 - 9.63e-01 9.32e-0
1f 1
13 9.1916505e+03 1.44e-04 1.93e-01 -3.8 1.06e+01 - 9.87e-01 7.22e-0
1h 1
14 9.1841521e+03 4.33e-07 3.42e-04 -3.8 3.12e+00 - 1.00e+00 1.00e+0
0h 1
15 9.1828158e+03 2.02e-08 4.20e-06 -5.7 2.98e-01 - 1.00e+00 1.00e+0
0h 1
16 9.1828008e+03 8.54e-13 5.02e-10 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 16
(scaled) (unscaled)
Objective...............: 9.1828007881584295e+00 9.1828007881584290e+0
3
Dual infeasibility......: 5.0243744958146128e-10 5.0243744958146128e-0
7
Constraint violation....: 8.5351170575620472e-13 8.5351170575620472e-1
3
Complementarity.........: 4.4922709536571724e-09 4.4922709536571724e-0
6
Overall NLP error.......: 4.4922709536571724e-09 4.4922709536571724e-0
6
Number of objective function evaluations = 17
Number of objective gradient evaluations = 17
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 17
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 16
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8772454e+02 4.77e+03 5.24e+01 -1.0 4.82e+03 - 6.64e-04 9.81e-0
3h 1
2 8.8463069e+02 4.77e+03 5.24e+01 -1.0 4.12e+03 - 4.65e-05 1.15e-0
4h 1
3 6.9026559e+02 4.73e+03 5.24e+01 -1.0 4.77e+03 - 2.20e-05 8.53e-0
3f 1
4 4.0829902e+02 4.63e+03 5.20e+01 -1.0 4.73e+03 - 1.12e-02 2.07e-0
2h 1
5 1.3286164e+04 7.24e-02 7.77e+01 -1.0 4.63e+03 - 9.89e-02 1.00e+0
0h 1
6 7.8843057e+03 6.35e-02 2.09e+01 -1.0 4.48e+01 - 7.03e-01 1.14e-0
1f 1
7 6.3730706e+03 2.46e-02 2.05e+00 -1.0 2.21e+01 - 9.31e-01 6.56e-0
1f 1
8 6.5551438e+03 3.66e-03 1.12e+00 -1.0 3.60e+00 - 5.19e-01 1.00e+0
0f 1
9 6.7368435e+03 4.58e-04 1.05e+00 -1.0 7.22e+00 - 5.18e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.7262120e+03 8.06e-05 1.35e-01 -1.0 1.39e+01 - 6.27e-01 1.00e+0
0f 1
11 6.1055995e+03 1.84e-03 7.55e-02 -1.7 3.35e+00 - 1.00e+00 1.00e+0
0f 1
12 5.9475772e+03 1.19e-03 2.42e-01 -2.5 2.20e+01 - 9.57e-01 6.69e-0
1f 1
13 5.9425030e+03 1.69e-06 7.41e-03 -2.5 7.22e+00 - 1.00e+00 1.00e+0
0h 1
14 5.9217902e+03 3.91e-06 5.53e-02 -3.8 5.36e+00 - 9.43e-01 8.87e-0
1f 1
15 5.9184142e+03 5.28e-04 6.07e-04 -3.8 6.06e-01 - 1.00e+00 1.00e+0
0f 1
16 5.9173075e+03 5.35e-05 1.05e-02 -5.7 2.97e-01 - 8.29e-01 1.00e+0
0h 1
17 5.9171985e+03 3.22e-05 3.59e-05 -5.7 9.15e-03 - 1.00e+00 1.00e+0
0h 1
18 5.9172014e+03 5.68e-07 6.02e-06 -5.7 1.14e-03 - 1.00e+00 1.00e+0
0h 1
19 5.9171874e+03 3.96e-08 8.04e-05 -8.6 3.68e-03 - 1.00e+00 9.42e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 5.9171866e+03 7.74e-12 6.98e-11 -8.6 2.12e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 5.9171865567467208e+00 5.9171865567467203e+0
3
Dual infeasibility......: 6.9809959692402568e-11 6.9809959692402568e-0
8
Constraint violation....: 7.7369222140077909e-12 7.7369222140077909e-1
2
Complementarity.........: 3.0413947244845120e-09 3.0413947244845119e-0
6
Overall NLP error.......: 3.0413947244845120e-09 3.0413947244845119e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2284101e+02 3.24e+03 5.23e+01 -1.0 3.27e+03 - 1.51e-03 9.82e-0
3h 1
2 9.0926076e+02 3.24e+03 5.23e+01 -1.0 2.65e+03 - 2.26e-05 5.44e-0
4h 1
3 3.4654879e+02 3.17e+03 5.24e+01 -1.0 3.24e+03 - 4.65e-04 2.33e-0
2h 1
4 1.5727761e+04 6.86e-02 7.64e+01 -1.0 3.17e+03 - 7.94e-02 1.00e+0
0h 1
5 7.5065615e+03 6.21e-02 2.55e+01 -1.0 1.38e+01 - 6.32e-01 8.66e-0
2f 1
6 6.1545521e+03 2.15e-02 1.11e+01 -1.0 9.93e+00 - 6.46e-01 9.10e-0
1f 1
7 6.3910865e+03 3.11e-03 1.12e-01 -1.0 2.98e+00 - 9.91e-01 9.82e-0
1f 1
8 5.9617956e+03 2.66e-03 4.92e-01 -1.7 1.31e+01 - 7.40e-01 1.00e+0
0f 1
9 5.9249148e+03 5.60e-04 7.16e-01 -1.7 3.18e+01 - 4.76e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.9585081e+03 1.60e-05 9.44e-04 -1.7 2.87e+01 - 1.00e+00 1.00e+0
0h 1
11 5.7578071e+03 4.61e-04 2.05e-02 -2.5 6.08e+01 - 9.76e-01 9.63e-0
1f 1
12 5.7307706e+03 1.44e-04 2.08e-01 -3.8 1.54e+01 - 9.94e-01 7.21e-0
1h 1
13 5.7228044e+03 3.42e-07 3.05e-04 -3.8 4.30e+00 - 1.00e+00 1.00e+0
0h 1
14 5.7210205e+03 1.95e-08 4.41e-06 -5.7 7.43e-01 - 1.00e+00 1.00e+0
0h 1
15 5.7210000e+03 7.93e-13 4.81e-10 -8.6 9.18e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.7210000439956197e+00 5.7210000439956193e+0
3
Dual infeasibility......: 4.8077074040182467e-10 4.8077074040182467e-0
7
Constraint violation....: 7.9251882834086018e-13 7.9251882834086018e-1
3
Complementarity.........: 3.1145027217673509e-09 3.1145027217673509e-0
6
Overall NLP error.......: 3.1145027217673509e-09 3.1145027217673509e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8047271e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.82e-0
3h 1
2 8.7571780e+02 2.00e+03 5.24e+01 -1.0 1.11e+03 - 4.57e-05 1.77e-0
4h 1
3 2.9373644e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 9.83e-05 2.27e-0
2f 1
4 1.4280611e+04 6.09e-02 7.92e+01 -1.0 1.95e+03 - 5.49e-02 1.00e+0
0h 1
5 5.5544141e+03 5.66e-02 5.35e+01 -1.0 6.57e+01 - 3.12e-01 6.38e-0
2f 1
6 4.1958834e+03 3.11e-02 2.65e+01 -1.0 3.24e+01 - 4.93e-01 4.18e-0
1f 1
7 3.3759781e+03 1.36e-02 2.17e+00 -1.0 1.11e+01 - 9.19e-01 9.26e-0
1f 1
8 3.8304846e+03 4.15e-04 1.03e-01 -1.0 5.03e+00 - 9.96e-01 1.00e+0
0f 1
9 3.1520614e+03 1.16e-03 1.15e+00 -1.7 3.99e+01 - 3.71e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.1955867e+03 9.31e-06 1.32e-02 -1.7 1.37e+01 - 1.00e+00 1.00e+0
0h 1
11 3.0822906e+03 2.95e-05 4.00e-01 -2.5 4.86e+01 - 1.00e+00 7.88e-0
1f 1
12 3.0635227e+03 1.06e-04 4.88e-03 -2.5 9.96e+00 - 1.00e+00 1.00e+0
0f 1
13 3.0434834e+03 2.78e-04 8.69e-02 -3.8 8.05e+00 - 7.71e-01 1.00e+0
0h 1
14 3.0407335e+03 1.61e-03 2.08e-03 -3.8 3.64e-02 - 9.71e-01 1.00e+0
0h 1
15 3.0407737e+03 7.55e-05 6.60e-05 -3.8 1.18e-02 - 1.00e+00 1.00e+0
0h 1
16 3.0392720e+03 1.31e-04 1.11e-03 -5.7 4.46e-01 - 9.18e-01 1.00e+0
0h 1
17 3.0392303e+03 3.28e-05 6.74e-06 -5.7 8.43e-03 - 1.00e+00 1.00e+0
0h 1
18 3.0392359e+03 1.93e-07 3.46e-06 -5.7 6.32e-04 - 1.00e+00 1.00e+0
0h 1
19 3.0392191e+03 2.64e-08 3.36e-05 -8.6 5.53e-03 - 1.00e+00 9.57e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 3.0392184e+03 4.51e-12 5.22e-11 -8.6 2.39e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 3.0392183956200469e+00 3.0392183956200470e+0
3
Dual infeasibility......: 5.2203757184103161e-11 5.2203757184103161e-0
8
Constraint violation....: 4.5099479706323109e-12 4.5099479706323109e-1
2
Complementarity.........: 4.0468608490038298e-09 4.0468608490038294e-0
6
Overall NLP error.......: 4.0468608490038298e-09 4.0468608490038294e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 34
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 17
inequality constraints with only lower bounds: 8
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2303872e+02 9.17e+02 5.24e+01 -1.0 9.22e+02 - 3.31e-04 9.86e-0
3h 1
2 8.0919006e+02 9.17e+02 5.24e+01 -1.0 7.37e+02 - 8.12e-05 5.04e-0
4h 1
3 2.4239398e+02 8.98e+02 5.26e+01 -1.0 9.17e+02 - 4.72e-04 2.11e-0
2f 1
4 1.2489447e+04 5.50e-02 8.23e+01 -1.0 8.98e+02 - 3.83e-02 1.00e+0
0h 1
5 3.8941148e+03 5.25e-02 5.67e+01 -1.0 8.14e+01 - 3.09e-01 4.98e-0
2f 1
6 1.9112633e+03 3.73e-02 3.04e+01 -1.0 3.92e+01 - 4.68e-01 5.06e-0
1f 1
7 4.6876227e+03 1.23e-02 2.71e+01 -1.0 2.07e+01 - 3.99e-01 1.00e+0
0h 1
8 1.8763004e+03 1.20e-02 1.04e+00 -1.0 2.56e+01 - 9.88e-01 8.91e-0
1f 1
9 1.9981274e+03 1.95e-04 4.76e-02 -1.0 2.98e+01 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.7321093e+03 2.19e-04 1.23e+00 -2.5 1.80e+01 - 9.37e-01 5.94e-0
1f 1
11 1.5439398e+03 3.77e-03 1.33e-01 -2.5 7.59e+00 - 7.95e-01 1.00e+0
0f 1
12 1.5209204e+03 5.17e-03 3.09e-01 -2.5 1.82e+00 - 1.00e+00 7.67e-0
1h 1
13 1.5332321e+03 2.41e-04 4.72e-03 -2.5 7.16e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5031438e+03 1.70e-04 2.15e-02 -3.8 1.35e+01 - 9.90e-01 9.29e-0
1h 1
15 1.5019709e+03 7.24e-07 6.84e-05 -3.8 9.19e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003148e+03 3.77e-07 1.78e-04 -5.7 7.43e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.79e-11 2.92e-09 -5.7 4.20e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932776792490e+00 1.5002932776792491e+0
3
Dual infeasibility......: 2.1737235071273386e-09 2.1737235071273386e-0
6
Constraint violation....: 6.2995900163009821e-11 6.2995900163009821e-1
1
Complementarity.........: 2.8882174443522761e-09 2.8882174443522758e-0
6
Overall NLP error.......: 2.8882174443522761e-09 2.8882174443522758e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.77e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5003661e+02 7.50e+01 9.04e+01 -1.0 2.59e+01 - 3.83e-04 3.52e-0
2f 1
2 1.1818872e+04 5.63e-02 8.12e+01 -1.0 2.87e+01 - 4.64e-02 1.00e+0
0h 1
3 3.1585743e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.65e-0
2f 1
4 1.0154810e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8148897e+03 7.28e-03 1.55e+01 -1.0 1.93e+01 - 6.11e-01 1.00e+0
0h 1
6 1.1196673e+03 5.40e-03 4.04e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8244210e+02 9.99e-04 2.10e-01 -1.7 5.71e+00 - 1.00e+00 8.87e-0
1h 1
8 7.2817516e+02 8.46e-04 1.35e-02 -1.7 3.45e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0982259e+02 1.50e-03 1.13e-01 -3.8 4.49e+00 - 7.71e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8216110e+02 2.17e-03 7.23e-02 -3.8 2.11e+00 - 8.07e-01 7.40e-0
1h 1
11 5.8336684e+02 9.52e-05 4.78e-02 -3.8 3.17e-02 - 1.00e+00 9.56e-0
1h 1
12 5.8368716e+02 2.82e-07 1.33e-05 -3.8 3.28e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278928e+02 4.12e-07 5.39e-04 -5.7 3.47e-02 - 1.00e+00 9.91e-0
1h 1
14 5.8278859e+02 4.36e-11 3.52e-09 -5.7 2.10e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.65e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753111572739e-01 5.8277753111572736e+0
2
Dual infeasibility......: 2.6503252905510431e-09 2.6503252905510431e-0
6
Constraint violation....: 6.3002228434250185e-11 6.3002228434250185e-1
1
Complementarity.........: 2.8882681473557689e-09 2.8882681473557688e-0
6
Overall NLP error.......: 2.8882681473557689e-09 2.8882681473557688e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.13e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.1584841e+02 1.09e+02 1.13e+02 -1.0 3.76e+01 - 2.64e-04 3.01e-0
2f 1
2 1.1398692e+04 5.38e-02 8.36e+01 -1.0 4.53e+01 - 3.10e-02 1.00e+0
0h 1
3 2.7848916e+03 5.17e-02 6.48e+01 -1.0 8.43e+01 - 2.27e-01 4.32e-0
2f 1
4 9.8155785e+02 4.24e-02 3.38e+01 -1.0 3.41e+01 - 4.79e-01 4.75e-0
1f 1
5 3.5909723e+03 1.17e-02 2.76e+01 -1.0 1.85e+01 - 4.21e-01 1.00e+0
0h 1
6 9.4491032e+02 1.01e-02 8.73e-01 -1.0 2.29e+01 - 9.92e-01 8.92e-0
1f 1
7 7.6264865e+02 4.59e-04 6.60e-02 -1.7 4.98e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2536469e+02 1.94e-03 1.94e-01 -2.5 5.33e+00 - 7.62e-01 1.00e+0
0f 1
9 5.9379741e+02 3.25e-03 6.12e-02 -2.5 2.05e+00 - 1.00e+00 9.47e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0140235e+02 1.19e-04 3.32e-03 -2.5 1.29e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8388164e+02 1.57e-04 1.69e-02 -3.8 7.57e-01 - 9.93e-01 9.41e-0
1h 1
12 5.8370191e+02 7.28e-07 6.65e-05 -3.8 8.63e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278679e+02 3.79e-07 1.40e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.06e-09 -5.7 3.41e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.09e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753148935385e-01 5.8277753148935381e+0
2
Dual infeasibility......: 2.0880540104020105e-09 2.0880540104020105e-0
6
Constraint violation....: 6.2994165439533845e-11 6.2994165439533845e-1
1
Complementarity.........: 2.8882094461488151e-09 2.8882094461488151e-0
6
Overall NLP error.......: 2.8882094461488151e-09 2.8882094461488151e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 7.77e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.5003661e+02 7.50e+01 9.04e+01 -1.0 2.59e+01 - 3.83e-04 3.52e-0
2f 1
2 1.1818872e+04 5.63e-02 8.12e+01 -1.0 2.87e+01 - 4.64e-02 1.00e+0
0h 1
3 3.1585743e+03 5.29e-02 5.38e+01 -1.0 8.10e+01 - 3.31e-01 5.65e-0
2f 1
4 1.0154810e+03 3.38e-02 2.94e+01 -1.0 4.36e+01 - 4.61e-01 5.33e-0
1f 1
5 2.8148897e+03 7.28e-03 1.55e+01 -1.0 1.93e+01 - 6.11e-01 1.00e+0
0h 1
6 1.1196673e+03 5.40e-03 4.04e-01 -1.0 1.75e+01 - 9.66e-01 1.00e+0
0f 1
7 7.8244210e+02 9.99e-04 2.10e-01 -1.7 5.71e+00 - 1.00e+00 8.87e-0
1h 1
8 7.2817516e+02 8.46e-04 1.35e-02 -1.7 3.45e+00 - 1.00e+00 1.00e+0
0f 1
9 6.0982259e+02 1.50e-03 1.13e-01 -3.8 4.49e+00 - 7.71e-01 9.23e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 5.8216110e+02 2.17e-03 7.23e-02 -3.8 2.11e+00 - 8.07e-01 7.40e-0
1h 1
11 5.8336684e+02 9.52e-05 4.78e-02 -3.8 3.17e-02 - 1.00e+00 9.56e-0
1h 1
12 5.8368716e+02 2.82e-07 1.33e-05 -3.8 3.28e-02 - 1.00e+00 1.00e+0
0f 1
13 5.8278928e+02 4.12e-07 5.39e-04 -5.7 3.47e-02 - 1.00e+00 9.91e-0
1h 1
14 5.8278859e+02 4.36e-11 3.52e-09 -5.7 2.10e-03 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.65e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753111572739e-01 5.8277753111572736e+0
2
Dual infeasibility......: 2.6503252905510431e-09 2.6503252905510431e-0
6
Constraint violation....: 6.3002228434250185e-11 6.3002228434250185e-1
1
Complementarity.........: 2.8882681473557689e-09 2.8882681473557688e-0
6
Overall NLP error.......: 2.8882681473557689e-09 2.8882681473557688e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 4.27e+01 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.9796473e+02 4.09e+01 5.94e+01 -1.0 1.42e+01 - 6.99e-04 4.23e-0
2f 1
2 1.2226497e+04 6.07e-02 7.87e+01 -1.0 1.80e+01 - 7.07e-02 1.00e+0
0h 1
3 3.6201832e+03 5.54e-02 5.15e+01 -1.0 5.45e+01 - 3.33e-01 7.87e-0
2f 1
4 2.3523812e+03 2.93e-02 2.28e+01 -1.0 2.70e+01 - 5.45e-01 4.46e-0
1f 1
5 1.7571767e+03 8.49e-03 1.17e+00 -1.0 9.96e+00 - 9.27e-01 7.68e-0
1f 1
6 2.0298800e+03 3.42e-04 8.15e-02 -1.0 3.35e+00 - 1.00e+00 1.00e+0
0h 1
7 1.4033455e+03 2.08e-03 8.15e-02 -2.5 4.87e+00 - 8.66e-01 8.50e-0
1f 1
8 1.2236679e+03 2.16e-03 2.06e-01 -2.5 1.05e+00 - 1.00e+00 8.33e-0
1f 1
9 1.2066818e+03 8.65e-05 3.81e-03 -2.5 1.49e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1969333e+03 4.60e-05 1.08e+00 -3.8 9.70e-02 - 1.00e+00 4.99e-0
1h 1
11 1.1949894e+03 3.31e-07 1.13e-01 -3.8 3.83e-02 - 9.68e-01 1.00e+0
0f 1
12 1.1939528e+03 1.38e-08 1.76e-03 -3.8 3.31e-02 - 1.00e+00 1.00e+0
0H 1
13 1.1941496e+03 1.10e-05 2.71e-04 -3.8 3.66e-03 - 1.00e+00 1.00e+0
0f 1
14 1.1935294e+03 1.78e-06 6.37e-02 -5.7 1.23e-02 - 7.78e-01 9.68e-0
1h 1
15 1.1933614e+03 1.24e-05 2.14e-04 -5.7 5.02e-03 - 1.00e+00 1.00e+0
0f 1
16 1.1933675e+03 2.91e-08 2.24e-06 -5.7 2.67e-04 - 1.00e+00 1.00e+0
0h 1
17 1.1933542e+03 2.76e-08 9.71e-06 -8.6 2.46e-04 - 9.82e-01 9.89e-0
1h 1
18 1.1933541e+03 2.43e-13 3.27e-11 -8.6 1.97e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.1933540952483821e+00 1.1933540952483820e+0
3
Dual infeasibility......: 3.2688517156896526e-11 3.2688517156896526e-0
8
Constraint violation....: 2.4313884239290928e-13 2.4313884239290928e-1
3
Complementarity.........: 2.5120652671227840e-09 2.5120652671227837e-0
6
Overall NLP error.......: 2.5120652671227840e-09 2.5120652671227837e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2278116e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 3.31e-04 9.87e-0
3h 1
2 8.0655676e+02 9.17e+02 5.24e+01 -1.0 7.64e+02 - 9.12e-05 5.91e-0
4h 1
3 6.8551274e+02 9.13e+02 5.24e+01 -1.0 9.17e+02 - 5.58e-04 4.52e-0
3h 1
4 2.5424767e+02 8.94e+02 5.24e+01 -1.0 9.13e+02 - 5.37e-03 2.03e-0
2f 1
5 1.0171545e+04 5.97e-02 8.27e+01 -1.0 8.94e+02 - 4.73e-02 1.00e+0
0h 1
6 3.6641626e+03 5.57e-02 4.00e+01 -1.0 6.42e+01 - 5.07e-01 6.19e-0
2f 1
7 1.8848289e+03 3.80e-02 1.82e+01 -1.0 3.83e+01 - 5.39e-01 4.87e-0
1f 1
8 2.8688311e+03 3.43e-03 5.12e+00 -1.0 6.15e+00 - 8.07e-01 1.00e+0
0f 1
9 2.1131669e+03 1.02e-03 8.36e-02 -1.0 6.46e+00 - 9.91e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6961671e+03 7.22e-04 4.22e-01 -2.5 7.50e+00 - 9.09e-01 7.34e-0
1f 1
11 1.5458646e+03 3.09e-03 2.28e-01 -2.5 7.71e+00 - 7.23e-01 1.00e+0
0f 1
12 1.5243442e+03 2.42e-03 2.16e-01 -2.5 1.67e+00 - 1.00e+00 8.40e-0
1h 1
13 1.5335197e+03 1.10e-04 3.95e-03 -2.5 4.58e-01 - 1.00e+00 1.00e+0
0f 1
14 1.5029410e+03 1.62e-04 2.15e-02 -3.8 1.39e+01 - 9.92e-01 9.31e-0
1h 1
15 1.5019708e+03 7.72e-07 7.02e-05 -3.8 7.26e-01 - 1.00e+00 1.00e+0
0h 1
16 1.5003141e+03 3.77e-07 1.79e-04 -5.7 7.43e-01 - 1.00e+00 9.96e-0
1h 1
17 1.5003135e+03 3.80e-11 2.93e-09 -5.7 1.63e-02 - 1.00e+00 1.00e+0
0f 1
18 1.5002933e+03 6.30e-11 2.17e-09 -8.6 9.21e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.5002932775674522e+00 1.5002932775674522e+0
3
Dual infeasibility......: 2.1737171973434393e-09 2.1737171973434393e-0
6
Constraint violation....: 6.2995483829375587e-11 6.2995483829375587e-1
1
Complementarity.........: 2.8882173001059798e-09 2.8882173001059797e-0
6
Overall NLP error.......: 2.8882173001059798e-09 2.8882173001059797e-0
6
Number of objective function evaluations = 19
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 19
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
1 8.6534799e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 4.97e-04 9.87e-0
3h 1
2 8.4756645e+02 9.17e+02 5.24e+01 -1.0 7.79e+02 - 8.94e-05 6.57e-0
4h 1
3 7.0654356e+02 9.12e+02 5.24e+01 -1.0 9.17e+02 - 6.24e-04 5.32e-0
3h 1
4 2.7668058e+02 8.93e+02 5.23e+01 -1.0 9.12e+02 - 6.28e-03 2.08e-0
2f 1
5 1.0297985e+04 6.55e-02 8.03e+01 -1.0 8.93e+02 - 6.71e-02 1.00e+0
0h 1
100 1.881966e+04 1.632511e+04 7.297742e+01
Terminating training with status: iteration_limit
-------------------------------------------------------
Simulation
results = HydroPowerModels.simulate(m, 100);
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.2433855e+02 1.57e+04 5.24e+01 -1.0 1.59e+04 - 3.31e-04 9.80e-0
3h 1
2 8.2143050e+02 1.57e+04 5.24e+01 -1.0 1.45e+04 - 3.13e-05 1.08e-0
4h 1
3 8.1812237e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 1.13e-05 2.65e-0
4h 1
4 8.1237401e+02 1.57e+04 5.24e+01 -1.0 1.57e+04 - 2.74e-04 4.71e-0
4h 1
5 5.6708824e+02 1.54e+04 5.26e+01 -1.0 1.57e+04 - 7.73e-04 2.11e-0
2f 1
6 2.7039718e+04 5.55e-02 8.24e+01 -1.0 1.54e+04 - 3.90e-02 1.00e+0
0h 1
7 1.8694739e+04 5.29e-02 5.45e+01 -1.0 7.93e+01 - 3.36e-01 5.08e-0
2f 1
8 1.6732058e+04 3.71e-02 2.90e+01 -1.0 3.93e+01 - 4.72e-01 5.02e-0
1f 1
9 1.7074843e+04 2.28e-02 1.32e+01 -1.0 2.04e+01 - 4.04e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6824512e+04 6.00e-03 3.40e+00 -1.0 4.83e+00 - 8.08e-01 1.00e+0
0h 1
11 1.6853243e+04 2.04e-04 1.86e+00 -1.0 3.75e+00 - 3.15e-01 1.00e+0
0f 1
12 1.6853945e+04 1.08e-05 5.35e-01 -1.0 1.78e+00 - 7.13e-01 1.00e+0
0f 1
13 1.6547601e+04 2.42e-04 3.92e-01 -1.7 5.30e+00 - 8.75e-01 7.50e-0
1f 1
14 1.6486131e+04 5.93e-04 3.62e-01 -1.7 7.50e+00 - 6.18e-01 1.00e+0
0f 1
15 1.6484263e+04 8.65e-05 6.43e-02 -1.7 1.25e+01 - 7.63e-01 1.00e+0
0h 1
16 1.6367554e+04 1.07e-03 6.21e-02 -2.5 1.50e+01 - 9.11e-01 1.00e+0
0f 1
17 1.6344645e+04 1.30e-03 1.47e-02 -2.5 4.03e+00 - 1.00e+00 1.00e+0
0h 1
18 1.6328137e+04 2.33e-04 1.06e-01 -3.8 5.60e+00 - 1.00e+00 8.33e-0
1h 1
19 1.6326249e+04 4.99e-07 1.26e-04 -3.8 8.51e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325267e+04 3.62e-07 7.89e-03 -5.7 2.60e-01 - 1.00e+00 8.32e-0
1h 1
21 1.6325119e+04 1.13e-08 4.02e-07 -5.7 5.70e-03 - 1.00e+00 1.00e+0
0f 1
22 1.6325105e+04 1.12e-10 2.87e-06 -8.6 2.27e-03 - 1.00e+00 9.96e-0
1h 1
23 1.6325105e+04 1.42e-14 4.22e-14 -8.6 3.80e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 23
(scaled) (unscaled)
Objective...............: 1.6325105286995925e+01 1.6325105286995924e+0
4
Dual infeasibility......: 4.2180236560962055e-14 4.2180236560962055e-1
1
Constraint violation....: 1.4210854715202004e-14 1.4210854715202004e-1
4
Complementarity.........: 2.5060245702742955e-09 2.5060245702742953e-0
6
Overall NLP error.......: 2.5060245702742955e-09 2.5060245702742953e-0
6
Number of objective function evaluations = 27
Number of objective gradient evaluations = 24
Number of equality constraint evaluations = 27
Number of inequality constraint evaluations = 27
Number of equality constraint Jacobian evaluations = 24
Number of inequality constraint Jacobian evaluations = 24
Number of Lagrangian Hessian evaluations = 23
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.4158794e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 3.83e-04 9.80e-0
3h 1
2 8.3874409e+02 1.50e+04 5.24e+01 -1.0 1.43e+04 - 4.60e-05 1.04e-0
4h 1
3 8.1063152e+02 1.49e+04 5.24e+01 -1.0 1.50e+04 - 6.58e-06 2.15e-0
3h 1
4 5.7583373e+02 1.46e+04 5.25e+01 -1.0 1.49e+04 - 2.30e-03 2.08e-0
2h 1
5 2.5840271e+04 5.85e-02 8.16e+01 -1.0 1.46e+04 - 4.72e-02 1.00e+0
0h 1
6 1.8007647e+04 5.47e-02 4.93e+01 -1.0 7.48e+01 - 3.86e-01 5.88e-0
2f 1
7 1.5982427e+04 3.56e-02 2.57e+01 -1.0 4.16e+01 - 4.83e-01 5.20e-0
1f 1
8 1.6343955e+04 1.91e-02 4.61e+00 -1.0 1.45e+01 - 6.89e-01 2.50e-0
1f 3
9 1.6123462e+04 4.98e-03 3.32e-01 -1.0 6.13e+00 - 9.54e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5782383e+04 1.35e-03 5.04e-01 -1.7 6.08e+00 - 1.00e+00 7.90e-0
1f 1
11 1.5746110e+04 6.55e-04 2.61e-02 -1.7 3.69e+01 - 1.00e+00 1.00e+0
0f 1
12 1.5588274e+04 1.52e-03 1.16e-01 -3.8 3.98e+01 - 7.64e-01 9.25e-0
1f 1
13 1.5559321e+04 2.22e-03 9.62e-02 -3.8 2.94e+00 - 8.18e-01 7.33e-0
1h 1
14 1.5560214e+04 2.15e-06 1.39e-03 -3.8 7.84e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5559228e+04 2.63e-07 1.00e-03 -5.7 2.97e-01 - 1.00e+00 9.83e-0
1h 1
16 1.5559217e+04 2.62e-11 7.43e-09 -5.7 9.43e-03 - 1.00e+00 1.00e+0
0f 1
17 1.5559202e+04 6.30e-11 2.65e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5559202163703230e+01 1.5559202163703229e+0
4
Dual infeasibility......: 2.6486919332231059e-09 2.6486919332231059e-0
6
Constraint violation....: 6.3010818784903222e-11 6.3010818784903222e-1
1
Complementarity.........: 3.4040685840081373e-09 3.4040685840081371e-0
6
Overall NLP error.......: 3.4040685840081373e-09 3.4040685840081371e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6400609e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 4.82e-04 9.80e-0
3h 1
2 8.6122237e+02 1.39e+04 5.24e+01 -1.0 1.37e+04 - 9.13e-05 1.01e-0
4h 1
3 8.5212286e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 3.12e-06 6.54e-0
4f 1
4 5.5517499e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 7.03e-04 2.20e-0
2h 1
5 2.5704695e+04 5.95e-02 8.03e+01 -1.0 1.36e+04 - 4.97e-02 1.00e+0
0h 1
6 1.7228586e+04 5.56e-02 5.33e+01 -1.0 7.41e+01 - 3.26e-01 5.97e-0
2f 1
7 1.5583485e+04 2.97e-02 2.79e+01 -1.0 3.97e+01 - 4.72e-01 4.41e-0
1f 1
8 1.5126799e+04 1.37e-02 2.58e+00 -1.0 1.09e+01 - 9.18e-01 1.00e+0
0f 1
9 1.5371611e+04 5.28e-04 8.46e-02 -1.0 4.58e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4841424e+04 5.83e-04 4.78e-01 -2.5 7.80e+00 - 8.88e-01 6.87e-0
1f 1
11 1.4750296e+04 3.38e-04 3.56e-01 -2.5 3.18e+00 - 8.71e-01 1.00e+0
0h 1
12 1.4749017e+04 6.39e-04 3.82e-01 -2.5 1.17e+01 - 1.24e-02 3.61e-0
3h 2
13 1.4717893e+04 1.15e-03 1.71e-02 -2.5 1.52e+00 - 1.00e+00 1.00e+0
0h 1
14 1.4704726e+04 1.78e-03 6.46e-02 -3.8 2.68e+00 - 7.20e-01 1.00e+0
0h 1
15 1.4700626e+04 4.03e-03 1.36e-03 -3.8 5.42e-02 - 9.96e-01 1.00e+0
0h 1
16 1.4700852e+04 5.22e-05 2.51e-04 -3.8 1.04e-02 - 1.00e+00 1.00e+0
0h 1
17 1.4699641e+04 7.91e-05 5.78e-04 -5.7 1.49e-01 - 9.55e-01 9.19e-0
1h 1
18 1.4699570e+04 2.06e-05 4.50e-03 -5.7 1.21e-02 - 1.00e+00 7.49e-0
1h 1
19 1.4699561e+04 6.69e-09 3.12e-06 -5.7 3.04e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.4699546e+04 9.45e-09 3.06e-05 -8.6 1.84e-03 - 1.00e+00 9.81e-0
1h 1
21 1.4699546e+04 2.21e-12 1.37e-10 -8.6 3.50e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.4699545523797642e+01 1.4699545523797642e+0
4
Dual infeasibility......: 1.3725805836802729e-10 1.3725805836802729e-0
7
Constraint violation....: 2.2066792837449611e-12 2.2066792837449611e-1
2
Complementarity.........: 2.5129331531040822e-09 2.5129331531040821e-0
6
Overall NLP error.......: 2.5129331531040822e-09 2.5129331531040821e-0
6
Number of objective function evaluations = 24
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 24
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8073105e+02 1.27e+04 5.24e+01 -1.0 1.28e+04 - 5.97e-04 9.80e-0
3h 1
2 8.7796146e+02 1.27e+04 5.24e+01 -1.0 1.24e+04 - 8.93e-05 1.01e-0
4h 1
3 8.6692458e+02 1.26e+04 5.24e+01 -1.0 1.26e+04 - 3.47e-06 7.37e-0
4f 1
4 5.4092019e+02 1.24e+04 5.25e+01 -1.0 1.26e+04 - 7.99e-04 2.24e-0
2h 1
5 2.4576710e+04 6.17e-02 7.93e+01 -1.0 1.24e+04 - 5.67e-02 1.00e+0
0h 1
6 1.6171478e+04 5.73e-02 5.23e+01 -1.0 6.39e+01 - 3.28e-01 6.59e-0
2f 1
7 1.4812866e+04 3.11e-02 2.54e+01 -1.0 3.21e+01 - 5.03e-01 4.22e-0
1f 1
8 1.4040427e+04 1.14e-02 2.00e+00 -1.0 1.10e+01 - 9.20e-01 9.11e-0
1f 1
9 1.4460004e+04 3.38e-04 9.28e-02 -1.0 4.85e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.3750291e+04 1.39e-03 7.06e-02 -2.5 6.50e+00 - 8.71e-01 8.55e-0
1f 1
11 1.3727058e+04 1.41e-05 1.70e-02 -2.5 6.60e-01 - 1.00e+00 1.00e+0
0h 1
12 1.3695913e+04 1.35e-03 3.69e-02 -3.8 2.68e+00 - 7.12e-01 1.00e+0
0f 1
13 1.3693938e+04 9.56e-04 1.56e-03 -3.8 3.41e-02 - 9.61e-01 1.00e+0
0h 1
14 1.3694087e+04 1.22e-04 1.32e-04 -3.8 1.60e-02 - 1.00e+00 1.00e+0
0h 1
15 1.3692879e+04 1.38e-04 1.17e-03 -5.7 1.49e-01 - 9.16e-01 1.00e+0
0h 1
16 1.3692835e+04 3.55e-05 7.55e-06 -5.7 8.77e-03 - 1.00e+00 1.00e+0
0h 1
17 1.3692839e+04 4.36e-07 4.70e-06 -5.7 9.55e-04 - 1.00e+00 1.00e+0
0h 1
18 1.3692826e+04 3.62e-08 4.80e-05 -8.6 1.84e-03 - 1.00e+00 9.49e-0
1h 1
19 1.3692826e+04 6.54e-12 6.63e-11 -8.6 9.47e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.3692825544524508e+01 1.3692825544524509e+0
4
Dual infeasibility......: 6.6307840297948229e-11 6.6307840297948222e-0
8
Constraint violation....: 6.5408789495791098e-12 6.5408789495791098e-1
2
Complementarity.........: 2.5095397414826709e-09 2.5095397414826706e-0
6
Overall NLP error.......: 2.5095397414826709e-09 2.5095397414826706e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.11e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.9481357e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 7.48e-04 9.80e-0
3h 1
2 8.9183826e+02 1.11e+04 5.24e+01 -1.0 9.65e+03 - 2.73e-05 1.14e-0
4h 1
3 7.2358233e+02 1.10e+04 5.24e+01 -1.0 1.11e+04 - 1.86e-05 1.03e-0
2h 1
4 6.2607071e+02 1.08e+04 5.20e+01 -1.0 1.10e+04 - 1.15e-02 2.10e-0
2h 1
5 1.9624049e+04 7.36e-02 7.76e+01 -1.0 1.08e+04 - 9.80e-02 1.00e+0
0h 1
6 1.4380395e+04 6.46e-02 2.08e+01 -1.0 3.73e+01 - 7.04e-01 1.14e-0
1f 1
7 1.2837848e+04 2.05e-02 1.65e+00 -1.0 1.97e+01 - 9.31e-01 7.25e-0
1f 1
8 1.3179866e+04 1.96e-03 4.52e-01 -1.0 4.05e+00 - 7.68e-01 1.00e+0
0f 1
9 1.2685195e+04 1.63e-03 2.81e-01 -1.7 3.94e+00 - 8.29e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.2650748e+04 8.39e-04 6.59e-01 -1.7 1.35e+01 - 4.74e-01 1.00e+0
0h 1
11 1.2669931e+04 4.60e-06 2.94e-04 -1.7 1.55e+01 - 1.00e+00 1.00e+0
0h 1
12 1.2491022e+04 5.18e-04 2.47e-02 -2.5 2.80e+01 - 9.74e-01 9.54e-0
1f 1
13 1.2456919e+04 1.39e-04 7.54e-02 -3.8 9.29e+00 - 9.74e-01 8.79e-0
1h 1
14 1.2455202e+04 2.23e-07 8.43e-01 -3.8 1.12e+00 - 6.25e-01 1.00e+0
0h 1
15 1.2455102e+04 6.37e-09 1.82e-04 -3.8 1.35e-04 - 1.00e+00 1.00e+0
0h 1
16 1.2453702e+04 2.26e-08 2.70e-02 -5.7 4.46e-01 - 1.00e+00 9.07e-0
1f 1
17 1.2453581e+04 4.41e-11 2.94e-07 -5.7 4.14e-02 - 1.00e+00 1.00e+0
0f 1
18 1.2453562e+04 2.64e-12 3.14e-06 -8.6 5.53e-03 - 1.00e+00 9.99e-0
1h 1
19 1.2453562e+04 1.63e-15 4.80e-14 -8.6 3.10e-06 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.2453562321278168e+01 1.2453562321278168e+0
4
Dual infeasibility......: 4.7970768536887180e-14 4.7970768536887180e-1
1
Constraint violation....: 1.6314189803876480e-15 1.6314189803876480e-1
5
Complementarity.........: 2.5969784134352757e-09 2.5969784134352756e-0
6
Overall NLP error.......: 2.5969784134352757e-09 2.5969784134352756e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 20
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.19e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3005293e+02 9.19e+03 5.23e+01 -1.0 9.28e+03 - 2.02e-03 9.81e-0
3h 1
2 9.2651210e+02 9.19e+03 5.23e+01 -1.0 6.50e+03 - 1.50e-05 1.40e-0
4h 1
3 4.8735725e+02 8.97e+03 5.24e+01 -1.0 9.19e+03 - 4.50e-05 2.34e-0
2f 1
4 2.1862187e+04 7.01e-02 8.02e+01 -1.0 8.97e+03 - 3.23e-02 1.00e+0
0h 1
5 1.3691797e+04 6.67e-02 6.19e+01 -1.0 1.57e+01 - 2.28e-01 4.50e-0
2f 1
6 1.2506350e+04 1.60e-02 2.67e+01 -1.0 7.64e+00 - 6.04e-01 8.60e-0
1f 1
7 1.2596694e+04 5.65e-03 2.44e-01 -1.0 2.19e+00 - 9.91e-01 1.00e+0
0f 1
8 1.2196511e+04 1.61e-03 1.40e-01 -1.7 5.04e+00 - 1.00e+00 9.30e-0
1f 1
9 1.2024811e+04 1.68e-03 5.13e-01 -2.5 3.38e+00 - 1.00e+00 7.47e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.1991288e+04 2.90e-04 1.15e-01 -2.5 8.49e-01 - 1.00e+00 8.88e-0
1h 1
11 1.1993022e+04 8.46e-06 2.09e-03 -2.5 9.54e-02 - 1.00e+00 1.00e+0
0f 1
12 1.1965653e+04 8.02e-06 3.85e-03 -3.8 8.04e+00 - 1.00e+00 9.81e-0
1f 1
13 1.1965506e+04 1.39e-08 6.12e-06 -3.8 1.52e-01 - 1.00e+00 1.00e+0
0f 1
14 1.1964016e+04 1.73e-08 3.04e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0f 1
15 1.1963999e+04 1.28e-12 4.22e-10 -8.6 5.52e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.1963999157210580e+01 1.1963999157210579e+0
4
Dual infeasibility......: 4.2180023692010938e-10 4.2180023692010938e-0
7
Constraint violation....: 1.2798095916366492e-12 1.2798095916366492e-1
2
Complementarity.........: 2.6916927169259375e-09 2.6916927169259373e-0
6
Overall NLP error.......: 2.6916927169259375e-09 2.6916927169259373e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 6.71e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.2298458e+02 6.71e+03 5.23e+01 -1.0 6.77e+03 - 1.51e-03 9.81e-0
3h 1
2 9.1944863e+02 6.71e+03 5.23e+01 -1.0 4.84e+03 - 2.16e-05 1.37e-0
4h 1
3 4.2746489e+02 6.55e+03 5.24e+01 -1.0 6.71e+03 - 4.40e-05 2.36e-0
2f 1
4 1.9375137e+04 6.81e-02 8.01e+01 -1.0 6.55e+03 - 3.23e-02 1.00e+0
0h 1
5 1.1073105e+04 6.48e-02 6.20e+01 -1.0 2.30e+01 - 2.26e-01 4.46e-0
2f 1
6 9.8597986e+03 1.54e-02 2.76e+01 -1.0 1.04e+01 - 5.80e-01 7.55e-0
1f 1
7 9.7407089e+03 8.27e-03 3.90e-01 -1.0 2.06e+00 - 9.86e-01 1.00e+0
0f 1
8 9.3846978e+03 1.66e-03 1.00e-01 -1.7 3.27e+00 - 1.00e+00 9.75e-0
1f 1
9 9.2396015e+03 1.75e-03 5.24e-01 -2.5 4.91e+00 - 1.00e+00 7.49e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 9.2091546e+03 3.14e-04 9.62e-02 -2.5 1.22e+00 - 1.00e+00 8.96e-0
1h 1
11 9.2123965e+03 1.16e-05 4.01e-03 -2.5 1.27e-01 - 1.00e+00 1.00e+0
0f 1
12 9.1849124e+03 1.05e-05 7.99e-03 -3.8 8.04e+00 - 1.00e+00 9.61e-0
1f 1
13 9.1843091e+03 1.57e-08 1.36e-05 -3.8 3.09e-01 - 1.00e+00 1.00e+0
0f 1
14 9.1828174e+03 1.79e-08 5.06e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0f 1
15 9.1828008e+03 6.40e-13 4.11e-10 -8.6 5.52e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 9.1828007909486775e+00 9.1828007909486769e+0
3
Dual infeasibility......: 4.1141834318741296e-10 4.1141834318741296e-0
7
Constraint violation....: 6.4032112945255903e-13 6.4032112945255903e-1
3
Complementarity.........: 2.9029462539783076e-09 2.9029462539783075e-0
6
Overall NLP error.......: 2.9029462539783076e-09 2.9029462539783075e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 4.77e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.3000909e+02 4.77e+03 5.23e+01 -1.0 4.82e+03 - 2.02e-03 9.81e-0
3h 1
2 9.2540939e+02 4.77e+03 5.23e+01 -1.0 2.66e+03 - 1.91e-05 1.78e-0
4h 1
3 3.8379504e+02 4.66e+03 5.24e+01 -1.0 4.77e+03 - 8.68e-05 2.34e-0
2f 1
4 1.7424477e+04 7.01e-02 7.87e+01 -1.0 4.66e+03 - 5.08e-02 1.00e+0
0h 1
5 9.2441130e+03 6.55e-02 5.13e+01 -1.0 1.16e+01 - 3.39e-01 6.13e-0
2f 1
6 7.9204820e+03 2.27e-02 2.21e+01 -1.0 7.02e+00 - 6.27e-01 9.88e-0
1f 1
7 8.2927286e+03 2.17e-03 1.90e-01 -1.0 2.55e+00 - 9.91e-01 1.00e+0
0f 1
8 7.7707207e+03 1.76e-03 6.99e-02 -1.7 6.32e+00 - 1.00e+00 9.92e-0
1f 1
9 7.5980682e+03 1.95e-03 3.69e-01 -2.5 1.69e+00 - 1.00e+00 7.91e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 7.5727494e+03 1.82e-04 4.79e-02 -2.5 3.50e-01 - 1.00e+00 9.36e-0
1h 1
11 7.5754877e+03 7.05e-06 1.34e-03 -2.5 2.24e-02 - 1.00e+00 1.00e+0
0f 1
12 7.5482488e+03 7.66e-06 4.23e-03 -3.8 8.04e+00 - 1.00e+00 9.79e-0
1f 1
13 7.5480543e+03 1.37e-08 6.27e-06 -3.8 1.66e-01 - 1.00e+00 1.00e+0
0f 1
14 7.5465649e+03 1.73e-08 3.04e-06 -5.7 4.46e-01 - 1.00e+00 1.00e+0
0f 1
15 7.5465477e+03 1.28e-12 4.22e-10 -8.6 5.52e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 7.5465477423422538e+00 7.5465477423422535e+0
3
Dual infeasibility......: 4.2179927614291929e-10 4.2179927614291929e-0
7
Constraint violation....: 1.2798789805756883e-12 1.2798789805756883e-1
2
Complementarity.........: 4.3055793953806559e-09 4.3055793953806556e-0
6
Overall NLP error.......: 4.3055793953806559e-09 4.3055793953806556e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.020
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 3.24e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6647742e+02 3.24e+03 5.24e+01 -1.0 3.27e+03 - 4.97e-04 9.81e-0
3h 1
2 8.6258607e+02 3.24e+03 5.24e+01 -1.0 2.21e+03 - 3.91e-05 1.45e-0
4h 1
3 3.1400433e+02 3.17e+03 5.25e+01 -1.0 3.24e+03 - 5.82e-05 2.24e-0
2f 1
4 1.5420372e+04 5.91e-02 8.12e+01 -1.0 3.17e+03 - 3.49e-02 1.00e+0
0h 1
5 6.7290070e+03 5.61e-02 6.00e+01 -1.0 7.11e+01 - 2.59e-01 4.63e-0
2f 1
6 4.9141783e+03 2.50e-02 3.24e+01 -1.0 3.47e+01 - 4.68e-01 5.32e-0
1f 1
7 4.4464852e+03 1.14e-02 2.56e+00 -1.0 9.40e+00 - 9.28e-01 1.00e+0
0f 1
8 4.7445322e+03 5.19e-04 7.14e-02 -1.0 2.72e+00 - 9.98e-01 1.00e+0
0f 1
9 4.1966665e+03 5.77e-04 4.25e-01 -2.5 7.14e+00 - 8.93e-01 7.24e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 4.1292458e+03 1.97e-04 2.34e-01 -2.5 2.25e+00 - 9.13e-01 1.00e+0
0h 1
11 4.1116410e+03 2.84e-04 9.33e-02 -2.5 9.70e-01 - 1.00e+00 7.64e-0
1H 1
12 4.1091626e+03 3.40e-04 1.77e-03 -2.5 1.24e-01 - 1.00e+00 1.00e+0
0f 1
13 4.0879672e+03 1.22e-03 3.19e-02 -3.8 8.05e+00 - 7.96e-01 1.00e+0
0h 1
14 4.0846007e+03 2.79e-03 1.11e-03 -3.8 4.90e-02 - 1.00e+00 1.00e+0
0h 1
15 4.0849547e+03 3.93e-05 1.31e-04 -3.8 1.35e-02 - 1.00e+00 1.00e+0
0h 1
16 4.0833586e+03 1.01e-04 3.52e-04 -5.7 4.46e-01 - 9.51e-01 9.77e-0
1h 1
17 4.0833414e+03 2.19e-05 3.67e-03 -5.7 1.03e-02 - 1.00e+00 7.83e-0
1h 1
18 4.0833430e+03 8.57e-09 1.21e-06 -5.7 2.23e-03 - 1.00e+00 1.00e+0
0f 1
19 4.0833247e+03 9.02e-09 1.92e-05 -8.6 5.53e-03 - 1.00e+00 9.83e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 4.0833244e+03 1.37e-12 6.48e-11 -8.6 9.16e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 4.0833243997213478e+00 4.0833243997213476e+0
3
Dual infeasibility......: 6.4812995111628137e-11 6.4812995111628137e-0
8
Constraint violation....: 1.3685719224554305e-12 1.3685719224554305e-1
2
Complementarity.........: 3.4208238413392330e-09 3.4208238413392328e-0
6
Overall NLP error.......: 3.4208238413392330e-09 3.4208238413392328e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 32
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 16
inequality constraints with only lower bounds: 7
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 2.00e+03 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.8038781e+02 2.00e+03 5.24e+01 -1.0 2.01e+03 - 5.97e-04 9.82e-0
3h 1
2 8.7404419e+02 2.00e+03 5.24e+01 -1.0 1.17e+03 - 4.28e-05 2.39e-0
4h 1
3 2.9382745e+02 1.95e+03 5.25e+01 -1.0 2.00e+03 - 1.65e-04 2.27e-0
2f 1
4 1.4249786e+04 6.10e-02 7.92e+01 -1.0 1.95e+03 - 5.51e-02 1.00e+0
0h 1
5 5.5512989e+03 5.67e-02 5.34e+01 -1.0 6.55e+01 - 3.14e-01 6.40e-0
2f 1
6 4.1927553e+03 3.11e-02 2.64e+01 -1.0 3.24e+01 - 4.94e-01 4.18e-0
1f 1
7 3.3769719e+03 1.34e-02 2.16e+00 -1.0 1.11e+01 - 9.19e-01 9.25e-0
1f 1
8 3.8285990e+03 4.08e-04 9.78e-02 -1.0 5.01e+00 - 9.94e-01 1.00e+0
0f 1
9 3.1539237e+03 1.16e-03 1.10e+00 -1.7 4.26e+01 - 3.96e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 3.2089926e+03 1.07e-05 7.27e-02 -1.7 2.33e+01 - 9.77e-01 1.00e+0
0h 1
11 3.0880183e+03 3.00e-05 3.95e-01 -2.5 5.76e+01 - 1.00e+00 7.84e-0
1f 1
12 3.0664124e+03 1.03e-04 4.92e-03 -2.5 1.27e+01 - 1.00e+00 1.00e+0
0f 1
13 3.0436350e+03 2.81e-04 8.70e-02 -3.8 1.07e+01 - 7.70e-01 1.00e+0
0h 1
14 3.0408851e+03 1.61e-03 2.08e-03 -3.8 3.64e-02 - 9.69e-01 1.00e+0
0h 1
15 3.0409243e+03 7.62e-05 6.65e-05 -3.8 1.19e-02 - 1.00e+00 1.00e+0
0h 1
16 3.0392739e+03 1.31e-04 1.11e-03 -5.7 5.94e-01 - 9.18e-01 1.00e+0
0h 1
17 3.0392322e+03 3.28e-05 6.77e-06 -5.7 8.44e-03 - 1.00e+00 1.00e+0
0h 1
18 3.0392377e+03 1.97e-07 3.49e-06 -5.7 6.38e-04 - 1.00e+00 1.00e+0
0h 1
19 3.0392192e+03 2.64e-08 3.39e-05 -8.6 7.37e-03 - 1.00e+00 9.57e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 3.0392184e+03 4.55e-12 5.24e-11 -8.6 3.20e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: 3.0392183947063685e+00 3.0392183947063686e+0
3
Dual infeasibility......: 5.2417505701161364e-11 5.2417505701161364e-0
8
Constraint violation....: 4.5541348470123921e-12 4.5541348470123921e-1
2
Complementarity.........: 3.7473976360966082e-09 3.7473976360966081e-0
6
Overall NLP error.......: 3.7473976360966082e-09 3.7473976360966081e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 21
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 36
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 18
inequality constraints with only lower bounds: 9
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 9.18e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.6534799e+02 9.17e+02 5.24e+01 -1.0 9.21e+02 - 4.97e-04 9.87e-0
3h 1
2 8.4756645e+02 9.17e+02 5.24e+01 -1.0 7.79e+02 - 8.94e-05 6.57e-0
4h 1
3 7.0654356e+02 9.12e+02 5.24e+01 -1.0 9.17e+02 - 6.24e-04 5.32e-0
3h 1
4 2.7668058e+02 8.93e+02 5.23e+01 -1.0 9.12e+02 - 6.28e-03 2.08e-0
2f 1
5 1.0297985e+04 6.55e-02 8.03e+01 -1.0 8.93e+02 - 6.71e-02 1.00e+0
0h 1
6 3.9710458e+03 5.98e-02 3.85e+01 -1.0 6.03e+01 - 5.01e-01 8.03e-0
2f 1
7 2.4224160e+03 3.28e-02 1.48e+01 -1.0 3.61e+01 - 5.99e-01 4.62e-0
1f 1
8 2.1232049e+03 1.02e-02 1.33e+00 -1.0 9.92e+00 - 9.28e-01 1.00e+0
0f 1
9 2.3149626e+03 4.59e-04 3.46e-02 -1.0 5.32e+00 - 9.93e-01 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.9060093e+03 4.89e-04 8.90e-01 -2.5 8.72e+00 - 9.04e-01 5.78e-0
1f 1
11 1.8219977e+03 2.46e-04 3.71e-01 -2.5 3.43e+00 - 8.95e-01 1.00e+0
0f 1
12 1.7845956e+03 3.30e-03 4.11e-02 -2.5 1.74e+00 - 1.00e+00 1.00e+0
0h 1
13 1.7890644e+03 4.44e-04 3.00e-03 -2.5 1.84e-01 - 1.00e+00 1.00e+0
0h 1
14 1.7620248e+03 1.22e-03 3.29e-02 -3.8 1.39e+01 - 7.90e-01 1.00e+0
0h 1
15 1.7587829e+03 2.96e-03 1.12e-03 -3.8 2.42e-01 - 1.00e+00 1.00e+0
0h 1
16 1.7590982e+03 4.00e-05 1.24e-04 -3.8 1.24e-02 - 1.00e+00 1.00e+0
0h 1
17 1.7572215e+03 9.84e-05 3.13e-04 -5.7 7.45e-01 - 9.51e-01 9.74e-0
1h 1
18 1.7571958e+03 2.17e-05 3.67e-03 -5.7 1.83e-02 - 1.00e+00 7.81e-0
1h 1
19 1.7571952e+03 8.54e-09 1.24e-06 -5.7 4.01e-03 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.7571733e+03 9.04e-09 1.92e-05 -8.6 9.21e-03 - 1.00e+00 9.83e-0
1h 1
21 1.7571729e+03 1.36e-12 6.48e-11 -8.6 1.52e-04 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 1.7571729209979225e+00 1.7571729209979226e+0
3
Dual infeasibility......: 6.4754906837027149e-11 6.4754906837027149e-0
8
Constraint violation....: 1.3637979634495423e-12 1.3637979634495423e-1
2
Complementarity.........: 2.5092376642328882e-09 2.5092376642328882e-0
6
Overall NLP error.......: 2.5092376642328882e-09 2.5092376642328882e-0
6
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 22
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 24
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 29
variables with only lower bounds: 2
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 12
inequality constraints with only lower bounds: 3
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0699989e+03 1.05e+02 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 2.2255441e+02 1.02e+02 1.08e+02 -1.0 3.50e+01 - 2.84e-04 3.11e-0
2f 1
2 1.1491317e+04 5.42e-02 8.31e+01 -1.0 4.15e+01 - 3.33e-02 1.00e+0
0h 1
3 2.8710318e+03 5.20e-02 6.24e+01 -1.0 8.38e+01 - 2.50e-01 4.52e-0
2f 1
4 9.8899853e+02 4.07e-02 3.30e+01 -1.0 3.63e+01 - 4.73e-01 4.88e-0
1f 1
5 3.6738739e+03 1.20e-02 2.79e+01 -1.0 1.94e+01 - 4.10e-01 1.00e+0
0h 1
6 9.4732998e+02 1.11e-02 9.75e-01 -1.0 2.44e+01 - 9.91e-01 8.86e-0
1f 1
7 7.6363949e+02 4.77e-04 6.25e-02 -1.7 5.06e+00 - 1.00e+00 1.00e+0
0h 1
8 6.2539356e+02 1.94e-03 2.02e-01 -2.5 5.38e+00 - 7.57e-01 1.00e+0
0f 1
9 5.9385951e+02 3.39e-03 7.47e-02 -2.5 2.07e+00 - 1.00e+00 9.37e-0
1h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 6.0139806e+02 1.19e-04 3.33e-03 -2.5 1.47e+00 - 1.00e+00 1.00e+0
0h 1
11 5.8389718e+02 1.58e-04 1.80e-02 -3.8 7.58e-01 - 9.93e-01 9.39e-0
1h 1
12 5.8370237e+02 7.45e-07 6.76e-05 -3.8 1.23e-01 - 1.00e+00 1.00e+0
0f 1
13 5.8278682e+02 3.79e-07 1.46e-04 -5.7 3.55e-02 - 1.00e+00 9.97e-0
1h 1
14 5.8278859e+02 3.80e-11 3.04e-09 -5.7 5.76e-02 - 1.00e+00 1.00e+0
0f 1
15 5.8277753e+02 6.30e-11 2.10e-09 -8.6 4.20e-04 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 5.8277753147933509e-01 5.8277753147933504e+0
2
Dual infeasibility......: 2.1031318724481455e-09 2.1031318724481455e-0
6
Constraint violation....: 6.2994373606350962e-11 6.2994373606350962e-1
1
Complementarity.........: 2.8882108896894379e-09 2.8882108896894380e-0
6
Overall NLP error.......: 2.8882108896894379e-09 2.8882108896894380e-0
6
Number of objective function evaluations = 16
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 16
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 16
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 30
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 15
inequality constraints with only lower bounds: 6
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.57e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 7.6794703e+02 1.57e+04 5.25e+01 -1.0 1.59e+04 - 2.29e-04 9.80e-0
3f 1
2 7.6502063e+02 1.57e+04 5.25e+01 -1.0 1.45e+04 - 3.26e-05 1.07e-0
4h 1
3 7.6168749e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 1.10e-05 2.64e-0
4h 1
4 7.5594877e+02 1.57e+04 5.25e+01 -1.0 1.57e+04 - 2.72e-04 4.66e-0
4h 1
5 5.2631235e+02 1.54e+04 5.27e+01 -1.0 1.57e+04 - 7.66e-04 1.99e-0
2f 1
6 2.6592679e+04 6.11e-02 8.48e+01 -1.0 1.54e+04 - 2.98e-02 1.00e+0
0h 1
7 1.8263015e+04 5.87e-02 6.67e+01 -1.0 7.77e+01 - 2.19e-01 4.32e-0
2f 1
8 1.6691365e+04 4.51e-02 3.29e+01 -1.0 2.87e+01 - 5.02e-01 4.35e-0
1f 1
9 1.6985576e+04 3.08e-02 1.31e+01 -1.0 1.61e+01 - 4.69e-01 1.25e-0
1f 4
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.6780968e+04 5.31e-03 3.60e+00 -1.0 3.77e+00 - 7.98e-01 1.00e+0
0h 1
11 1.6827495e+04 2.97e-04 1.96e+00 -1.0 1.76e+00 - 3.16e-01 1.00e+0
0f 1
12 1.6827518e+04 1.08e-05 5.47e-01 -1.0 1.69e+00 - 7.16e-01 1.00e+0
0f 1
13 1.6530489e+04 2.26e-04 3.23e-01 -1.7 4.85e+00 - 8.73e-01 7.81e-0
1f 1
14 1.6478894e+04 5.75e-04 3.23e-01 -1.7 7.22e+00 - 6.18e-01 1.00e+0
0f 1
15 1.6478890e+04 7.00e-05 5.36e-02 -1.7 1.23e+01 - 7.55e-01 1.00e+0
0h 1
16 1.6368094e+04 9.74e-04 4.98e-02 -2.5 1.42e+01 - 9.24e-01 1.00e+0
0f 1
17 1.6344960e+04 1.12e-03 1.21e-02 -2.5 4.24e+00 - 1.00e+00 1.00e+0
0h 1
18 1.6327922e+04 1.89e-04 8.62e-02 -3.8 5.60e+00 - 1.00e+00 8.52e-0
1h 1
19 1.6326250e+04 6.01e-07 1.03e-04 -3.8 7.44e-01 - 1.00e+00 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
20 1.6325266e+04 3.78e-07 7.36e-03 -5.7 2.60e-01 - 1.00e+00 8.33e-0
1h 1
21 1.6325119e+04 1.12e-08 3.77e-07 -5.7 5.68e-03 - 1.00e+00 1.00e+0
0f 1
22 1.6325105e+04 1.11e-10 2.74e-06 -8.6 2.27e-03 - 1.00e+00 9.96e-0
1h 1
23 1.6325105e+04 1.51e-15 4.11e-14 -8.6 3.85e-05 - 1.00e+00 1.00e+0
0f 1
Number of Iterations....: 23
(scaled) (unscaled)
Objective...............: 1.6325105286995925e+01 1.6325105286995924e+0
4
Dual infeasibility......: 4.1098776710582846e-14 4.1098776710582846e-1
1
Constraint violation....: 1.5126788710517758e-15 1.5126788710517758e-1
5
Complementarity.........: 2.5060245702753183e-09 2.5060245702753181e-0
6
Overall NLP error.......: 2.5060245702753183e-09 2.5060245702753181e-0
6
Number of objective function evaluations = 27
Number of objective gradient evaluations = 24
Number of equality constraint evaluations = 27
Number of inequality constraint evaluations = 27
Number of equality constraint Jacobian evaluations = 24
Number of inequality constraint Jacobian evaluations = 24
Number of Lagrangian Hessian evaluations = 23
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 28
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 14
inequality constraints with only lower bounds: 5
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.50e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.1743323e+02 1.50e+04 5.24e+01 -1.0 1.51e+04 - 3.14e-04 9.80e-0
3h 1
2 8.1457100e+02 1.50e+04 5.24e+01 -1.0 1.43e+04 - 4.70e-05 1.03e-0
4h 1
3 7.8694534e+02 1.49e+04 5.25e+01 -1.0 1.50e+04 - 6.48e-06 2.09e-0
3h 1
4 5.5755633e+02 1.46e+04 5.26e+01 -1.0 1.49e+04 - 2.23e-03 2.04e-0
2h 1
5 2.5647822e+04 5.61e-02 8.29e+01 -1.0 1.46e+04 - 3.89e-02 1.00e+0
0h 1
6 1.7825583e+04 5.34e-02 5.15e+01 -1.0 7.48e+01 - 3.76e-01 5.15e-0
2f 1
7 1.5953563e+04 3.83e-02 2.65e+01 -1.0 3.82e+01 - 4.85e-01 4.88e-0
1f 1
8 1.6281556e+04 2.41e-02 1.12e+01 -1.0 1.92e+01 - 4.19e-01 1.25e-0
1f 4
9 1.6044875e+04 6.11e-03 2.30e-01 -1.0 4.85e+00 - 9.85e-01 1.00e+0
0h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.5746655e+04 1.35e-03 3.55e-01 -1.7 5.09e+00 - 1.00e+00 8.40e-0
1f 1
11 1.5730875e+04 8.01e-04 1.40e-02 -1.7 3.58e+01 - 1.00e+00 1.00e+0
0f 1
12 1.5585141e+04 1.40e-03 9.58e-02 -3.8 3.98e+01 - 7.91e-01 9.30e-0
1f 1
13 1.5560257e+04 1.57e-03 7.43e-02 -3.8 2.75e+00 - 8.43e-01 7.60e-0
1h 1
14 1.5560310e+04 3.04e-06 8.05e-04 -3.8 6.59e-01 - 1.00e+00 1.00e+0
0h 1
15 1.5559225e+04 2.95e-07 6.42e-04 -5.7 2.97e-01 - 1.00e+00 9.88e-0
1h 1
16 1.5559217e+04 3.75e-11 6.47e-09 -5.7 2.55e-01 - 1.00e+00 1.00e+0
0f 1
17 1.5559202e+04 6.30e-11 2.14e-09 -8.6 3.68e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 1.5559202164155510e+01 1.5559202164155509e+0
4
Dual infeasibility......: 2.1392676033485357e-09 2.1392676033485357e-0
6
Constraint violation....: 6.2997621008697990e-11 6.2997621008697990e-1
1
Complementarity.........: 3.1847788548596835e-09 3.1847788548596835e-0
6
Overall NLP error.......: 3.1847788548596835e-09 3.1847788548596835e-0
6
Number of objective function evaluations = 21
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 21
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 18
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.39e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 8.5242496e+02 1.39e+04 5.24e+01 -1.0 1.40e+04 - 4.26e-04 9.80e-0
3f 1
2 8.4962893e+02 1.39e+04 5.24e+01 -1.0 1.37e+04 - 9.23e-05 1.01e-0
4h 1
3 8.4056489e+02 1.39e+04 5.24e+01 -1.0 1.39e+04 - 3.10e-06 6.46e-0
4f 1
4 5.4569467e+02 1.36e+04 5.25e+01 -1.0 1.39e+04 - 6.94e-04 2.17e-0
2h 1
5 2.5599069e+04 5.81e-02 8.08e+01 -1.0 1.36e+04 - 4.70e-02 1.00e+0
0h 1
6 1.7104829e+04 5.45e-02 5.30e+01 -1.0 7.81e+01 - 3.36e-01 5.73e-0
2f 1
7 1.5163982e+04 2.98e-02 2.85e+01 -1.0 4.19e+01 - 4.66e-01 4.97e-0
1f 1
8 1.5316095e+04 1.29e-02 2.77e+00 -1.0 1.63e+01 - 9.21e-01 5.00e-0
1f 2
9 1.4968872e+04 4.67e-03 1.80e-01 -1.0 9.22e+00 - 1.00e+00 1.00e+0
0f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4724303e+04 2.01e-03 1.17e+00 -2.5 4.97e+00 - 9.47e-01 6.02e-0
1f 1
11 1.4570158e+04 1.26e-03 1.20e-01 -2.5 6.12e+00 - 8.38e-01 1.00e+0
0f 1
12 1.4562901e+04 3.81e-04 5.50e-03 -2.5 3.97e-01 - 1.00e+00 1.00e+0
0h 1
13 1.4549679e+04 3.52e-04 9.56e-02 -3.8 2.68e+00 - 7.71e-01 9.13e-0
1h 1
14 1.4545857e+04 1.70e-03 2.05e-03 -3.8 2.33e-01 - 1.00e+00 1.00e+0
0f 1
15 1.4545946e+04 1.97e-05 9.00e-05 -3.8 8.38e-03 - 1.00e+00 1.00e+0
0h 1
16 1.4544770e+04 3.57e-05 1.60e-04 -5.7 1.49e-01 - 9.71e-01 1.00e+0
0h 1
17 1.4544767e+04 7.05e-08 1.51e-07 -5.7 4.94e-04 - 1.00e+00 1.00e+0
0h 1
18 1.4544753e+04 6.18e-09 5.00e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0h 1
Number of Iterations....: 18
(scaled) (unscaled)
Objective...............: 1.4544752577279267e+01 1.4544752577279267e+0
4
Dual infeasibility......: 4.9958414417124415e-09 4.9958414417124415e-0
6
Constraint violation....: 6.1830728315115380e-09 6.1830728315115380e-0
9
Complementarity.........: 4.3378324593180474e-09 4.3378324593180476e-0
6
Overall NLP error.......: 6.1830728315115380e-09 4.9958414417124415e-0
6
Number of objective function evaluations = 20
Number of objective gradient evaluations = 19
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 20
Number of equality constraint Jacobian evaluations = 19
Number of inequality constraint Jacobian evaluations = 19
Number of Lagrangian Hessian evaluations = 18
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation
).
Number of nonzeros in equality constraint Jacobian...: 86
Number of nonzeros in inequality constraint Jacobian.: 26
Number of nonzeros in Lagrangian Hessian.............: 132
Total number of variables............................: 30
variables with only lower bounds: 3
variables with lower and upper bounds: 24
variables with only upper bounds: 0
Total number of equality constraints.................: 21
Total number of inequality constraints...............: 13
inequality constraints with only lower bounds: 4
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 9
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
0 1.0700089e+03 1.27e+04 5.26e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+0
0 0
1 9.1597188e+02 1.27e+04 5.23e+01 -1.0 1.28e+04 - 1.20e-03 9.80e-0
3h 1
2 9.1321871e+02 1.27e+04 5.23e+01 -1.0 1.24e+04 - 7.92e-05 1.01e-0
4h 1
3 9.0074018e+02 1.26e+04 5.23e+01 -1.0 1.26e+04 - 3.71e-06 8.43e-0
4f 1
4 5.6875667e+02 1.23e+04 5.24e+01 -1.0 1.26e+04 - 9.20e-04 2.31e-0
2h 1
5 2.4866156e+04 6.77e-02 7.65e+01 -1.0 1.23e+04 - 8.14e-02 1.00e+0
0h 1
6 1.6742845e+04 6.11e-02 3.13e+01 -1.0 2.05e+01 - 5.60e-01 8.85e-0
2f 1
7 1.5215174e+04 1.68e-02 1.34e+01 -1.0 1.27e+01 - 6.30e-01 8.71e-0
1f 1
8 1.5383027e+04 8.76e-03 6.74e-01 -1.0 3.86e+00 - 9.93e-01 5.00e-0
1f 2
9 1.5057082e+04 7.92e-03 2.44e-01 -1.7 6.57e+00 - 1.00e+00 8.49e-0
1f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_p
r ls
10 1.4996775e+04 1.27e-03 1.01e-01 -1.7 1.41e+01 - 1.00e+00 1.00e+0
0f 1
11 1.4871041e+04 4.23e-04 1.06e-01 -2.5 1.72e+01 - 9.68e-01 8.78e-0
1h 1
12 1.4856576e+04 2.26e-05 3.37e-03 -2.5 2.08e+00 - 1.00e+00 1.00e+0
0f 1
13 1.4838332e+04 8.63e-06 1.03e-01 -3.8 2.68e+00 - 1.00e+00 8.23e-0
1f 1
14 1.4835312e+04 5.15e-08 7.18e-05 -3.8 4.75e-01 - 1.00e+00 1.00e+0
0f 1
15 1.4834113e+04 1.99e-08 1.57e-04 -5.7 1.49e-01 - 1.00e+00 9.96e-0
1f 1
16 1.4834111e+04 1.81e-12 2.22e-09 -5.7 5.61e-04 - 1.00e+00 1.00e+0
0f 1
17 1.4834096e+04 2.63e-12 1.52e-09 -8.6 1.84e-03 - 1.00e+00 1.00e+0
0f 1
1 8.9481357e+02 1.11e+04 5.24e+01 -1.0 1.12e+04 - 7.48e-04 9.80e-0
3h 1
2 8.9183826e+02 1.11e+04 5.24e+01 -1.0 9.65e+03 - 2.73e-05 1.14e-0
4h 1
3 7.2358233e+02 1.10e+04 5.24e+01 -1.0 1.11e+04 - 1.86e-05 1.03e-0
2h 1
4 6.2607071e+02 1.08e+04 5.20e+01 -1.0 1.10e+04 - 1.15e-02 2.10e-0
2h 1
5 1.9624049e+04 7.36e-02 7.76e+01 -1.0 1.08e+04 - 9.80e-02 1.00e+0
0h 1
6 1.4380395e+04 6.46e-02 2.08e+01 -1.0 3.73e+01 - 7.04e-01 1.14e-0
1f 1
results
Dict{Symbol,Any} with 5 entries:
:solve_time => 19.6573
:params => Dict{Any,Any}("optimizer"=>Optimizer,"stages"=>12,"post_m
etho…
:machine => Dict(:cpu=>"Intel(R) Xeon(R) CPU @ 2.30GHz",:memory=>"7.3
0454…
:data => Dict{Any,Any}[Dict("powersystem"=>Dict{String,Any}("bus"=
>Dic…
:simulations => Array{Dict{Symbol,Any},1}[[Dict(:bellman_term=>15742.3,:n
oise…
Results
Objective
results[:simulations][1][1][:objective]
16325.105286995924
Plotting Results
Active
if !@isdefined plot_bool plot_bool = true end if plot_bool == true plotresults(results) end
